A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.

Directory of Open Access Journals (Sweden)

ThienLuan Ho

Full Text Available Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs. In the proposed algorithm, all threads in the same GPUs warp share data using warp-shuffle operation instead of accessing the shared memory. Moreover, we implement the proposed algorithm by exploiting the memory structure of GPUs to optimize its performance. Experiment results for real DNA packages revealed that the performance of the proposed algorithm and its implementation archived up to 122.64 and 1.53 times compared to that of sequential algorithm on CPU and previous parallel approximate string matching algorithm on GPUs, respectively.

Is it sensible to “deform” dose? 3D experimental validation of dose-warping

International Nuclear Information System (INIS)

Yeo, U. J.; Taylor, M. L.; Supple, J. R.; Smith, R. L.; Dunn, L.; Kron, T.; Franich, R. D.

2012-01-01

Purpose: Strategies for dose accumulation in deforming anatomy are of interest in radiotherapy. Algorithms exist for the deformation of dose based on patient image sets, though these are sometimes contentious because not all such image calculations are constrained by physical laws. While tumor and organ motion has been a key area of study for a considerable amount of time, deformation is of increasing interest. In this work, we demonstrate a full 3D experimental validation of results from a range of dose deformation algorithms available in the public domain. Methods: We recently developed the first tissue-equivalent, full 3D deformable dosimetric phantom—“DEFGEL.” To assess the accuracy of dose-warping based on deformable image registration (DIR), we have measured doses in undeformed and deformed states of the DEFGEL dosimeter and compared these to planned doses and warped doses. In this way we have directly evaluated the accuracy of dose-warping calculations for 11 different algorithms. We have done this for a range of stereotactic irradiation schemes and types and magnitudes of deformation. Results: The original Horn and Schunck algorithm is shown to be the best performing of the 11 algorithms trialled. Comparing measured and dose-warped calculations for this method, it is found that for a 10 × 10 mm 2 square field, γ 3%/3mm = 99.9%; for a 20 × 20 mm 2 cross-shaped field, γ 3%/3mm = 99.1%; and for a multiple dynamic arc (0.413 cm 3 PTV) treatment adapted from a patient treatment plan, γ 3%/3mm = 95%. In each case, the agreement is comparable to—but consistently ∼1% less than—comparison between measured and calculated (planned) dose distributions in the absence of deformation. The magnitude of the deformation, as measured by the largest displacement experienced by any voxel in the volume, has the greatest influence on the accuracy of the warped dose distribution. Considering the square field case, the smallest deformation (∼9 mm) yields

Time warp operating system version 2.7 internals manual

Science.gov (United States)

1992-01-01

The Time Warp Operating System (TWOS) is an implementation of the Time Warp synchronization method proposed by David Jefferson. In addition, it serves as an actual platform for running discrete event simulations. The code comprising TWOS can be divided into several different sections. TWOS typically relies on an existing operating system to furnish some very basic services. This existing operating system is referred to as the Base OS. The existing operating system varies depending on the hardware TWOS is running on. It is Unix on the Sun workstations, Chrysalis or Mach on the Butterfly, and Mercury on the Mark 3 Hypercube. The base OS could be an entirely new operating system, written to meet the special needs of TWOS, but, to this point, existing systems have been used instead. The base OS's used for TWOS on various platforms are not discussed in detail in this manual, as they are well covered in their own manuals. Appendix G discusses the interface between one such OS, Mach, and TWOS.

Classification of biosensor time series using dynamic time warping: applications in screening cancer cells with characteristic biomarkers.

Science.gov (United States)

Rai, Shesh N; Trainor, Patrick J; Khosravi, Farhad; Kloecker, Goetz; Panchapakesan, Balaji

2016-01-01

The development of biosensors that produce time series data will facilitate improvements in biomedical diagnostics and in personalized medicine. The time series produced by these devices often contains characteristic features arising from biochemical interactions between the sample and the sensor. To use such characteristic features for determining sample class, similarity-based classifiers can be utilized. However, the construction of such classifiers is complicated by the variability in the time domains of such series that renders the traditional distance metrics such as Euclidean distance ineffective in distinguishing between biological variance and time domain variance. The dynamic time warping (DTW) algorithm is a sequence alignment algorithm that can be used to align two or more series to facilitate quantifying similarity. In this article, we evaluated the performance of DTW distance-based similarity classifiers for classifying time series that mimics electrical signals produced by nanotube biosensors. Simulation studies demonstrated the positive performance of such classifiers in discriminating between time series containing characteristic features that are obscured by noise in the intensity and time domains. We then applied a DTW distance-based k -nearest neighbors classifier to distinguish the presence/absence of mesenchymal biomarker in cancer cells in buffy coats in a blinded test. Using a train-test approach, we find that the classifier had high sensitivity (90.9%) and specificity (81.8%) in differentiating between EpCAM-positive MCF7 cells spiked in buffy coats and those in plain buffy coats.

Algorithmic choices in WARP – A framework for continuous energy Monte Carlo neutron transport in general 3D geometries on GPUs

International Nuclear Information System (INIS)

Bergmann, Ryan M.; Vujić, Jasmina L.

2015-01-01

Highlights: • WARP, a GPU-accelerated Monte Carlo neutron transport code, has been developed. • The NVIDIA OptiX high-performance ray tracing library is used to process geometric data. • The unionized cross section representation is modified for higher performance. • Reference remapping is used to keep the GPU busy as neutron batch population reduces. • Reference remapping is done using a key-value radix sort on neutron reaction type. - Abstract: In recent supercomputers, general purpose graphics processing units (GPGPUs) are a significant faction of the supercomputer’s total computational power. GPGPUs have different architectures compared to central processing units (CPUs), and for Monte Carlo neutron transport codes used in nuclear engineering to take advantage of these coprocessor cards, transport algorithms must be changed to execute efficiently on them. WARP is a continuous energy Monte Carlo neutron transport code that has been written to do this. The main thrust of WARP is to adapt previous event-based transport algorithms to the new GPU hardware; the algorithmic choices for all parts of which are presented in this paper. It is found that remapping history data references increases the GPU processing rate when histories start to complete. The main reason for this is that completed data are eliminated from the address space, threads are kept busy, and memory bandwidth is not wasted on checking completed data. Remapping also allows the interaction kernels to be launched concurrently, improving efficiency. The OptiX ray tracing framework and CUDPP library are used for geometry representation and parallel dataset-side operations, ensuring high performance and reliability

Increasing feasibility of the field-programmable gate array implementation of an iterative image registration using a kernel-warping algorithm

Science.gov (United States)

Nguyen, An Hung; Guillemette, Thomas; Lambert, Andrew J.; Pickering, Mark R.; Garratt, Matthew A.

2017-09-01

Image registration is a fundamental image processing technique. It is used to spatially align two or more images that have been captured at different times, from different sensors, or from different viewpoints. There have been many algorithms proposed for this task. The most common of these being the well-known Lucas-Kanade (LK) and Horn-Schunck approaches. However, the main limitation of these approaches is the computational complexity required to implement the large number of iterations necessary for successful alignment of the images. Previously, a multi-pass image interpolation algorithm (MP-I2A) was developed to considerably reduce the number of iterations required for successful registration compared with the LK algorithm. This paper develops a kernel-warping algorithm (KWA), a modified version of the MP-I2A, which requires fewer iterations to successfully register two images and less memory space for the field-programmable gate array (FPGA) implementation than the MP-I2A. These reductions increase feasibility of the implementation of the proposed algorithm on FPGAs with very limited memory space and other hardware resources. A two-FPGA system rather than single FPGA system is successfully developed to implement the KWA in order to compensate insufficiency of hardware resources supported by one FPGA, and increase parallel processing ability and scalability of the system.

Warped products and black holes

International Nuclear Information System (INIS)

Hong, Soon-Tae

2005-01-01

We apply the warped product space-time scheme to the Banados-Teitelboim-Zanelli black holes and the Reissner-Nordstroem-anti-de Sitter black hole to investigate their interior solutions in terms of warped products. It is shown that there exist no discontinuities of the Ricci and Einstein curvatures across event horizons of these black holes

Warp Field Mechanics 101

Science.gov (United States)

White, Harold

2011-01-01

This paper will begin with a short review of the Alcubierre warp drive metric and describes how the phenomenon might work based on the original paper. The canonical form of the metric was developed and published in [6] which provided key insight into the field potential and boost for the field which remedied a critical paradox in the original Alcubierre concept of operations. A modified concept of operations based on the canonical form of the metric that remedies the paradox is presented and discussed. The idea of a warp drive in higher dimensional space-time (manifold) will then be briefly considered by comparing the null-like geodesics of the Alcubierre metric to the Chung-Freese metric to illustrate the mathematical role of hyperspace coordinates. The net effect of using a warp drive technology coupled with conventional propulsion systems on an exploration mission will be discussed using the nomenclature of early mission planning. Finally, an overview of the warp field interferometer test bed being implemented in the Advanced Propulsion Physics Laboratory: Eagleworks (APPL:E) at the Johnson Space Center will be detailed. While warp field mechanics has not had a Chicago Pile moment, the tools necessary to detect a modest instance of the phenomenon are near at hand.

[Biometric identification method for ECG based on the piecewise linear representation (PLR) and dynamic time warping (DTW)].

Science.gov (United States)

Yang, Licai; Shen, Jun; Bao, Shudi; Wei, Shoushui

2013-10-01

To treat the problem of identification performance and the complexity of the algorithm, we proposed a piecewise linear representation and dynamic time warping (PLR-DTW) method for ECG biometric identification. Firstly we detected R peaks to get the heartbeats after denoising preprocessing. Then we used the PLR method to keep important information of an ECG signal segment while reducing the data dimension at the same time. The improved DTW method was used for similarity measurements between the test data and the templates. The performance evaluation was carried out on the two ECG databases: PTB and MIT-BIH. The analystic results showed that compared to the discrete wavelet transform method, the proposed PLR-DTW method achieved a higher accuracy rate which is nearly 8% of rising, and saved about 30% operation time, and this demonstrated that the proposed method could provide a better performance.

Non-linear dynamics in galactic disks: the spiral-warps connection

International Nuclear Information System (INIS)

Masset, Frederic

1997-01-01

After a recall on warp theories and on warp waves, this research thesis reports a linear study of warp waves with an assessment of the role of gas compressibility when taking the galactic disk thickness into account. Then, the author reports an analytical study of the non-linear coupling between warp waves and density waves, in order to calculate coupling efficiency, to identify areas of the galactic disk in which it is efficient, and to discuss concurrent physical processes (such as Landau absorption) and the validity of assumptions made to perform the calculations. The next part reports numerical simulations which have been performed to check the coupling mechanism. The author notably comments evolutions brought to existing codes, and finally presents the three-dimensional version of the developed code, and discusses choices made for this code (presence of gas, choice of hydrodynamics algorithms and of gas mesh geometry, and so on). Numerical results are then presented and discussed: they actually show the existence of a coupling between density waves and warp waves [fr

A time warping approach to multiple sequence alignment.

Science.gov (United States)

Arribas-Gil, Ana; Matias, Catherine

2017-04-25

We propose an approach for multiple sequence alignment (MSA) derived from the dynamic time warping viewpoint and recent techniques of curve synchronization developed in the context of functional data analysis. Starting from pairwise alignments of all the sequences (viewed as paths in a certain space), we construct a median path that represents the MSA we are looking for. We establish a proof of concept that our method could be an interesting ingredient to include into refined MSA techniques. We present a simple synthetic experiment as well as the study of a benchmark dataset, together with comparisons with 2 widely used MSA softwares.

Superluminal warp drive and dark energy

Energy Technology Data Exchange (ETDEWEB)

Gonzalez-Diaz, Pedro F. [Colina de los Chopos, Centro de Fisica ' Miguel A. Catalan' , Instituto de Matematicas y Fisica Fundamental, Consejo Superior de Investigaciones Cientificas, Serrano 121, 28006 Madrid (Spain)], E-mail: p.gonzalezdiaz@imaff.cfmac.csic.es

2007-11-29

In this Letter we consider a warp drive spacetime where the spaceship can only travel faster than light. Restricting to the two-dimensional case, we find that if the warp drive is placed in an accelerating universe the warp bubble size increases in a comoving way to the expansion of the universe in which it is immersed. Also shown is the result that the apparent velocity of the ship steadily increases with time as phantom energy is accreted onto it.

On constructing optimistic simulation algorithms for the discrete event system specification

International Nuclear Information System (INIS)

Nutaro, James J.

2008-01-01

This article describes a Time Warp simulation algorithm for discrete event models that are described in terms of the Discrete Event System Specification (DEVS). The article shows how the total state transition and total output function of a DEVS atomic model can be transformed into an event processing procedure for a logical process. A specific Time Warp algorithm is constructed around this logical process, and it is shown that the algorithm correctly simulates a DEVS coupled model that consists entirely of interacting atomic models. The simulation algorithm is presented abstractly; it is intended to provide a basis for implementing efficient and scalable parallel algorithms that correctly simulate DEVS models

Dynamic time warping and machine learning for signal quality assessment of pulsatile signals

International Nuclear Information System (INIS)

Li, Q; Clifford, G D

2012-01-01

In this work, we describe a beat-by-beat method for assessing the clinical utility of pulsatile waveforms, primarily recorded from cardiovascular blood volume or pressure changes, concentrating on the photoplethysmogram (PPG). Physiological blood flow is nonstationary, with pulses changing in height, width and morphology due to changes in heart rate, cardiac output, sensor type and hardware or software pre-processing requirements. Moreover, considerable inter-individual and sensor-location variability exists. Simple template matching methods are therefore inappropriate, and a patient-specific adaptive initialization is therefore required. We introduce dynamic time warping to stretch each beat to match a running template and combine it with several other features related to signal quality, including correlation and the percentage of the beat that appeared to be clipped. The features were then presented to a multi-layer perceptron neural network to learn the relationships between the parameters in the presence of good- and bad-quality pulses. An expert-labeled database of 1055 segments of PPG, each 6 s long, recorded from 104 separate critical care admissions during both normal and verified arrhythmic events, was used to train and test our algorithms. An accuracy of 97.5% on the training set and 95.2% on test set was found. The algorithm could be deployed as a stand-alone signal quality assessment algorithm for vetting the clinical utility of PPG traces or any similar quasi-periodic signal. (paper)

Dynamic time warping and machine learning for signal quality assessment of pulsatile signals.

Science.gov (United States)

Li, Q; Clifford, G D

2012-09-01

In this work, we describe a beat-by-beat method for assessing the clinical utility of pulsatile waveforms, primarily recorded from cardiovascular blood volume or pressure changes, concentrating on the photoplethysmogram (PPG). Physiological blood flow is nonstationary, with pulses changing in height, width and morphology due to changes in heart rate, cardiac output, sensor type and hardware or software pre-processing requirements. Moreover, considerable inter-individual and sensor-location variability exists. Simple template matching methods are therefore inappropriate, and a patient-specific adaptive initialization is therefore required. We introduce dynamic time warping to stretch each beat to match a running template and combine it with several other features related to signal quality, including correlation and the percentage of the beat that appeared to be clipped. The features were then presented to a multi-layer perceptron neural network to learn the relationships between the parameters in the presence of good- and bad-quality pulses. An expert-labeled database of 1055 segments of PPG, each 6 s long, recorded from 104 separate critical care admissions during both normal and verified arrhythmic events, was used to train and test our algorithms. An accuracy of 97.5% on the training set and 95.2% on test set was found. The algorithm could be deployed as a stand-alone signal quality assessment algorithm for vetting the clinical utility of PPG traces or any similar quasi-periodic signal.

Semiclassical instability of warp drives

Energy Technology Data Exchange (ETDEWEB)

Barcelo, C [Instituto de Astrofisica de Andalucia, IAA-CSIC, Glorieta de la Astronomia s/n, 18008 Granada (Spain); Finazzi, S; Liberati, S, E-mail: carlos@iaa.e, E-mail: finazzi@sissa.i, E-mail: liberati@sissa.i

2010-05-01

Warp drives, at least theoretically, provide a way to travel at superluminal speeds. However, even if one succeeded in providing the necessary exotic matter to construct them, it would still be necessary to check whether they would survive to the switching on of quantum effects. In this contribution we will report on the behaviour of the Renormalized Stress-Energy Tensor (RSET) in the spacetimes associated with superluminal warp drives. We find that the RSET will exponentially grow in time close to the front wall of the superluminal bubble, hence strongly supporting the conclusion that the warp-drive geometries are unstable against semiclassical back-reaction.

Sistem Gesture Accelerometer dengan Metode Fast Dynamic Time Warping (FastDTW

Directory of Open Access Journals (Sweden)

Sam Farisa Chaerul Haviana

2016-01-01

Full Text Available In the modern environment, the interaction between humans and computers require a more natural form of interaction. Therefore, it is important to be able to build a system that can meet these demands, such as by building a hand gesture recognition system or gesture to create a more natural form of interaction. This study aims to design a smartphone’s accelerometer gesture system as human computer interaction interfaces using FastDTW (Fast Dynamic Time Warping.The result of this study is form of gesture interaction which implemented in a system that can make the process of recognition of the human hand movements based on a smartphone accelerometer which generates a command to run the media player application functions as a case study. FastDTW as the development of Dynamic Time Warping method (DTW is able to compute faster than DTW and have an accuracy approaching DTW. From the test results, FastDTW show a fairly high degree of accuracy reached 86% and showed a better computing speed compared to DTW   Keywords: Human and Computer Interaction, Accelerometer-based gesture, FastDTW, Media player application function

The calculation of warping spools of warp-knitting machines

Directory of Open Access Journals (Sweden)

Vitaliy V. Chaban

2014-12-01

Full Text Available The paper is devoted to the development of scientific bases of the knitting machine design, in particular, to the calculation of warping spools of warp-knitting machines. The method of calculating the operating parameters of warping spools and mode of winding is offered. A formula that is obtained allows to define relationship between the parameters of the threads wound on a warping spool, their pull, structural dimensions of spool barrel and the diameter of spooling. With the given spool design and the given value of permissible tension of the material of its barrel, the offered formula allows to determine the maximum tension of the threads in the process of their winding on a spool. By this formula the safe diameter of winding the threads onto the spool can be calculated at a given pull of the threads during winding.

Wireless Augmented Reality Prototype (WARP)

Science.gov (United States)

Devereaux, A. S.

1999-01-01

Initiated in January, 1997, under NASA's Office of Life and Microgravity Sciences and Applications, the Wireless Augmented Reality Prototype (WARP) is a means to leverage recent advances in communications, displays, imaging sensors, biosensors, voice recognition and microelectronics to develop a hands-free, tetherless system capable of real-time personal display and control of computer system resources. Using WARP, an astronaut may efficiently operate and monitor any computer-controllable activity inside or outside the vehicle or station. The WARP concept is a lightweight, unobtrusive heads-up display with a wireless wearable control unit. Connectivity to the external system is achieved through a high-rate radio link from the WARP personal unit to a base station unit installed into any system PC. The radio link has been specially engineered to operate within the high- interference, high-multipath environment of a space shuttle or space station module. Through this virtual terminal, the astronaut will be able to view and manipulate imagery, text or video, using voice commands to control the terminal operations. WARP's hands-free access to computer-based instruction texts, diagrams and checklists replaces juggling manuals and clipboards, and tetherless computer system access allows free motion throughout a cabin while monitoring and operating equipment.

RELAXATION OF WARPED DISKS: THE CASE OF PURE HYDRODYNAMICS

Energy Technology Data Exchange (ETDEWEB)

Sorathia, Kareem A.; Krolik, Julian H. [Department of Physics and Astronomy, Johns Hopkins University, Baltimore, MD 21218 (United States); Hawley, John F. [Department of Astronomy, University of Virginia, Charlottesville, VA 22904 (United States)

2013-05-10

Orbiting disks may exhibit bends due to a misalignment between the angular momentum of the inner and outer regions of the disk. We begin a systematic simulational inquiry into the physics of warped disks with the simplest case: the relaxation of an unforced warp under pure fluid dynamics, i.e., with no internal stresses other than Reynolds stress. We focus on the nonlinear regime in which the bend rate is large compared to the disk aspect ratio. When warps are nonlinear, strong radial pressure gradients drive transonic radial motions along the disk's top and bottom surfaces that efficiently mix angular momentum. The resulting nonlinear decay rate of the warp increases with the warp rate and the warp width, but, at least in the parameter regime studied here, is independent of the sound speed. The characteristic magnitude of the associated angular momentum fluxes likewise increases with both the local warp rate and the radial range over which the warp extends; it also increases with increasing sound speed, but more slowly than linearly. The angular momentum fluxes respond to the warp rate after a delay that scales with the square root of the time for sound waves to cross the radial extent of the warp. These behaviors are at variance with a number of the assumptions commonly used in analytic models to describe linear warp dynamics.

FPGA Implementation of the Coupled Filtering Method and the Affine Warping Method.

Science.gov (United States)

Zhang, Chen; Liang, Tianzhu; Mok, Philip K T; Yu, Weichuan

2017-07-01

In ultrasound image analysis, the speckle tracking methods are widely applied to study the elasticity of body tissue. However, "feature-motion decorrelation" still remains as a challenge for the speckle tracking methods. Recently, a coupled filtering method and an affine warping method were proposed to accurately estimate strain values, when the tissue deformation is large. The major drawback of these methods is the high computational complexity. Even the graphics processing unit (GPU)-based program requires a long time to finish the analysis. In this paper, we propose field-programmable gate array (FPGA)-based implementations of both methods for further acceleration. The capability of FPGAs on handling different image processing components in these methods is discussed. A fast and memory-saving image warping approach is proposed. The algorithms are reformulated to build a highly efficient pipeline on FPGA. The final implementations on a Xilinx Virtex-7 FPGA are at least 13 times faster than the GPU implementation on the NVIDIA graphic card (GeForce GTX 580).

Superluminal warp drive

Energy Technology Data Exchange (ETDEWEB)

Gonzalez-Diaz, Pedro F. [Colina de los Chopos, Centro de Fisica ' Miguel A. Catalan' , Instituto de Matematicas y Fisica Fundamental, Consejo Superior de Investigaciones Cientificas, Serrano 121, 28006 Madrid (Spain)], E-mail: p.gonzalezdiaz@imaff.cfmac.csic.es

2007-09-20

In this Letter we consider a warp drive spacetime resulting from that suggested by Alcubierre when the spaceship can only travel faster than light. Restricting to the two dimensions that retains most of the physics, we derive the thermodynamic properties of the warp drive and show that the temperature of the spaceship rises up as its apparent velocity increases. We also find that the warp drive spacetime can be exhibited in a manifestly cosmological form.

Modeling laser-driven electron acceleration using WARP with Fourier decomposition

Energy Technology Data Exchange (ETDEWEB)

Lee, P., E-mail: patrick.lee@u-psud.fr [LPGP, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay (France); Audet, T.L. [LPGP, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay (France); Lehe, R.; Vay, J.-L. [Lawrence Berkeley National Laboratory, Berkeley, CA 94720 (United States); Maynard, G.; Cros, B. [LPGP, CNRS, Univ. Paris-Sud, Université Paris-Saclay, 91405 Orsay (France)

2016-09-01

WARP is used with the recent implementation of the Fourier decomposition algorithm to model laser-driven electron acceleration in plasmas. Simulations were carried out to analyze the experimental results obtained on ionization-induced injection in a gas cell. The simulated results are in good agreement with the experimental ones, confirming the ability of the code to take into account the physics of electron injection and reduce calculation time. We present a detailed analysis of the laser propagation, the plasma wave generation and the electron beam dynamics.

Development and application of a modified dynamic time warping algorithm (DTW-S) to analyses of primate brain expression time series.

Science.gov (United States)

Yuan, Yuan; Chen, Yi-Ping Phoebe; Ni, Shengyu; Xu, Augix Guohua; Tang, Lin; Vingron, Martin; Somel, Mehmet; Khaitovich, Philipp

2011-08-18

Comparing biological time series data across different conditions, or different specimens, is a common but still challenging task. Algorithms aligning two time series represent a valuable tool for such comparisons. While many powerful computation tools for time series alignment have been developed, they do not provide significance estimates for time shift measurements. Here, we present an extended version of the original DTW algorithm that allows us to determine the significance of time shift estimates in time series alignments, the DTW-Significance (DTW-S) algorithm. The DTW-S combines important properties of the original algorithm and other published time series alignment tools: DTW-S calculates the optimal alignment for each time point of each gene, it uses interpolated time points for time shift estimation, and it does not require alignment of the time-series end points. As a new feature, we implement a simulation procedure based on parameters estimated from real time series data, on a series-by-series basis, allowing us to determine the false positive rate (FPR) and the significance of the estimated time shift values. We assess the performance of our method using simulation data and real expression time series from two published primate brain expression datasets. Our results show that this method can provide accurate and robust time shift estimates for each time point on a gene-by-gene basis. Using these estimates, we are able to uncover novel features of the biological processes underlying human brain development and maturation. The DTW-S provides a convenient tool for calculating accurate and robust time shift estimates at each time point for each gene, based on time series data. The estimates can be used to uncover novel biological features of the system being studied. The DTW-S is freely available as an R package TimeShift at http://www.picb.ac.cn/Comparative/data.html.

Warp speed ahead

Science.gov (United States)

Swarup, Bob

2008-01-01

Warp drives are a staple of science fiction, transporting the heroes of shows like Star Trek between galaxies in a matter of hours. Now, increasing numbers of cosmologists are wondering whether this technology might eventually become science fact. Dozens of scientific papers on warp drives have appeared since 1994 when Miguel Alcubierre - a theoretical physicist then at the University of Wales in Cardiff - first argued that a warp drive was theoretically possible (Class. Quantum Grav. 11 L73)

Constraining the age of the NGC 4565 H I disk WARP: Determining the origin of gas WARPS

Energy Technology Data Exchange (ETDEWEB)

Radburn-Smith, David J.; Dalcanton, Julianne J.; Stilp, Adrienne M. [Department of Astronomy, University of Washington, Seattle, WA 98195 (United States); De Jong, Roelof S.; Streich, David [Leibniz-Institut für Astrophysik Potsdam, D-14482 Potsdam (Germany); Bell, Eric F.; Monachesi, Antonela [Department of Astronomy, University of Michigan, Ann Arbor, MI 48109 (United States); Dolphin, Andrew E. [Raytheon, 1151 East Hermans Road, Tucson, AZ 85756 (United States); Holwerda, Benne W. [European Space Agency, ESTEC, 2200 AG Noordwijk (Netherlands); Bailin, Jeremy [Department of Physics and Astronomy, University of Alabama, Tuscaloosa, AL 35487 (United States)

2014-01-01

We have mapped the distribution of young and old stars in the gaseous H I warp of NGC 4565. We find a clear correlation of young stars (<600 Myr) with the warp but no coincident old stars (>1 Gyr), which places an upper limit on the age of the structure. The formation rate of the young stars, which increased ∼300 Myr ago relative to the surrounding regions, is (6.3{sub −1.5}{sup +2.5})×10{sup −5} M {sub ☉} yr{sup –1} kpc{sup –2}. This implies a ∼60 ± 20 Gyr depletion time of the H I warp, similar to the timescales calculated for the outer H I disks of nearby spiral galaxies. While some stars associated with the warp fall into the asymptotic giant branch (AGB) region of the color-magnitude diagram, where stars could be as old as 1 Gyr, further investigation suggests that they may be interlopers rather than real AGB stars. We discuss the implications of these age constraints for the formation of H I warps and the gas fueling of disk galaxies.

Similarity recognition of online data curves based on dynamic spatial time warping for the estimation of lithium-ion battery capacity

Science.gov (United States)

Tao, Laifa; Lu, Chen; Noktehdan, Azadeh

2015-10-01

Battery capacity estimation is a significant recent challenge given the complex physical and chemical processes that occur within batteries and the restrictions on the accessibility of capacity degradation data. In this study, we describe an approach called dynamic spatial time warping, which is used to determine the similarities of two arbitrary curves. Unlike classical dynamic time warping methods, this approach can maintain the invariance of curve similarity to the rotations and translations of curves, which is vital in curve similarity search. Moreover, it utilizes the online charging or discharging data that are easily collected and do not require special assumptions. The accuracy of this approach is verified using NASA battery datasets. Results suggest that the proposed approach provides a highly accurate means of estimating battery capacity at less time cost than traditional dynamic time warping methods do for different individuals and under various operating conditions.

Development and application of a modified dynamic time warping algorithm (DTW-S to analyses of primate brain expression time series

Directory of Open Access Journals (Sweden)

Vingron Martin

2011-08-01

Full Text Available Abstract Background Comparing biological time series data across different conditions, or different specimens, is a common but still challenging task. Algorithms aligning two time series represent a valuable tool for such comparisons. While many powerful computation tools for time series alignment have been developed, they do not provide significance estimates for time shift measurements. Results Here, we present an extended version of the original DTW algorithm that allows us to determine the significance of time shift estimates in time series alignments, the DTW-Significance (DTW-S algorithm. The DTW-S combines important properties of the original algorithm and other published time series alignment tools: DTW-S calculates the optimal alignment for each time point of each gene, it uses interpolated time points for time shift estimation, and it does not require alignment of the time-series end points. As a new feature, we implement a simulation procedure based on parameters estimated from real time series data, on a series-by-series basis, allowing us to determine the false positive rate (FPR and the significance of the estimated time shift values. We assess the performance of our method using simulation data and real expression time series from two published primate brain expression datasets. Our results show that this method can provide accurate and robust time shift estimates for each time point on a gene-by-gene basis. Using these estimates, we are able to uncover novel features of the biological processes underlying human brain development and maturation. Conclusions The DTW-S provides a convenient tool for calculating accurate and robust time shift estimates at each time point for each gene, based on time series data. The estimates can be used to uncover novel biological features of the system being studied. The DTW-S is freely available as an R package TimeShift at http://www.picb.ac.cn/Comparative/data.html.

Instability of warped discs

Science.gov (United States)

Doǧan, S.; Nixon, C. J.; King, A. R.; Pringle, J. E.

2018-05-01

Accretion discs are generally warped. If a warp in a disc is too large, the disc can `break' apart into two or more distinct planes, with only tenuous connections between them. Further, if an initially planar disc is subject to a strong differential precession, then it can be torn apart into discrete annuli that precess effectively independently. In previous investigations, torque-balance formulae have been used to predict where and when the disc breaks into distinct parts. In this work, focusing on discs with Keplerian rotation and where the shearing motions driving the radial communication of the warp are damped locally by turbulence (the `diffusive' regime), we investigate the stability of warped discs to determine the precise criterion for an isolated warped disc to break. We find and solve the dispersion relation, which, in general, yields three roots. We provide a comprehensive analysis of this viscous-warp instability and the emergent growth rates and their dependence on disc parameters. The physics of the instability can be understood as a combination of (1) a term that would generally encapsulate the classical Lightman-Eardley instability in planar discs (given by ∂(νΣ)/∂Σ < 0) but is here modified by the warp to include ∂(ν1|ψ|)/∂|ψ| < 0, and (2) a similar condition acting on the diffusion of the warp amplitude given in simplified form by ∂(ν2|ψ|)/∂|ψ| < 0. We discuss our findings in the context of discs with an imposed precession, and comment on the implications for different astrophysical systems.

Time travel and warp drives a scientific guide to shortcuts through time and space

CERN Document Server

Everett, Allen

2012-01-01

Sci-fi makes it look so easy. Receive a distress call from Alpha Centauri? No problem: punch the warp drive and you're there in minutes. Facing a catastrophe that can't be averted? Just pop back in the timestream and stop it before it starts. But for those of us not lucky enough to live in a science-fictional universe, are these ideas merely flights of fancy—or could it really be possible to travel through time or take shortcuts between stars?Cutting-edge physics may not be able to answer those questions yet, but it does offer up some tantalizing possibilities. In Time Travel and W

Fundamental limitations on 'warp drive' spacetimes

International Nuclear Information System (INIS)

Lobo, Francisco S N; Visser, Matt

2004-01-01

'Warp drive' spacetimes are useful as 'gedanken-experiments' that force us to confront the foundations of general relativity, and among other things, to precisely formulate the notion of 'superluminal' communication. After carefully formulating the Alcubierre and Natario warp drive spacetimes, and verifying their non-perturbative violation of the classical energy conditions, we consider a more modest question and apply linearized gravity to the weak-field warp drive, testing the energy conditions to first and second orders of the warp-bubble velocity, v. Since we take the warp-bubble velocity to be non-relativistic, v << c, we are not primarily interested in the 'superluminal' features of the warp drive. Instead we focus on a secondary feature of the warp drive that has not previously been remarked upon-the warp drive (if it could be built) would be an example of a 'reaction-less drive'. For both the Alcubierre and Natario warp drives we find that the occurrence of significant energy condition violations is not just a high-speed effect, but that the violations persist even at arbitrarily low speeds. A particularly interesting feature of this construction is that it is now meaningful to think of placing a finite mass spaceship at the centre of the warp bubble, and then see how the energy in the warp field compares with the mass-energy of the spaceship. There is no hope of doing this in Alcubierre's original version of the warp field, since by definition the point at the centre of the warp bubble moves on a geodesic and is 'massless'. That is, in Alcubierre's original formalism and in the Natario formalism the spaceship is always treated as a test particle, while in the linearized theory we can treat the spaceship as a finite mass object. For both the Alcubierre and Natario warp drives we find that even at low speeds the net (negative) energy stored in the warp fields must be a significant fraction of the mass of the spaceship

The WARP Code: Modeling High Intensity Ion Beams

International Nuclear Information System (INIS)

Grote, D P; Friedman, A; Vay, J L; Haber, I

2004-01-01

The Warp code, developed for heavy-ion driven inertial fusion energy studies, is used to model high intensity ion (and electron) beams. Significant capability has been incorporated in Warp, allowing nearly all sections of an accelerator to be modeled, beginning with the source. Warp has as its core an explicit, three-dimensional, particle-in-cell model. Alongside this is a rich set of tools for describing the applied fields of the accelerator lattice, and embedded conducting surfaces (which are captured at sub-grid resolution). Also incorporated are models with reduced dimensionality: an axisymmetric model and a transverse ''slice'' model. The code takes advantage of modern programming techniques, including object orientation, parallelism, and scripting (via Python). It is at the forefront in the use of the computational technique of adaptive mesh refinement, which has been particularly successful in the area of diode and injector modeling, both steady-state and time-dependent. In the presentation, some of the major aspects of Warp will be overviewed, especially those that could be useful in modeling ECR sources. Warp has been benchmarked against both theory and experiment. Recent results will be presented showing good agreement of Warp with experimental results from the STS500 injector test stand. Additional information can be found on the web page http://hif.lbl.gov/theory/WARP( ) summary.html

Correlation functions of warped CFT

Science.gov (United States)

Song, Wei; Xu, Jianfei

2018-04-01

Warped conformal field theory (WCFT) is a two dimensional quantum field theory whose local symmetry algebra consists of a Virasoro algebra and a U(1) Kac-Moody algebra. In this paper, we study correlation functions for primary operators in WCFT. Similar to conformal symmetry, warped conformal symmetry is very constraining. The form of the two and three point functions are determined by the global warped conformal symmetry while the four point functions can be determined up to an arbitrary function of the cross ratio. The warped conformal bootstrap equation are constructed by formulating the notion of crossing symmetry. In the large central charge limit, four point functions can be decomposed into global warped conformal blocks, which can be solved exactly. Furthermore, we revisit the scattering problem in warped AdS spacetime (WAdS), and give a prescription on how to match the bulk result to a WCFT retarded Green's function. Our result is consistent with the conjectured holographic dualities between WCFT and WAdS.

The WARP Code: Modeling High Intensity Ion Beams

International Nuclear Information System (INIS)

Grote, David P.; Friedman, Alex; Vay, Jean-Luc; Haber, Irving

2005-01-01

The Warp code, developed for heavy-ion driven inertial fusion energy studies, is used to model high intensity ion (and electron) beams. Significant capability has been incorporated in Warp, allowing nearly all sections of an accelerator to be modeled, beginning with the source. Warp has as its core an explicit, three-dimensional, particle-in-cell model. Alongside this is a rich set of tools for describing the applied fields of the accelerator lattice, and embedded conducting surfaces (which are captured at sub-grid resolution). Also incorporated are models with reduced dimensionality: an axisymmetric model and a transverse ''slice'' model. The code takes advantage of modern programming techniques, including object orientation, parallelism, and scripting (via Python). It is at the forefront in the use of the computational technique of adaptive mesh refinement, which has been particularly successful in the area of diode and injector modeling, both steady-state and time-dependent. In the presentation, some of the major aspects of Warp will be overviewed, especially those that could be useful in modeling ECR sources. Warp has been benchmarked against both theory and experiment. Recent results will be presented showing good agreement of Warp with experimental results from the STS500 injector test stand

Closed timelike curves in asymmetrically warped brane universes

Science.gov (United States)

Päs, Heinrich; Pakvasa, Sandip; Dent, James; Weiler, Thomas J.

2009-08-01

In asymmetrically-warped spacetimes different warp factors are assigned to space and to time. We discuss causality properties of these warped brane universes and argue that scenarios with two extra dimensions may allow for timelike curves which can be closed via paths in the extra-dimensional bulk. In particular, necessary and sufficient conditions on the metric for the existence of closed timelike curves are presented. We find a six-dimensional warped metric which satisfies the CTC conditions, and where the null, weak and dominant energy conditions are satisfied on the brane (although only the former remains satisfied in the bulk). Such scenarios are interesting, since they open the possibility of experimentally testing the chronology protection conjecture by manipulating on our brane initial conditions of gravitons or hypothetical gauge-singlet fermions (“sterile neutrinos”) which then propagate in the extra dimensions.

A Dynamic Time Warping Approach to Real-Time Activity Recognition for Food Preparation

Science.gov (United States)

Pham, Cuong; Plötz, Thomas; Olivier, Patrick

We present a dynamic time warping based activity recognition system for the analysis of low-level food preparation activities. Accelerometers embedded into kitchen utensils provide continuous sensor data streams while people are using them for cooking. The recognition framework analyzes frames of contiguous sensor readings in real-time with low latency. It thereby adapts to the idiosyncrasies of utensil use by automatically maintaining a template database. We demonstrate the effectiveness of the classification approach by a number of real-world practical experiments on a publically available dataset. The adaptive system shows superior performance compared to a static recognizer. Furthermore, we demonstrate the generalization capabilities of the system by gradually reducing the amount of training samples. The system achieves excellent classification results even if only a small number of training samples is available, which is especially relevant for real-world scenarios.

Namaste (counterbalancing) technique: Overcoming warping in costal cartilage.

Science.gov (United States)

Agrawal, Kapil S; Bachhav, Manoj; Shrotriya, Raghav

2015-01-01

Indian noses are broader and lack projection as compared to other populations, hence very often need augmentation, that too by large volume. Costal cartilage remains the material of choice in large volume augmentations and repair of complex primary and secondary nasal deformities. One major disadvantage of costal cartilage grafts (CCG) which offsets all other advantages is the tendency to warp and become distorted over a period of time. We propose a simple technique to overcome this menace of warping. We present the data of 51 patients of rhinoplasty done using CCG with counterbalancing technique over a period of 4 years. No evidence of warping was found in any patient up to a maximum follow-up period of 4 years. Counterbalancing is a useful technique to overcome the problem of warping. It gives liberty to utilize even unbalanced cartilage safely to provide desired shape and use the cartilage without any wastage.

Two-pass imputation algorithm for missing value estimation in gene expression time series.

Science.gov (United States)

Tsiporkova, Elena; Boeva, Veselka

2007-10-01

Gene expression microarray experiments frequently generate datasets with multiple values missing. However, most of the analysis, mining, and classification methods for gene expression data require a complete matrix of gene array values. Therefore, the accurate estimation of missing values in such datasets has been recognized as an important issue, and several imputation algorithms have already been proposed to the biological community. Most of these approaches, however, are not particularly suitable for time series expression profiles. In view of this, we propose a novel imputation algorithm, which is specially suited for the estimation of missing values in gene expression time series data. The algorithm utilizes Dynamic Time Warping (DTW) distance in order to measure the similarity between time expression profiles, and subsequently selects for each gene expression profile with missing values a dedicated set of candidate profiles for estimation. Three different DTW-based imputation (DTWimpute) algorithms have been considered: position-wise, neighborhood-wise, and two-pass imputation. These have initially been prototyped in Perl, and their accuracy has been evaluated on yeast expression time series data using several different parameter settings. The experiments have shown that the two-pass algorithm consistently outperforms, in particular for datasets with a higher level of missing entries, the neighborhood-wise and the position-wise algorithms. The performance of the two-pass DTWimpute algorithm has further been benchmarked against the weighted K-Nearest Neighbors algorithm, which is widely used in the biological community; the former algorithm has appeared superior to the latter one. Motivated by these findings, indicating clearly the added value of the DTW techniques for missing value estimation in time series data, we have built an optimized C++ implementation of the two-pass DTWimpute algorithm. The software also provides for a choice between three different

Demonstration of accuracy and clinical versatility of mutual information for automatic multimodality image fusion using affine and thin-plate spline warped geometric deformations.

Science.gov (United States)

Meyer, C R; Boes, J L; Kim, B; Bland, P H; Zasadny, K R; Kison, P V; Koral, K; Frey, K A; Wahl, R L

1997-04-01

This paper applies and evaluates an automatic mutual information-based registration algorithm across a broad spectrum of multimodal volume data sets. The algorithm requires little or no pre-processing, minimal user input and easily implements either affine, i.e. linear or thin-plate spline (TPS) warped registrations. We have evaluated the algorithm in phantom studies as well as in selected cases where few other algorithms could perform as well, if at all, to demonstrate the value of this new method. Pairs of multimodal gray-scale volume data sets were registered by iteratively changing registration parameters to maximize mutual information. Quantitative registration errors were assessed in registrations of a thorax phantom using PET/CT and in the National Library of Medicine's Visible Male using MRI T2-/T1-weighted acquisitions. Registrations of diverse clinical data sets were demonstrated including rotate-translate mapping of PET/MRI brain scans with significant missing data, full affine mapping of thoracic PET/CT and rotate-translate mapping of abdominal SPECT/CT. A five-point thin-plate spline (TPS) warped registration of thoracic PET/CT is also demonstrated. The registration algorithm converged in times ranging between 3.5 and 31 min for affine clinical registrations and 57 min for TPS warping. Mean error vector lengths for rotate-translate registrations were measured to be subvoxel in phantoms. More importantly the rotate-translate algorithm performs well even with missing data. The demonstrated clinical fusions are qualitatively excellent at all levels. We conclude that such automatic, rapid, robust algorithms significantly increase the likelihood that multimodality registrations will be routinely used to aid clinical diagnoses and post-therapeutic assessment in the near future.

Warp drive with zero expansion

Energy Technology Data Exchange (ETDEWEB)

Natario, Jose [Department of Mathematics, Instituto Superior Tecnico (Portugal)

2002-03-21

It is commonly believed that Alcubierre's warp drive works by contracting space in front of the warp bubble and expanding the space behind it. We show that this contraction/expansion is but a marginal consequence of the choice made by Alcubierre and explicitly construct a similar spacetime where no contraction/expansion occurs. Global and optical properties of warp-drive spacetimes are also discussed.

Time-warp invariant pattern detection with bursting neurons

International Nuclear Information System (INIS)

Gollisch, Tim

2008-01-01

Sound patterns are defined by the temporal relations of their constituents, individual acoustic cues. Auditory systems need to extract these temporal relations to detect or classify sounds. In various cases, ranging from human speech to communication signals of grasshoppers, this pattern detection has been found to display invariance to temporal stretching or compression of the sound signal ('linear time-warp invariance'). In this work, a four-neuron network model is introduced, designed to solve such a detection task for the example of grasshopper courtship songs. As an essential ingredient, the network contains neurons with intrinsic bursting dynamics, which allow them to encode durations between acoustic events in short, rapid sequences of spikes. As shown by analytical calculations and computer simulations, these neuronal dynamics result in a powerful mechanism for temporal integration. Finally, the network reads out the encoded temporal information by detecting equal activity of two such bursting neurons. This leads to the recognition of rhythmic patterns independent of temporal stretching or compression

Namaste (counterbalancing technique: Overcoming warping in costal cartilage

Directory of Open Access Journals (Sweden)

Kapil S Agrawal

2015-01-01

Full Text Available Background: Indian noses are broader and lack projection as compared to other populations, hence very often need augmentation, that too by large volume. Costal cartilage remains the material of choice in large volume augmentations and repair of complex primary and secondary nasal deformities. One major disadvantage of costal cartilage grafts (CCG which offsets all other advantages is the tendency to warp and become distorted over a period of time. We propose a simple technique to overcome this menace of warping. Materials and Methods: We present the data of 51 patients of rhinoplasty done using CCG with counterbalancing technique over a period of 4 years. Results: No evidence of warping was found in any patient up to a maximum follow-up period of 4 years. Conclusion: Counterbalancing is a useful technique to overcome the problem of warping. It gives liberty to utilize even unbalanced cartilage safely to provide desired shape and use the cartilage without any wastage.

Overcoming the Educational Time Warp: Anticipating a Different Future

Directory of Open Access Journals (Sweden)

Garry Jacobs

2015-10-01

Full Text Available Education abridges the time required for individual and social progress by preserving and propagating the essence of human experience. It delivers to youth the accumulated knowledge of countless past generations in an organized and abridged form, so that future generations can start off with all the capacities acquired by their predecessors. However, today education confronts a serious dilemma. We are living in an educational time warp. There is a growing gap between contemporary human experience and what is taught in our educational system and that gap is widening rapidly with each passing year. Today humanity confronts challenges of unprecedented scope, magnitude and intensity. The incremental development of educational content and pedagogy in recent decades has not kept with the ever-accelerating pace of technological and social evolution. Education is also subject to a generational time warp resulting from the fact that many of today’s teachers were educated decades ago during very different times and based on different values and perspectives. The challenge of preparing youth for the future is exasperated by the fact that the future for which we are educating youth does not yet exist and to a large extent is unknown or unknowable. The resulting gap between the content of education and societal needs inhibits our capacity to anticipate and effectively respond to social problems. All these factors argue for a major reorientation of educational content and pedagogy from transmission of acquired knowledge based on past experience to development of the knowledge, skills and capacities of personality needed in a future we cannot clearly envision. We may not be able to anticipate the precise nature of the future, but we can provide an education based on the understanding that it will be very different from the present. In terms of content, the emphasis needs to shift from facts regarding the actual state of affairs in the past, present and

Warped AdS3 black holes

International Nuclear Information System (INIS)

Anninos, Dionysios; Li Wei; Padi, Megha; Song Wei; Strominger, Andrew

2009-01-01

Three dimensional topologically massive gravity (TMG) with a negative cosmological constant -l -2 and positive Newton constant G admits an AdS 3 vacuum solution for any value of the graviton mass μ. These are all known to be perturbatively unstable except at the recently explored chiral point μl = 1. However we show herein that for every value of μl ≠ 3 there are two other (potentially stable) vacuum solutions given by SL(2,R) x U(1)-invariant warped AdS 3 geometries, with a timelike or spacelike U(1) isometry. Critical behavior occurs at μl = 3, where the warping transitions from a stretching to a squashing, and there are a pair of warped solutions with a null U(1) isometry. For μl > 3, there are known warped black hole solutions which are asymptotic to warped AdS 3 . We show that these black holes are discrete quotients of warped AdS 3 just as BTZ black holes are discrete quotients of ordinary AdS 3 . Moreover new solutions of this type, relevant to any theory with warped AdS 3 solutions, are exhibited. Finally we note that the black hole thermodynamics is consistent with the hypothesis that, for μl > 3, the warped AdS 3 ground state of TMG is holographically dual to a 2D boundary CFT with central charges c R -formula and c L -formula.

Registration of prone and supine CT colonography scans using correlation optimized warping and canonical correlation analysis

International Nuclear Information System (INIS)

Wang Shijun; Yao Jianhua; Liu Jiamin; Petrick, Nicholas; Van Uitert, Robert L.; Periaswamy, Senthil; Summers, Ronald M.

2009-01-01

Purpose: In computed tomographic colonography (CTC), a patient will be scanned twice--Once supine and once prone--to improve the sensitivity for polyp detection. To assist radiologists in CTC reading, in this paper we propose an automated method for colon registration from supine and prone CTC scans. Methods: We propose a new colon centerline registration method for prone and supine CTC scans using correlation optimized warping (COW) and canonical correlation analysis (CCA) based on the anatomical structure of the colon. Four anatomical salient points on the colon are first automatically distinguished. Then correlation optimized warping is applied to the segments defined by the anatomical landmarks to improve the global registration based on local correlation of segments. The COW method was modified by embedding canonical correlation analysis to allow multiple features along the colon centerline to be used in our implementation. Results: We tested the COW algorithm on a CTC data set of 39 patients with 39 polyps (19 training and 20 test cases) to verify the effectiveness of the proposed COW registration method. Experimental results on the test set show that the COW method significantly reduces the average estimation error in a polyp location between supine and prone scans by 67.6%, from 46.27±52.97 to 14.98 mm±11.41 mm, compared to the normalized distance along the colon centerline algorithm (p<0.01). Conclusions: The proposed COW algorithm is more accurate for the colon centerline registration compared to the normalized distance along the colon centerline method and the dynamic time warping method. Comparison results showed that the feature combination of z-coordinate and curvature achieved lowest registration error compared to the other feature combinations used by COW. The proposed method is tolerant to centerline errors because anatomical landmarks help prevent the propagation of errors across the entire colon centerline.

Dynamic Programming Algorithms in Speech Recognition

Directory of Open Access Journals (Sweden)

Titus Felix FURTUNA

2008-01-01

Full Text Available In a system of speech recognition containing words, the recognition requires the comparison between the entry signal of the word and the various words of the dictionary. The problem can be solved efficiently by a dynamic comparison algorithm whose goal is to put in optimal correspondence the temporal scales of the two words. An algorithm of this type is Dynamic Time Warping. This paper presents two alternatives for implementation of the algorithm designed for recognition of the isolated words.

Modulus stabilization in a non-flat warped braneworld scenario

Energy Technology Data Exchange (ETDEWEB)

Banerjee, Indrani [S.N. Bose National Centre for Basic Sciences, Department of Astrophysics and Cosmology, Kolkata (India); SenGupta, Soumitra [Indian Association for the Cultivation of Science, Department of Theoretical Physics, Kolkata (India)

2017-05-15

The stability of the modular field in a warped brane world scenario has been a subject of interest for a long time. Goldberger and Wise (GW) proposed a mechanism to achieve this by invoking a massive scalar field in the bulk space-time neglecting the back-reaction. In this work, we examine the possibility of stabilizing the modulus without bringing about any external scalar field. We show that instead of flat 3-branes as considered in Randall-Sundrum (RS) warped braneworld model, if one considers a more generalized version of warped geometry with de Sitter 3-brane, then the brane vacuum energy automatically leads to a modulus potential with a metastable minimum. Our result further reveals that in this scenario the gauge hierarchy problem can also be resolved for an appropriate choice of the brane's cosmological constant. (orig.)

The geometry of warped product singularities

Science.gov (United States)

Stoica, Ovidiu Cristinel

In this article, the degenerate warped products of singular semi-Riemannian manifolds are studied. They were used recently by the author to handle singularities occurring in General Relativity, in black holes and at the big-bang. One main result presented here is that a degenerate warped product of semi-regular semi-Riemannian manifolds with the warping function satisfying a certain condition is a semi-regular semi-Riemannian manifold. The connection and the Riemann curvature of the warped product are expressed in terms of those of the factor manifolds. Examples of singular semi-Riemannian manifolds which are semi-regular are constructed as warped products. Applications include cosmological models and black holes solutions with semi-regular singularities. Such singularities are compatible with a certain reformulation of the Einstein equation, which in addition holds at semi-regular singularities too.

The analysis of thin walled composite laminated helicopter rotor with hierarchical warping functions and finite element method

Science.gov (United States)

Zhu, Dechao; Deng, Zhongmin; Wang, Xingwei

2001-08-01

In the present paper, a series of hierarchical warping functions is developed to analyze the static and dynamic problems of thin walled composite laminated helicopter rotors composed of several layers with single closed cell. This method is the development and extension of the traditional constrained warping theory of thin walled metallic beams, which had been proved very successful since 1940s. The warping distribution along the perimeter of each layer is expanded into a series of successively corrective warping functions with the traditional warping function caused by free torsion or free bending as the first term, and is assumed to be piecewise linear along the thickness direction of layers. The governing equations are derived based upon the variational principle of minimum potential energy for static analysis and Rayleigh Quotient for free vibration analysis. Then the hierarchical finite element method is introduced to form a numerical algorithm. Both static and natural vibration problems of sample box beams are analyzed with the present method to show the main mechanical behavior of the thin walled composite laminated helicopter rotor.

Superluminal warp drives are semiclassically unstable

Energy Technology Data Exchange (ETDEWEB)

Finazzi, S; Liberati, S [SISSA, via Beirut 2-4, Trieste 34151, Italy and INFN sezione di Trieste (Italy); Barcelo, C, E-mail: finazzi@sissa.i, E-mail: liberati@sissa.i, E-mail: carlos@iaa.e [Instituto de Astrofisica de AndalucIa, CSIC, Camino Bajo de Huetor 50, 18008 Granada (Spain)

2010-04-01

Warp drives are very interesting configurations of General Relativity: they provide a way to travel at superluminal speeds, albeit at the cost of requiring exotic matter to build them. Even if one succeeded in providing the necessary exotic matter, it would still be necessary to check whether they would survive to the switching on of quantum effects. Semiclassical corrections to warp-drive geometries created out of an initially flat spacetime have been analyzed in a previous work by the present authors in special locations, close to the wall of the bubble and in its center. Here, we present an exact numerical analysis of the renormalized stress-energy tensor (RSET) in the whole bubble. We find that the the RSET will exponentially grow in time close to the front wall of the superluminal bubble, after some transient terms have disappeared, hence strongly supporting our previous conclusion that the warp-drive geometries are unstable against semiclassical back-reaction. This result seems to implement the chronology protection conjecture, forbiddig the set up of a structure potentially dangerous for causality.

Fundamental limitations on 'warp drive' spacetimes

Energy Technology Data Exchange (ETDEWEB)

Lobo, Francisco S N [Centro de Astronomia e AstrofIsica da Universidade de Lisboa, Campo Grande, Ed. C8 1749-016 Lisbon (Portugal); Visser, Matt [School of Mathematical and Computing Sciences, Victoria University of Wellington, PO Box 600, Wellington (New Zealand)

2004-12-21

'Warp drive' spacetimes are useful as 'gedanken-experiments' that force us to confront the foundations of general relativity, and among other things, to precisely formulate the notion of 'superluminal' communication. After carefully formulating the Alcubierre and Natario warp drive spacetimes, and verifying their non-perturbative violation of the classical energy conditions, we consider a more modest question and apply linearized gravity to the weak-field warp drive, testing the energy conditions to first and second orders of the warp-bubble velocity, v. Since we take the warp-bubble velocity to be non-relativistic, v << c, we are not primarily interested in the 'superluminal' features of the warp drive. Instead we focus on a secondary feature of the warp drive that has not previously been remarked upon-the warp drive (if it could be built) would be an example of a 'reaction-less drive'. For both the Alcubierre and Natario warp drives we find that the occurrence of significant energy condition violations is not just a high-speed effect, but that the violations persist even at arbitrarily low speeds. A particularly interesting feature of this construction is that it is now meaningful to think of placing a finite mass spaceship at the centre of the warp bubble, and then see how the energy in the warp field compares with the mass-energy of the spaceship. There is no hope of doing this in Alcubierre's original version of the warp field, since by definition the point at the centre of the warp bubble moves on a geodesic and is 'massless'. That is, in Alcubierre's original formalism and in the Natario formalism the spaceship is always treated as a test particle, while in the linearized theory we can treat the spaceship as a finite mass object. For both the Alcubierre and Natario warp drives we find that even at low speeds the net (negative) energy stored in the warp fields must be a significant fraction

Evaluation of oil biodegradation using time warping and PCA

Energy Technology Data Exchange (ETDEWEB)

Christensen, J.H. [Royal Veterinary and Agricultural Univ., Thorvaldsensvej (Denmark). Dept. of Natural Sciences; Hansen, A.B. [National Environmental Research Inst., Roskilde (Denmark). Dept. of Environmental Chemistry and Microbiology; Andersen, O. [Roskilde Univ., Roskilde (Denmark). Dept. of Life Sciences and Chemistry

2005-07-01

The effects of biodegradation on the composition of stranded oil after the Baltic Carrier oil spill in March 2001 was evaluated using a newly developed multivariate statistical methodology. Gas chromatography and mass spectrometry provided data on the oil compounds and oil biodegradation was determined by applying weighted least square principal component analysis to the preprocessed chromatograms of methylphenanthrenes and methyldibenzothiophenes. One principal component explained 46 per cent of the variation in the complete data set. Samples collected immediately after the spill and 2.5 months after the spill did not exhibit changes in isomer composition. However, the isomer patterns changed in samples collected between 6.5 and 16.5 months after the spill. Samples collected after 8.5 months were the most greatly affected. An evaluation of the degradation patterns suggest that time warping and multivariate statistical methods can successfully identify links between spill samples and can determine how chemical composition will respond to biodegradation processes. 27 refs., 1 tab., 3 figs.

Evaluation of oil biodegradation using time warping and PCA

International Nuclear Information System (INIS)

Christensen, J.H.; Hansen, A.B.; Andersen, O.

2005-01-01

The effects of biodegradation on the composition of stranded oil after the Baltic Carrier oil spill in March 2001 was evaluated using a newly developed multivariate statistical methodology. Gas chromatography and mass spectrometry provided data on the oil compounds and oil biodegradation was determined by applying weighted least square principal component analysis to the preprocessed chromatograms of methylphenanthrenes and methyldibenzothiophenes. One principal component explained 46 per cent of the variation in the complete data set. Samples collected immediately after the spill and 2.5 months after the spill did not exhibit changes in isomer composition. However, the isomer patterns changed in samples collected between 6.5 and 16.5 months after the spill. Samples collected after 8.5 months were the most greatly affected. An evaluation of the degradation patterns suggest that time warping and multivariate statistical methods can successfully identify links between spill samples and can determine how chemical composition will respond to biodegradation processes. 27 refs., 1 tab., 3 figs

Quantum effects in warp drives

Directory of Open Access Journals (Sweden)

Finazzi Stefano

2013-09-01

Full Text Available Warp drives are interesting configurations that, at least theoretically, provide a way to travel at superluminal speed. Unfortunately, several issues seem to forbid their realization. First, a huge amount of exotic matter is required to build them. Second, the presence of quantum fields propagating in superluminal warp-drive geometries makes them semiclassically unstable. Indeed, a Hawking-like high-temperature flux of particles is generated inside the warp-drive bubble, which causes an exponential growth of the energy density measured at the front wall of the bubble by freely falling observers. Moreover, superluminal warp drives remain unstable even if the Lorentz symmetry is broken by the introduction of regulating higher order terms in the Lagrangian of the quantum field. If the dispersion relation of the quantum field is subluminal, a black-hole laser phenomenon yields an exponential amplification of the emitted flux. If it is superluminal, infrared effects cause a linear growth of this flux.

Sirepo - Warp

Energy Technology Data Exchange (ETDEWEB)

2016-10-25

Sirepo is an open source framework for cloud computing. The graphical user interface (GUI) for Sirepo, also known as the client, executes in any HTML5 compliant web browser on any computing platform, including tablets. The client is built in JavaScript, making use of the following open source libraries: Bootstrap, which is fundamental for cross-platform web applications; AngularJS, which provides a model–view–controller (MVC) architecture and GUI components; and D3.js, which provides interactive plots and data-driven transformations. The Sirepo server is built on the following Python technologies: Flask, which is a lightweight framework for web development; Jin-ja, which is a secure and widely used templating language; and Werkzeug, a utility library that is compliant with the WSGI standard. We use Nginx as the HTTP server and proxy, which provides a scalable event-driven architecture. The physics codes supported by Sirepo execute inside a Docker container. One of the codes supported by Sirepo is Warp. Warp is a particle-in-cell (PIC) code de-signed to simulate high-intensity charged particle beams and plasmas in both the electrostatic and electromagnetic regimes, with a wide variety of integrated physics models and diagnostics. At pre-sent, Sirepo supports a small subset of Warp’s capabilities. Warp is open source and is part of the Berkeley Lab Accelerator Simulation Toolkit.

One-against-all weighted dynamic time warping for language-independent and speaker-dependent speech recognition in adverse conditions.

Directory of Open Access Journals (Sweden)

Xianglilan Zhang

Full Text Available Considering personal privacy and difficulty of obtaining training material for many seldom used English words and (often non-English names, language-independent (LI with lightweight speaker-dependent (SD automatic speech recognition (ASR is a promising option to solve the problem. The dynamic time warping (DTW algorithm is the state-of-the-art algorithm for small foot-print SD ASR applications with limited storage space and small vocabulary, such as voice dialing on mobile devices, menu-driven recognition, and voice control on vehicles and robotics. Even though we have successfully developed two fast and accurate DTW variations for clean speech data, speech recognition for adverse conditions is still a big challenge. In order to improve recognition accuracy in noisy environment and bad recording conditions such as too high or low volume, we introduce a novel one-against-all weighted DTW (OAWDTW. This method defines a one-against-all index (OAI for each time frame of training data and applies the OAIs to the core DTW process. Given two speech signals, OAWDTW tunes their final alignment score by using OAI in the DTW process. Our method achieves better accuracies than DTW and merge-weighted DTW (MWDTW, as 6.97% relative reduction of error rate (RRER compared with DTW and 15.91% RRER compared with MWDTW are observed in our extensive experiments on one representative SD dataset of four speakers' recordings. To the best of our knowledge, OAWDTW approach is the first weighted DTW specially designed for speech data in adverse conditions.

Human low vision image warping - Channel matching considerations

Science.gov (United States)

Juday, Richard D.; Smith, Alan T.; Loshin, David S.

1992-01-01

We are investigating the possibility that a video image may productively be warped prior to presentation to a low vision patient. This could form part of a prosthesis for certain field defects. We have done preliminary quantitative studies on some notions that may be valid in calculating the image warpings. We hope the results will help make best use of time to be spent with human subjects, by guiding the selection of parameters and their range to be investigated. We liken a warping optimization to opening the largest number of spatial channels between the pixels of an input imager and resolution cells in the visual system. Some important effects are not quantified that will require human evaluation, such as local 'squashing' of the image, taken as the ratio of eigenvalues of the Jacobian of the transformation. The results indicate that the method shows quantitative promise. These results have identified some geometric transformations to evaluate further with human subjects.

A warping window approach to real-time vision-based pedestrian detection in a truck’s blind spot zone

OpenAIRE

Van Beeck, Kristof; Goedemé, Toon; Tuytelaars, Tinne

2012-01-01

Van Beeck K., Goedemé T., Tuytelaars T., ''A warping window approach to real-time vision-based pedestrian detection in a truck’s blind spot zone'', Proceedings 9th international conference on informatics in control, automation and robotics - ICINCO 2012, vol. 2, pp. 561-568, July 28-31, 2012, Rome, Italy.

Real-time vision-based pedestrian detection in a truck’s blind spot zone using a warping window approach

OpenAIRE

Van Beeck, Kristof; Goedemé, Toon; Tuytelaars, Tinne

2014-01-01

Van Beeck K., Goedemé G., Tuytelaars T., ''Real-time vision-based pedestrian detection in a truck’s blind spot zone using a warping window approach'', Informatics in control, automation and robotics - lecture notes in electrical engineering, vol. 283, pp. 251-264, Ferrier J.-L., Bernard A., Gusikhin O. and Madani K., eds., 2014.

Dynamic Time Warping Distance Method for Similarity Test of Multipoint Ground Motion Field

Directory of Open Access Journals (Sweden)

Yingmin Li

2010-01-01

Full Text Available The reasonability of artificial multi-point ground motions and the identification of abnormal records in seismic array observations, are two important issues in application and analysis of multi-point ground motion fields. Based on the dynamic time warping (DTW distance method, this paper discusses the application of similarity measurement in the similarity analysis of simulated multi-point ground motions and the actual seismic array records. Analysis results show that the DTW distance method not only can quantitatively reflect the similarity of simulated ground motion field, but also offers advantages in clustering analysis and singularity recognition of actual multi-point ground motion field.

Prediction of regulatory gene pairs using dynamic time warping and gene ontology.

Science.gov (United States)

Yang, Andy C; Hsu, Hui-Huang; Lu, Ming-Da; Tseng, Vincent S; Shih, Timothy K

2014-01-01

Selecting informative genes is the most important task for data analysis on microarray gene expression data. In this work, we aim at identifying regulatory gene pairs from microarray gene expression data. However, microarray data often contain multiple missing expression values. Missing value imputation is thus needed before further processing for regulatory gene pairs becomes possible. We develop a novel approach to first impute missing values in microarray time series data by combining k-Nearest Neighbour (KNN), Dynamic Time Warping (DTW) and Gene Ontology (GO). After missing values are imputed, we then perform gene regulation prediction based on our proposed DTW-GO distance measurement of gene pairs. Experimental results show that our approach is more accurate when compared with existing missing value imputation methods on real microarray data sets. Furthermore, our approach can also discover more regulatory gene pairs that are known in the literature than other methods.

Algorithms and programming tools for image processing on the MPP:3

Science.gov (United States)

Reeves, Anthony P.

1987-01-01

This is the third and final report on the work done for NASA Grant 5-403 on Algorithms and Programming Tools for Image Processing on the MPP:3. All the work done for this grant is summarized in the introduction. Work done since August 1986 is reported in detail. Research for this grant falls under the following headings: (1) fundamental algorithms for the MPP; (2) programming utilities for the MPP; (3) the Parallel Pascal Development System; and (4) performance analysis. In this report, the results of two efforts are reported: region growing, and performance analysis of important characteristic algorithms. In each case, timing results from MPP implementations are included. A paper is included in which parallel algorithms for region growing on the MPP is discussed. These algorithms permit different sized regions to be merged in parallel. Details on the implementation and peformance of several important MPP algorithms are given. These include a number of standard permutations, the FFT, convolution, arbitrary data mappings, image warping, and pyramid operations, all of which have been implemented on the MPP. The permutation and image warping functions have been included in the standard development system library.

Conformal boundaries of warped products

DEFF Research Database (Denmark)

Kokkendorff, Simon Lyngby

2006-01-01

In this note we prove a result on how to determine the conformal boundary of a type of warped product of two length spaces in terms of the individual conformal boundaries. In the situation, that we treat, the warping and conformal distortion functions are functions of distance to a base point....... The result is applied to produce examples of CAT(0)-spaces, where the conformal and ideal boundaries differ in interesting ways....

Wormholes, warp drives and energy conditions

CERN Document Server

2017-01-01

Top researchers in the field of gravitation present the state-of-the-art topics outlined in this book, ranging from the stability of rotating wormholes solutions supported by ghost scalar fields, modified gravity applied to wormholes, the study of novel semi-classical and nonlinear energy conditions, to the applications of quantum effects and the superluminal version of the warp drive in modified spacetime. Based on Einstein's field equations, this cutting-edge research area explores the more far-fetched theoretical outcomes of General Relativity and relates them to quantum field theory. This includes quantum energy inequalities, flux energy conditions, and wormhole curvature, and sheds light on not just the theoretical physics but also on the possible applications to warp drives and time travel. This book extensively explores the physical properties and characteristics of these 'exotic spacetimes,' describing in detail the general relativistic geometries that generate closed timelike curves.

Method for adjusting warp measurements to a different board dimension

Science.gov (United States)

William T. Simpson; John R. Shelly

2000-01-01

Warp in lumber is a common problem that occurs while lumber is being dried. In research or other testing programs, it is sometimes necessary to compare warp of different species or warp caused by different process variables. If lumber dimensions are not the same, then direct comparisons are not possible, and adjusting warp to a common dimension would be desirable so...

Conformal Vector Fields on Doubly Warped Product Manifolds and Applications

Directory of Open Access Journals (Sweden)

H. K. El-Sayied

2016-01-01

Full Text Available This article aimed to study and explore conformal vector fields on doubly warped product manifolds as well as on doubly warped spacetime. Then we derive sufficient conditions for matter and Ricci collineations on doubly warped product manifolds. A special attention is paid to concurrent vector fields. Finally, Ricci solitons on doubly warped product spacetime admitting conformal vector fields are considered.

DigiWarp: a method for deformable mouse atlas warping to surface topographic data

International Nuclear Information System (INIS)

Joshi, Anand A; Shattuck, David W; Toga, Arthur W; Chaudhari, Abhijit J; Li Changqing; Cherry, Simon R; Dutta, Joyita; Leahy, Richard M

2010-01-01

For pre-clinical bioluminescence or fluorescence optical tomography, the animal's surface topography and internal anatomy need to be estimated for improving the quantitative accuracy of reconstructed images. The animal's surface profile can be measured by all-optical systems, but estimation of the internal anatomy using optical techniques is non-trivial. A 3D anatomical mouse atlas may be warped to the estimated surface. However, fitting an atlas to surface topography data is challenging because of variations in the posture and morphology of imaged mice. In addition, acquisition of partial data (for example, from limited views or with limited sampling) can make the warping problem ill-conditioned. Here, we present a method for fitting a deformable mouse atlas to surface topographic range data acquired by an optical system. As an initialization procedure, we match the posture of the atlas to the posture of the mouse being imaged using landmark constraints. The asymmetric L 2 pseudo-distance between the atlas surface and the mouse surface is then minimized in order to register two data sets. A Laplacian prior is used to ensure smoothness of the surface warping field. Once the atlas surface is normalized to match the range data, the internal anatomy is transformed using elastic energy minimization. We present results from performance evaluation studies of our method where we have measured the volumetric overlap between the internal organs delineated directly from MRI or CT and those estimated by our proposed warping scheme. Computed Dice coefficients indicate excellent overlap in the brain and the heart, with fair agreement in the kidneys and the bladder.

Solid waste bin detection and classification using Dynamic Time Warping and MLP classifier

Energy Technology Data Exchange (ETDEWEB)

Islam, Md. Shafiqul, E-mail: shafique@eng.ukm.my [Dept. of Electrical, Electronic and Systems Engineering, Universiti Kebangsaan Malaysia, Bangi 43600, Selangore (Malaysia); Hannan, M.A., E-mail: hannan@eng.ukm.my [Dept. of Electrical, Electronic and Systems Engineering, Universiti Kebangsaan Malaysia, Bangi 43600, Selangore (Malaysia); Basri, Hassan [Dept. of Civil and Structural Engineering, Universiti Kebangsaan Malaysia, Bangi 43600, Selangore (Malaysia); Hussain, Aini; Arebey, Maher [Dept. of Electrical, Electronic and Systems Engineering, Universiti Kebangsaan Malaysia, Bangi 43600, Selangore (Malaysia)

2014-02-15

Highlights: • Solid waste bin level detection using Dynamic Time Warping (DTW). • Gabor wavelet filter is used to extract the solid waste image features. • Multi-Layer Perceptron classifier network is used for bin image classification. • The classification performance evaluated by ROC curve analysis. - Abstract: The increasing requirement for Solid Waste Management (SWM) has become a significant challenge for municipal authorities. A number of integrated systems and methods have introduced to overcome this challenge. Many researchers have aimed to develop an ideal SWM system, including approaches involving software-based routing, Geographic Information Systems (GIS), Radio-frequency Identification (RFID), or sensor intelligent bins. Image processing solutions for the Solid Waste (SW) collection have also been developed; however, during capturing the bin image, it is challenging to position the camera for getting a bin area centralized image. As yet, there is no ideal system which can correctly estimate the amount of SW. This paper briefly discusses an efficient image processing solution to overcome these problems. Dynamic Time Warping (DTW) was used for detecting and cropping the bin area and Gabor wavelet (GW) was introduced for feature extraction of the waste bin image. Image features were used to train the classifier. A Multi-Layer Perceptron (MLP) classifier was used to classify the waste bin level and estimate the amount of waste inside the bin. The area under the Receiver Operating Characteristic (ROC) curves was used to statistically evaluate classifier performance. The results of this developed system are comparable to previous image processing based system. The system demonstration using DTW with GW for feature extraction and an MLP classifier led to promising results with respect to the accuracy of waste level estimation (98.50%). The application can be used to optimize the routing of waste collection based on the estimated bin level.

Dynamics of warped flux compactifications

International Nuclear Information System (INIS)

Shiu, Gary; Underwood, Bret; Torroba, Gonzalo; Douglas, Michael R.

2008-01-01

We discuss the four dimensional effective action for type IIB flux compactifications, and obtain the quadratic terms taking warp effects into account. The analysis includes both the 4-d zero modes and their KK excitations, which become light at large warping. We identify an 'axial' type gauge for the supergravity fluctuations, which makes the four dimensional degrees of freedom manifest. The other key ingredient is the existence of constraints coming from the ten dimensional equations of motion. Applying these conditions leads to considerable simplifications, enabling us to obtain the low energy lagrangian explicitly. In particular, the warped Kaehler potential for metric moduli is computed and it is shown that there are no mixings with the KK fluctuations and the result differs from previous proposals. The four dimensional potential contains a generalization of the Gukov-Vafa-Witten term, plus usual mass terms for KK modes.

Geodesic congruences in warped spacetimes

International Nuclear Information System (INIS)

Ghosh, Suman; Dasgupta, Anirvan; Kar, Sayan

2011-01-01

In this article, we explore the kinematics of timelike geodesic congruences in warped five-dimensional bulk spacetimes, with and without thick or thin branes. Beginning with geodesic flows in the Randall-Sundrum anti-de Sitter geometry without and with branes, we find analytical expressions for the expansion scalar and comment on the effects of including thin branes on its evolution. Later, we move on to congruences in more general warped bulk geometries with a cosmological thick brane and a time-dependent extra dimensional scale. Using analytical expressions for the velocity field, we interpret the expansion, shear and rotation (ESR) along the flows, as functions of the extra dimensional coordinate. The evolution of a cross-sectional area orthogonal to the congruence, as seen from a local observer's point of view, is also shown graphically. Finally, the Raychaudhuri and geodesic equations in backgrounds with a thick brane are solved numerically in order to figure out the role of initial conditions (prescribed on the ESR) and spacetime curvature on the evolution of the ESR.

Tensorial dynamic time warping with articulation index representation for efficient audio-template learning.

Science.gov (United States)

Le, Long N; Jones, Douglas L

2018-03-01

Audio classification techniques often depend on the availability of a large labeled training dataset for successful performance. However, in many application domains of audio classification (e.g., wildlife monitoring), obtaining labeled data is still a costly and laborious process. Motivated by this observation, a technique is proposed to efficiently learn a clean template from a few labeled, but likely corrupted (by noise and interferences), data samples. This learning can be done efficiently via tensorial dynamic time warping on the articulation index-based time-frequency representations of audio data. The learned template can then be used in audio classification following the standard template-based approach. Experimental results show that the proposed approach outperforms both (1) the recurrent neural network approach and (2) the state-of-the-art in the template-based approach on a wildlife detection application with few training samples.

Warping methods for spectroscopic and chromatographic signal alignment: A tutorial

Energy Technology Data Exchange (ETDEWEB)

Bloemberg, Tom G., E-mail: T.Bloemberg@science.ru.nl [Radboud University Nijmegen, Institute for Molecules and Materials, Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands); Radboud University Nijmegen, Education Institute for Molecular Sciences, Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands); Gerretzen, Jan; Lunshof, Anton [Radboud University Nijmegen, Institute for Molecules and Materials, Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands); Wehrens, Ron [Centre for Research and Innovation, Fondazione Edmund Mach, Via E. Mach, 1, 38010 San Michele all’Adige, TN (Italy); Buydens, Lutgarde M.C. [Radboud University Nijmegen, Institute for Molecules and Materials, Heyendaalseweg 135, 6525 AJ Nijmegen (Netherlands)

2013-06-05

Highlights: •The concepts of warping and alignment are introduced. •The most important warping methods are critically reviewed and explained. •Reference selection, evaluation and place of warping in preprocessing are discussed. •Some pitfalls, especially for LC–MS and similar data, are addressed. •Examples are provided, together with programming scripts to rework and extend them. -- Abstract: Warping methods are an important class of methods that can correct for misalignments in (a.o.) chemical measurements. Their use in preprocessing of chromatographic, spectroscopic and spectrometric data has grown rapidly over the last decade. This tutorial review aims to give a critical introduction to the most important warping methods, the place of warping in preprocessing and current views on the related matters of reference selection, optimization, and evaluation. Some pitfalls in warping, notably for liquid chromatography–mass spectrometry (LC–MS) data and similar, will be discussed. Examples will be given of the application of a number of freely available warping methods to a nuclear magnetic resonance (NMR) spectroscopic dataset and a chromatographic dataset. As part of the Supporting Information, we provide a number of programming scripts in Matlab and R, allowing the reader to work the extended examples in detail and to reproduce the figures in this paper.

DigiWarp: a method for deformable mouse atlas warping to surface topographic data

Energy Technology Data Exchange (ETDEWEB)

Joshi, Anand A; Shattuck, David W; Toga, Arthur W [Laboratory of Neuro Imaging, UCLA School of Medicine, Los Angeles, CA 90095 (United States); Chaudhari, Abhijit J [Department of Radiology, UC Davis School of Medicine, Sacramento, CA 95817 (United States); Li Changqing; Cherry, Simon R [Department of Biomedical Engineering, University of California-Davis, Davis, CA 95616 (United States); Dutta, Joyita; Leahy, Richard M, E-mail: anand.joshi@loni.ucla.ed, E-mail: leahy@sipi.usc.ed [Signal and Image Processing Institute, University of Southern California, Los Angeles, CA 90089 (United States)

2010-10-21

For pre-clinical bioluminescence or fluorescence optical tomography, the animal's surface topography and internal anatomy need to be estimated for improving the quantitative accuracy of reconstructed images. The animal's surface profile can be measured by all-optical systems, but estimation of the internal anatomy using optical techniques is non-trivial. A 3D anatomical mouse atlas may be warped to the estimated surface. However, fitting an atlas to surface topography data is challenging because of variations in the posture and morphology of imaged mice. In addition, acquisition of partial data (for example, from limited views or with limited sampling) can make the warping problem ill-conditioned. Here, we present a method for fitting a deformable mouse atlas to surface topographic range data acquired by an optical system. As an initialization procedure, we match the posture of the atlas to the posture of the mouse being imaged using landmark constraints. The asymmetric L{sup 2} pseudo-distance between the atlas surface and the mouse surface is then minimized in order to register two data sets. A Laplacian prior is used to ensure smoothness of the surface warping field. Once the atlas surface is normalized to match the range data, the internal anatomy is transformed using elastic energy minimization. We present results from performance evaluation studies of our method where we have measured the volumetric overlap between the internal organs delineated directly from MRI or CT and those estimated by our proposed warping scheme. Computed Dice coefficients indicate excellent overlap in the brain and the heart, with fair agreement in the kidneys and the bladder.

Transverse Slicing of the Sixth-Seventh Costal Cartilaginous Junction: A Novel Technique to Prevent Warping in Nasal Surgery.

Science.gov (United States)

Teshima, Tara Lynn; Cheng, Homan; Pakdel, Amir; Kiss, Alex; Fialkov, Jeffrey A

2016-01-01

Costal cartilage is an important reconstructive tissue for correcting nasal deformities. Warping of costal cartilage, a recognized complication, can lead to significant functional and aesthetic problems. The authors present a technique to prevent warping that involves transverse slicing of the sixth-seventh costal cartilaginous junction, that when sliced perpendicular to the long axis of the rib, provides multiple long, narrow, clinically useful grafts with balanced cross-sections. The aim was to measure differences in cartilage warp between this technique (TJS) and traditional carving techniques. Costal cartilage was obtained from human subjects and cut to clinically relevant dimensions using a custom cutting jig. The sixth-seventh costal cartilaginous junction was sliced transversely leaving the outer surface intact. The adjacent sixth rib cartilage was carved concentrically and eccentrically. The samples were incubated and standardized serial photography was performed over time up to 4 weeks. Warp was quantified by measuring nonlinearity of the grafts using least-squares regression and compared between carving techniques. TJS grafts (n = 10) resulted in significantly less warp than both eccentrically (n = 3) and concentrically carved grafts (n = 3) (P < 0.0001). Warp was significantly higher with eccentric carving compared with concentric carving (P < 0.0001). Warp increased significantly with time for both eccentric (P = 0002) and concentric (P = 0.0007) techniques while TJS warp did not (P = 0.56). The technique of transverse slicing costal cartilage from the sixth-seventh junction minimizes warp compared with traditional carving methods providing ample grafts of adequate length and versatility for reconstructive requirements.

Galactic warps and the shape of heavy halos

International Nuclear Information System (INIS)

Sparke, L.S.

1984-01-01

The outer disks of many spiral galaxies are bent away from the plane of the inner disk; the abundance of these warps suggests that they are long-lived. Isolated galactic disks have long been thought to have no discrete modes of vertical oscillation under their own gravity, and so to be incapable of sustaining persistent warps. However, the visible disk contains only a fraction of the galactic mass; an invisible galactic halo makes up the rest. This paper presents an investigation of vertical warping modes in self-gravitating disks, in the imposed potential due to an axisymmetric unseen massive halo. If the halo matter is distributed so that the free precession rate of a test particle decreases with radius near the edge of the disk, then the disk has a discrete mode of vibration; oblate halos which become rapidly more flattened at large radii, and uniformly prolate halos, satisfy this requirement. Otherwise, the disk has no discrete modes and so cannot maintain a long-lived warp, unless the edge is sharply truncated. Computed mode shapes which resemble the observed warps can be found for halo masses consistent with those inferred from galactic rotation curves

Point-based warping with optimized weighting factors of displacement vectors

Science.gov (United States)

Pielot, Ranier; Scholz, Michael; Obermayer, Klaus; Gundelfinger, Eckart D.; Hess, Andreas

2000-06-01

The accurate comparison of inter-individual 3D image brain datasets requires non-affine transformation techniques (warping) to reduce geometric variations. Constrained by the biological prerequisites we use in this study a landmark-based warping method with weighted sums of displacement vectors, which is enhanced by an optimization process. Furthermore, we investigate fast automatic procedures for determining landmarks to improve the practicability of 3D warping. This combined approach was tested on 3D autoradiographs of Gerbil brains. The autoradiographs were obtained after injecting a non-metabolized radioactive glucose derivative into the Gerbil thereby visualizing neuronal activity in the brain. Afterwards the brain was processed with standard autoradiographical methods. The landmark-generator computes corresponding reference points simultaneously within a given number of datasets by Monte-Carlo-techniques. The warping function is a distance weighted exponential function with a landmark- specific weighting factor. These weighting factors are optimized by a computational evolution strategy. The warping quality is quantified by several coefficients (correlation coefficient, overlap-index, and registration error). The described approach combines a highly suitable procedure to automatically detect landmarks in autoradiographical brain images and an enhanced point-based warping technique, optimizing the local weighting factors. This optimization process significantly improves the similarity between the warped and the target dataset.

Warping for trim statics

KAUST Repository

Zhang, Dongliang; Wang, Xin; Huang, Yunsong; Schuster, Gerard T.

2014-01-01

The quality of migration images depends on the accuracy of the velocity model. For large velocity errors, the migration image is strongly distorted, which unflattens events in the common image gathers and consequently leads to a blurring in the stacked migration image. To mitigate this problem, we propose dynamic image warping to flatten the common image gathers before stacking and to enhance the signal-to-noise ratio of the migration image. Numerical tests on the Marmousi model and GOM data show that image warping of the prestack images followed by stacking leads to much better resolved reflectors than the original migration image. The problem, however, is that the reflector locations have increased uncertainty because the wrong velocity model is still used.

Warping for trim statics

KAUST Repository

Zhang, Dongliang

2014-08-05

The quality of migration images depends on the accuracy of the velocity model. For large velocity errors, the migration image is strongly distorted, which unflattens events in the common image gathers and consequently leads to a blurring in the stacked migration image. To mitigate this problem, we propose dynamic image warping to flatten the common image gathers before stacking and to enhance the signal-to-noise ratio of the migration image. Numerical tests on the Marmousi model and GOM data show that image warping of the prestack images followed by stacking leads to much better resolved reflectors than the original migration image. The problem, however, is that the reflector locations have increased uncertainty because the wrong velocity model is still used.

Statistics of galaxy warps in the HDF North and South

NARCIS (Netherlands)

Reshetnikov, [No Value; Battaner, E; Combes, F; Jimenez-Vicente, J

We present a statistical study of the presence of galaxy warps in the Hubble deep fields. Among a complete sample of 45 edge-on galaxies above a diameter of 1."3, we find 5 galaxies to be certainly warped and 6 galaxies as good candidates. In addition, 4 galaxies reveal a characteristic U-warp.

Mechanical properties of 3D printed warped membranes

Science.gov (United States)

Kosmrlj, Andrej; Xiao, Kechao; Weaver, James C.; Vlassak, Joost J.; Nelson, David R.

2015-03-01

We explore how a frozen background metric affects the mechanical properties of solid planar membranes. Our focus is a special class of ``warped membranes'' with a preferred random height profile characterized by random Gaussian variables h (q) in Fourier space with zero mean and variance q-m . It has been shown theoretically that in the linear response regime, this quenched random disorder increases the effective bending rigidity, while the Young's and shear moduli are reduced. Compared to flat plates of the same thickness t, the bending rigidity of warped membranes is increased by a factor hv / t while the in-plane elastic moduli are reduced by t /hv , where hv =√{ } describes the frozen height fluctuations. Interestingly, hv is system size dependent for warped membranes characterized with m > 2 . We present experimental tests of these predictions, using warped membranes prepared via high resolution 3D printing.

Bouncing cosmology from warped extra dimensional scenario

Science.gov (United States)

Das, Ashmita; Maity, Debaprasad; Paul, Tanmoy; SenGupta, Soumitra

2017-12-01

From the perspective of four dimensional effective theory on a two brane warped geometry model, we examine the possibility of "bouncing phenomena"on our visible brane. Our results reveal that the presence of a warped extra dimension lead to a non-singular bounce on the brane scale factor and hence can remove the "big-bang singularity". We also examine the possible parametric regions for which this bouncing is possible.

Two-step flash light sintering of copper nanoparticle ink to remove substrate warping

Energy Technology Data Exchange (ETDEWEB)

Ryu, Chung-Hyeon; Joo, Sung-Jun [Department of Mechanical Convergence Engineering, Hanyang University, Haengdang-dong, Seongdong-gu, Seoul 133-791 (Korea, Republic of); Kim, Hak-Sung, E-mail: kima@hanyang.ac.kr [Department of Mechanical Convergence Engineering, Hanyang University, Haengdang-dong, Seongdong-gu, Seoul 133-791 (Korea, Republic of); Institute of Nano Science and Technology, Hanyang University, Seoul, 133-791 (Korea, Republic of)

2016-10-30

Highlights: • We performed the two-step flash light sintering for copper nanoparticle ink to remove substrate warping. • 12 J/cm{sup 2} of preheating and 7 J/cm{sup 2} of main sintering energies were determined as optimum conditions to sinter the copper nanoparticle ink. • The resistivity of two-step sintered copper nanoparticle ink was 3.81 μΩ cm with 5B adhesion level, 2.3 times greater than that of bulk copper. • The two-step sintered case showed a high conductivity without any substrate warping. - Abstract: A two-step flash light sintering process was devised to reduce the warping of polymer substrates during the sintering of copper nanoparticle ink. To determine the optimum sintering conditions of the copper nanoparticle ink, the flash light irradiation conditions (pulse power, pulse number, on-time, and off-time) were varied and optimized. In order to monitor the flash light sintering process, in situ resistance and temperature monitoring of copper nanoink were conducted during the flash light sintering process. Also, a transient heat transfer analysis was performed by using the finite-element program ABAQUS to predict the temperature changes of copper nanoink and polymer substrate. The microstructures of the sintered copper nanoink films were analyzed by scanning electron microscopy. Additionally, an X-ray diffraction and Fourier transform infrared spectroscopy were used to characterize the crystal phase change of the sintered copper nanoparticles. The resulting two-step flash light sintered copper nanoink films exhibited a low resistivity (3.81 μΩ cm, 2.3 times of that of bulk copper) and 5B level of adhesion strength without warping of the polymer substrate.

Atlas warping for brain morphometry

Science.gov (United States)

Machado, Alexei M. C.; Gee, James C.

1998-06-01

In this work, we describe an automated approach to morphometry based on spatial normalizations of the data, and demonstrate its application to the analysis of gender differences in the human corpus callosum. The purpose is to describe a population by a reduced and representative set of variables, from which a prior model can be constructed. Our approach is rooted in the assumption that individual anatomies can be considered as quantitative variations on a common underlying qualitative plane. We can therefore imagine that a given individual's anatomy is a warped version of some referential anatomy, also known as an atlas. The spatial warps which transform a labeled atlas into anatomic alignment with a population yield immediate knowledge about organ size and shape in the group. Furthermore, variation within the set of spatial warps is directly related to the anatomic variation among the subjects. Specifically, the shape statistics--mean and variance of the mappings--for the population can be calculated in a special basis, and an eigendecomposition of the variance performed to identify the most significant modes of shape variation. The results obtained with the corpus callosum study confirm the existence of substantial anatomical differences between males and females, as reported in previous experimental work.

Evaluation of the Intel iWarp parallel processor for space flight applications

Science.gov (United States)

Hine, Butler P., III; Fong, Terrence W.

1993-01-01

The potential of a DARPA-sponsored advanced processor, the Intel iWarp, for use in future SSF Data Management Systems (DMS) upgrades is evaluated through integration into the Ames DMS testbed and applications testing. The iWarp is a distributed, parallel computing system well suited for high performance computing applications such as matrix operations and image processing. The system architecture is modular, supports systolic and message-based computation, and is capable of providing massive computational power in a low-cost, low-power package. As a consequence, the iWarp offers significant potential for advanced space-based computing. This research seeks to determine the iWarp's suitability as a processing device for space missions. In particular, the project focuses on evaluating the ease of integrating the iWarp into the SSF DMS baseline architecture and the iWarp's ability to support computationally stressing applications representative of SSF tasks.

Some examples of image warping for low vision prosthesis

Science.gov (United States)

Juday, Richard D.; Loshin, David S.

1988-01-01

NASA has developed an image processor, the Programmable Remapper, for certain functions in machine vision. The Remapper performs a highly arbitrary geometric warping of an image at video rate. It might ultimately be shrunk to a size and cost that could allow its use in a low-vision prosthesis. Coordinate warpings have been developed for retinitis pigmentosa (tunnel vision) and for maculapathy (loss of central field) that are intended to make best use of the patient's remaining viable retina. The rationales and mathematics are presented for some warpings that we will try in clinical studies using the Remapper's prototype.

Asymptotically spacelike warped anti-de Sitter spacetimes in generalized minimal massive gravity

International Nuclear Information System (INIS)

Setare, M R; Adami, H

2017-01-01

In this paper we show that warped AdS 3 black hole spacetime is a solution of the generalized minimal massive gravity (GMMG) and introduce suitable boundary conditions for asymptotically warped AdS 3 spacetimes. Then we find the Killing vector fields such that transformations generated by them preserve the considered boundary conditions. We calculate the conserved charges which correspond to the obtained Killing vector fields and show that the algebra of the asymptotic conserved charges is given as the semi direct product of the Virasoro algebra with U (1) current algebra. We use a particular Sugawara construction to reconstruct the conformal algebra. Thus, we are allowed to use the Cardy formula to calculate the entropy of the warped black hole. We demonstrate that the gravitational entropy of the warped black hole exactly coincides with what we obtain via Cardy’s formula. As we expect, the warped Cardy formula also gives us exactly the same result as we obtain from the usual Cardy’s formula. We calculate mass and angular momentum of the warped black hole and then check that obtained mass, angular momentum and entropy to satisfy the first law of the black hole mechanics. According to the results of this paper we believe that the dual theory of the warped AdS 3 black hole solution of GMMG is a warped CFT. (paper)

Bouncing cosmology from warped extra dimensional scenario

Energy Technology Data Exchange (ETDEWEB)

Das, Ashmita; Maity, Debaprasad [Indian Institute of Technology, Department of Physics, Guwahati, Assam (India); Paul, Tanmoy; SenGupta, Soumitra [Indian Association for the Cultivation of Science, Department of Theoretical Physics, Kolkata (India)

2017-12-15

From the perspective of four dimensional effective theory on a two brane warped geometry model, we examine the possibility of ''bouncing phenomena''on our visible brane. Our results reveal that the presence of a warped extra dimension lead to a non-singular bounce on the brane scale factor and hence can remove the ''big-bang singularity''. We also examine the possible parametric regions for which this bouncing is possible. (orig.)

Warped Extra-Dimensional Opportunities and Signatures (1/3)

CERN Multimedia

CERN. Geneva

2008-01-01

I plan to discuss ways of searching for warped geometry and other extra-dimensional scenarios, with emphasis on the general lessons for search strategies. We will consider RS geometry on the brane and in the bulk, as well as possible black hole or quantum gravity signatures. If time permits, we will also consider fermion masses and/or precision Higgs measurements.

Warped Extra-Dimensional Opportunities and Signatures (3/3)

CERN Multimedia

CERN. Geneva

2008-01-01

I plan to discuss ways of searching for warped geometry and other extra-dimensional scenarios, with emphasis on the general lessons for search strategies. We will consider RS geometry on the brane and in the bulk, as well as possible black hole or quantum gravity signatures. If time permits, we will also consider fermion masses and/or precision Higgs measurements.

Warped Extra-Dimensional Opportunities and Signatures (2/3)

CERN Multimedia

CERN. Geneva

2008-01-01

I plan to discuss ways of searching for warped geometry and other extra-dimensional scenarios, with emphasis on the general lessons for search strategies. We will consider RS geometry on the brane and in the bulk, as well as possible black hole or quantum gravity signatures. If time permits, we will also consider fermion masses and/or precision Higgs measurements.

Warped Kähler potentials and fluxes

International Nuclear Information System (INIS)

Martucci, Luca

2017-01-01

The four-dimensional effective theory for type IIB warped flux compactifications proposed in https://www.doi.org/10.1007/JHEP03(2015)067 is completed by taking into account the backreaction of the Kähler moduli on the three-form fluxes. The only required modification consists in a flux-dependent contribution to the chiral fields parametrising the Kähler moduli. The resulting supersymmetric effective theory satisfies the no-scale condition and consistently combines previous partial results present in the literature. Similar results hold for M-theory warped compactifications on Calabi-Yau fourfolds, whose effective field theory and Kähler potential are also discussed.

Warped Kähler potentials and fluxes

Energy Technology Data Exchange (ETDEWEB)

Martucci, Luca [Dipartimento di Fisica ed Astronomia “Galileo Galilei' ,Università di Padova & I.N.F.N. Sezione di Padova,Via Marzolo 8, 35131 Padova (Italy)

2017-01-13

The four-dimensional effective theory for type IIB warped flux compactifications proposed in https://www.doi.org/10.1007/JHEP03(2015)067 is completed by taking into account the backreaction of the Kähler moduli on the three-form fluxes. The only required modification consists in a flux-dependent contribution to the chiral fields parametrising the Kähler moduli. The resulting supersymmetric effective theory satisfies the no-scale condition and consistently combines previous partial results present in the literature. Similar results hold for M-theory warped compactifications on Calabi-Yau fourfolds, whose effective field theory and Kähler potential are also discussed.

Seamless warping of diffusion tensor fields

DEFF Research Database (Denmark)

Xu, Dongrong; Hao, Xuejun; Bansal, Ravi

2008-01-01

deformations in an attempt to ensure that the local deformations in the warped image remains true to the orientation of the underlying fibers; forward mapping, however, can also create "seams" or gaps and consequently artifacts in the warped image by failing to define accurately the voxels in the template...... space where the magnitude of the deformation is large (e.g., |Jacobian| > 1). Backward mapping, in contrast, defines voxels in the template space by mapping them back to locations in the original imaging space. Backward mapping allows every voxel in the template space to be defined without the creation...

Alcubierre's warp drive: Problems and prospects

International Nuclear Information System (INIS)

Broeck, Chris van den

2000-01-01

Alcubierre's warp drive geometry seemingly represents the ultimate dream for interstellar travel: there is no speed limit, the passengers are weightless whatever the acceleration, and there is no time dilation. However, in its original form, the proposal suffers from several fatal flaws, such as unreasonably high energies, energy moving in a locally spacelike direction, and a violation of the energy conditions of classical Einstein gravity. I present a possible solution for one of these problems, and I suggest ways to at least soften the others

Application of dynamical system methods to galactic dynamics : from warps to double bars

OpenAIRE

Sánchez Martín, Patricia

2015-01-01

Most galaxies have a warped shape when they are seen from an edge-on point of view. In this work we apply dynamical system methods to find an explanation of this phenomenon that agrees with its abundance among galaxies, its persistence in time and the angular size of observed warps. Starting from a simple, but realistic, 3D galaxy model formed by a bar and a flat disc, we study the effect produced by a small misalignment between the angular momentum of the system and its angular velocity. ...

IMPLEMETASI OFFLINE PENGENALAN SISTEM ISYARAT BAHASA INDONESIA MENGGUNAKAN METODE DYNAMIC TIME WARPING PADA PERANGKAT ANDROID

Directory of Open Access Journals (Sweden)

Mohammad Iqbal

2015-11-01

Full Text Available ABSTRAK Algoritma Dynamic Time Warping (DTW digunakan secara luas untuk berbagai penelitian, salah satunya di bidang bahasa isyarat. DTW adalah algoritma pencocokan pola (template matching untuk mengukur kemiripan dua data sekuensial (time series temporal yang berbeda waktu dan kecepatan. Pada penelitian ini disajikan implementasi algoritma DTW untuk pengenalan bahasa isyarat Indonesia (Sistem Isyarat Bahasa Indonesia SIBI secara offline. Dataset yang digunakan dalam penelitian ini sebanyak 900 data untuk dengan jumlah kelas 50 kata isyarat, yaitu dengan rincian untuk masing-masing kelas adalah 3 data sebagai data template dan 15 data sebagai data testing. Hasil pengujian menunjukkan bahwa tingkat pengenalan atau nilai accuracy adalah 89,73%. Waktu rata-rata yang dibutuhkan adalah 654.59 milidetik untuk proses pengenalan satu data testing dengan menggunakan template sebanyak 3 data per kelas atau total template 150 data. Kata kunci: pengenalan, offline, SIBI, bahasa isyarat Indonesia, android.

Lorentz Violation in Warped Extra Dimensions

International Nuclear Information System (INIS)

Rizzo, Thomas G.

2011-01-01

Higher dimensional theories which address some of the problematic issues of the Standard Model(SM) naturally involve some form of D = 4 + n-dimensional Lorentz invariance violation (LIV). In such models the fundamental physics which leads to, e.g., field localization, orbifolding, the existence of brane terms and the compactification process all can introduce LIV in the higher dimensional theory while still preserving 4-d Lorentz invariance. In this paper, attempting to capture some of this physics, we extend our previous analysis of LIV in 5-d UED-type models to those with 5- d warped extra dimensions. To be specific, we employ the 5-d analog of the SM Extension of Kostelecky et al. which incorporates a complete set of operators arising from spontaneous LIV. We show that while the response of the bulk scalar, fermion and gauge fields to the addition of LIV operators in warped models is qualitatively similar to what happens in the flat 5-d UED case, the gravity sector of these models reacts very differently than in flat space. Specifically, we show that LIV in this warped case leads to a non-zero bulk mass for the 5-d graviton and so the would-be zero mode, which we identify as the usual 4-d graviton, must necessarily become massive. The origin of this mass term is the simultaneous existence of the constant non-zero AdS 5 curvature and the loss of general co-ordinate invariance via LIV in the 5-d theory. Thus warped 5-d models with LIV in the gravity sector are not phenomenologically viable.

Watershed regressions for pesticides (warp) models for predicting atrazine concentrations in Corn Belt streams

Science.gov (United States)

Stone, Wesley W.; Gilliom, Robert J.

2012-01-01

Watershed Regressions for Pesticides (WARP) models, previously developed for atrazine at the national scale, are improved for application to the United States (U.S.) Corn Belt region by developing region-specific models that include watershed characteristics that are influential in predicting atrazine concentration statistics within the Corn Belt. WARP models for the Corn Belt (WARP-CB) were developed for annual maximum moving-average (14-, 21-, 30-, 60-, and 90-day durations) and annual 95th-percentile atrazine concentrations in streams of the Corn Belt region. The WARP-CB models accounted for 53 to 62% of the variability in the various concentration statistics among the model-development sites. Model predictions were within a factor of 5 of the observed concentration statistic for over 90% of the model-development sites. The WARP-CB residuals and uncertainty are lower than those of the National WARP model for the same sites. Although atrazine-use intensity is the most important explanatory variable in the National WARP models, it is not a significant variable in the WARP-CB models. The WARP-CB models provide improved predictions for Corn Belt streams draining watersheds with atrazine-use intensities of 17 kg/km2 of watershed area or greater.

The Effect of Knitting Parameter and Finishing on Elastic Property of PET/PBT Warp Knitted Fabric

Directory of Open Access Journals (Sweden)

Chen Qing

2017-12-01

Full Text Available This study investigated the elastic elongation and elastic recovery of the elastic warp knittedfabric made of PET( polyethylene terephthalate and PBT(polybutylene terephthalate filament. Using 50/24F PET and 50D/24F PBT in two threadingbars, the tricot, locknit and satin warp knitted fabrics were produced on the E28 tricot warpknitting machine. The knitting parameters influencing the elastic elongation under 100N wereanalyzed in terms of fabric structure, yarn run-in speed and drawing density set on machine.Besides, dyeing temperature and heat setting temperature/time were also examined in order toretain proper elastic elongation and elastic recovery. The relationship between elastic elongationand knitting parameter and finishing parameter were analyzed. Finally, the elastic recovery ofPET/PBT warp knitted fabric was examined to demonstrate the elastic property of final finishedfabric. This study could help us to further exploit the use of PET/PBT warp knitted fabric in thedevelopment of elastic garment in future.

Perceived Speech Quality Estimation Using DTW Algorithm

Directory of Open Access Journals (Sweden)

S. Arsenovski

2009-06-01

Full Text Available In this paper a method for speech quality estimation is evaluated by simulating the transfer of speech over packet switched and mobile networks. The proposed system uses Dynamic Time Warping algorithm for test and received speech comparison. Several tests have been made on a test speech sample of a single speaker with simulated packet (frame loss effects on the perceived speech. The achieved results have been compared with measured PESQ values on the used transmission channel and their correlation has been observed.

Fault Diagnosis for Compensating Capacitors of Jointless Track Circuit Based on Dynamic Time Warping

Directory of Open Access Journals (Sweden)

Wei Dong

2014-01-01

Full Text Available Aiming at the problem of online fault diagnosis for compensating capacitors of jointless track circuit, a dynamic time warping (DTW based diagnosis method is proposed in this paper. Different from the existing related works, this method only uses the ground indoor monitoring signals of track circuit to locate the faulty compensating capacitor, not depending on the shunt current of inspection train, which is an indispensable condition for existing methods. So, it can be used for online diagnosis of compensating capacitor, which has not yet been realized by existing methods. To overcome the key problem that track circuit cannot obtain the precise position of the train, the DTW method is used for the first time in this situation to recover the function relationship between receiver’s peak voltage and shunt position. The necessity, thinking, and procedure of the method are described in detail. Besides the classical DTW based method, two improved methods for improving classification quality and reducing computation complexity are proposed. Finally, the diagnosis experiments based on the simulation model of track circuit show the effectiveness of the proposed methods.

Flavor universal resonances and warped gravity

Energy Technology Data Exchange (ETDEWEB)

Agashe, Kaustubh; Du, Peizhi; Hong, Sungwoo; Sundrum, Raman [Maryland Center for Fundamental Physics, Department of Physics,University of Maryland, College Park, MD 20742 (United States)

2017-01-04

Warped higher-dimensional compactifications with “bulk” standard model, or their AdS/CFT dual as the purely 4D scenario of Higgs compositeness and partial compositeness, offer an elegant approach to resolving the electroweak hierarchy problem as well as the origins of flavor structure. However, low-energy electroweak/flavor/CP constraints and the absence of non-standard physics at LHC Run 1 suggest that a “little hierarchy problem” remains, and that the new physics underlying naturalness may lie out of LHC reach. Assuming this to be the case, we show that there is a simple and natural extension of the minimal warped model in the Randall-Sundrum framework, in which matter, gauge and gravitational fields propagate modestly different degrees into the IR of the warped dimension, resulting in rich and striking consequences for the LHC (and beyond). The LHC-accessible part of the new physics is AdS/CFT dual to the mechanism of “vectorlike confinement”, with TeV-scale Kaluza-Klein excitations of the gauge and gravitational fields dual to spin-0,1,2 composites. Unlike the minimal warped model, these low-lying excitations have predominantly flavor-blind and flavor/CP-safe interactions with the standard model. Remarkably, this scenario also predicts small deviations from flavor-blindness originating from virtual effects of Higgs/top compositeness at ∼O(10) TeV, with subdominant resonance decays into Higgs/top-rich final states, giving the LHC an early “preview” of the nature of the resolution of the hierarchy problem. Discoveries of this type at LHC Run 2 would thereby anticipate (and set a target for) even more explicit explorations of Higgs compositeness at a 100 TeV collider, or for next-generation flavor tests.

An HMM-Like Dynamic Time Warping Scheme for Automatic Speech Recognition

Directory of Open Access Journals (Sweden)

Ing-Jr Ding

2014-01-01

Full Text Available In the past, the kernel of automatic speech recognition (ASR is dynamic time warping (DTW, which is feature-based template matching and belongs to the category technique of dynamic programming (DP. Although DTW is an early developed ASR technique, DTW has been popular in lots of applications. DTW is playing an important role for the known Kinect-based gesture recognition application now. This paper proposed an intelligent speech recognition system using an improved DTW approach for multimedia and home automation services. The improved DTW presented in this work, called HMM-like DTW, is essentially a hidden Markov model- (HMM- like method where the concept of the typical HMM statistical model is brought into the design of DTW. The developed HMM-like DTW method, transforming feature-based DTW recognition into model-based DTW recognition, will be able to behave as the HMM recognition technique and therefore proposed HMM-like DTW with the HMM-like recognition model will have the capability to further perform model adaptation (also known as speaker adaptation. A series of experimental results in home automation-based multimedia access service environments demonstrated the superiority and effectiveness of the developed smart speech recognition system by HMM-like DTW.

Asymptotically warped anti-de Sitter spacetimes in topologically massive gravity

International Nuclear Information System (INIS)

Henneaux, Marc; Martinez, Cristian; Troncoso, Ricardo

2011-01-01

Asymptotically warped AdS spacetimes in topologically massive gravity with negative cosmological constant are considered in the case of spacelike stretched warping, where black holes have been shown to exist. We provide a set of asymptotic conditions that accommodate solutions in which the local degree of freedom (the ''massive graviton'') is switched on. An exact solution with this property is explicitly exhibited and possesses a slower falloff than the warped AdS black hole. The boundary conditions are invariant under the semidirect product of the Virasoro algebra with a u(1) current algebra. We show that the canonical generators are integrable and finite. When the graviton is not excited, our analysis is compared and contrasted with earlier results obtained through the covariant approach to conserved charges. In particular, we find agreement with the conserved charges of the warped AdS black holes as well as with the central charges in the algebra.

Watershed regressions for pesticides (WARP) for predicting atrazine concentration in Corn Belt streams

Science.gov (United States)

Stone, Wesley W.; Gilliom, Robert J.

2011-01-01

Watershed Regressions for Pesticides (WARP) models, previously developed for atrazine at the national scale, can be improved for application to the U.S. Corn Belt region by developing region-specific models that include important watershed characteristics that are influential in predicting atrazine concentration statistics within the Corn Belt. WARP models for the Corn Belt (WARP-CB) were developed for predicting annual maximum moving-average (14-, 21-, 30-, 60-, and 90-day durations) and annual 95th-percentile atrazine concentrations in streams of the Corn Belt region. All streams used in development of WARP-CB models drain watersheds with atrazine use intensity greater than 17 kilograms per square kilometer (kg/km2). The WARP-CB models accounted for 53 to 62 percent of the variability in the various concentration statistics among the model-development sites.

Probabilistic wind power forecasting with online model selection and warped gaussian process

International Nuclear Information System (INIS)

Kou, Peng; Liang, Deliang; Gao, Feng; Gao, Lin

2014-01-01

Highlights: • A new online ensemble model for the probabilistic wind power forecasting. • Quantifying the non-Gaussian uncertainties in wind power. • Online model selection that tracks the time-varying characteristic of wind generation. • Dynamically altering the input features. • Recursive update of base models. - Abstract: Based on the online model selection and the warped Gaussian process (WGP), this paper presents an ensemble model for the probabilistic wind power forecasting. This model provides the non-Gaussian predictive distributions, which quantify the non-Gaussian uncertainties associated with wind power. In order to follow the time-varying characteristics of wind generation, multiple time dependent base forecasting models and an online model selection strategy are established, thus adaptively selecting the most probable base model for each prediction. WGP is employed as the base model, which handles the non-Gaussian uncertainties in wind power series. Furthermore, a regime switch strategy is designed to modify the input feature set dynamically, thereby enhancing the adaptiveness of the model. In an online learning framework, the base models should also be time adaptive. To achieve this, a recursive algorithm is introduced, thus permitting the online updating of WGP base models. The proposed model has been tested on the actual data collected from both single and aggregated wind farms

STRONG FIELD EFFECTS ON EMISSION LINE PROFILES: KERR BLACK HOLES AND WARPED ACCRETION DISKS

International Nuclear Information System (INIS)

Wang Yan; Li Xiangdong

2012-01-01

If an accretion disk around a black hole is illuminated by hard X-rays from non-thermal coronae, fluorescent iron lines will be emitted from the inner region of the accretion disk. The emission line profiles will show a variety of strong field effects, which may be used as a probe of the spin parameter of the black hole and the structure of the accretion disk. In this paper, we generalize the previous relativistic line profile models by including both the black hole spinning effects and the non-axisymmetries of warped accretion disks. Our results show different features from the conventional calculations for either a flat disk around a Kerr black hole or a warped disk around a Schwarzschild black hole by presenting, at the same time, multiple peaks, rather long red tails, and time variations of line profiles with the precession of the disk. We show disk images as seen by a distant observer, which are distorted by the strong gravity. Although we are primarily concerned with the iron K-shell lines in this paper, the calculation is general and is valid for any emission lines produced from a warped accretion disk around a black hole.

Comparison of turbulence mitigation algorithms

Science.gov (United States)

Kozacik, Stephen T.; Paolini, Aaron; Sherman, Ariel; Bonnett, James; Kelmelis, Eric

2017-07-01

When capturing imagery over long distances, atmospheric turbulence often degrades the data, especially when observation paths are close to the ground or in hot environments. These issues manifest as time-varying scintillation and warping effects that decrease the effective resolution of the sensor and reduce actionable intelligence. In recent years, several image processing approaches to turbulence mitigation have shown promise. Each of these algorithms has different computational requirements, usability demands, and degrees of independence from camera sensors. They also produce different degrees of enhancement when applied to turbulent imagery. Additionally, some of these algorithms are applicable to real-time operational scenarios while others may only be suitable for postprocessing workflows. EM Photonics has been developing image-processing-based turbulence mitigation technology since 2005. We will compare techniques from the literature with our commercially available, real-time, GPU-accelerated turbulence mitigation software. These comparisons will be made using real (not synthetic), experimentally obtained data for a variety of conditions, including varying optical hardware, imaging range, subjects, and turbulence conditions. Comparison metrics will include image quality, video latency, computational complexity, and potential for real-time operation. Additionally, we will present a technique for quantitatively comparing turbulence mitigation algorithms using real images of radial resolution targets.

Quality control of the soil moisture probe response patterns from a green infrastructure site using Dynamic Time Warping (DTW) and association rule learning

Science.gov (United States)

Yu, Z.; Bedig, A.; Quigley, M.; Montalto, F. A.

2017-12-01

In-situ field monitoring can help to improve the design and management of decentralized Green Infrastructure (GI) systems in urban areas. Because of the vast quantity of continuous data generated from multi-site sensor systems, cost-effective post-construction opportunities for real-time control are limited; and the physical processes that influence the observed phenomena (e.g. soil moisture) are hard to track and control. To derive knowledge efficiently from real-time monitoring data, there is currently a need to develop more efficient approaches to data quality control. In this paper, we employ dynamic time warping method to compare the similarity of two soil moisture patterns without ignoring the inherent autocorrelation. We also use a rule-based machine learning method to investigate the feasibility of detecting anomalous responses from soil moisture probes. The data was generated from both individual and clusters of probes, deployed in a GI site in Milwaukee, WI. In contrast to traditional QAQC methods, which seek to detect outliers at individual time steps, the new method presented here converts the continuous time series into event-based symbolic sequences from which unusual response patterns can be detected. Different Matching rules are developed on different physical characteristics for different seasons. The results suggest that this method could be used alternatively to detect sensor failure, to identify extreme events, and to call out abnormal change patterns, compared to intra-probe and inter-probe historical observations. Though this algorithm was developed for soil moisture probes, the same approach could easily be extended to advance QAQC efficiency for any continuous environmental datasets.

Namaste (counterbalancing) technique: Overcoming warping in costal cartilage

OpenAIRE

Kapil S Agrawal; Manoj Bachhav; Raghav Shrotriya

2015-01-01

Background: Indian noses are broader and lack projection as compared to other populations, hence very often need augmentation, that too by large volume. Costal cartilage remains the material of choice in large volume augmentations and repair of complex primary and secondary nasal deformities. One major disadvantage of costal cartilage grafts (CCG) which offsets all other advantages is the tendency to warp and become distorted over a period of time. We propose a simple technique to overcome th...

Experimental Investigation About Stamping Behaviour of 3D Warp Interlock Composite Preforms

Science.gov (United States)

Dufour, Clément; Wang, Peng; Boussu, François; Soulat, Damien

2014-10-01

Forming of continuous fibre reinforcements and thermoplastic resin commingled prepregs can be performed at room temperature due to its similar textile structure. The "cool" forming stage is better controlled and more economical. The increase of temperature and the resin consolidation phases after the forming can be carried out under the isothermal condition thanks to a closed system. It can avoid the manufacturing defects easily experienced in the non-isothermal thermoforming, in particular the wrinkling [1]. Glass/Polypropylene commingled yarns have been woven inside different three-dimensional (3D) warp interlock fabrics and then formed using a double-curved shape stamping tool. The present study investigates the in-plane and through-thickness behaviour of the 3D warp interlock fibrous reinforcements during forming with a hemispherical punch. Experimental data allow analysing the forming behaviour in the warp and weft directions and on the influence of warp interlock architectures. The results point out that the layer to layer warp interlock preform has a better stamping behaviour, in particular no forming defects and good homogeneity in thickness.

Sinuous oscillations and steady warps of polytropic disks

International Nuclear Information System (INIS)

Balmforth, N.J.; Spiegel, E.A.

1995-05-01

In an asymptotic development of the equations governing the equilibria and linear stability of rapidly rotating polytropes we employed the slender aspect of these objects to reduce the three-dimensional partial differential equations to a somewhat simpler, ordinary integro-differential form. The earlier calculations dealt with isolated objects that were in centrifugal balance, that is the centrifugal acceleration of the configuration was balanced largely by self gravity with small contributions from the pressure gradient. Another interesting situation is that in which the polytrope rotates subject to externally imposed gravitational fields. In astrophysics, this is common in the theory of galactic dynamics because disks are unlikely to be isolated objects. The dark halos associated with disks also provide one possible explanation of the apparent warping of many galaxies. If the axis of the highly flattened disk is not aligned with that of the much less flattened halo, then the resultant torque of the halo gravity on the disk might provide a nonaxisymmetric distortion or disk warp. Motivated by these possibilities we shall here build models of polytropic disks of small but finite thickness which are subjected to prescribed, external gravitational fields. First we estimate how a symmetrical potential distorts the structure of the disk, then we examine its sinuous oscillations to confirm that they freely decay, hence suggesting that a warp must be externally forced. Finally, we consider steady warps of the disk plane when the axis of the disk does not coincide with that of the halo

Innovative monitoring of 3D warp interlock fabric during forming process

Science.gov (United States)

Dufour, C.; Jerkovic, I.; Wang, P.; Boussu, F.; Koncar, V.; Soulat, D.; Grancaric, A. M.; Pineau, P.

2017-10-01

The final geometry of 3D warp interlock fabric needs to be check during the 3D forming step to ensure the right locations of warp and weft yarns inside the final structure. Thus, a new monitoring approach has been proposed based on sensor yarns located in the fabric thickness. To ensure the accuracy of measurements, the observation of the surface deformation of the 3D warp interlock fabric has been joined to the sensor yarns measurements. At the end, it has been revealed a good correlation between strain measurement done globally by camera and locally performed by sensor yarns.

Computer-Aided Design Method of Warp-Knitted Jacquard Spacer Fabrics

Directory of Open Access Journals (Sweden)

Li Xinxin

2016-06-01

Full Text Available Based on a further study on knitting and jacquard principles, this paper presents a mathematical design model to make computer-aided design of warp-knitted jacquard spacer fabrics more efficient. The mathematical model with matrix method employs three essential elements of chain notation, threading and Jacquard designing. With this model, the processing to design warp-knitted jacquard spacer fabrics with CAD software is also introduced. In this study, the sports shoes which have separated functional areas according to the feet structure and characteristics of movement are analysed. The results show the different patterns on Jacquard spacer fabrics that are seamlessly stitched with jacquard technics. The computer-aided design method of warp-knitted jacquard spacer fabrics is efficient and simple.

Four-flux and warped heterotic M-theory compactifications

International Nuclear Information System (INIS)

Curio, Gottfried; Krause, Axel

2001-01-01

In the framework of heterotic M-theory compactified on a Calabi-Yau threefold 'times' an interval, the relation between geometry and four-flux is derived beyond first order. Besides the case with general flux which cannot be described by a warped geometry one is naturally led to consider two special types of four-flux in detail. One choice shows how the M-theory relation between warped geometry and flux reproduces the analogous one of the weakly coupled heterotic string with torsion. The other one leads to a quadratic dependence of the Calabi-Yau volume with respect to the orbifold direction which avoids the problem with negative volume of the first order approximation. As in the first order analysis we still find that Newton's constant is bounded from below at just the phenomenologically relevant value. However, the bound does not require an ad hoc truncation of the orbifold-size any longer. Finally we demonstrate explicitly that to leading order in κ 2/3 no Cosmological constant is induced in the four-dimensional low-energy action. This is in accord with what one can expect from supersymmetry

Warps, grids and curvature in triple vector bundles

Science.gov (United States)

Flari, Magdalini K.; Mackenzie, Kirill

2018-06-01

A triple vector bundle is a cube of vector bundle structures which commute in the (strict) categorical sense. A grid in a triple vector bundle is a collection of sections of each bundle structure with certain linearity properties. A grid provides two routes around each face of the triple vector bundle, and six routes from the base manifold to the total manifold; the warps measure the lack of commutativity of these routes. In this paper we first prove that the sum of the warps in a triple vector bundle is zero. The proof we give is intrinsic and, we believe, clearer than the proof using decompositions given earlier by one of us. We apply this result to the triple tangent bundle T^3M of a manifold and deduce (as earlier) the Jacobi identity. We further apply the result to the triple vector bundle T^2A for a vector bundle A using a connection in A to define a grid in T^2A . In this case the curvature emerges from the warp theorem.

Testing block subdivision algorithms on block designs

Science.gov (United States)

Wiseman, Natalie; Patterson, Zachary

2016-01-01

Integrated land use-transportation models predict future transportation demand taking into account how households and firms arrange themselves partly as a function of the transportation system. Recent integrated models require parcels as inputs and produce household and employment predictions at the parcel scale. Block subdivision algorithms automatically generate parcel patterns within blocks. Evaluating block subdivision algorithms is done by way of generating parcels and comparing them to those in a parcel database. Three block subdivision algorithms are evaluated on how closely they reproduce parcels of different block types found in a parcel database from Montreal, Canada. While the authors who developed each of the algorithms have evaluated them, they have used their own metrics and block types to evaluate their own algorithms. This makes it difficult to compare their strengths and weaknesses. The contribution of this paper is in resolving this difficulty with the aim of finding a better algorithm suited to subdividing each block type. The proposed hypothesis is that given the different approaches that block subdivision algorithms take, it's likely that different algorithms are better adapted to subdividing different block types. To test this, a standardized block type classification is used that consists of mutually exclusive and comprehensive categories. A statistical method is used for finding a better algorithm and the probability it will perform well for a given block type. Results suggest the oriented bounding box algorithm performs better for warped non-uniform sites, as well as gridiron and fragmented uniform sites. It also produces more similar parcel areas and widths. The Generalized Parcel Divider 1 algorithm performs better for gridiron non-uniform sites. The Straight Skeleton algorithm performs better for loop and lollipop networks as well as fragmented non-uniform and warped uniform sites. It also produces more similar parcel shapes and patterns.

ChromAlign: A two-step algorithmic procedure for time alignment of three-dimensional LC-MS chromatographic surfaces.

Science.gov (United States)

Sadygov, Rovshan G; Maroto, Fernando Martin; Hühmer, Andreas F R

2006-12-15

We present an algorithmic approach to align three-dimensional chromatographic surfaces of LC-MS data of complex mixture samples. The approach consists of two steps. In the first step, we prealign chromatographic profiles: two-dimensional projections of chromatographic surfaces. This is accomplished by correlation analysis using fast Fourier transforms. In this step, a temporal offset that maximizes the overlap and dot product between two chromatographic profiles is determined. In the second step, the algorithm generates correlation matrix elements between full mass scans of the reference and sample chromatographic surfaces. The temporal offset from the first step indicates a range of the mass scans that are possibly correlated, then the correlation matrix is calculated only for these mass scans. The correlation matrix carries information on highly correlated scans, but it does not itself determine the scan or time alignment. Alignment is determined as a path in the correlation matrix that maximizes the sum of the correlation matrix elements. The computational complexity of the optimal path generation problem is reduced by the use of dynamic programming. The program produces time-aligned surfaces. The use of the temporal offset from the first step in the second step reduces the computation time for generating the correlation matrix and speeds up the process. The algorithm has been implemented in a program, ChromAlign, developed in C++ language for the .NET2 environment in WINDOWS XP. In this work, we demonstrate the applications of ChromAlign to alignment of LC-MS surfaces of several datasets: a mixture of known proteins, samples from digests of surface proteins of T-cells, and samples prepared from digests of cerebrospinal fluid. ChromAlign accurately aligns the LC-MS surfaces we studied. In these examples, we discuss various aspects of the alignment by ChromAlign, such as constant time axis shifts and warping of chromatographic surfaces.

Aspects of warped AdS3/CFT2 correspondence

Science.gov (United States)

Chen, Bin; Zhang, Jia-Ju; Zhang, Jian-Dong; Zhong, De-Liang

2013-04-01

In this paper we apply the thermodynamics method to investigate the holographic pictures for the BTZ black hole, the spacelike and the null warped black holes in three-dimensional topologically massive gravity (TMG) and new massive gravity (NMG). Even though there are higher derivative terms in these theories, the thermodynamics method is still effective. It gives consistent results with the ones obtained by using asymptotical symmetry group (ASG) analysis. In doing the ASG analysis we develop a brute-force realization of the Barnich-Brandt-Compere formalism with Mathematica code, which also allows us to calculate the masses and the angular momenta of the black holes. In particular, we propose the warped AdS3/CFT2 correspondence in the new massive gravity, which states that quantum gravity in the warped spacetime could holographically dual to a two-dimensional CFT with {c_R}={c_L}=24 /{Gm{β^2√{{2( {21-4{β^2}} )}}}}.

Characterization of GCR-lightlike warped product of indefinite Sasakian manifolds

Directory of Open Access Journals (Sweden)

Rakesh Kumar

2014-07-01

Full Text Available In this paper we prove that there do not exist warped product GCR-lightlike submanifolds in the form M = N⊥ × λNT such that N⊥ is an anti-invariant submanifold tangent to V and NT an invariant submanifold of M‾, other than GCR-lightlike product in an indefinite Sasakian manifold. We also obtain characterization theorems for a GCR-lightlike submanifold to be locally a GCR-lightlike warped product.

Time warping of evolutionary distant temporal gene expression data based on noise suppression

Directory of Open Access Journals (Sweden)

Papatsenko Dmitri

2009-10-01

Full Text Available Abstract Background Comparative analysis of genome wide temporal gene expression data has a broad potential area of application, including evolutionary biology, developmental biology, and medicine. However, at large evolutionary distances, the construction of global alignments and the consequent comparison of the time-series data are difficult. The main reason is the accumulation of variability in expression profiles of orthologous genes, in the course of evolution. Results We applied Pearson distance matrices, in combination with other noise-suppression techniques and data filtering to improve alignments. This novel framework enhanced the capacity to capture the similarities between the temporal gene expression datasets separated by large evolutionary distances. We aligned and compared the temporal gene expression data in budding (Saccharomyces cerevisiae and fission (Schizosaccharomyces pombe yeast, which are separated by more then ~400 myr of evolution. We found that the global alignment (time warping properly matched the duration of cell cycle phases in these distant organisms, which was measured in prior studies. At the same time, when applied to individual ortholog pairs, this alignment procedure revealed groups of genes with distinct alignments, different from the global alignment. Conclusion Our alignment-based predictions of differences in the cell cycle phases between the two yeast species were in a good agreement with the existing data, thus supporting the computational strategy adopted in this study. We propose that the existence of the alternative alignments, specific to distinct groups of genes, suggests presence of different synchronization modes between the two organisms and possible functional decoupling of particular physiological gene networks in the course of evolution.

Majorana neutrinos in a warped 5D standard model

International Nuclear Information System (INIS)

Huber, S.J.; Shafi, Q.

2002-05-01

We consider neutrino oscillations and neutrinoless double beta decay in a five dimensional standard model with warped geometry. Although the see-saw mechanism in its simplest form cannot be implemented because of the warped geometry, the bulk standard model neutrinos can acquire the desired (Majorana) masses from dimension five interactions. We discuss how large mixings can arise, why the large mixing angle MSW solution for solar neutrinos is favored, and provide estimates for the mixing angle U e3 . Implications for neutrinoless double beta decay are also discussed. (orig.)

Warped conformal field theory as lower spin gravity

Science.gov (United States)

Hofman, Diego M.; Rollier, Blaise

2015-08-01

Two dimensional Warped Conformal Field Theories (WCFTs) may represent the simplest examples of field theories without Lorentz invariance that can be described holographically. As such they constitute a natural window into holography in non-AdS space-times, including the near horizon geometry of generic extremal black holes. It is shown in this paper that WCFTs posses a type of boost symmetry. Using this insight, we discuss how to couple these theories to background geometry. This geometry is not Riemannian. We call it Warped Geometry and it turns out to be a variant of a Newton-Cartan structure with additional scaling symmetries. With this formalism the equivalent of Weyl invariance in these theories is presented and we write two explicit examples of WCFTs. These are free fermionic theories. Lastly we present a systematic description of the holographic duals of WCFTs. It is argued that the minimal setup is not Einstein gravity but an SL (2, R) × U (1) Chern-Simons Theory, which we call Lower Spin Gravity. This point of view makes manifest the definition of boundary for these non-AdS geometries. This case represents the first step towards understanding a fully invariant formalism for WN field theories and their holographic duals.

Warped conformal field theory as lower spin gravity

Directory of Open Access Journals (Sweden)

Diego M. Hofman

2015-08-01

Full Text Available Two dimensional Warped Conformal Field Theories (WCFTs may represent the simplest examples of field theories without Lorentz invariance that can be described holographically. As such they constitute a natural window into holography in non-AdS space–times, including the near horizon geometry of generic extremal black holes. It is shown in this paper that WCFTs posses a type of boost symmetry. Using this insight, we discuss how to couple these theories to background geometry. This geometry is not Riemannian. We call it Warped Geometry and it turns out to be a variant of a Newton–Cartan structure with additional scaling symmetries. With this formalism the equivalent of Weyl invariance in these theories is presented and we write two explicit examples of WCFTs. These are free fermionic theories. Lastly we present a systematic description of the holographic duals of WCFTs. It is argued that the minimal setup is not Einstein gravity but an SL(2,R×U(1 Chern–Simons Theory, which we call Lower Spin Gravity. This point of view makes manifest the definition of boundary for these non-AdS geometries. This case represents the first step towards understanding a fully invariant formalism for WN field theories and their holographic duals.

Technical Note: The impact of deformable image registration methods on dose warping.

Science.gov (United States)

Qin, An; Liang, Jian; Han, Xiao; O'Connell, Nicolette; Yan, Di

2018-03-01

The purpose of this study was to investigate the clinical-relevant discrepancy between doses warped by pure image based deformable image registration (IM-DIR) and by biomechanical model based DIR (BM-DIR) on intensity-homogeneous organs. Ten patients (5Head&Neck, 5Prostate) were included. A research DIR tool (ADMRIE_v1.12) was utilized for IM-DIR. After IM-DIR, BM-DIR was carried out for organs (parotids, bladder, and rectum) which often encompass sharp dose gradient. Briefly, high-quality tetrahedron meshes were generated and deformable vector fields (DVF) from IM-DIR were interpolated to the surface nodes of the volume meshes as boundary condition. Then, a FEM solver (ABAQUS_v6.14) was used to simulate the displacement of internal nodes, which were then interpolated to image-voxel grids to get the more physically plausible DVF. Both geometrical and subsequent dose warping discrepancies were quantified between the two DIR methods. Target registration discrepancy(TRD) was evaluated to show the geometry difference. The re-calculated doses on second CT were warped to the pre-treatment CT via two DIR. Clinical-relevant dose parameters and γ passing rate were compared between two types of warped dose. The correlation was evaluated between parotid shrinkage and TRD/dose discrepancy. The parotid shrunk to 75.7% ± 9% of its pre-treatment volume and the percentage of volume with TRD>1.5 mm) was 6.5% ± 4.7%. The normalized mean-dose difference (NMDD) of IM-DIR and BM-DIR was -0.8% ± 1.5%, with range (-4.7% to 1.5%). 2 mm/2% passing rate was 99.0% ± 1.4%. A moderate correlation was found between parotid shrinkage and TRD and NMDD. The bladder had a NMDD of -9.9% ± 9.7%, with BM-DIR warped dose systematically higher. Only minor deviation was observed for rectum NMDD (0.5% ± 1.1%). Impact of DIR method on treatment dose warping is patient and organ-specific. Generally, intensity-homogeneous organs, which undergo larger deformation/shrinkage during

Design of a reading test for low vision image warping

Science.gov (United States)

Loshin, David S.; Wensveen, Janice; Juday, Richard D.; Barton, R. S.

1993-01-01

NASA and the University of Houston College of Optometry are examining the efficacy of image warping as a possible prosthesis for at least two forms of low vision - maculopathy and retinitis pigmentosa. Before incurring the expense of reducing the concept to practice, one would wish to have confidence that a worthwhile improvement in visual function would result. NASA's Programmable Remapper (PR) can warp an input image onto arbitrary geometric coordinate systems at full video rate, and it has recently been upgraded to accept computer-generated video text. We have integrated the Remapper with an SRI eye tracker to simulate visual malfunction in normal observers. A reading performance test has been developed to determine if the proposed warpings yield an increase in visual function; i.e., reading speed. We will describe the preliminary experimental results of this reading test with a simulated central field defect with and without remapped images.

Stability of warped AdS3 vacua of topologically massive gravity

International Nuclear Information System (INIS)

Anninos, Dionysios; Esole, Mboyo; Guica, Monica

2009-01-01

AdS 3 vacua of topologically massive gravity (TMG) have been shown to be perturbatively unstable for all values of the coupling constant except the chiral point μl = 1. We study the possibility that the warped vacua of TMG, which exist for all values of μ, are stable under linearized perturbations. In this paper, we show that spacelike warped AdS 3 vacua with Compere-Detournay boundary conditions are indeed stable in the range μl>3. This is precisely the range in which black hole solutions arise as discrete identifications of the warped AdS 3 vacuum. The situation somewhat resembles chiral gravity: although negative energy modes do exist, they are all excluded by the boundary conditions, and the perturbative spectrum solely consists of boundary (pure large gauge) gravitons.

Communication and Jamming BDA of OFDMA Communication Systems Using the Software Defined Radio Platform WARP

Science.gov (United States)

2015-03-01

COMMUNICATION AND JAMMING BDA OF OFDMA COMMUNICATION SYSTEMS USING THE SOFTWARE DEFINED RADIO PLATFORM WARP THESIS Kate J. Yaxley, FLTLT, Royal... BDA OF OFDMA COMMUNICATION SYSTEMS USING THE SOFTWARE DEFINED RADIO PLATFORM WARP THESIS Presented to the Faculty Department of Electrical and...COMMUNICATION AND JAMMING BDA OF OFDMA COMMUNICATION SYSTEMS USING THE SOFTWARE DEFINED RADIO PLATFORM WARP THESIS Kate J. Yaxley, B.E. (Elec) Hons Div II

Quantum tunneling and quasinormal modes in the spacetime of the Alcubierre warp drive

Science.gov (United States)

Jusufi, Kimet; Sakallı, İzzet; Övgün, Ali

2018-01-01

In a seminal paper, Alcubierre showed that Einstein's theory of general relativity appears to allow a super-luminal motion. In the present study, we use a recent eternal-warp-drive solution found by Alcubierre to study the effect of Hawking radiation upon an observer located within the warp drive in the framework of the quantum tunneling method. We find the same expression for the Hawking temperatures associated with the tunneling of both massive vector and scalar particles, and show this expression to be proportional to the velocity of the warp drive. On the other hand, since the discovery of gravitational waves, the quasinormal modes (QNMs) of black holes have also been extensively studied. With this purpose in mind, we perform a QNM analysis of massive scalar field perturbations in the background of the eternal-Alcubierre-warp-drive spacetime. Our analytical analysis shows that massive scalar perturbations lead to stable QNMs.

Thermodynamic stability of warped AdS3 black holes

International Nuclear Information System (INIS)

Birmingham, Danny; Mokhtari, Susan

2011-01-01

We study the thermodynamic stability of warped black holes in three-dimensional topologically massive gravity. The spacelike stretched black hole is parametrized by its mass and angular momentum. We determine the local and global stability properties in the canonical and grand canonical ensembles. The presence of a Hawking-Page type transition is established, and the critical temperature is determined. The thermodynamic metric of Ruppeiner is computed, and the curvature is shown to diverge in the extremal limit. The consequences of these results for the classical stability properties of warped black holes are discussed within the context of the correlated stability conjecture.

Algorithm for Compressing Time-Series Data

Science.gov (United States)

Hawkins, S. Edward, III; Darlington, Edward Hugo

2012-01-01

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

Three dimensional PIC simulation of heavy ion fusion beams: Recent improvements to and applications of WARP

International Nuclear Information System (INIS)

Grote, D.P.; Friedman, A.; Haber, I.

1993-01-01

The multi-dimensional particle simulation code WARP is used to study the transport and acceleration of space-charge dominated ion beams in present-day and near-term experiments, and in fusion drivers. The algorithms employed in the 3d package and a number of applications have recently been described. In this paper the authors review the general features and major applications of the code. They then present recent developments in both code capabilities and applications. Most notable is modeling of the planned ESQ injector for ILSE, which uses the code's newest features, including subgrid-scale placement of internal conductor boundaries

FPGA-Based Implementation of Lithuanian Isolated Word Recognition Algorithm

Directory of Open Access Journals (Sweden)

Tomyslav Sledevič

2013-05-01

Full Text Available The paper describes the FPGA-based implementation of Lithuanian isolated word recognition algorithm. FPGA is selected for parallel process implementation using VHDL to ensure fast signal processing at low rate clock signal. Cepstrum analysis was applied to features extraction in voice. The dynamic time warping algorithm was used to compare the vectors of cepstrum coefficients. A library of 100 words features was created and stored in the internal FPGA BRAM memory. Experimental testing with speaker dependent records demonstrated the recognition rate of 94%. The recognition rate of 58% was achieved for speaker-independent records. Calculation of cepstrum coefficients lasted for 8.52 ms at 50 MHz clock, while 100 DTWs took 66.56 ms at 25 MHz clock.Article in Lithuanian

Dynamically warped theory space and collective supersymmetry breaking

International Nuclear Information System (INIS)

Carone, Christopher D.; Erlich, Joshua; Glover, Brian

2005-01-01

We study deconstructed gauge theories in which a warp factor emerges dynamically. We present nonsupersymmetric models in which the potential for the link fields has translational invariance, broken only by boundary effects that trigger an exponential profile of vacuum expectation values. The spectrum of physical states deviates exponentially from that of the continuum for large masses; we discuss the effects of such exponential towers on gauge coupling unification. We also present a supersymmetric example in which a warp factor is driven by Fayet-Iliopoulos terms. The model is peculiar in that it possesses a global supersymmetry that remains unbroken despite nonvanishing D-terms. Inclusion of gravity and/or additional messenger fields leads to the collective breaking of supersymmetry and to unusual phenomenology

Needle bar for warp knitting machines

Science.gov (United States)

Hagel, Adolf; Thumling, Manfred

1979-01-01

Needle bar for warp knitting machines with a number of needles individually set into slits of the bar and having shafts cranked to such an extent that the head section of each needle is in alignment with the shaft section accommodated by the slit. Slackening of the needles will thus not influence the needle spacing.

PolyWaTT: A polynomial water travel time estimator based on Derivative Dynamic Time Warping and Perceptually Important Points

Science.gov (United States)

Claure, Yuri Navarro; Matsubara, Edson Takashi; Padovani, Carlos; Prati, Ronaldo Cristiano

2018-03-01

Traditional methods for estimating timing parameters in hydrological science require a rigorous study of the relations of flow resistance, slope, flow regime, watershed size, water velocity, and other local variables. These studies are mostly based on empirical observations, where the timing parameter is estimated using empirically derived formulas. The application of these studies to other locations is not always direct. The locations in which equations are used should have comparable characteristics to the locations from which such equations have been derived. To overcome this barrier, in this work, we developed a data-driven approach to estimate timing parameters such as travel time. Our proposal estimates timing parameters using historical data of the location without the need of adapting or using empirical formulas from other locations. The proposal only uses one variable measured at two different locations on the same river (for instance, two river-level measurements, one upstream and the other downstream on the same river). The recorded data from each location generates two time series. Our method aligns these two time series using derivative dynamic time warping (DDTW) and perceptually important points (PIP). Using data from timing parameters, a polynomial function generalizes the data by inducing a polynomial water travel time estimator, called PolyWaTT. To evaluate the potential of our proposal, we applied PolyWaTT to three different watersheds: a floodplain ecosystem located in the part of Brazil known as Pantanal, the world's largest tropical wetland area; and the Missouri River and the Pearl River, in United States of America. We compared our proposal with empirical formulas and a data-driven state-of-the-art method. The experimental results demonstrate that PolyWaTT showed a lower mean absolute error than all other methods tested in this study, and for longer distances the mean absolute error achieved by PolyWaTT is three times smaller than empirical

Warped Discrete Cosine Transform-Based Low Bit-Rate Block Coding Using Image Downsampling

Directory of Open Access Journals (Sweden)

Ertürk Sarp

2007-01-01

Full Text Available This paper presents warped discrete cosine transform (WDCT-based low bit-rate block coding using image downsampling. While WDCT aims to improve the performance of conventional DCT by frequency warping, the WDCT has only been applicable to high bit-rate coding applications because of the overhead required to define the parameters of the warping filter. Recently, low bit-rate block coding based on image downsampling prior to block coding followed by upsampling after the decoding process is proposed to improve the compression performance for low bit-rate block coders. This paper demonstrates that a superior performance can be achieved if WDCT is used in conjunction with image downsampling-based block coding for low bit-rate applications.

Gauge and moduli hierarchy in a multiply warped braneworld scenario

International Nuclear Information System (INIS)

Das, Ashmita; SenGupta, Soumitra

2013-01-01

Discovery of Higgs-like boson near the mass scale ∼126 Gev generates renewed interest to the gauge hierarchy problem in the standard model related to the stabilisation of the Higgs mass within Tev scale without any unnatural fine tuning. One of the successful attempts to resolve this problem has been the Randall–Sundrum warped geometry model. Subsequently this 5-dimensional model was extended to a doubly warped 6-dimensional (or higher) model which can offer a geometric explanation of the fermion mass hierarchy in the standard model of elementary particles (D. Choudhury and S. SenGupta, 2007 [1]). In an attempt to address the dark energy issue, we in this work extend such 6-dimensional warped braneworld model to include non-flat 3-branes at the orbifold fixed points such that a small but non-vanishing brane cosmological constant is induced in our observable brane. We show that the requirements of a Planck to Tev scale warping along with a vanishingly small but non-zero cosmological constant on the visible brane with non-hierarchical moduli, each with scale close to Planck length, lead to a scenario where the 3-branes can have energy scales either close to Tev or close to Planck scale. Such a scenario can address both the gauge hierarchy as well as fermion mass hierarchy problem in standard model without introducing hierarchical scales between the two moduli. Thus simultaneous resolutions to the gauge hierarchy problem, fermion mass hierarchy problem and non-hierarchical moduli problem are closely linked with the near flatness condition of our universe.

Distributed Algorithms for Time Optimal Reachability Analysis

DEFF Research Database (Denmark)

Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

2016-01-01

. We propose distributed computing to accelerate time optimal reachability analysis. We develop five distributed state exploration algorithms, implement them in \\uppaal enabling it to exploit the compute resources of a dedicated model-checking cluster. We experimentally evaluate the implemented...... algorithms with four models in terms of their ability to compute near- or proven-optimal solutions, their scalability, time and memory consumption and communication overhead. Our results show that distributed algorithms work much faster than sequential algorithms and have good speedup in general.......Time optimal reachability analysis is a novel model based technique for solving scheduling and planning problems. After modeling them as reachability problems using timed automata, a real-time model checker can compute the fastest trace to the goal states which constitutes a time optimal schedule...

Thermodynamic stability of warped AdS{sub 3} black holes

Energy Technology Data Exchange (ETDEWEB)

Birmingham, Danny, E-mail: dbirmingham@pacific.ed [Department of Physics, University of the Pacific, Stockton, CA 95211 (United States); Mokhtari, Susan, E-mail: susan@science.csustan.ed [Department of Physics, California State University Stanislaus, Turlock, CA 95382 (United States)

2011-02-21

We study the thermodynamic stability of warped black holes in three-dimensional topologically massive gravity. The spacelike stretched black hole is parametrized by its mass and angular momentum. We determine the local and global stability properties in the canonical and grand canonical ensembles. The presence of a Hawking-Page type transition is established, and the critical temperature is determined. The thermodynamic metric of Ruppeiner is computed, and the curvature is shown to diverge in the extremal limit. The consequences of these results for the classical stability properties of warped black holes are discussed within the context of the correlated stability conjecture.

Algorithms for Brownian first-passage-time estimation

Science.gov (United States)

Adib, Artur B.

2009-09-01

A class of algorithms in discrete space and continuous time for Brownian first-passage-time estimation is considered. A simple algorithm is derived that yields exact mean first-passage times (MFPTs) for linear potentials in one dimension, regardless of the lattice spacing. When applied to nonlinear potentials and/or higher spatial dimensions, numerical evidence suggests that this algorithm yields MFPT estimates that either outperform or rival Langevin-based (discrete time and continuous space) estimates.

Nonlinear Gravitational Waves as Dark Energy in Warped Spacetimes

Directory of Open Access Journals (Sweden)

Reinoud Jan Slagter

2017-02-01

Full Text Available We find an azimuthal-angle dependent approximate wave like solution to second order on a warped five-dimensional manifold with a self-gravitating U(1 scalar gauge field (cosmic string on the brane using the multiple-scale method. The spectrum of the several orders of approximation show maxima of the energy distribution dependent on the azimuthal-angle and the winding numbers of the subsequent orders of the scalar field. This breakup of the quantized flux quanta does not lead to instability of the asymptotic wavelike solution due to the suppression of the n-dependency in the energy momentum tensor components by the warp factor. This effect is triggered by the contribution of the five dimensional Weyl tensor on the brane. This contribution can be understood as dark energy and can trigger the self-acceleration of the universe without the need of a cosmological constant. There is a striking relation between the symmetry breaking of the Higgs field described by the winding number and the SO(2 breaking of the axially symmetric configuration into a discrete subgroup of rotations of about 180 ∘ . The discrete sequence of non-axially symmetric deviations, cancelled by the emission of gravitational waves in order to restore the SO(2 symmetry, triggers the pressure T z z for discrete values of the azimuthal-angle. There could be a possible relation between the recently discovered angle-preferences of polarization axes of quasars on large scales and our theoretical predicted angle-dependency and this could be evidence for the existence of cosmic strings. Careful comparison of this spectrum of extremal values of the first and second order φ-dependency and the distribution of the alignment of the quasar polarizations is necessary. This can be accomplished when more observational data become available. It turns out that, for late time, the vacuum 5D spacetime is conformally invariant if the warp factor fulfils the equation of a vibrating �

Explicit Supersymmetry Breaking on Boundaries of Warped Extra Dimensions

Energy Technology Data Exchange (ETDEWEB)

Hall, Lawrence J.; Nomura, Yasunori; Okui, Takemichi; Oliver, Steven J.

2003-02-25

Explicit supersymmetry breaking is studied in higher dimensional theories by having boundaries respect only a subgroup of the bulk symmetry. If the boundary symmetry is the maximal subgroup allowed by the boundary conditions imposed on the fields, then the symmetry can be consistently gauged; otherwise gauging leads to an inconsistent theory. In a warped fifth dimension, an explicit breaking of all bulk supersymmetries by the boundaries is found to be inconsistent with gauging; unlike the case of flat 5D, complete supersymmetry breaking by boundary conditions is not consistent with supergravity. Despite this result, the low energy effective theory resulting from boundary supersymmetry breaking becomes consistent in the limit where gravity decouples, and such models are explored in the hope that some way of successfully incorporating gravity can be found. A warped constrained standard model leads to a theory with one Higgs boson with mass expected close to the experimental limit. A unified theory in a warped fifth dimension is studied with boundary breaking of both SU(5) gauge symmetry and supersymmetry. The usual supersymmetric predictionfor gauge coupling unification holds even though the TeV spectrum is quite unlike the MSSM. Such a theory may unify matter and Higgs in the same SU(5) hypermultiplet.

An algorithm for learning real-time automata

NARCIS (Netherlands)

Verwer, S.E.; De Weerdt, M.M.; Witteveen, C.

2007-01-01

We describe an algorithm for learning simple timed automata, known as real-time automata. The transitions of real-time automata can have a temporal constraint on the time of occurrence of the current symbol relative to the previous symbol. The learning algorithm is similar to the redblue fringe

Universal algorithm of time sharing

International Nuclear Information System (INIS)

Silin, I.N.; Fedyun'kin, E.D.

1979-01-01

Timesharing system algorithm is proposed for the wide class of one- and multiprocessor computer configurations. Dynamical priority is the piece constant function of the channel characteristic and system time quantum. The interactive job quantum has variable length. Characteristic recurrent formula is received. The concept of the background job is introduced. Background job loads processor if high priority jobs are inactive. Background quality function is given on the base of the statistical data received in the timesharing process. Algorithm includes optimal trashing off procedure for the jobs replacements in the memory. Sharing of the system time in proportion to the external priorities is guaranteed for the all active enough computing channels (back-ground too). The fast answer is guaranteed for the interactive jobs, which use small time and memory. The external priority control is saved for the high level scheduler. The experience of the algorithm realization on the BESM-6 computer in JINR is discussed

A Dynamic Fuzzy Cluster Algorithm for Time Series

Directory of Open Access Journals (Sweden)

Min Ji

2013-01-01

clustering time series by introducing the definition of key point and improving FCM algorithm. The proposed algorithm works by determining those time series whose class labels are vague and further partitions them into different clusters over time. The main advantage of this approach compared with other existing algorithms is that the property of some time series belonging to different clusters over time can be partially revealed. Results from simulation-based experiments on geographical data demonstrate the excellent performance and the desired results have been obtained. The proposed algorithm can be applied to solve other clustering problems in data mining.

A controlled method to flatten warped wooden panels

NARCIS (Netherlands)

Van Gerven, G.; Ankersmit, B.; van Duin, P.H.J.C.; Jorissen, A.J.M.; Schellen, H.L.

2016-01-01

This article describes the research and subsequent treatment to flatten the warped wooden doors of a seventeenth-century cabinet. The aim was to flatten the veneered panels, in very strict climatic conditions and without lifting any veneer or damaging the surface finish of the exterior. In this

Warped, anisotropic wormhole/soliton configurations in vacuum 5D gravity

International Nuclear Information System (INIS)

Vacaru, Sergiu I; Singleton, D

2002-01-01

In this paper we apply the anholonomic frames method developed in previous work to construct and study anisotropic vacuum field configurations in 5D gravity. Starting with an off-diagonal 5D metric, parametrized in terms of several ansatz functions, we show that using anholonomic frames greatly simplifies the resulting Einstein field equations. These simplified equations contain an interesting freedom in that one can choose one of the ansatz functions and then determine the remaining ansatz functions in terms of this choice. As examples we take one of the ansatz functions to be a solitonic solution of either the Kadomtsev-Petviashvili equation or the sine-Gordon equation. There are several interesting physical consequences of these solutions. First, a certain subclass of the solutions discussed in this paper has an exponential warp factor similar to that of the Randall-Sundrum model. However, the warp factor depends on more than just the fifth coordinate. In addition the warp factor arises from anisotropic vacuum solutions rather than from any explicit matter. Second, the solitonic character of these solutions might allow them to be interpreted either as gravitational models for particles (i.e. analogous to the 't Hooft-Polyakov monopole, but in the context of gravity), or as nonlinear, anisotropic gravitational waves

Warped models in string theory

International Nuclear Information System (INIS)

Acharya, B.S.; Benini, F.; Valandro, R.

2006-12-01

Warped models, originating with the ideas of Randall and Sundrum, provide a fascinating extension of the standard model with interesting consequences for the LHC. We investigate in detail how string theory realises such models, with emphasis on fermion localisation and the computation of Yukawa couplings. We find, in contrast to the 5d models, that fermions can be localised anywhere in the extra dimension, and that there are new mechanisms to generate exponential hierarchies amongst the Yukawa couplings. We also suggest a way to distinguish these string theory models with data from the LHC. (author)

Little Randall-Sundrum model and a multiply warped spacetime

International Nuclear Information System (INIS)

McDonald, Kristian L.

2008-01-01

A recent work has investigated the possibility that the mass scale for the ultraviolet (UV) brane in the Randall-Sundrum (RS) model is of the order 10 3 TeV. In this so called 'little Randall-Sundrum' (LRS) model the bounds on the gauge sector are less severe, permitting a lower Kaluza-Klein scale and cleaner discovery channels. However employing a low UV scale nullifies one major appeal of the RS model, namely, the elegant explanation of the hierarchy between the Planck and weak scales. In this work we show that by localizing the gauge, fermion, and scalar sector of the LRS model on a five dimensional slice of a doubly warped spacetime one may obtain the low UV brane scale employed in the LRS model and motivate the weak-Planck hierarchy. We also consider the generalization to an n-warped spacetime

A novel vibration-based fault diagnostic algorithm for gearboxes under speed fluctuations without rotational speed measurement

Science.gov (United States)

Hong, Liu; Qu, Yongzhi; Dhupia, Jaspreet Singh; Sheng, Shuangwen; Tan, Yuegang; Zhou, Zude

2017-09-01

The localized failures of gears introduce cyclic-transient impulses in the measured gearbox vibration signals. These impulses are usually identified from the sidebands around gear-mesh harmonics through the spectral analysis of cyclo-stationary signals. However, in practice, several high-powered applications of gearboxes like wind turbines are intrinsically characterized by nonstationary processes that blur the measured vibration spectra of a gearbox and deteriorate the efficacy of spectral diagnostic methods. Although order-tracking techniques have been proposed to improve the performance of spectral diagnosis for nonstationary signals measured in such applications, the required hardware for the measurement of rotational speed of these machines is often unavailable in industrial settings. Moreover, existing tacho-less order-tracking approaches are usually limited by the high time-frequency resolution requirement, which is a prerequisite for the precise estimation of the instantaneous frequency. To address such issues, a novel fault-signature enhancement algorithm is proposed that can alleviate the spectral smearing without the need of rotational speed measurement. This proposed tacho-less diagnostic technique resamples the measured acceleration signal of the gearbox based on the optimal warping path evaluated from the fast dynamic time-warping algorithm, which aligns a filtered shaft rotational harmonic signal with respect to a reference signal assuming a constant shaft rotational speed estimated from the approximation of operational speed. The effectiveness of this method is validated using both simulated signals from a fixed-axis gear pair under nonstationary conditions and experimental measurements from a 750-kW planetary wind turbine gearbox on a dynamometer test rig. The results demonstrate that the proposed algorithm can identify fault information from typical gearbox vibration measurements carried out in a resource-constrained industrial environment.

Trigonal warping and photo-induced effects on zone boundary phonon in monolayer graphene

Science.gov (United States)

Akay, D.

2018-05-01

We have reported the electronic band structure of monolayer graphene when the combined effects arising from the trigonal warp and highest zone-boundary phonons having A1 g symmetry with Haldane interaction which induced photo-irradiation effect. On the basis of our model, we have introduced a diagonalization to solve the associated Fröhlich Hamiltonian. We have examined that, a trigonal warping effect is introduced on the K and K ' points, leading to a dynamical band gap in the graphene electronic band spectrum due to the electron-A1 g phonon interaction and Haldane mass interaction. Additionally, the bands exhibited an anisotropy at this point. It is also found that, photo-irradiation effect is quite smaller than the trigonal warp effects in the graphene electronic band spectrum. In spite of this, controllability of the photo induced effects by the Haldane mass will have extensive implications in the graphene.

Time-Delay System Identification Using Genetic Algorithm

DEFF Research Database (Denmark)

Yang, Zhenyu; Seested, Glen Thane

2013-01-01

Due to the unknown dead-time coefficient, the time-delay system identification turns to be a non-convex optimization problem. This paper investigates the identification of a simple time-delay system, named First-Order-Plus-Dead-Time (FOPDT), by using the Genetic Algorithm (GA) technique. The qual......Due to the unknown dead-time coefficient, the time-delay system identification turns to be a non-convex optimization problem. This paper investigates the identification of a simple time-delay system, named First-Order-Plus-Dead-Time (FOPDT), by using the Genetic Algorithm (GA) technique...

Warping similarity space in category learning by human subjects: the role of task difficulty

OpenAIRE

Pevtzow, Rachel; Harnad, Stevan

1997-01-01

In innate Categorical Perception (CP) (e.g., colour perception), similarity space is "warped," with regions of increased within-category similarity (compression) and regions of reduced between-category similarity (separation) enh ancing the category boundaries and making categorisation reliable and all-or-none rather than graded. We show that category learning can likewise warp similarity space, resolving uncertainty near category boundaries. Two Hard and two Easy texture learning tasks were ...

Interactions between massive dark halos and warped disks

NARCIS (Netherlands)

Kuijken, K; Persic, M; Salucci, P

1997-01-01

The normal mode theory for warping of galaxy disks, in which disks are assumed to be tilted with respect to the equator of a massive, flattened dark halo, assumes a rigid, fixed halo. However, consideration of the back-reaction by a misaligned disk on a massive particle halo shows there to be strong

3D temporal subtraction on multislice CT images using nonlinear warping technique

Science.gov (United States)

Ishida, Takayuki; Katsuragawa, Shigehiko; Kawashita, Ikuo; Kim, Hyounseop; Itai, Yoshinori; Awai, Kazuo; Li, Qiang; Doi, Kunio

2007-03-01

The detection of very subtle lesions and/or lesions overlapped with vessels on CT images is a time consuming and difficult task for radiologists. In this study, we have developed a 3D temporal subtraction method to enhance interval changes between previous and current multislice CT images based on a nonlinear image warping technique. Our method provides a subtraction CT image which is obtained by subtraction of a previous CT image from a current CT image. Reduction of misregistration artifacts is important in the temporal subtraction method. Therefore, our computerized method includes global and local image matching techniques for accurate registration of current and previous CT images. For global image matching, we selected the corresponding previous section image for each current section image by using 2D cross-correlation between a blurred low-resolution current CT image and a blurred previous CT image. For local image matching, we applied the 3D template matching technique with translation and rotation of volumes of interests (VOIs) which were selected in the current and the previous CT images. The local shift vector for each VOI pair was determined when the cross-correlation value became the maximum in the 3D template matching. The local shift vectors at all voxels were determined by interpolation of shift vectors of VOIs, and then the previous CT image was nonlinearly warped according to the shift vector for each voxel. Finally, the warped previous CT image was subtracted from the current CT image. The 3D temporal subtraction method was applied to 19 clinical cases. The normal background structures such as vessels, ribs, and heart were removed without large misregistration artifacts. Thus, interval changes due to lung diseases were clearly enhanced as white shadows on subtraction CT images.

Resistance of i-beams in warping torsion with account for the development of plasticdeformations

Directory of Open Access Journals (Sweden)

Tusnin Aleksandr Romanovich

2014-01-01

Full Text Available Torsion of thin-walled open-section beams due to restrained warping displacements of cross-section is causing additional stresses, which make a significant contribution to the total stress. Due to plastic deformation there are certain reserves of bearing capacity, identification of which is of significant practical interest. The existing normative documents for the design of steel structures in Russia do not include design factor taking into account the development of plastic deformation during warping torsion. The analysis of thin-walled open-section members with plastic deformation will more accurately determine their load-bearing capacity and requires further research. Reserves of the beams bearing capacity due to the development of plastic deformations are revealed when beams are influenced by bending, as well as tension and compression. The existing methodology of determining these reserves and the plastic shape factor in bending was reviewed. This has allowed understanding how it was possible to solve this problem for warping torsion members and outline possible ways of theoretical studies of the bearing capacity in warping torsion. The authors used theoretical approach in determining this factor for the symmetric I-section beam under the action of bimoment and gave recommendations for the design of torsion members including improved value of plastic shape factor.

Sorting on STAR. [CDC computer algorithm timing comparison

Science.gov (United States)

Stone, H. S.

1978-01-01

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Gravitational quantum corrections in warped supersymmetric brane worlds

International Nuclear Information System (INIS)

Gregoire, T.; Rattazzi, R.; Scrucca, C.A.; Strumia, A.; Trincherini, E.

2005-01-01

We study gravitational quantum corrections in supersymmetric theories with warped extra dimensions. We develop for this a superfield formalism for linearized gauged supergravity. We show that the 1-loop effective Kahler potential is a simple functional of the KK spectrum in the presence of generic localized kinetic terms at the two branes. We also present a simple understanding of our results by showing that the leading matter effects are equivalent to suitable displacements of the branes. We then apply this general result to compute the gravity-mediated universal soft mass m 0 2 in models where the visible and the hidden sectors are sequestered at the two branes. We find that the contributions coming from radion mediation and brane-to-brane mediation are both negative in the minimal set-up, but the former can become positive if the gravitational kinetic term localized at the hidden brane has a sizable coefficient. We then compare the features of the two extreme cases of flat and very warped geometry, and give an outlook on the building of viable models

Micro-Doppler Signal Time-Frequency Algorithm Based on STFRFT

Directory of Open Access Journals (Sweden)

Cunsuo Pang

2016-09-01

Full Text Available This paper proposes a time-frequency algorithm based on short-time fractional order Fourier transformation (STFRFT for identification of a complicated movement targets. This algorithm, consisting of a STFRFT order-changing and quick selection method, is effective in reducing the computation load. A multi-order STFRFT time-frequency algorithm is also developed that makes use of the time-frequency feature of each micro-Doppler component signal. This algorithm improves the estimation accuracy of time-frequency curve fitting through multi-order matching. Finally, experiment data were used to demonstrate STFRFT’s performance in micro-Doppler time-frequency analysis. The results validated the higher estimate accuracy of the proposed algorithm. It may be applied to an LFM (Linear frequency modulated pulse radar, SAR (Synthetic aperture radar, or ISAR (Inverse synthetic aperture radar, for improving the probability of target recognition.

Micro-Doppler Signal Time-Frequency Algorithm Based on STFRFT.

Science.gov (United States)

Pang, Cunsuo; Han, Yan; Hou, Huiling; Liu, Shengheng; Zhang, Nan

2016-09-24

This paper proposes a time-frequency algorithm based on short-time fractional order Fourier transformation (STFRFT) for identification of a complicated movement targets. This algorithm, consisting of a STFRFT order-changing and quick selection method, is effective in reducing the computation load. A multi-order STFRFT time-frequency algorithm is also developed that makes use of the time-frequency feature of each micro-Doppler component signal. This algorithm improves the estimation accuracy of time-frequency curve fitting through multi-order matching. Finally, experiment data were used to demonstrate STFRFT's performance in micro-Doppler time-frequency analysis. The results validated the higher estimate accuracy of the proposed algorithm. It may be applied to an LFM (Linear frequency modulated) pulse radar, SAR (Synthetic aperture radar), or ISAR (Inverse synthetic aperture radar), for improving the probability of target recognition.

An Expectation Maximization Algorithm to Model Failure Times by Continuous-Time Markov Chains

Directory of Open Access Journals (Sweden)

Qihong Duan

2010-01-01

Full Text Available In many applications, the failure rate function may present a bathtub shape curve. In this paper, an expectation maximization algorithm is proposed to construct a suitable continuous-time Markov chain which models the failure time data by the first time reaching the absorbing state. Assume that a system is described by methods of supplementary variables, the device of stage, and so on. Given a data set, the maximum likelihood estimators of the initial distribution and the infinitesimal transition rates of the Markov chain can be obtained by our novel algorithm. Suppose that there are m transient states in the system and that there are n failure time data. The devised algorithm only needs to compute the exponential of m×m upper triangular matrices for O(nm2 times in each iteration. Finally, the algorithm is applied to two real data sets, which indicates the practicality and efficiency of our algorithm.

Surface charge conductivity of a topological insulator in a magnetic field: The effect of hexagonal warping

Science.gov (United States)

Akzyanov, R. S.; Rakhmanov, A. L.

2018-02-01

We investigate the influence of hexagonal warping on the transport properties of topological insulators. We study the charge conductivity within Kubo formalism in the first Born approximation using low-energy expansion of the Hamiltonian near the Dirac point. The effects of disorder, magnetic field, and chemical-potential value are analyzed in detail. We find that the presence of hexagonal warping significantly affects the conductivity of the topological insulator. In particular, it gives rise to the growth of the longitudinal conductivity with the increase of the disorder and anisotropic anomalous in-plane magnetoresistance. Hexagonal warping also affects the quantum anomalous Hall effect and anomalous out-of-plane magnetoresistance. The obtained results are consistent with the experimental data.

Guide for 3D WARP simulations of hollow electron beam lenses. Practical explanation on basis of Tevatron electron lens test stand

Energy Technology Data Exchange (ETDEWEB)

Moens, Vince [Ecole Polytechnique Federale de Lausanne (EPFL) (Switzerland)

2014-06-08

The purpose of this guide is to help successive students handle WARP. It outlines the installation of WARP on personal computers as well as super-computers and clusters. It furthermore teaches the reader how to handle the WARP environment and run basic scripts. Lastly it outlines how to execute the current Hollow Electron Beam Lens scripts.

Seesaw mechanism in warped geometry

International Nuclear Information System (INIS)

Huber, Stephan J.; Shafi, Qaisar

2004-01-01

We show how the seesaw mechanism for neutrino masses can be realized within a five-dimensional (5D) warped geometry framework. Intermediate scale standard model (SM) singlet neutrino masses, needed to explain the atmospheric and solar neutrino oscillations, are shown to be proportional to M Pl exp((2c-1)πkR), where c denotes the coefficient of the 5D Dirac mass term for the singlet neutrino which also has a Planck scale Majorana mass localized on the Planck-brane, and kR∼11 in order to resolve the gauge hierarchy problem. The case with a bulk 5D Majorana mass term for the singlet neutrino is briefly discussed

An explicit multi-time-stepping algorithm for aerodynamic flows

NARCIS (Netherlands)

Niemann-Tuitman, B.E.; Veldman, A.E.P.

1997-01-01

An explicit multi-time-stepping algorithm with applications to aerodynamic flows is presented. In the algorithm, in different parts of the computational domain different time steps are taken, and the flow is synchronized at the so-called synchronization levels. The algorithm is validated for

Efficient Constrained Local Model Fitting for Non-Rigid Face Alignment.

Science.gov (United States)

Lucey, Simon; Wang, Yang; Cox, Mark; Sridharan, Sridha; Cohn, Jeffery F

2009-11-01

Active appearance models (AAMs) have demonstrated great utility when being employed for non-rigid face alignment/tracking. The "simultaneous" algorithm for fitting an AAM achieves good non-rigid face registration performance, but has poor real time performance (2-3 fps). The "project-out" algorithm for fitting an AAM achieves faster than real time performance (> 200 fps) but suffers from poor generic alignment performance. In this paper we introduce an extension to a discriminative method for non-rigid face registration/tracking referred to as a constrained local model (CLM). Our proposed method is able to achieve superior performance to the "simultaneous" AAM algorithm along with real time fitting speeds (35 fps). We improve upon the canonical CLM formulation, to gain this performance, in a number of ways by employing: (i) linear SVMs as patch-experts, (ii) a simplified optimization criteria, and (iii) a composite rather than additive warp update step. Most notably, our simplified optimization criteria for fitting the CLM divides the problem of finding a single complex registration/warp displacement into that of finding N simple warp displacements. From these N simple warp displacements, a single complex warp displacement is estimated using a weighted least-squares constraint. Another major advantage of this simplified optimization lends from its ability to be parallelized, a step which we also theoretically explore in this paper. We refer to our approach for fitting the CLM as the "exhaustive local search" (ELS) algorithm. Experiments were conducted on the CMU Multi-PIE database.

WARP: a double phase argon programme for dark matter detection

International Nuclear Information System (INIS)

Ferrari, N

2006-01-01

WARP (Wimp ARgon Programme) is a double phase Argon detector for Dark Matter search under construction at Laboratori Nazionali del Gran Sasso. We present recent results obtained operating a prototype with a sensitive mass of 2.3 litres deep underground

Traces of warping subsided tectonic blocks on Miranda, Enceladus, Titan

Science.gov (United States)

Kochemasov, G.

2007-08-01

Icy satellites of the outer Solar system have very large range of sizes - from kilometers to thousands of kilometers. Bodies less than 400-500 km across have normally irregular shapes , often presenting simple Plato's polyhedrons woven by standing inertiagravity waves (see an accompanying abstract of Kochemasov). Larger bodies with enhanced gravity normally are rounded off and have globular shapes but far from ideal spheres. This is due to warping action of inertia-gravity waves of various wavelengths origin of which is related to body movements in elliptical keplerian orbits with periodically changing accelerations (alternating accelerations cause periodically changing forces acting upon a body what means oscillations of its spheres in form of standing warping waves). The fundamental wave 1 and its first overtone wave 2 produce ubiquitous tectonic dichotomy - two segmental structure and tectonic sectoring superimposed on this dichotomy. Two kinds of tectonic blocks (segments and sectors) are formed: uplifted (+) and subsided (-). Uplifting means increasing planetary radius of blocks, subsiding - decreasing radius (as a sequence subsiding blocks diminishing their surfaces must be warped, folded, wrinkled; uplifting blocks increasing their surfaces tend to be deeply cracked, fallen apart). To level changing angular momenta of blocks subsided areas are filled with denser material than uplifted ones (one of the best examples is Earth with its oceanic basins filled with dense basalts and uplifted continents built of less dense on average andesitic material). Icy satellites follow the same rule. Their warped surfaces show differing chemistries or structures of constructive materials. Uplifted blocks are normally built with light (by color and density) water ice. Subsided blocks - depressions, "seas', "lakes", coronas - by somewhat denser material differing in color from water ice (very sharply - Iapetus, moderately - Europa, slightly - many saturnian satellites). A very

An explicit multi-time-stepping algorithm for aerodynamic flows

OpenAIRE

Niemann-Tuitman, B.E.; Veldman, A.E.P.

1997-01-01

An explicit multi-time-stepping algorithm with applications to aerodynamic flows is presented. In the algorithm, in different parts of the computational domain different time steps are taken, and the flow is synchronized at the so-called synchronization levels. The algorithm is validated for aerodynamic turbulent flows. For two-dimensional flows speedups in the order of five with respect to single time stepping are obtained.

Saving time in a space-efficient simulation algorithm

NARCIS (Netherlands)

Markovski, J.

2011-01-01

We present an efficient algorithm for computing the simulation preorder and equivalence for labeled transition systems. The algorithm improves an existing space-efficient algorithm and improves its time complexity by employing a variant of the stability condition and exploiting properties of the

Particle collisions near a three-dimensional warped AdS black hole

Science.gov (United States)

Bécar, Ramón; González, P. A.; Vásquez, Yerko

2018-04-01

In this paper we consider the warped AdS3 black hole solution of topologically massive gravity with a negative cosmological constant, and we study the possibility that it acts as a particle accelerator by analyzing the energy in the center of mass (CM) frame of two colliding particles in the vicinity of its horizon, which is known as the Bañnados, Silk and West (BSW) process. Mainly, we show that the critical angular momentum (L_c) of the particle decreases when the warping parameter(ν ) increases. Also, we show that despite the particle with L_c being able to exist for certain values of the conserved energy outside the horizon, it will never reach the event horizon; therefore, the black hole cannot act as a particle accelerator with arbitrarily high CM energy on the event horizon. However, such a particle could also exist inside the outer horizon, with the BSW process being possible on the inner horizon. On the other hand, for the extremal warped AdS3 black hole, the particle with L_c and energy E could exist outside the event horizon and, the CM energy blows up on the event horizon if its conserved energy fulfills the condition E2>(ν 2+3)l2/3(ν ^{2-1)}, with the BSW process being possible.

Modifications to holographic entanglement entropy in warped CFT

Energy Technology Data Exchange (ETDEWEB)

Song, Wei; Wen, Qiang; Xu, Jianfei [Yau Mathematical Sciences Center, Tsinghua University,Beijing 100084 (China)

2017-02-13

In https://www.doi.org/10.1103/PhysRevLett.117.011602 it was observed that asymptotic boundary conditions play an important role in the study of holographic entanglement beyond AdS/CFT. In particular, the Ryu-Takayanagi proposal must be modified for warped AdS{sub 3} (WAdS{sub 3}) with Dirichlet boundary conditions. In this paper, we consider AdS{sub 3} and WAdS{sub 3} with Dirichlet-Neumann boundary conditions. The conjectured holographic duals are warped conformal field theories (WCFTs), featuring a Virasoro-Kac-Moody algebra. We provide a holographic calculation of the entanglement entropy and Rényi entropy using AdS{sub 3}/WCFT and WAdS{sub 3}/WCFT dualities. Our bulk results are consistent with the WCFT results derived by Castro-Hofman-Iqbal using the Rindler method. Comparing with https://www.doi.org/10.1103/PhysRevLett.117.011602, we explicitly show that the holographic entanglement entropy is indeed affected by boundary conditions. Both results differ from the Ryu-Takayanagi proposal, indicating new relations between spacetime geometry and quantum entanglement for holographic dualities beyond AdS/CFT.

Properties on the edge: graphene edge energies, edge stresses, edge warping, and the Wulff shape of graphene flakes

International Nuclear Information System (INIS)

Branicio, Paulo S; Jhon, Mark H; Gan, Chee Kwan; Srolovitz, David J

2011-01-01

It has been shown that the broken bonds of an unreconstructed graphene edge generate compressive edge stresses leading to edge warping. Here, we investigate edge energies and edge stresses of graphene nanoribbons with arbitrary orientations from armchair to zigzag, considering both flat and warped edge shapes in the presence and absence of hydrogen. We use the second generation reactive empirical bond order potential to calculate the edge energies and stresses for clean and hydrogenated edges. Using these energies, we perform a Wulff construction to determine the equilibrium shapes of flat graphene flakes as a function of hydrogen chemical potential. While edge stresses for clean, flat edges are compressive, they become tensile if allowed to warp. Conversely, we find that edge energies change little (∼1%) with edge warping. Hydrogenation of the edges virtually eliminates both the edge energy and edge stresses. For warped edges an approximately linear relationship is found between amplitudes and wavelengths. The equilibrium shape of a graphene flake is determined by the value of the hydrogen chemical potential. For very small (and large) values of it the flakes have a nearly hexagonal (dodecagon) shape with zigzag oriented edges, while for intermediate values graphene flakes are found with complex shapes

Time tunnels meet warped passages

CERN Multimedia

Kushner, David

2006-01-01

"Just in time for its 40th anniversary, the classic sci-fi television show "The time tunnel" is out on DVD. The conceit is something every engineer can relate to: a pulled plug. Scientists in an underground lab are working on a secret government experiment in time travel. (1 page)

Moisture Comfort and Antibacterial Properties of Elastic Warp-Knitted Fabrics

Directory of Open Access Journals (Sweden)

Yu Zhi-Cai

2015-03-01

Full Text Available Multifunction elastic warp-knitted fabrics were fabricated on a crochet machine with the use of metal composite yarns/viscose yarn and bamboo polyester/ crisscross-section polyester hybrid yarns as the front face and back face of the knitted fabric structure, respectively. We investigated the effect of the blend ratio of bamboo charcoal/ crisscross-section polyester multiply yarns on the fabric's moisture comfort properties, such as water vapour transmission (WVT, water evaporation rate (WER, and water absorbency. The results showed that blending ratio significantly influenced WVT and WER. Moreover, antibacterial activity of the elastic warp- knitted fabric was tested against Staphylococcus aureus and Escherichia coli in accordance with AATCC 90-2011. Finally, the extension- stress value curves were used to analyse the elastic stretching property, and the fabric exhibited greater breaking elongation and lower stress value in the walewise than in the weft direction.

Recycling of warp size materials and comparison of yarn mechanical properties sized with recycled materials and virgin materials

NARCIS (Netherlands)

Maqsood, Muhammad

2017-01-01

Warp sizing is an established method for improving the weaveability of textile yarns by coating or impregnating warp yarns with a polymer that improves the efficiency of the weaving operation. Despite its high cost, polyvinyl alcohol (PVA) normally shows better adhesion to fibers than other sizing

Seesaw mechanism in warped geometry

International Nuclear Information System (INIS)

Huber, S.J.; Shafi, Q.

2003-09-01

We show how the seesaw mechanism for neutrino masses can be realized within a five dimensional (5D) warped geometry framework. Intermediate scale standard model (SM) singlet neutrino masses, needed to explain the atmospheric and solar neutrino oscillations, are shown to be proportional to M P1 .exp((2c-1)πkR), where c denotes the coefficient of the 5D Dirac mass term for the singlet neutrino which also has a Planck scale Majorana mass localized on the Planck-brane, and kR∼11 in order to resolve the gauge hierarchy problem. The case with a bulk 5D Majorana mass term for the singlet neutrino is briefly discussed. (orig.)

Efficient On-the-fly Algorithms for the Analysis of Timed Games

DEFF Research Database (Denmark)

Cassez, Franck; David, Alexandre; Fleury, Emmanuel

2005-01-01

In this paper, we propose the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka [15] for linear-time model-ch...... symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.......In this paper, we propose the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka [15] for linear-time model...

Yet one more dwell time algorithm

Science.gov (United States)

Haberl, Alexander; Rascher, Rolf

2017-06-01

The current demand of even more powerful and efficient microprocessors, for e.g. deep learning, has led to an ongoing trend of reducing the feature size of the integrated circuits. These processors are patterned with EUV-lithography which enables 7 nm chips [1]. To produce mirrors which satisfy the needed requirements is a challenging task. Not only increasing requirements on the imaging properties, but also new lens shapes, such as aspheres or lenses with free-form surfaces, require innovative production processes. However, these lenses need new deterministic sub-aperture polishing methods that have been established in the past few years. These polishing methods are characterized, by an empirically determined TIF and local stock removal. Such a deterministic polishing method is ion-beam-figuring (IBF). The beam profile of an ion beam is adjusted to a nearly ideal Gaussian shape by various parameters. With the known removal function, a dwell time profile can be generated for each measured error profile. Such a profile is always generated pixel-accurately to the predetermined error profile, with the aim always of minimizing the existing surface structures up to the cut-off frequency of the tool used [2]. The processing success of a correction-polishing run depends decisively on the accuracy of the previously computed dwell-time profile. So the used algorithm to calculate the dwell time has to accurately reflect the reality. But furthermore the machine operator should have no influence on the dwell-time calculation. Conclusively there mustn't be any parameters which have an influence on the calculation result. And lastly it should take a minimum of machining time to get a minimum of remaining error structures. Unfortunately current dwell time algorithm calculations are divergent, user-dependent, tending to create high processing times and need several parameters to bet set. This paper describes an, realistic, convergent and user independent dwell time algorithm. The

Self-accelerated brane Universe with warped extra dimension

CERN Document Server

Gorbunov, D S

2008-01-01

We propose a cosmological model which exhibits the phenomenon of self-acceleration: the Universe is attracted to the phase of accelerated expansion at late times even in the absence of the cosmological constant. The self-acceleration is inevitable in the sense that it cannot be neutralized by any negative explicit cosmological constant. The model is formulated in the framework of brane-world theories with a warped extra dimension. The key ingredient of the model is the brane-bulk energy transfer which is carried by bulk vector fields with a sigma-model-like boundary condition on the brane. We explicitly find the 5-dimensional metric corresponding to the late-time de Sitter expansion on the brane; this metric describes an AdS_5 black hole with growing mass. The present value of the Hubble parameter implies the scale of new physics of order 1 TeV, where the proposed model has to be replaced by putative UV-completion. The mechanism leading to the self-acceleration has AdS/CFT interpretation as occurring due to s...

Warped Dipole Completed, with a Tower of Higgs Bosons

CERN Document Server

Agashe, Kaustubh; Cui, Yanou; Randall, Lisa; Son, Minho

2015-01-01

In the context of warped extra-dimensional models which address both the Planck-weak- and flavor-hierarchies of the Standard Model (SM), it has been argued that certain observables can be calculated within the 5D effective field theory only with the Higgs field propagating in the bulk of the extra dimension, just like other SM fields. The related studies also suggested an interesting form of decoupling of the heavy Kaluza-Klein (KK) fermion states in the warped 5D SM in the limit where the profile of the SM Higgs approaches the IR brane. We demonstrate that a similar phenomenon occurs when we include the mandatory KK excitations of the SM Higgs in loop diagrams giving dipole operators for SM fermions, where the earlier work only considered the SM Higgs (zero mode). In particular, in the limit of a quasi IR-localized SM Higgs, the effect from summing over KK Higgs modes is unsuppressed (yet finite), in contrast to the naive expectation that KK Higgs modes decouple as their masses become large. In this case, a ...

Similarity measure and topology evolution of foreign exchange markets using dynamic time warping method: Evidence from minimal spanning tree

Science.gov (United States)

Wang, Gang-Jin; Xie, Chi; Han, Feng; Sun, Bo

2012-08-01

In this study, we employ a dynamic time warping method to study the topology of similarity networks among 35 major currencies in international foreign exchange (FX) markets, measured by the minimal spanning tree (MST) approach, which is expected to overcome the synchronous restriction of the Pearson correlation coefficient. In the empirical process, firstly, we subdivide the analysis period from June 2005 to May 2011 into three sub-periods: before, during, and after the US sub-prime crisis. Secondly, we choose NZD (New Zealand dollar) as the numeraire and then, analyze the topology evolution of FX markets in terms of the structure changes of MSTs during the above periods. We also present the hierarchical tree associated with the MST to study the currency clusters in each sub-period. Our results confirm that USD and EUR are the predominant world currencies. But USD gradually loses the most central position while EUR acts as a stable center in the MST passing through the crisis. Furthermore, an interesting finding is that, after the crisis, SGD (Singapore dollar) becomes a new center currency for the network.

Time-advance algorithms based on Hamilton's principle

International Nuclear Information System (INIS)

Lewis, H.R.; Kostelec, P.J.

1993-01-01

Time-advance algorithms based on Hamilton's variational principle are being developed for application to problems in plasma physics and other areas. Hamilton's principle was applied previously to derive a system of ordinary differential equations in time whose solution provides an approximation to the evolution of a plasma described by the Vlasov-Maxwell equations. However, the variational principle was not used to obtain an algorithm for solving the ordinary differential equations numerically. The present research addresses the numerical solution of systems of ordinary differential equations via Hamilton's principle. The basic idea is first to choose a class of functions for approximating the solution of the ordinary differential equations over a specific time interval. Then the parameters in the approximating function are determined by applying Hamilton's principle exactly within the class of approximating functions. For example, if an approximate solution is desired between time t and time t + Δ t, the class of approximating functions could be polynomials in time up to some degree. The issue of how to choose time-advance algorithms is very important for achieving efficient, physically meaningful computer simulations. The objective is to reliably simulate those characteristics of an evolving system that are scientifically most relevant. Preliminary numerical results are presented, including comparisons with other computational methods

Object-based warping: an illusory distortion of space within objects.

Science.gov (United States)

Vickery, Timothy J; Chun, Marvin M

2010-12-01

Visual objects are high-level primitives that are fundamental to numerous perceptual functions, such as guidance of attention. We report that objects warp visual perception of space in such a way that spatial distances within objects appear to be larger than spatial distances in ground regions. When two dots were placed inside a rectangular object, they appeared farther apart from one another than two dots with identical spacing outside of the object. To investigate whether this effect was object based, we measured the distortion while manipulating the structure surrounding the dots. Object displays were constructed with a single object, multiple objects, a partially occluded object, and an illusory object. Nonobject displays were constructed to be comparable to object displays in low-level visual attributes. In all cases, the object displays resulted in a more powerful distortion of spatial perception than comparable non-object-based displays. These results suggest that perception of space within objects is warped.

Status report on the 'Merging' of the Electron-Cloud Code POSINST with the 3-D Accelerator PIC CODE WARP

International Nuclear Information System (INIS)

Vay, J.-L.; Furman, M.A.; Azevedo, A.W.; Cohen, R.H.; Friedman, A.; Grote, D.P.; Stoltz, P.H.

2004-01-01

We have integrated the electron-cloud code POSINST [1] with WARP [2]--a 3-D parallel Particle-In-Cell accelerator code developed for Heavy Ion Inertial Fusion--so that the two can interoperate. Both codes are run in the same process, communicate through a Python interpreter (already used in WARP), and share certain key arrays (so far, particle positions and velocities). Currently, POSINST provides primary and secondary sources of electrons, beam bunch kicks, a particle mover, and diagnostics. WARP provides the field solvers and diagnostics. Secondary emission routines are provided by the Tech-X package CMEE

Warped frequency transform analysis of ultrasonic guided waves in long bones

Science.gov (United States)

De Marchi, L.; Baravelli, E.; Xu, K.; Ta, D.; Speciale, N.; Marzani, A.; Viola, E.

2010-03-01

Long bones can be seen as irregular hollow tubes, in which, for a given excitation frequency, many ultrasonic Guided Waves (GWs) can propagate. The analysis of GWs is potential to reflect more information on both geometry and material properties of the bone than any other method (such as dual-energy X-ray absorptiometry, or quantitative computed tomography), and can be used in the assessment of osteoporosis and in the evaluation of fracture healing. In this study, time frequency representations (TFRs) were used to gain insights into the expected behavior of GWs in bones. To this aim, we implemented a dedicated Warped Frequency Transform (WFT) which decomposes the spectrotemporal components of the different propagating modes by selecting an appropriate warping map to reshape the frequency axis. The map can be designed once the GWs group velocity dispersion curves can be predicted. To this purpose, the bone is considered as a hollow cylinder with inner and outer diameter of 16.6 and 24.7 mm, respectively, and linear poroelastic material properties in agreement with the low level of stresses induced by the waves. Timetransient events obtained experimentally, via a piezoelectric ultrasonic set-up applied to bovine tibiae, are analyzed. The results show that WFT limits interference patterns which appear with others TFRs (such as scalograms or warpograms) and produces a sparse representation suitable for characterization purposes. In particular, the mode-frequency combinations propagating with minimal losses are identified.

Evaluation of short-term physical weathering of a heavy fuel oil by use of time warping and PCA

Energy Technology Data Exchange (ETDEWEB)

Malmquist, L.M.V.; Olsen, R.R. [Roskilde Univ., Roskilde (Denmark). Dept. of Life Sciences and Chemistry]|[National Environmental Research Inst., Roskilde (Denmark). Dept. of Environmental Chemistry and Microbiology; Christensen, J.H. [Royal Veterinary and Agricultural Univ., Thorvaldsensvej (Denmark). Dept. of Natural Sciences; Andersen, O. [Roskilde Univ., Roskilde (Denmark). Dept. of Life Sciences and Chemistry

2005-07-01

An estimated 1,140 billion tons of oil was accidentally spilled to the environment during the 1990s. These spills present an ecotoxicologic risk due to the presence of toxic and mutagenic compounds in the oil. Oil is affected by short term and long term weathering processes such as evaporation, dissolution, dispersion, emulsification, photodegradation and biodegradation. Physical weathering processes change the composition of the oil but they do not alter the oil components. Gas chromatography and mass spectrometry can characterize the compositional changes resulting from evaporation. However, the process depends on subjective analysis because it is based on manual interpretation of results and visual inspection. This paper presents a rapid and objective method to compare oil sample compositions. The method is based on automated data preprocessing involving baseline removal, alignment of chromatograms using correlation optimized warping (COW) and normalization. Preprocessed data is analyzed by principal component analysis (PCA) based on the total chromatograms. The method has successfully resolved the effects of evaporation and dissolution processes and showed clear dependence of time, but it did not completely resolve the effect of weathering from the analytical variability because better quality data is required. 21 refs., 3 figs.

Evaluation of short-term physical weathering of a heavy fuel oil by use of time warping and PCA

International Nuclear Information System (INIS)

Malmquist, L.M.V.; Olsen, R.R.; Christensen, J.H.; Andersen, O.

2005-01-01

An estimated 1,140 billion tons of oil was accidentally spilled to the environment during the 1990s. These spills present an ecotoxicologic risk due to the presence of toxic and mutagenic compounds in the oil. Oil is affected by short term and long term weathering processes such as evaporation, dissolution, dispersion, emulsification, photodegradation and biodegradation. Physical weathering processes change the composition of the oil but they do not alter the oil components. Gas chromatography and mass spectrometry can characterize the compositional changes resulting from evaporation. However, the process depends on subjective analysis because it is based on manual interpretation of results and visual inspection. This paper presents a rapid and objective method to compare oil sample compositions. The method is based on automated data preprocessing involving baseline removal, alignment of chromatograms using correlation optimized warping (COW) and normalization. Preprocessed data is analyzed by principal component analysis (PCA) based on the total chromatograms. The method has successfully resolved the effects of evaporation and dissolution processes and showed clear dependence of time, but it did not completely resolve the effect of weathering from the analytical variability because better quality data is required. 21 refs., 3 figs

Pattern Discovery in Time-Ordered Data; TOPICAL

International Nuclear Information System (INIS)

CONRAD, GREGORY N.; BRITANIK, JOHN M.; DELAND, SHARON M.; JENKIN, CHRISTINA L.

2002-01-01

This report describes the results of a Laboratory-Directed Research and Development project on techniques for pattern discovery in discrete event time series data. In this project, we explored two different aspects of the pattern matching/discovery problem. The first aspect studied was the use of Dynamic Time Warping for pattern matching in continuous data. In essence, DTW is a technique for aligning time series along the time axis to optimize the similarity measure. The second aspect studied was techniques for discovering patterns in discrete event data. We developed a pattern discovery tool based on adaptations of the A-priori and GSP (Generalized Sequential Pattern mining) algorithms. We then used the tool on three different application areas-unattended monitoring system data from a storage magazine, computer network intrusion detection, and analysis of robot training data

Low-scale gravity mediation in warped extra dimension and collider ...

Indian Academy of Sciences (India)

We propose a new scenario of gravity-mediated supersymmetry breaking (gravity mediation) in a supersymmetric Randall-Sundrum model, where the gravity mediation takes place at a low scale due to the warped metric. We investigate collider phenomenology involving the hidden sector field, and find a possibility that the ...

A real time sorting algorithm to time sort any deterministic time disordered data stream

Science.gov (United States)

Saini, J.; Mandal, S.; Chakrabarti, A.; Chattopadhyay, S.

2017-12-01

In new generation high intensity high energy physics experiments, millions of free streaming high rate data sources are to be readout. Free streaming data with associated time-stamp can only be controlled by thresholds as there is no trigger information available for the readout. Therefore, these readouts are prone to collect large amount of noise and unwanted data. For this reason, these experiments can have output data rate of several orders of magnitude higher than the useful signal data rate. It is therefore necessary to perform online processing of the data to extract useful information from the full data set. Without trigger information, pre-processing on the free streaming data can only be done with time based correlation among the data set. Multiple data sources have different path delays and bandwidth utilizations and therefore the unsorted merged data requires significant computational efforts for real time manifestation of sorting before analysis. Present work reports a new high speed scalable data stream sorting algorithm with its architectural design, verified through Field programmable Gate Array (FPGA) based hardware simulation. Realistic time based simulated data likely to be collected in an high energy physics experiment have been used to study the performance of the algorithm. The proposed algorithm uses parallel read-write blocks with added memory management and zero suppression features to make it efficient for high rate data-streams. This algorithm is best suited for online data streams with deterministic time disorder/unsorting on FPGA like hardware.

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

Science.gov (United States)

Koppenhoefer, Kyle C.; Gullerud, Arne S.; Ruggieri, Claudio; Dodds, Robert H., Jr.; Healy, Brian E.

1998-01-01

This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves

Technical guidance for the development of a solid state image sensor for human low vision image warping

Science.gov (United States)

Vanderspiegel, Jan

1994-01-01

This report surveys different technologies and approaches to realize sensors for image warping. The goal is to study the feasibility, technical aspects, and limitations of making an electronic camera with special geometries which implements certain transformations for image warping. This work was inspired by the research done by Dr. Juday at NASA Johnson Space Center on image warping. The study has looked into different solid-state technologies to fabricate image sensors. It is found that among the available technologies, CMOS is preferred over CCD technology. CMOS provides more flexibility to design different functions into the sensor, is more widely available, and is a lower cost solution. By using an architecture with row and column decoders one has the added flexibility of addressing the pixels at random, or read out only part of the image.

The effect of tooling design parameters on web-warping in the flexible roll forming of UHSS

International Nuclear Information System (INIS)

Jiao, Jingsi; Weiss, Matthias; Rolfe, Bernard; Mendiguren, Joseba; Galdos, Lander

2013-01-01

To reduce weight and improve passenger safety there is an increased need in the automotive industry to use Ultra High Strength Steels (UHSS) for structural and crash components. However, the application of UHSS is restricted by their limited formability and the difficulty of forming them in conventional processes. An alternative method of manufacturing structural auto body parts from UHSS is the flexible roll forming process which can accommodate materials with high strength and limited ductility in the production of complex and weight-optimised components. However, one major concern in the flexible roll forming is web-warping, which is the height deviation of the profile web area. This paper investigates, using a numerical model, the effect on web-warping with respect to various forming methods. The results demonstrate that different forming methods lead to different amount of web-warping in terms of forming the product with identical geometry

The effect of tooling design parameters on web-warping in the flexible roll forming of UHSS

Science.gov (United States)

Jiao, Jingsi; Rolfe, Bernard; Mendiguren, Joseba; Galdos, Lander; Weiss, Matthias

2013-12-01

To reduce weight and improve passenger safety there is an increased need in the automotive industry to use Ultra High Strength Steels (UHSS) for structural and crash components. However, the application of UHSS is restricted by their limited formability and the difficulty of forming them in conventional processes. An alternative method of manufacturing structural auto body parts from UHSS is the flexible roll forming process which can accommodate materials with high strength and limited ductility in the production of complex and weight-optimised components. However, one major concern in the flexible roll forming is web-warping, which is the height deviation of the profile web area. This paper investigates, using a numerical model, the effect on web-warping with respect to various forming methods. The results demonstrate that different forming methods lead to different amount of web-warping in terms of forming the product with identical geometry.

Inflationary scenario from higher curvature warped spacetime

International Nuclear Information System (INIS)

Banerjee, Narayan; Paul, Tanmoy

2017-01-01

We consider a five dimensional warped spacetime, in presence of the higher curvature term like F(R) = R + αR 2 in the bulk, in the context of the two-brane model. Our universe is identified with the TeV scale brane and emerges as a four dimensional effective theory. From the perspective of this effective theory, we examine the possibility of ''inflationary scenario'' by considering the on-brane metric ansatz as an FRW one. Our results reveal that the higher curvature term in the five dimensional bulk spacetime generates a potential term for the radion field. Due to the presence of radion potential, the very early universe undergoes a stage of accelerated expansion and, moreover, the accelerating period of the universe terminates in a finite time. We also find the spectral index of curvature perturbation (n s ) and the tensor to scalar ratio (r) in the present context, which match with the observational results based on the observations of Planck (Astron. Astrophys. 594, A20, 2016). (orig.)

Inflationary scenario from higher curvature warped spacetime

Energy Technology Data Exchange (ETDEWEB)

Banerjee, Narayan [Indian Institute of Science Education and Research Kolkata, Department of Physical Sciences, Nadia, West Bengal (India); Paul, Tanmoy [Indian Association for the Cultivation of Science, Department of Theoretical Physics, Kolkata (India)

2017-10-15

We consider a five dimensional warped spacetime, in presence of the higher curvature term like F(R) = R + αR{sup 2} in the bulk, in the context of the two-brane model. Our universe is identified with the TeV scale brane and emerges as a four dimensional effective theory. From the perspective of this effective theory, we examine the possibility of ''inflationary scenario'' by considering the on-brane metric ansatz as an FRW one. Our results reveal that the higher curvature term in the five dimensional bulk spacetime generates a potential term for the radion field. Due to the presence of radion potential, the very early universe undergoes a stage of accelerated expansion and, moreover, the accelerating period of the universe terminates in a finite time. We also find the spectral index of curvature perturbation (n{sub s}) and the tensor to scalar ratio (r) in the present context, which match with the observational results based on the observations of Planck (Astron. Astrophys. 594, A20, 2016). (orig.)

Similarities and Differences Between Warped Linear Prediction and Laguerre Linear Prediction

NARCIS (Netherlands)

Brinker, Albertus C. den; Krishnamoorthi, Harish; Verbitskiy, Evgeny A.

2011-01-01

Linear prediction has been successfully applied in many speech and audio processing systems. This paper presents the similarities and differences between two classes of linear prediction schemes, namely, Warped Linear Prediction (WLP) and Laguerre Linear Prediction (LLP). It is shown that both

Energy conservation in Newmark based time integration algorithms

DEFF Research Database (Denmark)

Krenk, Steen

2006-01-01

Energy balance equations are established for the Newmark time integration algorithm, and for the derived algorithms with algorithmic damping introduced via averaging, the so-called a-methods. The energy balance equations form a sequence applicable to: Newmark integration of the undamped equations...... of motion, an extended form including structural damping, and finally the generalized form including structural as well as algorithmic damping. In all three cases the expression for energy, appearing in the balance equation, is the mechanical energy plus some additional terms generated by the discretization...

Scales and hierarchies in warped compactifications and brane worlds

International Nuclear Information System (INIS)

DeWolfe, Oliver; Giddings, Steven B.

2003-01-01

Warped compactifications with branes provide a new approach to the hierarchy problem and generate a diversity of four-dimensional thresholds. We investigate the relationships between these scales, which fall into two classes. Geometrical scales, such as thresholds for Kaluza-Klein, excited string, and black hole production, are generically determined solely by the spacetime geometry. Dynamical scales, notably the scale of supersymmetry breaking and moduli masses, depend on other details of the model. We illustrate these relationships in a class of solutions of type IIB string theory with imaginary self-dual fluxes. After identifying the geometrical scales and the resulting hierarchy, we determine the gravitino and moduli masses through explicit dimensional reduction, and estimate their value to be near the four-dimensional Planck scale. In the process we obtain expressions for the superpotential and Kaehler potential, including the effects of warping. We identify matter living on certain branes to be effectively sequestered from the supersymmetry breaking fluxes: specifically, such 'visible sector' fields receive no tree-level masses from the supersymmetry breaking. However, loop corrections are expected to generate masses, at the phenomenologically viable TeV scale

Cotton/polyester and cotton/nylon warp knitted terry cloth: Why ...

African Journals Online (AJOL)

Administrator

1994:68) and has the added advantage of enhanced durability because of the synthetic component that can be incorporated into the structure (Kadolph &. Langford, 2002:41). In practice, the ground yarns of warp knitted terry cloth fabrics often differ in composi- tion to the yarns of the pile (Miller, 1992:109, Wooten,. 1979).

False-nearest-neighbors algorithm and noise-corrupted time series

International Nuclear Information System (INIS)

Rhodes, C.; Morari, M.

1997-01-01

The false-nearest-neighbors (FNN) algorithm was originally developed to determine the embedding dimension for autonomous time series. For noise-free computer-generated time series, the algorithm does a good job in predicting the embedding dimension. However, the problem of predicting the embedding dimension when the time-series data are corrupted by noise was not fully examined in the original studies of the FNN algorithm. Here it is shown that with large data sets, even small amounts of noise can lead to incorrect prediction of the embedding dimension. Surprisingly, as the length of the time series analyzed by FNN grows larger, the cause of incorrect prediction becomes more pronounced. An analysis of the effect of noise on the FNN algorithm and a solution for dealing with the effects of noise are given here. Some results on the theoretically correct choice of the FNN threshold are also presented. copyright 1997 The American Physical Society

PRESEE: an MDL/MML algorithm to time-series stream segmenting.

Science.gov (United States)

Xu, Kaikuo; Jiang, Yexi; Tang, Mingjie; Yuan, Changan; Tang, Changjie

2013-01-01

Time-series stream is one of the most common data types in data mining field. It is prevalent in fields such as stock market, ecology, and medical care. Segmentation is a key step to accelerate the processing speed of time-series stream mining. Previous algorithms for segmenting mainly focused on the issue of ameliorating precision instead of paying much attention to the efficiency. Moreover, the performance of these algorithms depends heavily on parameters, which are hard for the users to set. In this paper, we propose PRESEE (parameter-free, real-time, and scalable time-series stream segmenting algorithm), which greatly improves the efficiency of time-series stream segmenting. PRESEE is based on both MDL (minimum description length) and MML (minimum message length) methods, which could segment the data automatically. To evaluate the performance of PRESEE, we conduct several experiments on time-series streams of different types and compare it with the state-of-art algorithm. The empirical results show that PRESEE is very efficient for real-time stream datasets by improving segmenting speed nearly ten times. The novelty of this algorithm is further demonstrated by the application of PRESEE in segmenting real-time stream datasets from ChinaFLUX sensor networks data stream.

Parareal algorithms with local time-integrators for time fractional differential equations

Science.gov (United States)

Wu, Shu-Lin; Zhou, Tao

2018-04-01

It is challenge work to design parareal algorithms for time-fractional differential equations due to the historical effect of the fractional operator. A direct extension of the classical parareal method to such equations will lead to unbalance computational time in each process. In this work, we present an efficient parareal iteration scheme to overcome this issue, by adopting two recently developed local time-integrators for time fractional operators. In both approaches, one introduces auxiliary variables to localized the fractional operator. To this end, we propose a new strategy to perform the coarse grid correction so that the auxiliary variables and the solution variable are corrected separately in a mixed pattern. It is shown that the proposed parareal algorithm admits robust rate of convergence. Numerical examples are presented to support our conclusions.

A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems

Directory of Open Access Journals (Sweden)

White Michael S

2003-01-01

Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.

Effectiveness of firefly algorithm based neural network in time series ...

African Journals Online (AJOL)

Effectiveness of firefly algorithm based neural network in time series forecasting. ... In the experiments, three well known time series were used to evaluate the performance. Results obtained were compared with ... Keywords: Time series, Artificial Neural Network, Firefly Algorithm, Particle Swarm Optimization, Overfitting ...

Real-time algorithm for acoustic imaging with a microphone array.

Science.gov (United States)

Huang, Xun

2009-05-01

Acoustic phased array has become an important testing tool in aeroacoustic research, where the conventional beamforming algorithm has been adopted as a classical processing technique. The computation however has to be performed off-line due to the expensive cost. An innovative algorithm with real-time capability is proposed in this work. The algorithm is similar to a classical observer in the time domain while extended for the array processing to the frequency domain. The observer-based algorithm is beneficial mainly for its capability of operating over sampling blocks recursively. The expensive experimental time can therefore be reduced extensively since any defect in a testing can be corrected instantaneously.

An image-warping architecture for VR : low latency versus image quality

NARCIS (Netherlands)

Smit, F.A.; Liere, van R.; Beck, S.; Fröhlich, B.; Steed, A.; Reiners, D.; Lindeman, R.W.

2009-01-01

Designing low end-to-end latency system architectures for virtual reality is still an open and challenging problem. We describe the design, implementation and evaluation of a client-server depth-image warping architecture that updates and displays the scene graph at the refresh rate of the display.

TaDb: A time-aware diffusion-based recommender algorithm

Science.gov (United States)

Li, Wen-Jun; Xu, Yuan-Yuan; Dong, Qiang; Zhou, Jun-Lin; Fu, Yan

2015-02-01

Traditional recommender algorithms usually employ the early and recent records indiscriminately, which overlooks the change of user interests over time. In this paper, we show that the interests of a user remain stable in a short-term interval and drift during a long-term period. Based on this observation, we propose a time-aware diffusion-based (TaDb) recommender algorithm, which assigns different temporal weights to the leading links existing before the target user's collection and the following links appearing after that in the diffusion process. Experiments on four real datasets, Netflix, MovieLens, FriendFeed and Delicious show that TaDb algorithm significantly improves the prediction accuracy compared with the algorithms not considering temporal effects.

Soft hairy warped black hole entropy

Science.gov (United States)

Grumiller, Daniel; Hacker, Philip; Merbis, Wout

2018-02-01

We reconsider warped black hole solutions in topologically massive gravity and find novel boundary conditions that allow for soft hairy excitations on the horizon. To compute the associated symmetry algebra we develop a general framework to compute asymptotic symmetries in any Chern-Simons-like theory of gravity. We use this to show that the near horizon symmetry algebra consists of two u (1) current algebras and recover the surprisingly simple entropy formula S = 2 π( J 0 + + J 0 - ), where J 0 ± are zero mode charges of the current algebras. This provides the first example of a locally non-maximally symmetric configuration exhibiting this entropy law and thus non-trivial evidence for its universality.

Vehicle routing problem with time windows using natural inspired algorithms

Science.gov (United States)

Pratiwi, A. B.; Pratama, A.; Sa’diyah, I.; Suprajitno, H.

2018-03-01

Process of distribution of goods needs a strategy to make the total cost spent for operational activities minimized. But there are several constrains have to be satisfied which are the capacity of the vehicles and the service time of the customers. This Vehicle Routing Problem with Time Windows (VRPTW) gives complex constrains problem. This paper proposes natural inspired algorithms for dealing with constrains of VRPTW which involves Bat Algorithm and Cat Swarm Optimization. Bat Algorithm is being hybrid with Simulated Annealing, the worst solution of Bat Algorithm is replaced by the solution from Simulated Annealing. Algorithm which is based on behavior of cats, Cat Swarm Optimization, is improved using Crow Search Algorithm to make simplier and faster convergence. From the computational result, these algorithms give good performances in finding the minimized total distance. Higher number of population causes better computational performance. The improved Cat Swarm Optimization with Crow Search gives better performance than the hybridization of Bat Algorithm and Simulated Annealing in dealing with big data.

Time synchronization algorithm of distributed system based on server time-revise and workstation self-adjust

International Nuclear Information System (INIS)

Zhou Shumin; Sun Yamin; Tang Bin

2007-01-01

In order to enhance the time synchronization quality of the distributed system, a time synchronization algorithm of distributed system based on server time-revise and workstation self-adjust is proposed. The time-revise cycle and self-adjust process is introduced in the paper. The algorithm reduces network flow effectively and enhances the quality of clock-synchronization. (authors)

RB Particle Filter Time Synchronization Algorithm Based on the DPM Model.

Science.gov (United States)

Guo, Chunsheng; Shen, Jia; Sun, Yao; Ying, Na

2015-09-03

Time synchronization is essential for node localization, target tracking, data fusion, and various other Wireless Sensor Network (WSN) applications. To improve the estimation accuracy of continuous clock offset and skew of mobile nodes in WSNs, we propose a novel time synchronization algorithm, the Rao-Blackwellised (RB) particle filter time synchronization algorithm based on the Dirichlet process mixture (DPM) model. In a state-space equation with a linear substructure, state variables are divided into linear and non-linear variables by the RB particle filter algorithm. These two variables can be estimated using Kalman filter and particle filter, respectively, which improves the computational efficiency more so than if only the particle filter was used. In addition, the DPM model is used to describe the distribution of non-deterministic delays and to automatically adjust the number of Gaussian mixture model components based on the observational data. This improves the estimation accuracy of clock offset and skew, which allows achieving the time synchronization. The time synchronization performance of this algorithm is also validated by computer simulations and experimental measurements. The results show that the proposed algorithm has a higher time synchronization precision than traditional time synchronization algorithms.

Status report on the 'Merging' of the Electron-Cloud Code POSINST with the 3-D Accelerator PIC CODE WARP

Energy Technology Data Exchange (ETDEWEB)

Vay, J.-L.; Furman, M.A.; Azevedo, A.W.; Cohen, R.H.; Friedman, A.; Grote, D.P.; Stoltz, P.H.

2004-04-19

We have integrated the electron-cloud code POSINST [1] with WARP [2]--a 3-D parallel Particle-In-Cell accelerator code developed for Heavy Ion Inertial Fusion--so that the two can interoperate. Both codes are run in the same process, communicate through a Python interpreter (already used in WARP), and share certain key arrays (so far, particle positions and velocities). Currently, POSINST provides primary and secondary sources of electrons, beam bunch kicks, a particle mover, and diagnostics. WARP provides the field solvers and diagnostics. Secondary emission routines are provided by the Tech-X package CMEE.

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

Directory of Open Access Journals (Sweden)

Zoltán Király

2013-08-01

Full Text Available We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time algorithm with the same ratio, using some ideas of Paluch [2]. In this algorithm every person make decisions using only their own list, and some information asked from members of these lists (as in the case of the famous algorithm of Gale and Shapley. Some consequences to the Hospitals/Residents problem are also discussed.

Osserman and conformally Osserman manifolds with warped and twisted product structure

OpenAIRE

Brozos-Vazquez, M.; Garcia-Rio, E.; Vazquez-Lorenzo, R.

2008-01-01

We characterize Osserman and conformally Osserman Riemannian manifolds with the local structure of a warped product. By means of this approach we analyze the twisted product structure and obtain, as a consequence, that the only Osserman manifolds which can be written as a twisted product are those of constant curvature.

Triply coupled vibrational band gap in a periodic and nonsymmetrical axially loaded thin-walled Bernoulli-Euler beam including the warping effect

International Nuclear Information System (INIS)

Yu Dianlong; Fang Jianyu; Cai Li; Han Xiaoyun; Wen Jihong

2009-01-01

The propagation of triply coupled vibrations in a periodic, nonsymmetrical and axially loaded thin-walled Bernoulli-Euler beam composed of two kinds of materials is investigated with the transfer matrix method. The cross-section of the beam lacks symmetrical axes, and bending vibrations in the two perpendicular directions are coupled with torsional vibrations. Furthermore, the effect of warping stiffness is included. The band structures of the periodic beam, both including and excluding the warping effect, are obtained. The frequency response function of the finite periodic beam is simulated with the finite element method. These simulations show large vibration-based attenuation in the frequency range of the gap, as expected. By comparing the band structure of the beam with plane wave expansion method calculations that are available in the literature, one finds that including the warping effect leads to a more accurate simulation. The effects of warping stiffness and axial force on the band structure are also discussed.

A Natural Extension of Standard Warped Higher-Dimensional Compactifications: Theory and Phenomenology

Science.gov (United States)

Hong, Sungwoo

Warped higher-dimensional compactifications with "bulk'' standard model, or their AdS/CFT dual as the purely 4D scenario of Higgs compositeness and partial compositeness, offer an elegant approach to resolving the electroweak hierarchy problem as well as the origins of flavor structure. However, low-energy electroweak/flavor/CP constraints and the absence of non-standard physics at LHC Run 1 suggest that a "little hierarchy problem'' remains, and that the new physics underlying naturalness may lie out of LHC reach. Assuming this to be the case, we show that there is a simple and natural extension of the minimal warped model in the Randall-Sundrum framework, in which matter, gauge and gravitational fields propagate modestly different degrees into the IR of the warped dimension, resulting in rich and striking consequences for the LHC (and beyond). The LHC-accessible part of the new physics is AdS/CFT dual to the mechanism of "vectorlike confinement'', with TeV-scale Kaluza-Klein excitations of the gauge and gravitational fields dual to spin-0,1,2 composites. Unlike the minimal warped model, these low-lying excitations have predominantly flavor-blind and flavor/CP-safe interactions with the standard model. In addition, the usual leading decay modes of the lightest KK gauge bosons into top and Higgs bosons are suppressed. This effect permits erstwhile subdominant channels to become significant. These include flavor-universal decays to all pairs of SM fermions, and a novel channel--decay to a radion and a SM gauge boson, followed by radion decay to a pair of SM gauge bosons. We present a detailed phenomenological study of the latter cascade decay processes. Remarkably, this scenario also predicts small deviations from flavor-blindness originating from virtual effects of Higgs/top compositeness at O(10) TeV, with subdominant resonance decays into a pair of Higgs/top-rich final states, giving the LHC an early "preview'' of the nature of the resolution of the hierarchy

Acoustic analysis of warp potential of green ponderosa pine lumber

Science.gov (United States)

Xiping Wang; William T. Simpson

2005-01-01

This study evaluated the potential of acoustic analysis as presorting criteria to identify warp-prone boards before kiln drying. Dimension lumber, 38 by 89 mm (nominal 2 by 4 in.) and 2.44 m (8 ft) long, sawn from open-grown small-diameter ponderosa pine trees, was acoustically tested lengthwise at green condition. Three acoustic properties (acoustic speed, rate of...

Fast algorithms for computing phylogenetic divergence time.

Science.gov (United States)

Crosby, Ralph W; Williams, Tiffani L

2017-12-06

The inference of species divergence time is a key step in most phylogenetic studies. Methods have been available for the last ten years to perform the inference, but the performance of the methods does not yet scale well to studies with hundreds of taxa and thousands of DNA base pairs. For example a study of 349 primate taxa was estimated to require over 9 months of processing time. In this work, we present a new algorithm, AncestralAge, that significantly improves the performance of the divergence time process. As part of AncestralAge, we demonstrate a new method for the computation of phylogenetic likelihood and our experiments show a 90% improvement in likelihood computation time on the aforementioned dataset of 349 primates taxa with over 60,000 DNA base pairs. Additionally, we show that our new method for the computation of the Bayesian prior on node ages reduces the running time for this computation on the 349 taxa dataset by 99%. Through the use of these new algorithms we open up the ability to perform divergence time inference on large phylogenetic studies.

Warped Linear Prediction of Physical Model Excitations with Applications in Audio Compression and Instrument Synthesis

Science.gov (United States)

Glass, Alexis; Fukudome, Kimitoshi

2004-12-01

A sound recording of a plucked string instrument is encoded and resynthesized using two stages of prediction. In the first stage of prediction, a simple physical model of a plucked string is estimated and the instrument excitation is obtained. The second stage of prediction compensates for the simplicity of the model in the first stage by encoding either the instrument excitation or the model error using warped linear prediction. These two methods of compensation are compared with each other, and to the case of single-stage warped linear prediction, adjustments are introduced, and their applications to instrument synthesis and MPEG4's audio compression within the structured audio format are discussed.

Analysis of warping deformation modes using higher order ANCF beam element

Science.gov (United States)

Orzechowski, Grzegorz; Shabana, Ahmed A.

2016-02-01

Most classical beam theories assume that the beam cross section remains a rigid surface under an arbitrary loading condition. However, in the absolute nodal coordinate formulation (ANCF) continuum-based beams, this assumption can be relaxed allowing for capturing deformation modes that couple the cross-section deformation and beam bending, torsion, and/or elongation. The deformation modes captured by ANCF finite elements depend on the interpolating polynomials used. The most widely used spatial ANCF beam element employs linear approximation in the transverse direction, thereby restricting the cross section deformation and leading to locking problems. The objective of this investigation is to examine the behavior of a higher order ANCF beam element that includes quadratic interpolation in the transverse directions. This higher order element allows capturing warping and non-uniform stretching distribution. Furthermore, this higher order element allows for increasing the degree of continuity at the element interface. It is shown in this paper that the higher order ANCF beam element can be used effectively to capture warping and eliminate Poisson locking that characterizes lower order ANCF finite elements. It is also shown that increasing the degree of continuity requires a special attention in order to have acceptable results. Because higher order elements can be more computationally expensive than the lower order elements, the use of reduced integration for evaluating the stress forces and the use of explicit and implicit numerical integrations to solve the nonlinear dynamic equations of motion are investigated in this paper. It is shown that the use of some of these integration methods can be very effective in reducing the CPU time without adversely affecting the solution accuracy.

Similarity queries for temporal toxicogenomic expression profiles.

Directory of Open Access Journals (Sweden)

Adam A Smith

2008-07-01

Full Text Available We present an approach for answering similarity queries about gene expression time series that is motivated by the task of characterizing the potential toxicity of various chemicals. Our approach involves two key aspects. First, our method employs a novel alignment algorithm based on time warping. Our time warping algorithm has several advantages over previous approaches. It allows the user to impose fairly strong biases on the form that the alignments can take, and it permits a type of local alignment in which the entirety of only one series has to be aligned. Second, our method employs a relaxed spline interpolation to predict expression responses for unmeasured time points, such that the spline does not necessarily exactly fit every observed point. We evaluate our approach using expression time series from the Edge toxicology database. Our experiments show the value of using spline representations for sparse time series. More significantly, they show that our time warping method provides more accurate alignments and classifications than previous standard alignment methods for time series.

Towards an Intelligent Acoustic Front End for Automatic Speech Recognition: Built-in Speaker Normalization

Directory of Open Access Journals (Sweden)

Umit H. Yapanel

2008-08-01

Full Text Available A proven method for achieving effective automatic speech recognition (ASR due to speaker differences is to perform acoustic feature speaker normalization. More effective speaker normalization methods are needed which require limited computing resources for real-time performance. The most popular speaker normalization technique is vocal-tract length normalization (VTLN, despite the fact that it is computationally expensive. In this study, we propose a novel online VTLN algorithm entitled built-in speaker normalization (BISN, where normalization is performed on-the-fly within a newly proposed PMVDR acoustic front end. The novel algorithm aspect is that in conventional frontend processing with PMVDR and VTLN, two separating warping phases are needed; while in the proposed BISN method only one single speaker dependent warp is used to achieve both the PMVDR perceptual warp and VTLN warp simultaneously. This improved integration unifies the nonlinear warping performed in the front end and reduces simultaneously. This improved integration unifies the nonlinear warping performed in the front end and reduces computational requirements, thereby offering advantages for real-time ASR systems. Evaluations are performed for (i an in-car extended digit recognition task, where an on-the-fly BISN implementation reduces the relative word error rate (WER by 24%, and (ii for a diverse noisy speech task (SPINE 2, where the relative WER improvement was 9%, both relative to the baseline speaker normalization method.

Towards an Intelligent Acoustic Front End for Automatic Speech Recognition: Built-in Speaker Normalization

Directory of Open Access Journals (Sweden)

Yapanel UmitH

2008-01-01

Full Text Available A proven method for achieving effective automatic speech recognition (ASR due to speaker differences is to perform acoustic feature speaker normalization. More effective speaker normalization methods are needed which require limited computing resources for real-time performance. The most popular speaker normalization technique is vocal-tract length normalization (VTLN, despite the fact that it is computationally expensive. In this study, we propose a novel online VTLN algorithm entitled built-in speaker normalization (BISN, where normalization is performed on-the-fly within a newly proposed PMVDR acoustic front end. The novel algorithm aspect is that in conventional frontend processing with PMVDR and VTLN, two separating warping phases are needed; while in the proposed BISN method only one single speaker dependent warp is used to achieve both the PMVDR perceptual warp and VTLN warp simultaneously. This improved integration unifies the nonlinear warping performed in the front end and reduces simultaneously. This improved integration unifies the nonlinear warping performed in the front end and reduces computational requirements, thereby offering advantages for real-time ASR systems. Evaluations are performed for (i an in-car extended digit recognition task, where an on-the-fly BISN implementation reduces the relative word error rate (WER by 24%, and (ii for a diverse noisy speech task (SPINE 2, where the relative WER improvement was 9%, both relative to the baseline speaker normalization method.

EDITORIAL: Special issue on time scale algorithms

Science.gov (United States)

Matsakis, Demetrios; Tavella, Patrizia

2008-12-01

This special issue of Metrologia presents selected papers from the Fifth International Time Scale Algorithm Symposium (VITSAS), including some of the tutorials presented on the first day. The symposium was attended by 76 persons, from every continent except Antarctica, by students as well as senior scientists, and hosted by the Real Instituto y Observatorio de la Armada (ROA) in San Fernando, Spain, whose staff further enhanced their nation's high reputation for hospitality. Although a timescale can be simply defined as a weighted average of clocks, whose purpose is to measure time better than any individual clock, timescale theory has long been and continues to be a vibrant field of research that has both followed and helped to create advances in the art of timekeeping. There is no perfect timescale algorithm, because every one embodies a compromise involving user needs. Some users wish to generate a constant frequency, perhaps not necessarily one that is well-defined with respect to the definition of a second. Other users might want a clock which is as close to UTC or a particular reference clock as possible, or perhaps wish to minimize the maximum variation from that standard. In contrast to the steered timescales that would be required by those users, other users may need free-running timescales, which are independent of external information. While no algorithm can meet all these needs, every algorithm can benefit from some form of tuning. The optimal tuning, and even the optimal algorithm, can depend on the noise characteristics of the frequency standards, or of their comparison systems, the most precise and accurate of which are currently Two Way Satellite Time and Frequency Transfer (TWSTFT) and GPS carrier phase time transfer. The interest in time scale algorithms and its associated statistical methodology began around 40 years ago when the Allan variance appeared and when the metrological institutions started realizing ensemble atomic time using more than

Gravitons in multiply warped scenarios: At 750 GeV and beyond

Indian Academy of Sciences (India)

Mathew Thomas Arun

2017-06-05

Jun 5, 2017 ... the parameter space that can be probed at the 14 TeV run of the LHC. We also ... attempted a RS-graviton interpretation (in a later update, ... The remainder of this paper is organized as follows: ... Six dimensions, four branes and nested warping ..... problem at hand, the construction presented below is.

Illumination Tolerance for Visual Navigation with the Holistic Min-Warping Method

Directory of Open Access Journals (Sweden)

Ralf Möller

2014-02-01

Full Text Available Holistic visual navigation methods are an emerging alternative to the ubiquitous feature-based methods. Holistic methods match entire images pixel-wise instead of extracting and comparing local feature descriptors. In this paper we investigate which pixel-wise distance measures are most suitable for the holistic min-warping method with respect to illumination invariance. Two novel approaches are presented: tunable distance measures—weighted combinations of illumination-invariant and illumination-sensitive terms—and two novel forms of “sequential” correlation which are only invariant against intensity shifts but not against multiplicative changes. Navigation experiments on indoor image databases collected at the same locations but under different conditions of illumination demonstrate that tunable distance measures perform optimally by mixing their two portions instead of using the illumination-invariant term alone. Sequential correlation performs best among all tested methods, and as well but much faster in an approximated form. Mixing with an additional illumination-sensitive term is not necessary for sequential correlation. We show that min-warping with approximated sequential correlation can successfully be applied to visual navigation of cleaning robots.

Novel methods in the Particle-In-Cell accelerator Code-Framework Warp

Energy Technology Data Exchange (ETDEWEB)

Vay, J-L [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Grote, D. P. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Cohen, R. H. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Friedman, A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2012-12-26

The Particle-In-Cell (PIC) Code-Framework Warp is being developed by the Heavy Ion Fusion Science Virtual National Laboratory (HIFS-VNL) to guide the development of accelerators that can deliver beams suitable for high-energy density experiments and implosion of inertial fusion capsules. It is also applied in various areas outside the Heavy Ion Fusion program to the study and design of existing and next-generation high-energy accelerators, including the study of electron cloud effects and laser wakefield acceleration for example. This study presents an overview of Warp's capabilities, summarizing recent original numerical methods that were developed by the HIFS-VNL (including PIC with adaptive mesh refinement, a large-timestep 'drift-Lorentz' mover for arbitrarily magnetized species, a relativistic Lorentz invariant leapfrog particle pusher, simulations in Lorentz-boosted frames, an electromagnetic solver with tunable numerical dispersion and efficient stride-based digital filtering), with special emphasis on the description of the mesh refinement capability. In addition, selected examples of the applications of the methods to the abovementioned fields are given.

Efficient Fourier-based algorithms for time-periodic unsteady problems

Science.gov (United States)

Gopinath, Arathi Kamath

2007-12-01

This dissertation work proposes two algorithms for the simulation of time-periodic unsteady problems via the solution of Unsteady Reynolds-Averaged Navier-Stokes (URANS) equations. These algorithms use a Fourier representation in time and hence solve for the periodic state directly without resolving transients (which consume most of the resources in a time-accurate scheme). In contrast to conventional Fourier-based techniques which solve the governing equations in frequency space, the new algorithms perform all the calculations in the time domain, and hence require minimal modifications to an existing solver. The complete space-time solution is obtained by iterating in a fifth pseudo-time dimension. Various time-periodic problems such as helicopter rotors, wind turbines, turbomachinery and flapping-wings can be simulated using the Time Spectral method. The algorithm is first validated using pitching airfoil/wing test cases. The method is further extended to turbomachinery problems, and computational results verified by comparison with a time-accurate calculation. The technique can be very memory intensive for large problems, since the solution is computed (and hence stored) simultaneously at all time levels. Often, the blade counts of a turbomachine are rescaled such that a periodic fraction of the annulus can be solved. This approximation enables the solution to be obtained at a fraction of the cost of a full-scale time-accurate solution. For a viscous computation over a three-dimensional single-stage rescaled compressor, an order of magnitude savings is achieved. The second algorithm, the reduced-order Harmonic Balance method is applicable only to turbomachinery flows, and offers even larger computational savings than the Time Spectral method. It simulates the true geometry of the turbomachine using only one blade passage per blade row as the computational domain. In each blade row of the turbomachine, only the dominant frequencies are resolved, namely

Magnetic resonance imaging in cadaver dogs with metallic vertebral implants at 3 Tesla: evaluation of the WARP-turbo spin echo sequence.

Science.gov (United States)

Griffin, John F; Archambault, Nicholas S; Mankin, Joseph M; Wall, Corey R; Thompson, James A; Padua, Abraham; Purdy, David; Kerwin, Sharon C

2013-11-15

Laboratory investigation, ex vivo. Postoperative complications are common after spinal implantation procedures, and magnetic resonance imaging (MRI) would be the ideal modality to image these patients. Unfortunately, the implants cause artifacts that can render MRI nondiagnostic. The WARP-turbo spin echo (TSE) sequence has been developed to mitigate artifacts caused by metal. The objective of this investigation was to evaluate the performance of the WARP-TSE sequence in canine cadaver specimens after implantation with metallic vertebral implants. Magnetic field strength, implant type, and MRI acquisition technique all play a role in the severity of susceptibility artifacts. The WARP-TSE sequence uses increased bandwidth, view angle tilting, and SEMAC (slice-encoding metal artifact correction) to correct for susceptibility artifact. The WARP-TSE technique has outperformed conventional techniques in patients, after total hip arthroplasty. However, published reports of its application in subjects with vertebral column implants are lacking. Ex vivo anterior stabilization of the atlantoaxial joint was performed on 6 adult small breed (implantation with stainless steel implants. N/A.

Space-time spectral collocation algorithm for solving time-fractional Tricomi-type equations

Directory of Open Access Journals (Sweden)

Abdelkawy M.A.

2016-01-01

Full Text Available We introduce a new numerical algorithm for solving one-dimensional time-fractional Tricomi-type equations (T-FTTEs. We used the shifted Jacobi polynomials as basis functions and the derivatives of fractional is evaluated by the Caputo definition. The shifted Jacobi Gauss-Lobatt algorithm is used for the spatial discretization, while the shifted Jacobi Gauss-Radau algorithmis applied for temporal approximation. Substituting these approximations in the problem leads to a system of algebraic equations that greatly simplifies the problem. The proposed algorithm is successfully extended to solve the two-dimensional T-FTTEs. Extensive numerical tests illustrate the capability and high accuracy of the proposed methodologies.

Efficient Geo-Computational Algorithms for Constructing Space-Time Prisms in Road Networks

Directory of Open Access Journals (Sweden)

Hui-Ping Chen

2016-11-01

Full Text Available The Space-time prism (STP is a key concept in time geography for analyzing human activity-travel behavior under various Space-time constraints. Most existing time-geographic studies use a straightforward algorithm to construct STPs in road networks by using two one-to-all shortest path searches. However, this straightforward algorithm can introduce considerable computational overhead, given the fact that accessible links in a STP are generally a small portion of the whole network. To address this issue, an efficient geo-computational algorithm, called NTP-A*, is proposed. The proposed NTP-A* algorithm employs the A* and branch-and-bound techniques to discard inaccessible links during two shortest path searches, and thereby improves the STP construction performance. Comprehensive computational experiments are carried out to demonstrate the computational advantage of the proposed algorithm. Several implementation techniques, including the label-correcting technique and the hybrid link-node labeling technique, are discussed and analyzed. Experimental results show that the proposed NTP-A* algorithm can significantly improve STP construction performance in large-scale road networks by a factor of 100, compared with existing algorithms.

Usefulness of metal artifact reduction with WARP technique at 1.5 and 3T MRI in imaging metal-on-metal hip resurfacings

Energy Technology Data Exchange (ETDEWEB)

Lazik, Andrea; Lauenstein, Thomas C.; Theysohn, Jens M. [University Hospital Essen, Department of Diagnostic and Interventional Radiology and Neuroradiology, Essen (Germany); Landgraeber, Stefan; Schulte, Patrick [University Hospital Essen, Department of Orthopedics, Essen (Germany); Kraff, Oliver [University of Duisburg-Essen, Erwin L. Hahn Institute for Magnetic Resonance Imaging, Essen (Germany)

2015-03-25

To evaluate the usefulness of the metal artifact reduction technique ''WARP'' in the assessment of metal-on-metal hip resurfacings at 1.5 and 3T in the context of image quality and imaging speed. Nineteen patients (25 hip resurfacings) were randomized for 1.5 and 3T MRI, both including T1 and T2 turbo spin-echo as well as turbo inversion recovery magnitude sequences with and without view angle tilting and high bandwidth. Additional 3T sequences were acquired with a reduced number of averages and using the parallel acquisition technique for accelerating imaging speed. Artifact size (diameter, area), image quality (5-point scale) and delineation of anatomical structures were compared among the techniques, sequences and field strengths using the Wilcoxon sign-rank and paired t-test with Bonferroni correction. At both field strengths, WARP showed significant superiority over standard sequences regarding image quality, artifact size and delineation of anatomical structures. At 3T, artifacts were larger compared to 1.5T without affecting diagnostic quality, and scanning time could be reduced by up to 64 % without quality degradation. WARP proved useful in imaging metal-on-metal hip resurfacings at 1.5T as well as 3T with better image quality surrounding the implants. At 3T imaging could be considerably accelerated without losing diagnostic quality. (orig.)

Usefulness of metal artifact reduction with WARP technique at 1.5 and 3T MRI in imaging metal-on-metal hip resurfacings

International Nuclear Information System (INIS)

Lazik, Andrea; Lauenstein, Thomas C.; Theysohn, Jens M.; Landgraeber, Stefan; Schulte, Patrick; Kraff, Oliver

2015-01-01

To evaluate the usefulness of the metal artifact reduction technique ''WARP'' in the assessment of metal-on-metal hip resurfacings at 1.5 and 3T in the context of image quality and imaging speed. Nineteen patients (25 hip resurfacings) were randomized for 1.5 and 3T MRI, both including T1 and T2 turbo spin-echo as well as turbo inversion recovery magnitude sequences with and without view angle tilting and high bandwidth. Additional 3T sequences were acquired with a reduced number of averages and using the parallel acquisition technique for accelerating imaging speed. Artifact size (diameter, area), image quality (5-point scale) and delineation of anatomical structures were compared among the techniques, sequences and field strengths using the Wilcoxon sign-rank and paired t-test with Bonferroni correction. At both field strengths, WARP showed significant superiority over standard sequences regarding image quality, artifact size and delineation of anatomical structures. At 3T, artifacts were larger compared to 1.5T without affecting diagnostic quality, and scanning time could be reduced by up to 64 % without quality degradation. WARP proved useful in imaging metal-on-metal hip resurfacings at 1.5T as well as 3T with better image quality surrounding the implants. At 3T imaging could be considerably accelerated without losing diagnostic quality. (orig.)

Parallel translation in warped product spaces: application to the Reissner-Nordstroem spacetime

International Nuclear Information System (INIS)

Raposo, A P; Del Riego, L

2005-01-01

A formal treatment of the parallel translation transformations in warped product manifolds is presented and related to those parallel translation transformations in each of the factor manifolds. A straightforward application to the Schwarzschild and Reissner-Nordstroem geometries, considered here as particular examples, explains some apparently surprising properties of the holonomy in these manifolds

Research on the relationship between viscoelasticity and shock isolation performance of warp knitted spacer fabrics

Directory of Open Access Journals (Sweden)

Jin JIANG

2016-04-01

Full Text Available Warp-knitted spacer fabric which is commonly used in impact protection is selected as test materials to study the relationship between viscoelasticity and the performance of shock isolation. A damping test platform is built to test different specifications of warp-knitted spacer fabric including compression elastic modulus, damping ratio and the residual impact load under different impact speed. Experimental results show that there is no clear correlation between the shock isolation performance and the viscidity or the elasticity. Accordingly, viscosity-to-elasticity ratio is proposed to characterize the relationship between viscoelasticity and shock isolation performance, and it is found that appropriate viscosity-to-elasticity ratio within a certain range can help to achieve better shock isolation performance.

An Empirical Derivation of the Run Time of the Bubble Sort Algorithm.

Science.gov (United States)

Gonzales, Michael G.

1984-01-01

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

ALGORITHMIC CONSTRUCTION SCHEDULES IN CONDITIONS OF TIMING CONSTRAINTS

Directory of Open Access Journals (Sweden)

Alexey S. Dobrynin

2014-01-01

Full Text Available Tasks of time-schedule construction (JSSP in various fields of human activities have an important theoretical and practical significance. The main feature of these tasks is a timing requirement, describing allowed planning time periods and periods of downtime. This article describes implementation variations of the work scheduling algorithm under timing requirements for the tasks of industrial time-schedules construction, and service activities.

Transformation Algorithm of Dielectric Response in Time-Frequency Domain

Directory of Open Access Journals (Sweden)

Ji Liu

2014-01-01

Full Text Available A transformation algorithm of dielectric response from time domain to frequency domain is presented. In order to shorten measuring time of low or ultralow frequency dielectric response characteristics, the transformation algorithm is used in this paper to transform the time domain relaxation current to frequency domain current for calculating the low frequency dielectric dissipation factor. In addition, it is shown from comparing the calculation results with actual test data that there is a coincidence for both results over a wide range of low frequencies. Meanwhile, the time domain test data of depolarization currents in dry and moist pressboards are converted into frequency domain results on the basis of the transformation. The frequency domain curves of complex capacitance and dielectric dissipation factor at the low frequency range are obtained. Test results of polarization and depolarization current (PDC in pressboards are also given at the different voltage and polarization time. It is demonstrated from the experimental results that polarization and depolarization current are affected significantly by moisture contents of the test pressboards, and the transformation algorithm is effective in ultralow frequency of 10−3 Hz. Data analysis and interpretation of the test results conclude that analysis of time-frequency domain dielectric response can be used for assessing insulation system in power transformer.

Detecting structural breaks in time series via genetic algorithms

DEFF Research Database (Denmark)

Doerr, Benjamin; Fischer, Paul; Hilbert, Astrid

2016-01-01

of the time series under consideration is available. Therefore, a black-box optimization approach is our method of choice for detecting structural breaks. We describe a genetic algorithm framework which easily adapts to a large number of statistical settings. To evaluate the usefulness of different crossover...... and mutation operations for this problem, we conduct extensive experiments to determine good choices for the parameters and operators of the genetic algorithm. One surprising observation is that use of uniform and one-point crossover together gave significantly better results than using either crossover...... operator alone. Moreover, we present a specific fitness function which exploits the sparse structure of the break points and which can be evaluated particularly efficiently. The experiments on artificial and real-world time series show that the resulting algorithm detects break points with high precision...

A Linear Time Algorithm for the k Maximal Sums Problem

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Jørgensen, Allan Grønlund

2007-01-01

 k maximal sums problem. We use this algorithm to obtain algorithms solving the two-dimensional k maximal sums problem in O(m 2·n + k) time, where the input is an m ×n matrix with m ≤ n. We generalize this algorithm to solve the d-dimensional problem in O(n 2d − 1 + k) time. The space usage of all......Finding the sub-vector with the largest sum in a sequence of n numbers is known as the maximum sum problem. Finding the k sub-vectors with the largest sums is a natural extension of this, and is known as the k maximal sums problem. In this paper we design an optimal O(n + k) time algorithm for the...... the algorithms can be reduced to O(n d − 1 + k). This leads to the first algorithm for the k maximal sums problem in one dimension using O(n + k) time and O(k) space....

Using Dynamic Time Warping and Data Forensics to Examine Tradeoffs among Land-Energy-Water Networks Across the Conterminous United States

Science.gov (United States)

McManamay, R.; Allen, M. R.; Piburn, J.; Sanyal, J.; Stewart, R.; Bhaduri, B. L.

2017-12-01

Characterizing interdependencies among land-energy-water sectors, their vulnerabilities, and tipping points, is challenging, especially if all sectors are simultaneously considered. Because such holistic system behavior is uncertain, largely unmodeled, and in need of testable hypotheses of system drivers, these dynamics are conducive to exploratory analytics of spatiotemporal patterns, powered by tools, such as Dynamic Time Warping (DTW). Here, we conduct a retrospective analysis (1950 - 2010) of temporal trends in land use, energy use, and water use within US counties to identify commonalities in resource consumption and adaptation strategies to resource limitations. We combine existing and derived data from statistical downscaling to synthesize a temporally comprehensive land-energy-water dataset at the US county level and apply DTW and subsequent hierarchical clustering to examine similar temporal trends in resource typologies for land, energy, and water sectors. As expected, we observed tradeoffs among water uses (e.g., public supply vs irrigation) and land uses (e.g., urban vs ag). Strong associations between clusters amongst sectors reveal tight system interdependencies, whereas weak associations suggest unique behaviors and potential for human adaptations towards disruptive technologies and less resource-dependent population growth. Our framework is useful for exploring complex human-environmental system dynamics and generating hypotheses to guide subsequent energy-water-nexus research.

On Closed Timelike Curves and Warped Brane World Models

Directory of Open Access Journals (Sweden)

Slagter Reinoud Jan

2013-09-01

Full Text Available At first glance, it seems possible to construct in general relativity theory causality violating solutions. The most striking one is the Gott spacetime. Two cosmic strings, approaching each other with high velocity, could produce closed timelike curves. It was quickly recognized that this solution violates physical boundary conditions. The effective one particle generator becomes hyperbolic, so the center of mass is tachyonic. On a 5-dimensional warped spacetime, it seems possible to get an elliptic generator, so no obstruction is encountered and the velocity of the center of mass of the effective particle has an overlap with the Gott region. So a CTC could, in principle, be constructed. However, from the effective 4D field equations on the brane, which are influenced by the projection of the bulk Weyl tensor on the brane, it follows that no asymptotic conical space time is found, so no angle deficit as in the 4D counterpart model. This could also explain why we do not observe cosmic strings.

A decentralized scheduling algorithm for time synchronized channel hopping

Directory of Open Access Journals (Sweden)

Andrew Tinka

2011-09-01

Full Text Available Time Synchronized Channel Hopping (TSCH is an existing Medium Access Control scheme which enables robust communication through channel hopping and high data rates through synchronization. It is based on a time-slotted architecture, and its correct functioning depends on a schedule which is typically computed by a central node. This paper presents, to our knowledge, the first scheduling algorithm for TSCH networks which both is distributed and which copes with mobile nodes. Two variations on scheduling algorithms are presented. Aloha-based scheduling allocates one channel for broadcasting advertisements for new neighbors. Reservation- based scheduling augments Aloha-based scheduling with a dedicated timeslot for targeted advertisements based on gossip information. A mobile ad hoc motorized sensor network with frequent connectivity changes is studied, and the performance of the two proposed algorithms is assessed. This performance analysis uses both simulation results and the results of a field deployment of floating wireless sensors in an estuarial canal environment. Reservation-based scheduling performs significantly better than Aloha-based scheduling, suggesting that the improved network reactivity is worth the increased algorithmic complexity and resource consumption.

Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem

International Nuclear Information System (INIS)

Du, X.; Liu, T.; Ji, W.; Xu, X. G.; Brown, F. B.

2013-01-01

Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER GPU code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)

Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem

Energy Technology Data Exchange (ETDEWEB)

Du, X.; Liu, T.; Ji, W.; Xu, X. G. [Nuclear Engineering Program, Rensselaer Polytechnic Institute, Troy, NY 12180 (United States); Brown, F. B. [Monte Carlo Codes Group, Los Alamos National Laboratory, Los Alamos, NM 87545 (United States)

2013-07-01

Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER{sub GPU} code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)

Time Reversal Reconstruction Algorithm Based on PSO Optimized SVM Interpolation for Photoacoustic Imaging

Directory of Open Access Journals (Sweden)

Mingjian Sun

2015-01-01

Full Text Available Photoacoustic imaging is an innovative imaging technique to image biomedical tissues. The time reversal reconstruction algorithm in which a numerical model of the acoustic forward problem is run backwards in time is widely used. In the paper, a time reversal reconstruction algorithm based on particle swarm optimization (PSO optimized support vector machine (SVM interpolation method is proposed for photoacoustics imaging. Numerical results show that the reconstructed images of the proposed algorithm are more accurate than those of the nearest neighbor interpolation, linear interpolation, and cubic convolution interpolation based time reversal algorithm, which can provide higher imaging quality by using significantly fewer measurement positions or scanning times.

Warped penguin diagrams

International Nuclear Information System (INIS)

Csaki, Csaba; Grossman, Yuval; Tanedo, Philip; Tsai, Yuhsin

2011-01-01

We present an analysis of the loop-induced magnetic dipole operator in the Randall-Sundrum model of a warped extra dimension with anarchic bulk fermions and an IR brane-localized Higgs. These operators are finite at one-loop order and we explicitly calculate the branching ratio for μ→eγ using the mixed position/momentum space formalism. The particular bound on the anarchic Yukawa and Kaluza-Klein (KK) scales can depend on the flavor structure of the anarchic matrices. It is possible for a generic model to either be ruled out or unaffected by these bounds without any fine-tuning. We quantify how these models realize this surprising behavior. We also review tree-level lepton flavor bounds in these models and show that these are on the verge of tension with the μ→eγ bounds from typical models with a 3 TeV Kaluza-Klein scale. Further, we illuminate the nature of the one-loop finiteness of these diagrams and show how to accurately determine the degree of divergence of a five-dimensional loop diagram using both the five-dimensional and KK formalism. This power counting can be obfuscated in the four-dimensional Kaluza-Klein formalism and we explicitly point out subtleties that ensure that the two formalisms agree. Finally, we remark on the existence of a perturbative regime in which these one-loop results give the dominant contribution.

Identifying Time Measurement Tampering in the Traversal Time and Hop Count Analysis (TTHCA Wormhole Detection Algorithm

Directory of Open Access Journals (Sweden)

Jonny Karlsson

2013-05-01

Full Text Available Traversal time and hop count analysis (TTHCA is a recent wormhole detection algorithm for mobile ad hoc networks (MANET which provides enhanced detection performance against all wormhole attack variants and network types. TTHCA involves each node measuring the processing time of routing packets during the route discovery process and then delivering the measurements to the source node. In a participation mode (PM wormhole where malicious nodes appear in the routing tables as legitimate nodes, the time measurements can potentially be altered so preventing TTHCA from successfully detecting the wormhole. This paper analyses the prevailing conditions for time tampering attacks to succeed for PM wormholes, before introducing an extension to the TTHCA detection algorithm called ∆T Vector which is designed to identify time tampering, while preserving low false positive rates. Simulation results confirm that the ∆T Vector extension is able to effectively detect time tampering attacks, thereby providing an important security enhancement to the TTHCA algorithm.

An Improved Phase Gradient Autofocus Algorithm Used in Real-time Processing

Directory of Open Access Journals (Sweden)

Qing Ji-ming

2015-10-01

Full Text Available The Phase Gradient Autofocus (PGA algorithm can remove the high order phase error effectively, which is of great significance to get high resolution images in real-time processing. While PGA usually needs iteration, which necessitates long working hours. In addition, the performances of the algorithm are not stable in different scene applications. This severely constrains the application of PGA in real-time processing. Isolated scatter selection and windowing are two important algorithmic steps of Phase Gradient Autofocus Algorithm. Therefore, this paper presents an isolated scatter selection method based on sample mean and a windowing method based on pulse envelope. These two methods are highly adaptable to data, which would make the algorithm obtain better stability and need less iteration. The adaptability of the improved PGA is demonstrated with the experimental results of real radar data.

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Science.gov (United States)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

Gravity on a little warped space

International Nuclear Information System (INIS)

George, Damien P.; McDonald, Kristian L.

2011-01-01

We investigate the consistent inclusion of 4D Einstein gravity on a truncated slice of AdS 5 whose bulk-gravity and UV scales are much less than the 4D Planck scale, M * Pl . Such 'Little Warped Spaces' have found phenomenological utility and can be motivated by string realizations of the Randall-Sundrum framework. Using the interval approach to brane-world gravity, we show that the inclusion of a large UV-localized Einstein-Hilbert term allows one to consistently incorporate 4D Einstein gravity into the low-energy theory. We detail the spectrum of Kaluza-Klein metric fluctuations and, in particular, examine the coupling of the little radion to matter. Furthermore, we show that Goldberger-Wise stabilization can be successfully implemented on such spaces. Our results demonstrate that realistic low-energy effective theories can be constructed on these spaces, and have relevance for existing models in the literature.

Continuous-time quantum algorithms for unstructured problems

International Nuclear Information System (INIS)

Hen, Itay

2014-01-01

We consider a family of unstructured optimization problems, for which we propose a method for constructing analogue, continuous-time (not necessarily adiabatic) quantum algorithms that are faster than their classical counterparts. In this family of problems, which we refer to as ‘scrambled input’ problems, one has to find a minimum-cost configuration of a given integer-valued n-bit black-box function whose input values have been scrambled in some unknown way. Special cases within this set of problems are Grover’s search problem of finding a marked item in an unstructured database, certain random energy models, and the functions of the Deutsch–Josza problem. We consider a couple of examples in detail. In the first, we provide an O(1) deterministic analogue quantum algorithm to solve the seminal problem of Deutsch and Josza, in which one has to determine whether an n-bit boolean function is constant (gives 0 on all inputs or 1 on all inputs) or balanced (returns 0 on half the input states and 1 on the other half). We also study one variant of the random energy model, and show that, as one might expect, its minimum energy configuration can be found quadratically faster with a quantum adiabatic algorithm than with classical algorithms. (paper)

Inter-patient image registration algorithms to disentangle regional dose bioeffects.

Science.gov (United States)

Monti, Serena; Pacelli, Roberto; Cella, Laura; Palma, Giuseppe

2018-03-20

Radiation therapy (RT) technological advances call for a comprehensive reconsideration of the definition of dose features leading to radiation induced morbidity (RIM). In this context, the voxel-based approach (VBA) to dose distribution analysis in RT offers a radically new philosophy to evaluate local dose response patterns, as an alternative to dose-volume-histograms for identifying dose sensitive regions of normal tissue. The VBA relies on mapping patient dose distributions into a single reference case anatomy which serves as anchor for local dosimetric evaluations. The inter-patient elastic image registrations (EIRs) of the planning CTs provide the deformation fields necessary for the actual warp of dose distributions. In this study we assessed the impact of EIR on the VBA results in thoracic patients by identifying two state-of-the-art EIR algorithms (Demons and B-Spline). Our analysis demonstrated that both the EIR algorithms may be successfully used to highlight subregions with dose differences associated with RIM that substantially overlap. Furthermore, the inclusion for the first time of covariates within a dosimetric statistical model that faces the multiple comparison problem expands the potential of VBA, thus paving the way to a reliable voxel-based analysis of RIM in datasets with strong correlation of the outcome with non-dosimetric variables.

Reducing the time requirement of k-means algorithm.

Science.gov (United States)

Osamor, Victor Chukwudi; Adebiyi, Ezekiel Femi; Oyelade, Jelilli Olarenwaju; Doumbia, Seydou

2012-01-01

Traditional k-means and most k-means variants are still computationally expensive for large datasets, such as microarray data, which have large datasets with large dimension size d. In k-means clustering, we are given a set of n data points in d-dimensional space R(d) and an integer k. The problem is to determine a set of k points in R(d), called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this work, we develop a novel k-means algorithm, which is simple but more efficient than the traditional k-means and the recent enhanced k-means. Our new algorithm is based on the recently established relationship between principal component analysis and the k-means clustering. We provided the correctness proof for this algorithm. Results obtained from testing the algorithm on three biological data and six non-biological data (three of these data are real, while the other three are simulated) also indicate that our algorithm is empirically faster than other known k-means algorithms. We assessed the quality of our algorithm clusters against the clusters of a known structure using the Hubert-Arabie Adjusted Rand index (ARI(HA)). We found that when k is close to d, the quality is good (ARI(HA)>0.8) and when k is not close to d, the quality of our new k-means algorithm is excellent (ARI(HA)>0.9). In this paper, emphases are on the reduction of the time requirement of the k-means algorithm and its application to microarray data due to the desire to create a tool for clustering and malaria research. However, the new clustering algorithm can be used for other clustering needs as long as an appropriate measure of distance between the centroids and the members is used. This has been demonstrated in this work on six non-biological data.

Flavor structure of warped extra dimension models

International Nuclear Information System (INIS)

Agashe, Kaustubh; Perez, Gilad; Soni, Amarjit

2005-01-01

We recently showed that warped extra-dimensional models with bulk custodial symmetry and few TeV Kaluza-Klein (KK) masses lead to striking signals at B factories. In this paper, using a spurion analysis, we systematically study the flavor structure of models that belong to the above class. In particular we find that the profiles of the zero modes, which are similar in all these models, essentially control the underlying flavor structure. This implies that our results are robust and model independent in this class of models. We discuss in detail the origin of the signals in B physics. We also briefly study other new physics signatures that arise in rare K decays (K→πνν), in rare top decays [t→cγ(Z,gluon)], and the possibility of CP asymmetries in D 0 decays to CP eigenstates such as K S π 0 and others. Finally we demonstrate that with light KK masses, ∼3 TeV, the above class of models with anarchic 5D Yukawas has a 'CP problem' since contributions to the neutron electric dipole moment are roughly 20 times larger than the current experimental bound. Using AdS/CFT correspondence, these extra-dimensional models are dual to a purely 4D strongly coupled conformal Higgs sector thus enhancing their appeal

Flavor Structure of Warped Extra Dimension Models

International Nuclear Information System (INIS)

Agashe, Kaustubh; Perez, Gilad; Soni, Amarjit

2004-01-01

We recently showed, in HEP-PH--0406101, that warped extra dimensional models with bulk custodial symmetry and few TeV KK masses lead to striking signals at B-factories. In this paper, using a spurion analysis, we systematically study the flavor structure of models that belong to the above class. In particular we find that the profiles of the zero modes, which are similar in all these models, essentially control the underlying flavor structure. This implies that our results are robust and model independent in this class of models. We discuss in detail the origin of the signals in B-physics. We also briefly study other NP signatures that arise in rare K decays (K → πνν), in rare top decays [t → cγ(Z, gluon)] and the possibility of CP asymmetries in D 0 decays to CP eigenstates such as K s π 0 and others. Finally we demonstrate that with light KK masses, ∼ 3 TeV, the above class of models with anarchic 5D Yukawas has a ''CP problem'' since contributions to the neutron electric dipole moment are roughly 20 times larger than the current experimental bound. Using AdS/CFT correspondence, these extra-dimensional models are dual to a purely 4D strongly coupled conformal Higgs sector thus enhancing their appeal

CAT-PUMA: CME Arrival Time Prediction Using Machine learning Algorithms

Science.gov (United States)

Liu, Jiajia; Ye, Yudong; Shen, Chenglong; Wang, Yuming; Erdélyi, Robert

2018-04-01

CAT-PUMA (CME Arrival Time Prediction Using Machine learning Algorithms) quickly and accurately predicts the arrival of Coronal Mass Ejections (CMEs) of CME arrival time. The software was trained via detailed analysis of CME features and solar wind parameters using 182 previously observed geo-effective partial-/full-halo CMEs and uses algorithms of the Support Vector Machine (SVM) to make its predictions, which can be made within minutes of providing the necessary input parameters of a CME.

Cosmological evolution in a two-brane warped geometry model

Directory of Open Access Journals (Sweden)

Sumit Kumar

2015-07-01

Full Text Available We study an effective 4-dimensional scalar–tensor field theory, originated from an underlying brane–bulk warped geometry, to explore the scenario of inflation. It is shown that the inflaton potential naturally emerges from the radion energy–momentum tensor which in turn results in an inflationary model of the Universe on the visible brane that is consistent with the recent results from the Planck's experiment. The dynamics of modulus stabilization from the inflaton rolling condition is demonstrated. The implications of our results in the context of recent BICEP2 results are also discussed.

HMC algorithm with multiple time scale integration and mass preconditioning

Science.gov (United States)

Urbach, C.; Jansen, K.; Shindler, A.; Wenger, U.

2006-01-01

We present a variant of the HMC algorithm with mass preconditioning (Hasenbusch acceleration) and multiple time scale integration. We have tested this variant for standard Wilson fermions at β=5.6 and at pion masses ranging from 380 to 680 MeV. We show that in this situation its performance is comparable to the recently proposed HMC variant with domain decomposition as preconditioner. We give an update of the "Berlin Wall" figure, comparing the performance of our variant of the HMC algorithm to other published performance data. Advantages of the HMC algorithm with mass preconditioning and multiple time scale integration are that it is straightforward to implement and can be used in combination with a wide variety of lattice Dirac operators.

Genetic algorithm for project time-cost optimization in fuzzy environment

Directory of Open Access Journals (Sweden)

Khan Md. Ariful Haque

2012-12-01

Full Text Available Purpose: The aim of this research is to develop a more realistic approach to solve project time-cost optimization problem under uncertain conditions, with fuzzy time periods. Design/methodology/approach: Deterministic models for time-cost optimization are never efficient considering various uncertainty factors. To make such problems realistic, triangular fuzzy numbers and the concept of a-cut method in fuzzy logic theory are employed to model the problem. Because of NP-hard nature of the project scheduling problem, Genetic Algorithm (GA has been used as a searching tool. Finally, Dev-C++ 4.9.9.2 has been used to code this solver. Findings: The solution has been performed under different combinations of GA parameters and after result analysis optimum values of those parameters have been found for the best solution. Research limitations/implications: For demonstration of the application of the developed algorithm, a project on new product (Pre-paid electric meter, a project under government finance launching has been chosen as a real case. The algorithm is developed under some assumptions. Practical implications: The proposed model leads decision makers to choose the desired solution under different risk levels. Originality/value: Reports reveal that project optimization problems have never been solved under multiple uncertainty conditions. Here, the function has been optimized using Genetic Algorithm search technique, with varied level of risks and fuzzy time periods.

A Gaussian Process Based Online Change Detection Algorithm for Monitoring Periodic Time Series

Energy Technology Data Exchange (ETDEWEB)

Chandola, Varun [ORNL; Vatsavai, Raju [ORNL

2011-01-01

Online time series change detection is a critical component of many monitoring systems, such as space and air-borne remote sensing instruments, cardiac monitors, and network traffic profilers, which continuously analyze observations recorded by sensors. Data collected by such sensors typically has a periodic (seasonal) component. Most existing time series change detection methods are not directly applicable to handle such data, either because they are not designed to handle periodic time series or because they cannot operate in an online mode. We propose an online change detection algorithm which can handle periodic time series. The algorithm uses a Gaussian process based non-parametric time series prediction model and monitors the difference between the predictions and actual observations within a statistically principled control chart framework to identify changes. A key challenge in using Gaussian process in an online mode is the need to solve a large system of equations involving the associated covariance matrix which grows with every time step. The proposed algorithm exploits the special structure of the covariance matrix and can analyze a time series of length T in O(T^2) time while maintaining a O(T) memory footprint, compared to O(T^4) time and O(T^2) memory requirement of standard matrix manipulation methods. We experimentally demonstrate the superiority of the proposed algorithm over several existing time series change detection algorithms on a set of synthetic and real time series. Finally, we illustrate the effectiveness of the proposed algorithm for identifying land use land cover changes using Normalized Difference Vegetation Index (NDVI) data collected for an agricultural region in Iowa state, USA. Our algorithm is able to detect different types of changes in a NDVI validation data set (with ~80% accuracy) which occur due to crop type changes as well as disruptive changes (e.g., natural disasters).

Mechanical Properties Of 3D-Structure Composites Based On Warp-Knitted Spacer Fabrics

Directory of Open Access Journals (Sweden)

Chen Si

2015-06-01

Full Text Available In this paper, the mechanical properties (compression and impact behaviours of three-dimension structure (3D-structure composites based on warp-knitted spacer fabrics have been thoroughly investigated. In order to discuss the effect of fabric structural parameters on the mechanical performance of composites, six different types of warp-knitted spacer fabrics having different structural parameters (such as outer layer structure, diameter of spacer yarn, spacer yarn inclination angle and thickness were involved for comparison study. The 3D-structure composites were fabricated based on a flexible polyurethane foam. The produced composites were characterised for compression and impact properties. The findings obtained indicate that the fabric structural parameters have strong influence on the compression and impact responses of 3D-structure composites. Additionally, the impact test carried out on the 3D-structure composites shows that the impact loads do not affect the integrity of composite structure. All the results reveal that the product exhibits promising mechanical performance and its service life can be sustained.

A distributed scheduling algorithm for heterogeneous real-time systems

Science.gov (United States)

Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

1991-01-01

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

An Adaptive and Time-Efficient ECG R-Peak Detection Algorithm.

Science.gov (United States)

Qin, Qin; Li, Jianqing; Yue, Yinggao; Liu, Chengyu

2017-01-01

R-peak detection is crucial in electrocardiogram (ECG) signal analysis. This study proposed an adaptive and time-efficient R-peak detection algorithm for ECG processing. First, wavelet multiresolution analysis was applied to enhance the ECG signal representation. Then, ECG was mirrored to convert large negative R-peaks to positive ones. After that, local maximums were calculated by the first-order forward differential approach and were truncated by the amplitude and time interval thresholds to locate the R-peaks. The algorithm performances, including detection accuracy and time consumption, were tested on the MIT-BIH arrhythmia database and the QT database. Experimental results showed that the proposed algorithm achieved mean sensitivity of 99.39%, positive predictivity of 99.49%, and accuracy of 98.89% on the MIT-BIH arrhythmia database and 99.83%, 99.90%, and 99.73%, respectively, on the QT database. By processing one ECG record, the mean time consumptions were 0.872 s and 0.763 s for the MIT-BIH arrhythmia database and QT database, respectively, yielding 30.6% and 32.9% of time reduction compared to the traditional Pan-Tompkins method.

Special Issue on Time Scale Algorithms

Science.gov (United States)

2008-01-01

unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 IOP PUBLISHING METROLOGIA Metrologia 45 (2008) doi:10.1088/0026-1394/45/6/E01...special issue of Metrologia presents selected papers from the Fifth International Time Scale Algorithm Symposium (VITSAS), including some of the...scientists, and hosted by the Real Instituto y Observatorio de la Armada (ROA) in San Fernando, Spain, whose staff further enhanced their nation’s high

Low-Energy Real-Time OS Using Voltage Scheduling Algorithm for Variable Voltage Processors

OpenAIRE

Okuma, Takanori; Yasuura, Hiroto

2001-01-01

This paper presents a real-time OS based on $ mu $ITRON using proposed voltage scheduling algorithm for variable voltage processors which can vary supply voltage dynamically. The proposed voltage scheduling algorithms assign voltage level for each task dynamically in order to minimize energy consumption under timing constraints. Using the presented real-time OS, running tasks with low supply voltage leads to drastic energy reduction. In addition, the presented voltage scheduling algorithm is ...

A Harmony Search Algorithm approach for optimizing traffic signal timings

Directory of Open Access Journals (Sweden)

Mauro Dell'Orco

2013-07-01

Full Text Available In this study, a bi-level formulation is presented for solving the Equilibrium Network Design Problem (ENDP. The optimisation of the signal timing has been carried out at the upper-level using the Harmony Search Algorithm (HSA, whilst the traffic assignment has been carried out through the Path Flow Estimator (PFE at the lower level. The results of HSA have been first compared with those obtained using the Genetic Algorithm, and the Hill Climbing on a two-junction network for a fixed set of link flows. Secondly, the HSA with PFE has been applied to the medium-sized network to show the applicability of the proposed algorithm in solving the ENDP. Additionally, in order to test the sensitivity of perceived travel time error, we have used the HSA with PFE with various level of perceived travel time. The results showed that the proposed method is quite simple and efficient in solving the ENDP.

Improvement of temporal and dynamic subtraction images on abdominal CT using 3D global image matching and nonlinear image warping techniques

International Nuclear Information System (INIS)

Okumura, E; Sanada, S; Suzuki, M; Takemura, A; Matsui, O

2007-01-01

Accurate registration of the corresponding non-enhanced and arterial-phase CT images is necessary to create temporal and dynamic subtraction images for the enhancement of subtle abnormalities. However, respiratory movement causes misregistration at the periphery of the liver. To reduce these misregistration errors, we developed a temporal and dynamic subtraction technique to enhance small HCC by 3D global matching and nonlinear image warping techniques. The study population consisted of 21 patients with HCC. Using the 3D global matching and nonlinear image warping technique, we registered current and previous arterial-phase CT images or current non-enhanced and arterial-phase CT images obtained in the same position. The temporal subtraction image was obtained by subtracting the previous arterial-phase CT image from the warped current arterial-phase CT image. The dynamic subtraction image was obtained by the subtraction of the current non-enhanced CT image from the warped current arterial-phase CT image. The percentage of fair or superior temporal subtraction images increased from 52.4% to 95.2% using the new technique, while on the dynamic subtraction images, the percentage increased from 66.6% to 95.2%. The new subtraction technique may facilitate the diagnosis of subtle HCC based on the superior ability of these subtraction images to show nodular and/or ring enhancement

A novel time-domain signal processing algorithm for real time ventricular fibrillation detection

International Nuclear Information System (INIS)

Monte, G E; Scarone, N C; Liscovsky, P O; Rotter, P

2011-01-01

This paper presents an application of a novel algorithm for real time detection of ECG pathologies, especially ventricular fibrillation. It is based on segmentation and labeling process of an oversampled signal. After this treatment, analyzing sequence of segments, global signal behaviours are obtained in the same way like a human being does. The entire process can be seen as a morphological filtering after a smart data sampling. The algorithm does not require any ECG digital signal pre-processing, and the computational cost is low, so it can be embedded into the sensors for wearable and permanent applications. The proposed algorithms could be the input signal description to expert systems or to artificial intelligence software in order to detect other pathologies.

A novel time-domain signal processing algorithm for real time ventricular fibrillation detection

Science.gov (United States)

Monte, G. E.; Scarone, N. C.; Liscovsky, P. O.; Rotter S/N, P.

2011-12-01

This paper presents an application of a novel algorithm for real time detection of ECG pathologies, especially ventricular fibrillation. It is based on segmentation and labeling process of an oversampled signal. After this treatment, analyzing sequence of segments, global signal behaviours are obtained in the same way like a human being does. The entire process can be seen as a morphological filtering after a smart data sampling. The algorithm does not require any ECG digital signal pre-processing, and the computational cost is low, so it can be embedded into the sensors for wearable and permanent applications. The proposed algorithms could be the input signal description to expert systems or to artificial intelligence software in order to detect other pathologies.

A Note on "A polynomial-time algorithm for global value numbering"

OpenAIRE

Nabeezath, Saleena; Paleri, Vineeth

2013-01-01

Global Value Numbering(GVN) is a popular method for detecting redundant computations. A polynomial time algorithm for GVN is presented by Gulwani and Necula(2006). Here we present two limitations of this GVN algorithm due to which detection of certain kinds of redundancies can not be done using this algorithm. The first one is concerning the use of this algorithm in detecting some instances of the classical global common subexpressions, and the second is concerning its use in the detection of...

Remarks on the high-energy behavior of string scattering amplitudes in warped spacetimes. II

International Nuclear Information System (INIS)

Andreev, Oleg

2005-01-01

We study the Regge limit of string amplitudes within the model of Polchinski-Strassler for string scattering in warped spacetimes. We also present some numerical estimations of the Regge slopes and intercepts. It is quite remarkable that the real values of those are inside a range of ours

An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

Directory of Open Access Journals (Sweden)

Farahmand-Mehr Mohammad

2014-01-01

Full Text Available In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented. Since few works have been implemented in this field, the necessity of finding better solutions is a motivation to extend heuristic or meta-heuristic algorithms. This type of production system is found in industries such as food processing, chemical, textile, metallurgical, printed circuit board, and automobile manufacturing. A mixed integer linear programming (MILP model is proposed to minimize the makespan. Since this problem is known as NP-Hard class, a meta-heuristic algorithm, named Genetic Algorithm (GA, and three heuristic algorithms (Johnson, SPTCH and Palmer are proposed. Numerical experiments of different sizes are implemented to evaluate the performance of presented mathematical programming model and the designed GA in compare to heuristic algorithms and a benchmark algorithm. Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.

Heterotic M-theory, warped geometry and the cosmological constant problem

International Nuclear Information System (INIS)

Krause, A.

2001-01-01

The first part of this thesis analyzes whether a locally flat background represents a stable vacuum for the proposed heterotic M-theory. A calculation of the leading order supergravity exchange diagrams leads to the conclusion that the locally flat vacuum cannot be stable. Afterwards a comparison with the corresponding weakly coupled heterotic string amplitudes is made. Next, we consider compactifications of heterotic M-theory on a Calabi-Yau threefold, including a non-vanishing G-flux. The ensuing warped-geometry is determined completely and used to show that the variation of the Calabi-Yau volume along the orbifold direction varies quadratically with distance instead linearly as suggested by an earlier first order approximation. In the second part of this thesis we propose a mechanism for obtaining a small cosmological constant. This mechanism consists of the separation of two domain-walls, which together constitute our world, up to a distance 2l ≅1/M GUT . The resulting warped-geometry leads to an exponential suppression of the cosmological constant, which thereby can obtain its observed value without introducing a large hierarchy. An embedding of this set-up into IIB string-theory entails an SU(6) grand unified theory with a natural explanation of the Higgs doublet-triplet splitting. Finally, we examine to what extent the string-theory T-duality can influence curvature. To this aim we derive the full transformation of the curvature-tensor under T-duality. (orig.)

Genetic algorithms for adaptive real-time control in space systems

Science.gov (United States)

Vanderzijp, J.; Choudry, A.

1988-01-01

Genetic Algorithms that are used for learning as one way to control the combinational explosion associated with the generation of new rules are discussed. The Genetic Algorithm approach tends to work best when it can be applied to a domain independent knowledge representation. Applications to real time control in space systems are discussed.

Computing return times or return periods with rare event algorithms

Science.gov (United States)

Lestang, Thibault; Ragone, Francesco; Bréhier, Charles-Edouard; Herbert, Corentin; Bouchet, Freddy

2018-04-01

The average time between two occurrences of the same event, referred to as its return time (or return period), is a useful statistical concept for practical applications. For instance insurances or public agencies may be interested by the return time of a 10 m flood of the Seine river in Paris. However, due to their scarcity, reliably estimating return times for rare events is very difficult using either observational data or direct numerical simulations. For rare events, an estimator for return times can be built from the extrema of the observable on trajectory blocks. Here, we show that this estimator can be improved to remain accurate for return times of the order of the block size. More importantly, we show that this approach can be generalised to estimate return times from numerical algorithms specifically designed to sample rare events. So far those algorithms often compute probabilities, rather than return times. The approach we propose provides a computationally extremely efficient way to estimate numerically the return times of rare events for a dynamical system, gaining several orders of magnitude of computational costs. We illustrate the method on two kinds of observables, instantaneous and time-averaged, using two different rare event algorithms, for a simple stochastic process, the Ornstein–Uhlenbeck process. As an example of realistic applications to complex systems, we finally discuss extreme values of the drag on an object in a turbulent flow.

Feature Selection Criteria for Real Time EKF-SLAM Algorithm

Directory of Open Access Journals (Sweden)

Fernando Auat Cheein

2010-02-01

Full Text Available This paper presents a seletion procedure for environmet features for the correction stage of a SLAM (Simultaneous Localization and Mapping algorithm based on an Extended Kalman Filter (EKF. This approach decreases the computational time of the correction stage which allows for real and constant-time implementations of the SLAM. The selection procedure consists in chosing the features the SLAM system state covariance is more sensible to. The entire system is implemented on a mobile robot equipped with a range sensor laser. The features extracted from the environment correspond to lines and corners. Experimental results of the real time SLAM algorithm and an analysis of the processing-time consumed by the SLAM with the feature selection procedure proposed are shown. A comparison between the feature selection approach proposed and the classical sequential EKF-SLAM along with an entropy feature selection approach is also performed.

Valley polarization due to trigonal warping on tunneling electrons in graphene

International Nuclear Information System (INIS)

Pereira Jr, J M; Peeters, F M; Costa Filho, R N; Farias, G A

2009-01-01

The effect of trigonal warping on the transmission of electrons tunneling through potential barriers in graphene is investigated. We present calculations of the transmission coefficient for single and double barriers as a function of energy, incidence angle and barrier heights. The results show remarkable valley-dependent directional effects for barriers oriented parallel to the armchair or parallel to the zigzag direction. These results indicate that electrostatic gates can be used as valley filters in graphene-based devices.

Computing Fault-Containment Times of Self-Stabilizing Algorithms Using Lumped Markov Chains

Directory of Open Access Journals (Sweden)

Volker Turau

2018-05-01

Full Text Available The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time starting from an arbitrary state, i.e., a state resulting from a sequence of faults. Considering the fact that these algorithms are intended to provide fault tolerance in the long run, this is not the most relevant metric. A common situation is that a running system is an a legitimate state when hit by a single fault. This event has a much higher probability than multiple concurrent faults. Therefore, the worst case time to recover from a single fault is more relevant than the recovery time from a large number of faults. This paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms based on Markov chains in combination with lumping. To illustrate the applicability of the techniques they are applied to a new self-stabilizing coloring algorithm.

6D supergravity. Warped solution and gravity mediated supersymmetry breaking

Energy Technology Data Exchange (ETDEWEB)

Luedeling, C

2006-07-15

We consider compactified six-dimensional gauged supergravity and find the general warped solution with four-dimensional maximal symmetry. Important features of the solution such as the number and position of singularities are determined by a free holomorphic function. Furthermore, in a particular torus compactification we derive the supergravity coupling of brane fields by the Noether procedure and investigate gravity-mediated supersymmetry breaking. The effective Kaehler potential is not sequestered, yet tree level gravity mediation is absent as long as the superpotential is independent of the radius modulus. (orig.)

6D supergravity. Warped solution and gravity mediated supersymmetry breaking

International Nuclear Information System (INIS)

Luedeling, C.

2006-07-01

We consider compactified six-dimensional gauged supergravity and find the general warped solution with four-dimensional maximal symmetry. Important features of the solution such as the number and position of singularities are determined by a free holomorphic function. Furthermore, in a particular torus compactification we derive the supergravity coupling of brane fields by the Noether procedure and investigate gravity-mediated supersymmetry breaking. The effective Kaehler potential is not sequestered, yet tree level gravity mediation is absent as long as the superpotential is independent of the radius modulus. (orig.)

The effective action of warped M-theory reductions with higher derivative terms — part I

Energy Technology Data Exchange (ETDEWEB)

Grimm, Thomas W.; Pugh, Tom G.; Weissenbacher, Matthias [Max Planck Institute for Physics,Föhringer Ring 6, 80805 Munich (Germany)

2016-01-25

M-theory accessed via eleven-dimensional supergravity admits globally consistent warped solutions with eight-dimensional compact spaces if background fluxes and higher derivative terms are considered. The internal background is conformally Kähler with vanishing first Chern class. We perturb these solutions including a finite number of Kähler deformations of the metric and vector deformations of the M-theory three-form. Special emphasis is given to the field-dependence of the warp-factor and the higher-derivative terms. We show that the three-dimensional two-derivative effective action takes a surprisingly simple form in terms of a single higher-curvature building block due to numerous non-trivial cancellations. Both the ansatz and the effective action admit a moduli dependent scaling symmetry of the internal metric. Furthermore, we find that the required departure from Ricci-flatness and harmonicity of the zero-mode eigenforms does not alter the effective theory.

Towards adaptive radiotherapy for head and neck patients: validation of an in-house deformable registration algorithm

Science.gov (United States)

Veiga, C.; McClelland, J.; Moinuddin, S.; Ricketts, K.; Modat, M.; Ourselin, S.; D'Souza, D.; Royle, G.

2014-03-01

The purpose of this work is to validate an in-house deformable image registration (DIR) algorithm for adaptive radiotherapy for head and neck patients. We aim to use the registrations to estimate the "dose of the day" and assess the need to replan. NiftyReg is an open-source implementation of the B-splines deformable registration algorithm, developed in our institution. We registered a planning CT to a CBCT acquired midway through treatment for 5 HN patients that required replanning. We investigated 16 different parameter settings that previously showed promising results. To assess the registrations, structures delineated in the CT were warped and compared with contours manually drawn by the same clinical expert on the CBCT. This structure set contained vertebral bodies and soft tissue. Dice similarity coefficient (DSC), overlap index (OI), centroid position and distance between structures' surfaces were calculated for every registration, and a set of parameters that produces good results for all datasets was found. We achieve a median value of 0.845 in DSC, 0.889 in OI, error smaller than 2 mm in centroid position and over 90% of the warped surface pixels are distanced less than 2 mm of the manually drawn ones. By using appropriate DIR parameters, we are able to register the planning geometry (pCT) to the daily geometry (CBCT).

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Science.gov (United States)

Baskaran, Subbiah; Noever, D.

1999-01-01

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Warped unification, proton stability, and dark matter.

Science.gov (United States)

Agashe, Kaustubh; Servant, Géraldine

2004-12-03

We show that solving the problem of baryon-number violation in nonsupersymmetric grand unified theories (GUT's) in warped higher-dimensional spacetime can lead to a stable Kaluza-Klein particle. This exotic particle has gauge quantum numbers of a right-handed neutrino, but carries fractional baryon number and is related to the top quark within the higher-dimensional GUT. A combination of baryon number and SU(3) color ensures its stability. Its relic density can easily be of the right value for masses in the 10 GeV-few TeV range. An exciting aspect of these models is that the entire parameter space will be tested at near future dark matter direct detection experiments. Other exotic GUT partners of the top quark are also light and can be produced at high energy colliders with distinctive signatures.

Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems

DEFF Research Database (Denmark)

Taslaman, Nina Sofia

of algorithms, as well as investigations into how far such improvements can get under reasonable assumptions.      The first part is concerned with detection of cycles in graphs, especially parameterized generalizations of Hamiltonian cycles. A remarkably simple Monte Carlo algorithm is presented......NP-hard problems are deemed highly unlikely to be solvable in polynomial time. Still, one can often find algorithms that are substantially faster than brute force solutions. This thesis concerns such algorithms for problems from graph theory; techniques for constructing and improving this type......, and with high probability any found solution is shortest possible. Moreover, the algorithm can be used to find a cycle of given parity through the specified elements.      The second part concerns the hardness of problems encoded as evaluations of the Tutte polynomial at some fixed point in the rational plane...

Comparison of Co-Temporal Modeling Algorithms on Sparse Experimental Time Series Data Sets.

Science.gov (United States)

Allen, Edward E; Norris, James L; John, David J; Thomas, Stan J; Turkett, William H; Fetrow, Jacquelyn S

2010-01-01

Multiple approaches for reverse-engineering biological networks from time-series data have been proposed in the computational biology literature. These approaches can be classified by their underlying mathematical algorithms, such as Bayesian or algebraic techniques, as well as by their time paradigm, which includes next-state and co-temporal modeling. The types of biological relationships, such as parent-child or siblings, discovered by these algorithms are quite varied. It is important to understand the strengths and weaknesses of the various algorithms and time paradigms on actual experimental data. We assess how well the co-temporal implementations of three algorithms, continuous Bayesian, discrete Bayesian, and computational algebraic, can 1) identify two types of entity relationships, parent and sibling, between biological entities, 2) deal with experimental sparse time course data, and 3) handle experimental noise seen in replicate data sets. These algorithms are evaluated, using the shuffle index metric, for how well the resulting models match literature models in terms of siblings and parent relationships. Results indicate that all three co-temporal algorithms perform well, at a statistically significant level, at finding sibling relationships, but perform relatively poorly in finding parent relationships.

Performances of the New Real Time Tsunami Detection Algorithm applied to tide gauges data

Science.gov (United States)

Chierici, F.; Embriaco, D.; Morucci, S.

2017-12-01

Real-time tsunami detection algorithms play a key role in any Tsunami Early Warning System. We have developed a new algorithm for tsunami detection (TDA) based on the real-time tide removal and real-time band-pass filtering of seabed pressure time series acquired by Bottom Pressure Recorders. The TDA algorithm greatly increases the tsunami detection probability, shortens the detection delay and enhances detection reliability with respect to the most widely used tsunami detection algorithm, while containing the computational cost. The algorithm is designed to be used also in autonomous early warning systems with a set of input parameters and procedures which can be reconfigured in real time. We have also developed a methodology based on Monte Carlo simulations to test the tsunami detection algorithms. The algorithm performance is estimated by defining and evaluating statistical parameters, namely the detection probability, the detection delay, which are functions of the tsunami amplitude and wavelength, and the occurring rate of false alarms. In this work we present the performance of the TDA algorithm applied to tide gauge data. We have adapted the new tsunami detection algorithm and the Monte Carlo test methodology to tide gauges. Sea level data acquired by coastal tide gauges in different locations and environmental conditions have been used in order to consider real working scenarios in the test. We also present an application of the algorithm to the tsunami event generated by Tohoku earthquake on March 11th 2011, using data recorded by several tide gauges scattered all over the Pacific area.

Arbitrary Phase Vocoders by means of Warping

Directory of Open Access Journals (Sweden)

Gianpaolo Evangelista

2013-08-01

Full Text Available The Phase Vocoder plays a central role in sound analysis and synthesis, allowing us to represent a sound signal in both time and frequency, similar to a music score – but possibly at much finer time and frequency scales – describing the evolution of sound events. According to the uncertainty principle, time and frequency are not independent variables so that any time-frequency representation is the result of a compromise between time and frequency resolutions, the product of which cannot be smaller than a given constant. Therefore, finer frequency resolution can only be achieved with coarser time resolution and, similarly, finer time resolution results in coarser frequency resolution.While most of the conventional methods for time-frequency representations are based on uniform time and uniform frequency resolutions, perception and physical characteristics of sound signals suggest the need for nonuniform analysis and synthesis. As the results of psycho-acoustic research show, human hearing is naturally organized in nonuniform frequency bands. On the physical side, the sounds of percussive instruments as well as piano in the low register, show partials whose frequencies are not uniformly spaced, as opposed to the uniformly spaced partial frequencies found in harmonic sounds. Moreover, the different characteristics of sound signals at the onset transients with respect to stationary segments suggest the need for nonuniform time resolution. In the effort to exploit the time-frequency resolution compromise at its best, a tight time-frequency suit should be tailored to snuggly fit the sound body.In this paper we overview flexible design methods for phase vocoders with nonuniform resolutions. The methods are based on remapping the time or the frequency axis, or both, by employing suitable functions acting as warping maps, which locally change the characteristics of the time-frequency plane. As a result, the sliding windows may have time dependent

Stability of zero-mode Landau levels in bilayer graphene against disorder in the presence of the trigonal warping

International Nuclear Information System (INIS)

Kawarabayashi, Tohru; Hasugai, Yasuhiro; Aoki, Hideo

2013-01-01

The stability of the zero-energy Landau levels in bilayer graphene against the chiral symmetric disorder is examined in the presence of the trigonal warping. Based on the tight-binding lattice model with a bond disorder correlated over several lattice constants, it is shown that among the four Landau levels per spin and per valley, two Landau levels exhibit the anomalous sharpness as in the absence of the trigonal warping, while the other two are broadened, yielding split peaks in the density of states. This can be attributed to the fact that the total chirality in each valley is ±2, which is protected topologically even in the presence of an intra-valley scattering due to disorder

Real Time Search Algorithm for Observation Outliers During Monitoring Engineering Constructions

Science.gov (United States)

Latos, Dorota; Kolanowski, Bogdan; Pachelski, Wojciech; Sołoducha, Ryszard

2017-12-01

Real time monitoring of engineering structures in case of an emergency of disaster requires collection of a large amount of data to be processed by specific analytical techniques. A quick and accurate assessment of the state of the object is crucial for a probable rescue action. One of the more significant evaluation methods of large sets of data, either collected during a specified interval of time or permanently, is the time series analysis. In this paper presented is a search algorithm for those time series elements which deviate from their values expected during monitoring. Quick and proper detection of observations indicating anomalous behavior of the structure allows to take a variety of preventive actions. In the algorithm, the mathematical formulae used provide maximal sensitivity to detect even minimal changes in the object's behavior. The sensitivity analyses were conducted for the algorithm of moving average as well as for the Douglas-Peucker algorithm used in generalization of linear objects in GIS. In addition to determining the size of deviations from the average it was used the so-called Hausdorff distance. The carried out simulation and verification of laboratory survey data showed that the approach provides sufficient sensitivity for automatic real time analysis of large amount of data obtained from different and various sensors (total stations, leveling, camera, radar).

Real Time Search Algorithm for Observation Outliers During Monitoring Engineering Constructions

Directory of Open Access Journals (Sweden)

Latos Dorota

2017-12-01

Full Text Available Real time monitoring of engineering structures in case of an emergency of disaster requires collection of a large amount of data to be processed by specific analytical techniques. A quick and accurate assessment of the state of the object is crucial for a probable rescue action. One of the more significant evaluation methods of large sets of data, either collected during a specified interval of time or permanently, is the time series analysis. In this paper presented is a search algorithm for those time series elements which deviate from their values expected during monitoring. Quick and proper detection of observations indicating anomalous behavior of the structure allows to take a variety of preventive actions. In the algorithm, the mathematical formulae used provide maximal sensitivity to detect even minimal changes in the object’s behavior. The sensitivity analyses were conducted for the algorithm of moving average as well as for the Douglas-Peucker algorithm used in generalization of linear objects in GIS. In addition to determining the size of deviations from the average it was used the so-called Hausdorff distance. The carried out simulation and verification of laboratory survey data showed that the approach provides sufficient sensitivity for automatic real time analysis of large amount of data obtained from different and various sensors (total stations, leveling, camera, radar.

Generating a normalized geometric liver model with warping

International Nuclear Information System (INIS)

Boes, J.L.; Weymouth, T.E.; Meyer, C.R.; Quint, L.E.; Bland, P.H.; Bookstein, F.L.

1990-01-01

This paper reports on the automated determination of the liver surface in abdominal CT scans for radiation treatment, surgery planning, and anatomic visualization. The normalized geometric model of the liver is generated by averaging registered outlines from a set of 15 studies of normal liver. The outlines have been registered with the use of thin-plate spline warping based on a set of five homologous landmarks. Thus, the model consists of an average of the surface and a set of five anatomic landmarks. The accuracy of the model is measured against both the set of studies used in model generation and an alternate set of 15 normal studies with use of, as an error measure, the ratio of nonoverlapping model and study volume to total model volume

Semi-automated Anatomical Labeling and Inter-subject Warping of High-Density Intracranial Recording Electrodes in Electrocorticography

Directory of Open Access Journals (Sweden)

Liberty S. Hamilton

2017-10-01

Full Text Available In this article, we introduce img_pipe, our open source python package for preprocessing of imaging data for use in intracranial electrocorticography (ECoG and intracranial stereo-EEG analyses. The process of electrode localization, labeling, and warping for use in ECoG currently varies widely across laboratories, and it is usually performed with custom, lab-specific code. This python package aims to provide a standardized interface for these procedures, as well as code to plot and display results on 3D cortical surface meshes. It gives the user an easy interface to create anatomically labeled electrodes that can also be warped to an atlas brain, starting with only a preoperative T1 MRI scan and a postoperative CT scan. We describe the full capabilities of our imaging pipeline and present a step-by-step protocol for users.

Evaluation of focused ultrasound algorithms: Issues for reducing pre-focal heating and treatment time.

Science.gov (United States)

Yiannakou, Marinos; Trimikliniotis, Michael; Yiallouras, Christos; Damianou, Christakis

2016-02-01

Due to the heating in the pre-focal field the delay between successive movements in high intensity focused ultrasound (HIFU) are sometimes as long as 60s, resulting to treatment time in the order of 2-3h. Because there is generally a requirement to reduce treatment time, we were motivated to explore alternative transducer motion algorithms in order to reduce pre-focal heating and treatment time. A 1 MHz single element transducer with 4 cm diameter and 10 cm focal length was used. A simulation model was developed that estimates the temperature, thermal dose and lesion development in the pre-focal field. The simulated temperature history that was combined with the motion algorithms produced thermal maps in the pre-focal region. Polyacrylimde gel phantom was used to evaluate the induced pre-focal heating for each motion algorithm used, and also was used to assess the accuracy of the simulation model. Three out of the six algorithms having successive steps close to each other, exhibited severe heating in the pre-focal field. Minimal heating was produced with the algorithms having successive steps apart from each other (square, square spiral and random). The last three algorithms were improved further (with small cost in time), thus eliminating completely the pre-focal heating and reducing substantially the treatment time as compared to traditional algorithms. Out of the six algorithms, 3 were successful in eliminating the pre-focal heating completely. Because these 3 algorithms required no delay between successive movements (except in the last part of the motion), the treatment time was reduced by 93%. Therefore, it will be possible in the future, to achieve treatment time of focused ultrasound therapies shorter than 30 min. The rate of ablated volume achieved with one of the proposed algorithms was 71 cm(3)/h. The intention of this pilot study was to demonstrate that the navigation algorithms play the most important role in reducing pre-focal heating. By evaluating in

Night-Time Vehicle Detection Algorithm Based on Visual Saliency and Deep Learning

Directory of Open Access Journals (Sweden)

Yingfeng Cai

2016-01-01

Full Text Available Night vision systems get more and more attention in the field of automotive active safety field. In this area, a number of researchers have proposed far-infrared sensor based night-time vehicle detection algorithm. However, existing algorithms have low performance in some indicators such as the detection rate and processing time. To solve this problem, we propose a far-infrared image vehicle detection algorithm based on visual saliency and deep learning. Firstly, most of the nonvehicle pixels will be removed with visual saliency computation. Then, vehicle candidate will be generated by using prior information such as camera parameters and vehicle size. Finally, classifier trained with deep belief networks will be applied to verify the candidates generated in last step. The proposed algorithm is tested in around 6000 images and achieves detection rate of 92.3% and processing time of 25 Hz which is better than existing methods.

Phi-s correlation and dynamic time warping - Two methods for tracking ice floes in SAR images

Science.gov (United States)

Mcconnell, Ross; Kober, Wolfgang; Kwok, Ronald; Curlander, John C.; Pang, Shirley S.

1991-01-01

The authors present two algorithms for performing shape matching on ice floe boundaries in SAR (synthetic aperture radar) images. These algorithms quickly produce a set of ice motion and rotation vectors that can be used to guide a pixel value correlator. The algorithms match a shape descriptor known as the Phi-s curve. The first algorithm uses normalized correlation to match the Phi-s curves, while the second uses dynamic programming to compute an elastic match that better accommodates ice floe deformation. Some empirical data on the performance of the algorithms on Seasat SAR images are presented.

A Scalable GVT Estimation Algorithm for PDES: Using Lower Bound of Event-Bulk-Time

Directory of Open Access Journals (Sweden)

Yong Peng

2015-01-01

Full Text Available Global Virtual Time computation of Parallel Discrete Event Simulation is crucial for conducting fossil collection and detecting the termination of simulation. The triggering condition of GVT computation in typical approaches is generally based on the wall-clock time or logical time intervals. However, the GVT value depends on the timestamps of events rather than the wall-clock time or logical time intervals. Therefore, it is difficult for the existing approaches to select appropriate time intervals to compute the GVT value. In this study, we propose a scalable GVT estimation algorithm based on Lower Bound of Event-Bulk-Time, which triggers the computation of the GVT value according to the number of processed events. In order to calculate the number of transient messages, our algorithm employs Event-Bulk to record the messages sent and received by Logical Processes. To eliminate the performance bottleneck, we adopt an overlapping computation approach to distribute the workload of GVT computation to all worker-threads. We compare our algorithm with the fast asynchronous GVT algorithm using PHOLD benchmark on the shared memory machine. Experimental results indicate that our algorithm has a light overhead and shows higher speedup and accuracy of GVT computation than the fast asynchronous GVT algorithm.

Time series classification using k-Nearest neighbours, Multilayer Perceptron and Learning Vector Quantization algorithms

Directory of Open Access Journals (Sweden)

Jiří Fejfar

2012-01-01

Full Text Available We are presenting results comparison of three artificial intelligence algorithms in a classification of time series derived from musical excerpts in this paper. Algorithms were chosen to represent different principles of classification – statistic approach, neural networks and competitive learning. The first algorithm is a classical k-Nearest neighbours algorithm, the second algorithm is Multilayer Perceptron (MPL, an example of artificial neural network and the third one is a Learning Vector Quantization (LVQ algorithm representing supervised counterpart to unsupervised Self Organizing Map (SOM.After our own former experiments with unlabelled data we moved forward to the data labels utilization, which generally led to a better accuracy of classification results. As we need huge data set of labelled time series (a priori knowledge of correct class which each time series instance belongs to, we used, with a good experience in former studies, musical excerpts as a source of real-world time series. We are using standard deviation of the sound signal as a descriptor of a musical excerpts volume level.We are describing principle of each algorithm as well as its implementation briefly, giving links for further research. Classification results of each algorithm are presented in a confusion matrix showing numbers of misclassifications and allowing to evaluate overall accuracy of the algorithm. Results are compared and particular misclassifications are discussed for each algorithm. Finally the best solution is chosen and further research goals are given.

Parallel pipeline algorithm of real time star map preprocessing

Science.gov (United States)

Wang, Hai-yong; Qin, Tian-mu; Liu, Jia-qi; Li, Zhi-feng; Li, Jian-hua

2016-03-01

To improve the preprocessing speed of star map and reduce the resource consumption of embedded system of star tracker, a parallel pipeline real-time preprocessing algorithm is presented. The two characteristics, the mean and the noise standard deviation of the background gray of a star map, are firstly obtained dynamically by the means that the intervene of the star image itself to the background is removed in advance. The criterion on whether or not the following noise filtering is needed is established, then the extraction threshold value is assigned according to the level of background noise, so that the centroiding accuracy is guaranteed. In the processing algorithm, as low as two lines of pixel data are buffered, and only 100 shift registers are used to record the connected domain label, by which the problems of resources wasting and connected domain overflow are solved. The simulating results show that the necessary data of the selected bright stars could be immediately accessed in a delay time as short as 10us after the pipeline processing of a 496×496 star map in 50Mb/s is finished, and the needed memory and registers resource total less than 80kb. To verify the accuracy performance of the algorithm proposed, different levels of background noise are added to the processed ideal star map, and the statistic centroiding error is smaller than 1/23 pixel under the condition that the signal to noise ratio is greater than 1. The parallel pipeline algorithm of real time star map preprocessing helps to increase the data output speed and the anti-dynamic performance of star tracker.

Measurement and simulation of the time-dependent behavior of the UMER source

International Nuclear Information System (INIS)

Haber, I.; Feldman, D.; Fiorito, R.; Friedman, A.; Grote, D.P.; Kishek, R.A.; Quinn, B.; Reiser, M.; Rodgers, J.; O'Shea, P.G.; Stratakis, D.; Tian, K.; Vay, J.-L.; Walter, M.

2007-01-01

Control of the time-dependent characteristics of the beam pulse, beginning when it is born from the source, is important for obtaining adequate beam intensity on a target. Recent experimental measurements combined with the new mesh-refinement capability in WARP have improved the understanding of time-dependent beam characteristics beginning at the source, as well as the predictive ability of the simulation codes. The University of Maryland Electron Ring (UMER), because of its ease of operation and flexible diagnostics has proved particularly useful for benchmarking WARP by comparing simulation to measurement. One source of significant agreement has been in the ability of three-dimensional WARP simulations to predict the onset of virtual cathode oscillations in the vicinity of the cathode grid in the UMER gun, and the subsequent measurement of the predicted oscillations

Characterizing the Spatio-Temporal Pattern of Land Surface Temperature through Time Series Clustering: Based on the Latent Pattern and Morphology

Directory of Open Access Journals (Sweden)

Huimin Liu

2018-04-01

Full Text Available Land Surface Temperature (LST is a critical component to understand the impact of urbanization on the urban thermal environment. Previous studies were inclined to apply only one snapshot to analyze the pattern and dynamics of LST without considering the non-stationarity in the temporal domain, or focus on the diurnal, seasonal, and annual pattern analysis of LST which has limited support for the understanding of how LST varies with the advancing of urbanization. This paper presents a workflow to extract the spatio-temporal pattern of LST through time series clustering by focusing on the LST of Wuhan, China, from 2002 to 2017 with a 3-year time interval with 8-day MODerate-resolution Imaging Spectroradiometer (MODIS satellite image products. The Latent pattern of LST (LLST generated by non-parametric Multi-Task Gaussian Process Modeling (MTGP and the Multi-Scale Shape Index (MSSI which characterizes the morphology of LLST are coupled for pattern recognition. Specifically, spatio-temporal patterns are discovered after the extraction of spatial patterns conducted by the incorporation of k -means and the Back-Propagation neural networks (BP-Net. The spatial patterns of the 6 years form a basic understanding about the corresponding temporal variances. For spatio-temporal pattern recognition, LLSTs and MSSIs of the 6 years are regarded as geo-referenced time series. Multiple algorithms including traditional k -means with Euclidean Distance (ED, shape-based k -means with the constrained Dynamic Time Warping ( c DTW distance measure, and the Dynamic Time Warping Barycenter Averaging (DBA centroid computation method ( k - c DBA and k -shape are applied. Ten external indexes are employed to evaluate the performance of the three algorithms and reveal k - c DBA as the optimal time series clustering algorithm for our study. The study area is divided into 17 geographical time series clusters which respectively illustrate heterogeneous temporal dynamics of LST

Language comprehension warps the mirror neuron system

Directory of Open Access Journals (Sweden)

Noah eZarr

2013-12-01

Full Text Available Is the mirror neuron system (MNS used in language understanding? According to embodied accounts of language comprehension, understanding sentences describing actions makes use of neural mechanisms of action control, including the MNS. Consequently, repeatedly comprehending sentences describing similar actions should induce adaptation of the MNS thereby warping its use in other cognitive processes such as action recognition and prediction. To test this prediction, participants read blocks of multiple sentences where each sentence in the block described transfer of objects in a direction away or toward the reader. Following each block, adaptation was measured by having participants predict the end-point of videotaped actions. The adapting sentences disrupted prediction of actions in the same direction, but a only for videos of biological motion, and b only when the effector implied by the language (e.g., the hand matched the videos. These findings are signatures of the mirror neuron system.

Language comprehension warps the mirror neuron system.

Science.gov (United States)

Zarr, Noah; Ferguson, Ryan; Glenberg, Arthur M

2013-01-01

Is the mirror neuron system (MNS) used in language understanding? According to embodied accounts of language comprehension, understanding sentences describing actions makes use of neural mechanisms of action control, including the MNS. Consequently, repeatedly comprehending sentences describing similar actions should induce adaptation of the MNS thereby warping its use in other cognitive processes such as action recognition and prediction. To test this prediction, participants read blocks of multiple sentences where each sentence in the block described transfer of objects in a direction away or toward the reader. Following each block, adaptation was measured by having participants predict the end-point of videotaped actions. The adapting sentences disrupted prediction of actions in the same direction, but (a) only for videos of biological motion, and (b) only when the effector implied by the language (e.g., the hand) matched the videos. These findings are signatures of the MNS.

Algorithmic Approach to Abstracting Linear Systems by Timed Automata

DEFF Research Database (Denmark)

Sloth, Christoffer; Wisniewski, Rafael

2011-01-01

This paper proposes an LMI-based algorithm for abstracting dynamical systems by timed automata, which enables automatic formal verification of linear systems. The proposed abstraction is based on partitioning the state space of the system using positive invariant sets, generated by Lyapunov...... functions. This partitioning ensures that the vector field of the dynamical system is transversal to all facets of the cells, which induces some desirable properties of the abstraction. The algorithm is based on identifying intersections of level sets of quadratic Lyapunov functions, and determining...

A non-minimally coupled quintom dark energy model on the warped DGP brane

International Nuclear Information System (INIS)

Nozari, K; Azizi, T; Setare, M R; Behrouz, N

2009-01-01

We construct a quintom dark energy model with two non-minimally coupled scalar fields, one quintessence and the other phantom field, confined to the warped Dvali-Gabadadze-Porrati (DGP) brane. We show that this model accounts for crossing of the phantom divide line in appropriate subspaces of the model parameter space. This crossing occurs for both normal and self-accelerating branches of this DGP-inspired setup.

Differential RF MEMS interwoven capacitor immune to residual stress warping

KAUST Repository

Elshurafa, Amro M.

2012-07-27

A RF MEMS capacitor with an interwoven structure is designed, fabricated in the PolyMUMPS process and tested in an effort to address fabrication challenges usually faced in MEMS processes. The interwoven structure was found to offer several advantages over the typical MEMS parallel-plate design including eliminating the warping caused by residual stress, eliminating the need for etching holes, suppressing stiction, reducing parasitics and providing differential capability. The quality factor of the proposed capacitor was higher than five throughout a 2–10 GHz range and the resonant frequency was in excess of 20 GHz.

Differential RF MEMS interwoven capacitor immune to residual stress warping

KAUST Repository

Elshurafa, Amro M.; Salama, Khaled N.

2012-01-01

A RF MEMS capacitor with an interwoven structure is designed, fabricated in the PolyMUMPS process and tested in an effort to address fabrication challenges usually faced in MEMS processes. The interwoven structure was found to offer several advantages over the typical MEMS parallel-plate design including eliminating the warping caused by residual stress, eliminating the need for etching holes, suppressing stiction, reducing parasitics and providing differential capability. The quality factor of the proposed capacitor was higher than five throughout a 2–10 GHz range and the resonant frequency was in excess of 20 GHz.

Magnetotelluric inversion via reverse time migration algorithm of seismic data

International Nuclear Information System (INIS)

Ha, Taeyoung; Shin, Changsoo

2007-01-01

We propose a new algorithm for two-dimensional magnetotelluric (MT) inversion. Our algorithm is an MT inversion based on the steepest descent method, borrowed from the backpropagation technique of seismic inversion or reverse time migration, introduced in the middle 1980s by Lailly and Tarantola. The steepest descent direction can be calculated efficiently by using the symmetry of numerical Green's function derived from a mixed finite element method proposed by Nedelec for Maxwell's equation, without calculating the Jacobian matrix explicitly. We construct three different objective functions by taking the logarithm of the complex apparent resistivity as introduced in the recent waveform inversion algorithm by Shin and Min. These objective functions can be naturally separated into amplitude inversion, phase inversion and simultaneous inversion. We demonstrate our algorithm by showing three inversion results for synthetic data

Moduli effective action in warped brane-world compactifications

Energy Technology Data Exchange (ETDEWEB)

Garriga, Jaume E-mail: garriga@ifae.es; Pujolas, Oriol; Tanaka, Takahiro

2003-04-07

We consider a class of 5D brane-world solutions with a power-law warp factor a(y){proportional_to}y{sup q}, and bulk dilaton with profile phi{proportional_to}lny, where y is the proper distance in the extra dimension. This class includes the heterotic M-theory brane-world of [Phys. Rev. D 59 (1999) 086001, and] and the Randall-Sundrum (RS) model as a limiting case. In general, there are two moduli fields y{sub {+-}}, corresponding to the 'positions' of two branes (which live at the fixed points of an orbifold compactification). Classically, the moduli are massless, due to a scaling symmetry of the action. However, in the absence of supersymmetry, they develop an effective potential at one loop. Local terms proportional to K{sub {+-}}{sup 4}, where K{sub {+-}}=q/y{sub {+-}} is the local curvature scale at the location of the corresponding brane, are needed in order to remove the divergences in the effective potential. Such terms break the scaling symmetry and hence they may act as stabilizers for the moduli. When the branes are very close to each other, the effective potential induced by massless bulk fields behaves like V{approx}d{sup -4}, where d is the separation between branes. When the branes are widely separated, the potentials for each one of the moduli generically develop a 'Coleman-Weinberg'-type behaviour of the form a{sup 4}(y{sub {+-}})K{sub {+-}}{sup 4}ln(K{sub {+-}}/{mu}{sub {+-}}), where {mu}{sub {+-}} are renormalization scales. In the RS case, the bulk geometry is AdS and K{sub {+-}} are equal to a constant, independent of the position of the branes, so these terms do not contribute to the mass of the moduli. However, for generic warp factor, they provide a simple stabilization mechanism. For q > or approx. 10, the observed hierarchy can be naturally generated by this potential, giving the lightest modulus a mass of order m{sub -} < or approx. TeV.

Moduli effective action in warped brane-world compactifications

International Nuclear Information System (INIS)

Garriga, Jaume; Pujolas, Oriol; Tanaka, Takahiro

2003-01-01

We consider a class of 5D brane-world solutions with a power-law warp factor a(y)∝y q , and bulk dilaton with profile phi∝lny, where y is the proper distance in the extra dimension. This class includes the heterotic M-theory brane-world of [Phys. Rev. D 59 (1999) 086001, and] and the Randall-Sundrum (RS) model as a limiting case. In general, there are two moduli fields y ± , corresponding to the 'positions' of two branes (which live at the fixed points of an orbifold compactification). Classically, the moduli are massless, due to a scaling symmetry of the action. However, in the absence of supersymmetry, they develop an effective potential at one loop. Local terms proportional to K ± 4 , where K ± =q/y ± is the local curvature scale at the location of the corresponding brane, are needed in order to remove the divergences in the effective potential. Such terms break the scaling symmetry and hence they may act as stabilizers for the moduli. When the branes are very close to each other, the effective potential induced by massless bulk fields behaves like V∼d -4 , where d is the separation between branes. When the branes are widely separated, the potentials for each one of the moduli generically develop a 'Coleman-Weinberg'-type behaviour of the form a 4 (y ± )K ± 4 ln(K ± /μ ± ), where μ ± are renormalization scales. In the RS case, the bulk geometry is AdS and K ± are equal to a constant, independent of the position of the branes, so these terms do not contribute to the mass of the moduli. However, for generic warp factor, they provide a simple stabilization mechanism. For q > or approx. 10, the observed hierarchy can be naturally generated by this potential, giving the lightest modulus a mass of order m - < or approx. TeV

Unified flavor symmetry from warped dimensions

Energy Technology Data Exchange (ETDEWEB)

Frank, Mariana, E-mail: mariana.frank@concordia.ca [Department of Physics, Concordia University, 7141 Sherbrooke St. West, Montreal, Quebec, H4B 1R6 (Canada); Hamzaoui, Cherif, E-mail: hamzaoui.cherif@uqam.ca [Groupe de Physique Théorique des Particules, Département des Sciences de la Terre et de L' Atmosphère, Université du Québec à Montréal, Case Postale 8888, Succ. Centre-Ville, Montréal, Québec, H3C 3P8 (Canada); Pourtolami, Nima, E-mail: n_pour@live.concordia.ca [Department of Physics, Concordia University, 7141 Sherbrooke St. West, Montreal, Quebec, H4B 1R6 (Canada); Toharia, Manuel, E-mail: mtoharia@physics.concordia.ca [Department of Physics, Concordia University, 7141 Sherbrooke St. West, Montreal, Quebec, H4B 1R6 (Canada)

2015-03-06

In a model of warped extra-dimensions with all matter fields in the bulk, we propose a scenario which explains all the masses and mixings of the SM fermions. In this scenario, the same flavor symmetric structure is imposed on all the fermions of the Standard Model (SM), including neutrinos. Due to the exponential sensitivity on bulk fermion masses, a small breaking of this symmetry can be greatly enhanced and produce seemingly un-symmetric hierarchical masses and small mixing angles among the charged fermion zero-modes (SM quarks and charged leptons), thus washing out visible effects of the symmetry. If the Dirac neutrinos are sufficiently localized towards the UV boundary, and the Higgs field leaking into the bulk, the neutrino mass hierarchy and flavor structure will still be largely dominated and reflect the fundamental flavor structure, whereas localization of the quark sector would reflect the effects of the flavor symmetry breaking sector. We explore these features in an example based on which a family permutation symmetry is imposed in both quark and lepton sectors.

Observation of antiphase coherent phonons in the warped Dirac cone of Bi2Te3

Science.gov (United States)

Golias, E.; Sánchez-Barriga, J.

2016-10-01

In this Rapid Communication we investigate the coupling between excited electrons and phonons in the highly anisotropic electronic structure of the prototypical topological insulator Bi2Te3 . Using time- and angle-resolved photoemission spectroscopy we are able to identify the emergence and ultrafast temporal evolution of the longitudinal-optical A1 g coherent-phonon mode in Bi2Te3 . We observe an antiphase behavior in the onset of the coherent-phonon oscillations between the Γ K ¯ and the Γ M ¯ high-symmetry directions that is consistent with warping. The qualitative agreement between our density-functional theory calculations and the experimental results reveals the critical role of the anisotropic coupling between Dirac fermions and phonon modes in the topological insulator Bi2Te3 .

Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax

DEFF Research Database (Denmark)

Krejca, Martin S.; Witt, Carsten

2017-01-01

The Univariate Marginal Distribution Algorithm (UMDA), a popular estimation of distribution algorithm, is studied from a run time perspective. On the classical OneMax benchmark function, a lower bound of Ω(μ√n + n log n), where μ is the population size, on its expected run time is proved...... values maintained by the algorithm, including carefully designed potential functions. These techniques may prove useful in advancing the field of run time analysis for estimation of distribution algorithms in general........ This is the first direct lower bound on the run time of the UMDA. It is stronger than the bounds that follow from general black-box complexity theory and is matched by the run time of many evolutionary algorithms. The results are obtained through advanced analyses of the stochastic change of the frequencies of bit...

A real-time MTFC algorithm of space remote-sensing camera based on FPGA

Science.gov (United States)

Zhao, Liting; Huang, Gang; Lin, Zhe

2018-01-01

A real-time MTFC algorithm of space remote-sensing camera based on FPGA was designed. The algorithm can provide real-time image processing to enhance image clarity when the remote-sensing camera running on-orbit. The image restoration algorithm adopted modular design. The MTF measurement calculation module on-orbit had the function of calculating the edge extension function, line extension function, ESF difference operation, normalization MTF and MTFC parameters. The MTFC image filtering and noise suppression had the function of filtering algorithm and effectively suppressing the noise. The algorithm used System Generator to design the image processing algorithms to simplify the design structure of system and the process redesign. The image gray gradient dot sharpness edge contrast and median-high frequency were enhanced. The image SNR after recovery reduced less than 1 dB compared to the original image. The image restoration system can be widely used in various fields.

Algorithms and programming tools for image processing on the MPP, part 2

Science.gov (United States)

Reeves, Anthony P.

1986-01-01

A number of algorithms were developed for image warping and pyramid image filtering. Techniques were investigated for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some utilities for dealing with very long vectors and for sorting were developed. Documentation pages for the algorithms which are available for distribution are given. The performance of the MPP for a number of basic data manipulations was determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications. The Parallel Pascal development system, which is a portable programming environment for the MPP, was improved and better documentation including a tutorial was written. This environment allows programs for the MPP to be developed on any conventional computer system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions. The algorithms were tested on the MPP and a presentation on the development system was made to the MPP users group. The UNIX version of the Parallel Pascal System was distributed to a number of new sites.

A MODIFIED GIFFLER AND THOMPSON ALGORITHM COMBINED WITH DYNAMIC SLACK TIME FOR SOLVING DYNAMIC SCHEDULE PROBLEMS

Directory of Open Access Journals (Sweden)

Tanti Octavia

2003-01-01

Full Text Available A Modified Giffler and Thompson algorithm combined with dynamic slack time is used to allocate machines resources in dynamic nature. It was compared with a Real Time Order Promising (RTP algorithm. The performance of modified Giffler and Thompson and RTP algorithms are measured by mean tardiness. The result shows that modified Giffler and Thompson algorithm combined with dynamic slack time provides significantly better result compared with RTP algorithm in terms of mean tardiness.

Development of seersucker fabrics using single warp beam and modelling of their stretch-recovery behaviour

NARCIS (Netherlands)

Maqsood, Muhammad

2014-01-01

Seersucker is a thin and puckered fabric used to make clothing for spring. Due to its specific structure, this fabric is held away from the skin when worn, facilitating heat dissipation and air circulation. Seersucker is produced by slack tension weaving using two warp beams. Due to the use of two

Time Optimized Algorithm for Web Document Presentation Adaptation

DEFF Research Database (Denmark)

Pan, Rong; Dolog, Peter

2010-01-01

Currently information on the web is accessed through different devices. Each device has its own properties such as resolution, size, and capabilities to display information in different format and so on. This calls for adaptation of information presentation for such platforms. This paper proposes...... content-optimized and time-optimized algorithms for information presentation adaptation for different devices based on its hierarchical model. The model is formalized in order to experiment with different algorithms.......Currently information on the web is accessed through different devices. Each device has its own properties such as resolution, size, and capabilities to display information in different format and so on. This calls for adaptation of information presentation for such platforms. This paper proposes...

Implementation of Tree and Butterfly Barriers with Optimistic Time Management Algorithms for Discrete Event Simulation

Science.gov (United States)

Rizvi, Syed S.; Shah, Dipali; Riasat, Aasia

The Time Wrap algorithm [3] offers a run time recovery mechanism that deals with the causality errors. These run time recovery mechanisms consists of rollback, anti-message, and Global Virtual Time (GVT) techniques. For rollback, there is a need to compute GVT which is used in discrete-event simulation to reclaim the memory, commit the output, detect the termination, and handle the errors. However, the computation of GVT requires dealing with transient message problem and the simultaneous reporting problem. These problems can be dealt in an efficient manner by the Samadi's algorithm [8] which works fine in the presence of causality errors. However, the performance of both Time Wrap and Samadi's algorithms depends on the latency involve in GVT computation. Both algorithms give poor latency for large simulation systems especially in the presence of causality errors. To improve the latency and reduce the processor ideal time, we implement tree and butterflies barriers with the optimistic algorithm. Our analysis shows that the use of synchronous barriers such as tree and butterfly with the optimistic algorithm not only minimizes the GVT latency but also minimizes the processor idle time.

Timing Metrics of Joint Timing and Carrier-Frequency Offset Estimation Algorithms for TDD-based OFDM systems

NARCIS (Netherlands)

Hoeksema, F.W.; Srinivasan, R.; Schiphorst, Roelof; Slump, Cornelis H.

2004-01-01

In joint timing and carrier offset estimation algorithms for Time Division Duplexing (TDD) OFDM systems, different timing metrics are proposed to determine the beginning of a burst or symbol. In this contribution we investigated the different timing metrics in order to establish their impact on the

Contributed Review: Source-localization algorithms and applications using time of arrival and time difference of arrival measurements

Energy Technology Data Exchange (ETDEWEB)

Li, Xinya [Energy and Environment Directorate, Pacific Northwest National Laboratory, Richland, Washington 99352, USA; Deng, Zhiqun Daniel [Energy and Environment Directorate, Pacific Northwest National Laboratory, Richland, Washington 99352, USA; Rauchenstein, Lynn T. [Energy and Environment Directorate, Pacific Northwest National Laboratory, Richland, Washington 99352, USA; Carlson, Thomas J. [Energy and Environment Directorate, Pacific Northwest National Laboratory, Richland, Washington 99352, USA

2016-04-01

Locating the position of fixed or mobile sources (i.e., transmitters) based on received measurements from sensors is an important research area that is attracting much research interest. In this paper, we present localization algorithms using time of arrivals (TOA) and time difference of arrivals (TDOA) to achieve high accuracy under line-of-sight conditions. The circular (TOA) and hyperbolic (TDOA) location systems both use nonlinear equations that relate the locations of the sensors and tracked objects. These nonlinear equations can develop accuracy challenges because of the existence of measurement errors and efficiency challenges that lead to high computational burdens. Least squares-based and maximum likelihood-based algorithms have become the most popular categories of location estimators. We also summarize the advantages and disadvantages of various positioning algorithms. By improving measurement techniques and localization algorithms, localization applications can be extended into the signal-processing-related domains of radar, sonar, the Global Positioning System, wireless sensor networks, underwater animal tracking, mobile communications, and multimedia.

The impact of emerging technology on nursing care: warp speed ahead.

Science.gov (United States)

Huston, Carol

2013-05-31

While myriad forces are changing the face of contemporary healthcare, one could argue that nothing will change the way nursing is practiced more than current advances in technology. Indeed, technology is changing the world at warp speed and nowhere is this more evident than in healthcare settings. This article identifies seven emerging technologies that will change the practice of nursing; three skill sets nurses will need to develop to acquire, use, and integrate these emerging technologies; and four challenges nurse leaders will face in integrating this new technology.

Towards Real-Time Detection of Gait Events on Different Terrains Using Time-Frequency Analysis and Peak Heuristics Algorithm.

Science.gov (United States)

Zhou, Hui; Ji, Ning; Samuel, Oluwarotimi Williams; Cao, Yafei; Zhao, Zheyi; Chen, Shixiong; Li, Guanglin

2016-10-01

Real-time detection of gait events can be applied as a reliable input to control drop foot correction devices and lower-limb prostheses. Among the different sensors used to acquire the signals associated with walking for gait event detection, the accelerometer is considered as a preferable sensor due to its convenience of use, small size, low cost, reliability, and low power consumption. Based on the acceleration signals, different algorithms have been proposed to detect toe off (TO) and heel strike (HS) gait events in previous studies. While these algorithms could achieve a relatively reasonable performance in gait event detection, they suffer from limitations such as poor real-time performance and are less reliable in the cases of up stair and down stair terrains. In this study, a new algorithm is proposed to detect the gait events on three walking terrains in real-time based on the analysis of acceleration jerk signals with a time-frequency method to obtain gait parameters, and then the determination of the peaks of jerk signals using peak heuristics. The performance of the newly proposed algorithm was evaluated with eight healthy subjects when they were walking on level ground, up stairs, and down stairs. Our experimental results showed that the mean F1 scores of the proposed algorithm were above 0.98 for HS event detection and 0.95 for TO event detection on the three terrains. This indicates that the current algorithm would be robust and accurate for gait event detection on different terrains. Findings from the current study suggest that the proposed method may be a preferable option in some applications such as drop foot correction devices and leg prostheses.

Repeated Transient Jets from a Warped Disk in the Symbiotic Prototype Z And: A Link to the Long-lasting Active Phase

Science.gov (United States)

Skopal, Augustin; Tarasova, Taya. N.; Wolf, Marek; Dubovský, Pavol A.; Kudzej, Igor

2018-05-01

Active phases of some symbiotic binaries survive for a long time, from years to decades. The accretion process onto a white dwarf (WD) sustaining long-lasting activity, and sometimes leading to collimated ejection, is not well understood. We present the repeated emergence of highly collimated outflows (jets) from the symbiotic prototype Z And during its 2008 and 2009–10 outbursts and suggest their link to the current long-lasting (from 2000) active phase. We monitored Z And with high-resolution spectroscopy, multicolor UBVR C—and high time resolution—photometry. The well-pronounced bipolar jets were ejected again during the 2009–10 outburst together with the simultaneous emergence of the rapid photometric variability (Δm ≈ 0.06 mag) on the timescale of hours, showing similar properties as those during the 2006 outburst. These phenomena and the measured disk–jets connection could be caused by the radiation-induced warping of the inner disk due to a significant increase of the burning WD luminosity. Ejection of transient jets by Z And around outburst maxima signals a transient accretion at rates above the upper limit of the stable hydrogen burning on the WD surface, and thus proves the nature of Z And-type outbursts. The enhanced accretion through the disk warping, supplemented by the accretion from the giant’s wind, can keep a high luminosity of the WD for a long time, until depletion of the disk. In this way, the jets provide a link to long-lasting active phases of Z And.

The Stars and Gas in Outer Parts of Galaxy Disks : Extended or Truncated, Flat or Warped?

NARCIS (Netherlands)

van der Kruit, P. C.; Funes, JG; Corsini, EM

2008-01-01

I review observations of truncations of stellar disks and models for their origin, compare observations of truncations in moderately inclined galaxies to those in edge-on systems and discuss the relation between truncations and H I-warps and their systematics and origin. Truncations are a common

Fingerprinting with Wow

Science.gov (United States)

Yu, Eugene; Craver, Scott

2006-02-01

Wow, or time warping caused by speed fluctuations in analog audio equipment, provides a wealth of applications in watermarking. Very subtle temporal distortion has been used to defeat watermarks, and as components in watermarking systems. In the image domain, the analogous warping of an image's canvas has been used both to defeat watermarks and also proposed to prevent collusion attacks on fingerprinting systems. In this paper, we explore how subliminal levels of wow can be used for steganography and fingerprinting. We present both a low-bitrate robust solution and a higher-bitrate solution intended for steganographic communication. As already observed, such a fingerprinting algorithm naturally discourages collusion by averaging, owing to flanging effects when misaligned audio is averaged. Another advantage of warping is that even when imperceptible, it can be beyond the reach of compression algorithms. We use this opportunity to debunk the common misconception that steganography is impossible under "perfect compression."

Implementation of Real-Time Feedback Flow Control Algorithms on a Canonical Testbed

Science.gov (United States)

Tian, Ye; Song, Qi; Cattafesta, Louis

2005-01-01

This report summarizes the activities on "Implementation of Real-Time Feedback Flow Control Algorithms on a Canonical Testbed." The work summarized consists primarily of two parts. The first part summarizes our previous work and the extensions to adaptive ID and control algorithms. The second part concentrates on the validation of adaptive algorithms by applying them to a vibration beam test bed. Extensions to flow control problems are discussed.

GPU-accelerated algorithms for many-particle continuous-time quantum walks

Science.gov (United States)

Piccinini, Enrico; Benedetti, Claudia; Siloi, Ilaria; Paris, Matteo G. A.; Bordone, Paolo

2017-06-01

Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantum technology, including quantum search algorithms and universal quantum computation. In order to design and implement CTQWs in a realistic scenario, one needs effective simulation tools for Hamiltonians that take into account static noise and fluctuations in the lattice, i.e. Hamiltonians containing stochastic terms. To this aim, we suggest a parallel algorithm based on the Taylor series expansion of the evolution operator, and compare its performances with those of algorithms based on the exact diagonalization of the Hamiltonian or a 4th order Runge-Kutta integration. We prove that both Taylor-series expansion and Runge-Kutta algorithms are reliable and have a low computational cost, the Taylor-series expansion showing the additional advantage of a memory allocation not depending on the precision of calculation. Both algorithms are also highly parallelizable within the SIMT paradigm, and are thus suitable for GPGPU computing. In turn, we have benchmarked 4 NVIDIA GPUs and 3 quad-core Intel CPUs for a 2-particle system over lattices of increasing dimension, showing that the speedup provided by GPU computing, with respect to the OPENMP parallelization, lies in the range between 8x and (more than) 20x, depending on the frequency of post-processing. GPU-accelerated codes thus allow one to overcome concerns about the execution time, and make it possible simulations with many interacting particles on large lattices, with the only limit of the memory available on the device.

PRACTICAL CONTRIBUTIONS TO THE STUDY OF RESISTANCE ASSEMBLIES MADE WITH WARP KNITS

OpenAIRE

OANA Ioan-Pavel; OANA Dorina

2014-01-01

Based on the principle that a body to be obtained by sewing the material to provide resistance and the like in the stitching assembly, the experimental study of which developed resistance is compared with the resistance materials to effectively assembled by the assembly line. The experimental values resistance for assemblies were obtained in the testing for resistance to sliding stitch ASTM D 434 using Tinius Olsen HK5T test type machine. The assembly strength was determined for warp knit...

An Algorithm for Real-Time Pulse Waveform Segmentation and Artifact Detection in Photoplethysmograms.

Science.gov (United States)

Fischer, Christoph; Domer, Benno; Wibmer, Thomas; Penzel, Thomas

2017-03-01

Photoplethysmography has been used in a wide range of medical devices for measuring oxygen saturation, cardiac output, assessing autonomic function, and detecting peripheral vascular disease. Artifacts can render the photoplethysmogram (PPG) useless. Thus, algorithms capable of identifying artifacts are critically important. However, the published PPG algorithms are limited in algorithm and study design. Therefore, the authors developed a novel embedded algorithm for real-time pulse waveform (PWF) segmentation and artifact detection based on a contour analysis in the time domain. This paper provides an overview about PWF and artifact classifications, presents the developed PWF analysis, and demonstrates the implementation on a 32-bit ARM core microcontroller. The PWF analysis was validated with data records from 63 subjects acquired in a sleep laboratory, ergometry laboratory, and intensive care unit in equal parts. The output of the algorithm was compared with harmonized experts' annotations of the PPG with a total duration of 31.5 h. The algorithm achieved a beat-to-beat comparison sensitivity of 99.6%, specificity of 90.5%, precision of 98.5%, and accuracy of 98.3%. The interrater agreement expressed as Cohen's kappa coefficient was 0.927 and as F-measure was 0.990. In conclusion, the PWF analysis seems to be a suitable method for PPG signal quality determination, real-time annotation, data compression, and calculation of additional pulse wave metrics such as amplitude, duration, and rise time.

Real coded genetic algorithm for fuzzy time series prediction

Science.gov (United States)

Jain, Shilpa; Bisht, Dinesh C. S.; Singh, Phool; Mathpal, Prakash C.

2017-10-01

Genetic Algorithm (GA) forms a subset of evolutionary computing, rapidly growing area of Artificial Intelligence (A.I.). Some variants of GA are binary GA, real GA, messy GA, micro GA, saw tooth GA, differential evolution GA. This research article presents a real coded GA for predicting enrollments of University of Alabama. Data of Alabama University is a fuzzy time series. Here, fuzzy logic is used to predict enrollments of Alabama University and genetic algorithm optimizes fuzzy intervals. Results are compared to other eminent author works and found satisfactory, and states that real coded GA are fast and accurate.

A polynomial time algorithm for solving the maximum flow problem in directed networks

International Nuclear Information System (INIS)

Tlas, M.

2015-01-01

An efficient polynomial time algorithm for solving maximum flow problems has been proposed in this paper. The algorithm is basically based on the binary representation of capacities; it solves the maximum flow problem as a sequence of O(m) shortest path problems on residual networks with nodes and m arcs. It runs in O(m"2r) time, where is the smallest integer greater than or equal to log B , and B is the largest arc capacity of the network. A numerical example has been illustrated using this proposed algorithm.(author)

Contributed Review: Source-localization algorithms and applications using time of arrival and time difference of arrival measurements

Science.gov (United States)

Li, Xinya; Deng, Zhiqun Daniel; Rauchenstein, Lynn T.; Carlson, Thomas J.

2016-04-01

Locating the position of fixed or mobile sources (i.e., transmitters) based on measurements obtained from sensors (i.e., receivers) is an important research area that is attracting much interest. In this paper, we review several representative localization algorithms that use time of arrivals (TOAs) and time difference of arrivals (TDOAs) to achieve high signal source position estimation accuracy when a transmitter is in the line-of-sight of a receiver. Circular (TOA) and hyperbolic (TDOA) position estimation approaches both use nonlinear equations that relate the known locations of receivers and unknown locations of transmitters. Estimation of the location of transmitters using the standard nonlinear equations may not be very accurate because of receiver location errors, receiver measurement errors, and computational efficiency challenges that result in high computational burdens. Least squares and maximum likelihood based algorithms have become the most popular computational approaches to transmitter location estimation. In this paper, we summarize the computational characteristics and position estimation accuracies of various positioning algorithms. By improving methods for estimating the time-of-arrival of transmissions at receivers and transmitter location estimation algorithms, transmitter location estimation may be applied across a range of applications and technologies such as radar, sonar, the Global Positioning System, wireless sensor networks, underwater animal tracking, mobile communications, and multimedia.

Energy-Aware Real-Time Task Scheduling for Heterogeneous Multiprocessors with Particle Swarm Optimization Algorithm

Directory of Open Access Journals (Sweden)

Weizhe Zhang

2014-01-01

Full Text Available Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.

PRESENTATION OF AN ARCHITECTURAL OBJECT DESIGNED BY WARPED SURFACES

Directory of Open Access Journals (Sweden)

VELJKOVIĆ Milica

2015-06-01

Full Text Available Due to the importance of good functional solutions and aesthetic appearance of an object, modeling in architecture is the subject of this study. Application of more modern materials in architecture allows us to perform various geometric surfaces in the production of facade and roof structures. With such complex objects, it is necessary to create detailed three-dimensional models, using some of the modern software package for modeling. This paper provides an example of creating a 3D model of a modern building in whose exterior we can recognize nondevelopmental (becoming warped line-generated surfaces, primarily cylindroids and conoids. The entire process of modeling and presenting an object using augmented reality was carried out using the modern software package for visualization in architecture.

Non-minimally coupled tachyonic inflation in warped string background

International Nuclear Information System (INIS)

Chingangbam, Pravabati; Panda, Sudhakar; Deshamukhya, Atri

2005-01-01

We show that the non-minimal coupling of tachyon field to the scalar curvature, as proposed by Piao et al, with the chosen coupling parameter does not produce the effective potential where the tachyon field can roll down from T=0 to large T along the slope of the potential. We find a correct choice of the parameters which ensures this requirement and support slow-roll inflation. However, we find that the cosmological parameter found from the analysis of the theory are not in the range obtained from observations. We then invoke warped compactification and varying dilaton field over the compact manifold, as proposed by Raeymaekers, to show that in such a setup the observed parameter space can be ensured. (author)

Intermediate view reconstruction using adaptive disparity search algorithm for real-time 3D processing

Science.gov (United States)

Bae, Kyung-hoon; Park, Changhan; Kim, Eun-soo

2008-03-01

In this paper, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (ASDA) is for realtime 3-dimensional (3D) processing proposed. The proposed algorithm can reduce processing time of disparity estimation by selecting adaptive disparity search range. Also, the proposed algorithm can increase the quality of the 3D imaging. That is, by adaptively predicting the mutual correlation between stereo images pair using the proposed algorithm, the bandwidth of stereo input images pair can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and disparity vectors. From some experiments, stereo sequences of 'Pot Plant' and 'IVO', it is shown that the proposed algorithm improves the PSNRs of a reconstructed image to about 4.8 dB by comparing with that of conventional algorithms, and reduces the Synthesizing time of a reconstructed image to about 7.02 sec by comparing with that of conventional algorithms.

Development of real-time plasma analysis and control algorithms for the TCV tokamak using SIMULINK

International Nuclear Information System (INIS)

Felici, F.; Le, H.B.; Paley, J.I.; Duval, B.P.; Coda, S.; Moret, J.-M.; Bortolon, A.; Federspiel, L.; Goodman, T.P.; Hommen, G.; Karpushov, A.; Piras, F.; Pitzschke, A.; Romero, J.; Sevillano, G.; Sauter, O.; Vijvers, W.

2014-01-01

Highlights: • A new digital control system for the TCV tokamak has been commissioned. • The system is entirely programmable by SIMULINK, allowing rapid algorithm development. • Different control system nodes can run different algorithms at varying sampling times. • The previous control system functions have been emulated and improved. • New capabilities include MHD control, profile control, equilibrium reconstruction. - Abstract: One of the key features of the new digital plasma control system installed on the TCV tokamak is the possibility to rapidly design, test and deploy real-time algorithms. With this flexibility the new control system has been used for a large number of new experiments which exploit TCV's powerful actuators consisting of 16 individually controllable poloidal field coils and 7 real-time steerable electron cyclotron (EC) launchers. The system has been used for various applications, ranging from event-based real-time MHD control to real-time current diffusion simulations. These advances have propelled real-time control to one of the cornerstones of the TCV experimental program. Use of the SIMULINK graphical programming language to directly program the control system has greatly facilitated algorithm development and allowed a multitude of different algorithms to be deployed in a short time. This paper will give an overview of the developed algorithms and their application in physics experiments

Timing measurements of some tracking algorithms and suitability of FPGA's to improve the execution speed

CERN Document Server

Khomich, A; Kugel, A; Männer, R; Müller, M; Baines, J T M

2003-01-01

Some of track reconstruction algorithms which are common to all B-physics channels and standard RoI processing have been tested for execution time and assessed for suitability for speed-up by using FPGA coprocessor. The studies presented in this note were performed in the C/C++ framework, CTrig, which was the fullest set of algorithms available at the time of study For investigation of possible speed-up of algorithms most time consuming parts of TRT-LUT was implemented in VHDL for running in FPGA coprocessor board MPRACE. MPRACE (Reconfigurable Accelerator / Computing Engine) is an FPGA-Coprocessor based on Xilinx Virtex-2 FPGA and made as 64Bit/66MHz PCI card developed at the University of Mannheim. Timing measurements results for a TRT Full Scan algorithm executed on the MPRACE are presented here as well. The measurement results show a speed-up factor of ~2 for this algorithm.

Extraordinary phenomenology from warped flavor triviality

International Nuclear Information System (INIS)

Delaunay, Cedric; Gedalia, Oram; Lee, Seung J.; Perez, Gilad; Ponton, Eduardo

2011-01-01

Anarchic warped extra dimensional models provide a solution to the hierarchy problem. They can also account for the observed flavor hierarchies, but only at the expense of little hierarchy and CP problems, which naturally require a Kaluza-Klein (KK) scale beyond the LHC reach. We have recently shown that when flavor issues are decoupled, and assumed to be solved by UV physics, the framework's parameter space greatly opens. Given the possibility of a lower KK scale and composite light quarks, this class of flavor triviality models enjoys a rather exceptional phenomenology, which is the focus of this Letter. We also revisit the anarchic RS EDM problem, which requires m KK ≥12 TeV, and show that it is solved within flavor triviality models. Interestingly, our framework can induce a sizable differential tt-bar forward-backward asymmetry, and leads to an excess of massive boosted di-jet events, which may be linked to the recent findings of the CDF Collaboration. This feature may be observed by looking at the corresponding planar flow distribution, which is presented here. Finally we point out that the celebrated standard model preference towards a light Higgs is significantly reduced within our framework.

Multivariate statistical process control (MSPC) using Raman spectroscopy for in-line culture cell monitoring considering time-varying batches synchronized with correlation optimized warping (COW).

Science.gov (United States)

Liu, Ya-Juan; André, Silvère; Saint Cristau, Lydia; Lagresle, Sylvain; Hannas, Zahia; Calvosa, Éric; Devos, Olivier; Duponchel, Ludovic

2017-02-01

Multivariate statistical process control (MSPC) is increasingly popular as the challenge provided by large multivariate datasets from analytical instruments such as Raman spectroscopy for the monitoring of complex cell cultures in the biopharmaceutical industry. However, Raman spectroscopy for in-line monitoring often produces unsynchronized data sets, resulting in time-varying batches. Moreover, unsynchronized data sets are common for cell culture monitoring because spectroscopic measurements are generally recorded in an alternate way, with more than one optical probe parallelly connecting to the same spectrometer. Synchronized batches are prerequisite for the application of multivariate analysis such as multi-way principal component analysis (MPCA) for the MSPC monitoring. Correlation optimized warping (COW) is a popular method for data alignment with satisfactory performance; however, it has never been applied to synchronize acquisition time of spectroscopic datasets in MSPC application before. In this paper we propose, for the first time, to use the method of COW to synchronize batches with varying durations analyzed with Raman spectroscopy. In a second step, we developed MPCA models at different time intervals based on the normal operation condition (NOC) batches synchronized by COW. New batches are finally projected considering the corresponding MPCA model. We monitored the evolution of the batches using two multivariate control charts based on Hotelling's T 2 and Q. As illustrated with results, the MSPC model was able to identify abnormal operation condition including contaminated batches which is of prime importance in cell culture monitoring We proved that Raman-based MSPC monitoring can be used to diagnose batches deviating from the normal condition, with higher efficacy than traditional diagnosis, which would save time and money in the biopharmaceutical industry. Copyright © 2016 Elsevier B.V. All rights reserved.

IMPLEMENTATION OF A REAL-TIME STACKING ALGORITHM IN A PHOTOGRAMMETRIC DIGITAL CAMERA FOR UAVS

Directory of Open Access Journals (Sweden)

A. Audi

2017-08-01

Full Text Available In the recent years, unmanned aerial vehicles (UAVs have become an interesting tool in aerial photography and photogrammetry activities. In this context, some applications (like cloudy sky surveys, narrow-spectral imagery and night-vision imagery need a longexposure time where one of the main problems is the motion blur caused by the erratic camera movements during image acquisition. This paper describes an automatic real-time stacking algorithm which produces a high photogrammetric quality final composite image with an equivalent long-exposure time using several images acquired with short-exposure times. Our method is inspired by feature-based image registration technique. The algorithm is implemented on the light-weight IGN camera, which has an IMU sensor and a SoC/FPGA. To obtain the correct parameters for the resampling of images, the presented method accurately estimates the geometrical relation between the first and the Nth image, taking into account the internal parameters and the distortion of the camera. Features are detected in the first image by the FAST detector, than homologous points on other images are obtained by template matching aided by the IMU sensors. The SoC/FPGA in the camera is used to speed up time-consuming parts of the algorithm such as features detection and images resampling in order to achieve a real-time performance as we want to write only the resulting final image to save bandwidth on the storage device. The paper includes a detailed description of the implemented algorithm, resource usage summary, resulting processing time, resulting images, as well as block diagrams of the described architecture. The resulting stacked image obtained on real surveys doesn’t seem visually impaired. Timing results demonstrate that our algorithm can be used in real-time since its processing time is less than the writing time of an image in the storage device. An interesting by-product of this algorithm is the 3D rotation

A Space-Time Signal Decomposition Algorithm for Downlink MIMO DS-CDMA Receivers

Science.gov (United States)

Wang, Yung-Yi; Fang, Wen-Hsien; Chen, Jiunn-Tsair

We propose a dimension reduction algorithm for the receiver of the downlink of direct-sequence code-division multiple access (DS-CDMA) systems in which both the transmitters and the receivers employ antenna arrays of multiple elements. To estimate the high order channel parameters, we develop a layered architecture using dimension-reduced parameter estimation algorithms to estimate the frequency-selective multipath channels. In the proposed architecture, to exploit the space-time geometric characteristics of multipath channels, spatial beamformers and constrained (or unconstrained) temporal filters are adopted for clustered-multipath grouping and path isolation. In conjunction with the multiple access interference (MAI) suppression techniques, the proposed architecture jointly estimates the direction of arrivals, propagation delays, and fading amplitudes of the downlink fading multipaths. With the outputs of the proposed architecture, the signals of interest can then be naturally detected by using path-wise maximum ratio combining. Compared to the traditional techniques, such as the Joint-Angle-and-Delay-Estimation (JADE) algorithm for DOA-delay joint estimation and the space-time minimum mean square error (ST-MMSE) algorithm for signal detection, computer simulations show that the proposed algorithm substantially mitigate the computational complexity at the expense of only slight performance degradation.

Beam Dynamics in an Electron Lens with the Warp Particle-in-cell Code

CERN Document Server

Stancari, Giulio; Redaelli, Stefano

2014-01-01

Electron lenses are a mature technique for beam manipulation in colliders and storage rings. In an electron lens, a pulsed, magnetically confined electron beam with a given current-density profile interacts with the circulating beam to obtain the desired effect. Electron lenses were used in the Fermilab Tevatron collider for beam-beam compensation, for abort-gap clearing, and for halo scraping. They will be used in RHIC at BNL for head-on beam-beam compensation, and their application to the Large Hadron Collider for halo control is under development. At Fermilab, electron lenses will be implemented as lattice elements for nonlinear integrable optics. The design of electron lenses requires tools to calculate the kicks and wakefields experienced by the circulating beam. We use the Warp particle-in-cell code to study generation, transport, and evolution of the electron beam. For the first time, a fully 3-dimensional code is used for this purpose.

Efficient Algorithms for Segmentation of Item-Set Time Series

Science.gov (United States)

Chundi, Parvathi; Rosenkrantz, Daniel J.

We propose a special type of time series, which we call an item-set time series, to facilitate the temporal analysis of software version histories, email logs, stock market data, etc. In an item-set time series, each observed data value is a set of discrete items. We formalize the concept of an item-set time series and present efficient algorithms for segmenting a given item-set time series. Segmentation of a time series partitions the time series into a sequence of segments where each segment is constructed by combining consecutive time points of the time series. Each segment is associated with an item set that is computed from the item sets of the time points in that segment, using a function which we call a measure function. We then define a concept called the segment difference, which measures the difference between the item set of a segment and the item sets of the time points in that segment. The segment difference values are required to construct an optimal segmentation of the time series. We describe novel and efficient algorithms to compute segment difference values for each of the measure functions described in the paper. We outline a dynamic programming based scheme to construct an optimal segmentation of the given item-set time series. We use the item-set time series segmentation techniques to analyze the temporal content of three different data sets—Enron email, stock market data, and a synthetic data set. The experimental results show that an optimal segmentation of item-set time series data captures much more temporal content than a segmentation constructed based on the number of time points in each segment, without examining the item set data at the time points, and can be used to analyze different types of temporal data.

Conference: Probing the warped side of our Universe with gravitational waves and computer simulations | 16 September | Uni Dufour

CERN Multimedia

2016-01-01

Probing the warped side of our Universe with gravitational waves and computer simulations, by Kip Thorne, recipient of the Tomalla Prize for Gravity 2016.   "Probing the warped side of our Universe with gravitational waves and computer simulations" Uni Dufour - Auditorium U300 Friday, 16 September at 6 p.m.   Kip Thorne. (Photo: ©Jon Rou) Abstract: A half century ago, John Wheeler challenged his students and colleagues to explore Geometrodynamics: the nonlinear dynamics of curved spacetime. How does the curvature of spacetime behave when roiled in a storm, like a storm at sea with crashing waves. We tried to explore this, and failed. Success eluded us until two new tools became available: computer simulations, and gravitational wave observations. Thorne will describe what these have begun to teach us, and he will offer a vision for the future of Geometrodynamics.

A Speech Controlled Information-Retrieval System,

Science.gov (United States)

1983-01-01

instance, monitoring the speed of articulation continuously could lead to a faster time warping algorithm by restricting the amount of overlapping of...M E (1975) "LEX - a lexical analyser generator" CSTR 39, Bell Laboratories. ’.

A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series

Directory of Open Access Journals (Sweden)

Madeira Sara C

2009-06-01

Full Text Available Abstract Background The ability to monitor the change in expression patterns over time, and to observe the emergence of coherent temporal responses using gene expression time series, obtained from microarray experiments, is critical to advance our understanding of complex biological processes. In this context, biclustering algorithms have been recognized as an important tool for the discovery of local expression patterns, which are crucial to unravel potential regulatory mechanisms. Although most formulations of the biclustering problem are NP-hard, when working with time series expression data the interesting biclusters can be restricted to those with contiguous columns. This restriction leads to a tractable problem and enables the design of efficient biclustering algorithms able to identify all maximal contiguous column coherent biclusters. Methods In this work, we propose e-CCC-Biclustering, a biclustering algorithm that finds and reports all maximal contiguous column coherent biclusters with approximate expression patterns in time polynomial in the size of the time series gene expression matrix. This polynomial time complexity is achieved by manipulating a discretized version of the original matrix using efficient string processing techniques. We also propose extensions to deal with missing values, discover anticorrelated and scaled expression patterns, and different ways to compute the errors allowed in the expression patterns. We propose a scoring criterion combining the statistical significance of expression patterns with a similarity measure between overlapping biclusters. Results We present results in real data showing the effectiveness of e-CCC-Biclustering and its relevance in the discovery of regulatory modules describing the transcriptomic expression patterns occurring in Saccharomyces cerevisiae in response to heat stress. In particular, the results show the advantage of considering approximate patterns when compared to state of

A fast density-based clustering algorithm for real-time Internet of Things stream.

Science.gov (United States)

Amini, Amineh; Saboohi, Hadi; Wah, Teh Ying; Herawan, Tutut

2014-01-01

Data streams are continuously generated over time from Internet of Things (IoT) devices. The faster all of this data is analyzed, its hidden trends and patterns discovered, and new strategies created, the faster action can be taken, creating greater value for organizations. Density-based method is a prominent class in clustering data streams. It has the ability to detect arbitrary shape clusters, to handle outlier, and it does not need the number of clusters in advance. Therefore, density-based clustering algorithm is a proper choice for clustering IoT streams. Recently, several density-based algorithms have been proposed for clustering data streams. However, density-based clustering in limited time is still a challenging issue. In this paper, we propose a density-based clustering algorithm for IoT streams. The method has fast processing time to be applicable in real-time application of IoT devices. Experimental results show that the proposed approach obtains high quality results with low computation time on real and synthetic datasets.

Formulations and exact algorithms for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2008-01-01

In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...

Efficient quantum algorithm for computing n-time correlation functions.

Science.gov (United States)

Pedernales, J S; Di Candia, R; Egusquiza, I L; Casanova, J; Solano, E

2014-07-11

We propose a method for computing n-time correlation functions of arbitrary spinorial, fermionic, and bosonic operators, consisting of an efficient quantum algorithm that encodes these correlations in an initially added ancillary qubit for probe and control tasks. For spinorial and fermionic systems, the reconstruction of arbitrary n-time correlation functions requires the measurement of two ancilla observables, while for bosonic variables time derivatives of the same observables are needed. Finally, we provide examples applicable to different quantum platforms in the frame of the linear response theory.

Low-scale gravity mediation in warped extra dimension and collider phenomenology on hidden sector

International Nuclear Information System (INIS)

Itoh, H.; Okada, N.; Yamashita, T.

2007-01-01

We propose a new scenario of gravity-mediated supersymmetry breaking (gravity mediation) in a supersymmetric Randall-Sundrum model, where the gravity mediation takes place at a low scale due to the warped metric. We investigate collider phenomenology involving the hidden sector field, and find a possibility that the hidden sector field can be produced at the LHC and the ILC. The hidden sector may no longer be hidden. (author)

Real-time recursive hyperspectral sample and band processing algorithm architecture and implementation

CERN Document Server

Chang, Chein-I

2017-01-01

This book explores recursive architectures in designing progressive hyperspectral imaging algorithms. In particular, it makes progressive imaging algorithms recursive by introducing the concept of Kalman filtering in algorithm design so that hyperspectral imagery can be processed not only progressively sample by sample or band by band but also recursively via recursive equations. This book can be considered a companion book of author’s books, Real-Time Progressive Hyperspectral Image Processing, published by Springer in 2016. Explores recursive structures in algorithm architecture Implements algorithmic recursive architecture in conjunction with progressive sample and band processing Derives Recursive Hyperspectral Sample Processing (RHSP) techniques according to Band-Interleaved Sample/Pixel (BIS/BIP) acquisition format Develops Recursive Hyperspectral Band Processing (RHBP) techniques according to Band SeQuential (BSQ) acquisition format for hyperspectral data.

Change detection using landsat time series: A review of frequencies, preprocessing, algorithms, and applications

Science.gov (United States)

Zhu, Zhe

2017-08-01

The free and open access to all archived Landsat images in 2008 has completely changed the way of using Landsat data. Many novel change detection algorithms based on Landsat time series have been developed We present a comprehensive review of four important aspects of change detection studies based on Landsat time series, including frequencies, preprocessing, algorithms, and applications. We observed the trend that the more recent the study, the higher the frequency of Landsat time series used. We reviewed a series of image preprocessing steps, including atmospheric correction, cloud and cloud shadow detection, and composite/fusion/metrics techniques. We divided all change detection algorithms into six categories, including thresholding, differencing, segmentation, trajectory classification, statistical boundary, and regression. Within each category, six major characteristics of different algorithms, such as frequency, change index, univariate/multivariate, online/offline, abrupt/gradual change, and sub-pixel/pixel/spatial were analyzed. Moreover, some of the widely-used change detection algorithms were also discussed. Finally, we reviewed different change detection applications by dividing these applications into two categories, change target and change agent detection.

Real-time slicing algorithm for Stereolithography (STL) CAD model applied in additive manufacturing industry

Science.gov (United States)

Adnan, F. A.; Romlay, F. R. M.; Shafiq, M.

2018-04-01

Owing to the advent of the industrial revolution 4.0, the need for further evaluating processes applied in the additive manufacturing application particularly the computational process for slicing is non-trivial. This paper evaluates a real-time slicing algorithm for slicing an STL formatted computer-aided design (CAD). A line-plane intersection equation was applied to perform the slicing procedure at any given height. The application of this algorithm has found to provide a better computational time regardless the number of facet in the STL model. The performance of this algorithm is evaluated by comparing the results of the computational time for different geometry.

Time Series Modeling of Nano-Gold Immunochromatographic Assay via Expectation Maximization Algorithm.

Science.gov (United States)

Zeng, Nianyin; Wang, Zidong; Li, Yurong; Du, Min; Cao, Jie; Liu, Xiaohui

2013-12-01

In this paper, the expectation maximization (EM) algorithm is applied to the modeling of the nano-gold immunochromatographic assay (nano-GICA) via available time series of the measured signal intensities of the test and control lines. The model for the nano-GICA is developed as the stochastic dynamic model that consists of a first-order autoregressive stochastic dynamic process and a noisy measurement. By using the EM algorithm, the model parameters, the actual signal intensities of the test and control lines, as well as the noise intensity can be identified simultaneously. Three different time series data sets concerning the target concentrations are employed to demonstrate the effectiveness of the introduced algorithm. Several indices are also proposed to evaluate the inferred models. It is shown that the model fits the data very well.

A class of kernel based real-time elastography algorithms.

Science.gov (United States)

Kibria, Md Golam; Hasan, Md Kamrul

2015-08-01

In this paper, a novel real-time kernel-based and gradient-based Phase Root Seeking (PRS) algorithm for ultrasound elastography is proposed. The signal-to-noise ratio of the strain image resulting from this method is improved by minimizing the cross-correlation discrepancy between the pre- and post-compression radio frequency signals with an adaptive temporal stretching method and employing built-in smoothing through an exponentially weighted neighborhood kernel in the displacement calculation. Unlike conventional PRS algorithms, displacement due to tissue compression is estimated from the root of the weighted average of the zero-lag cross-correlation phases of the pair of corresponding analytic pre- and post-compression windows in the neighborhood kernel. In addition to the proposed one, the other time- and frequency-domain elastography algorithms (Ara et al., 2013; Hussain et al., 2012; Hasan et al., 2012) proposed by our group are also implemented in real-time using Java where the computations are serially executed or parallely executed in multiple processors with efficient memory management. Simulation results using finite element modeling simulation phantom show that the proposed method significantly improves the strain image quality in terms of elastographic signal-to-noise ratio (SNRe), elastographic contrast-to-noise ratio (CNRe) and mean structural similarity (MSSIM) for strains as high as 4% as compared to other reported techniques in the literature. Strain images obtained for the experimental phantom as well as in vivo breast data of malignant or benign masses also show the efficacy of our proposed method over the other reported techniques in the literature. Copyright © 2015 Elsevier B.V. All rights reserved.

Axion monodromy inflation with warped KK-modes

Energy Technology Data Exchange (ETDEWEB)

Hebecker, Arthur; Moritz, Jakob; Witkowski, Lukas T. [Heidelberg Univ. (Germany). Inst. for Theoretical Physics; Westphal, Alexander [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

2015-12-15

We present a particularly simple model of axion monodromy inflation: Our axion is the lowest-lying KK-mode of the RR-2-form-potential C{sub 2} in the standard Klebanov-Strassler throat. One can think of this inflaton candidate as being defined by the integral of C{sub 2} over the S{sup 2} cycle of the throat. It obtains an exponentially small mass from the IR-region in which the S{sup 2} shrinks to zero size. Crucially, the S{sup 2} cycle has to be shared between two throats, such that the second locus where the S{sup 2} shrinks is also in a warped region. Well-known problems like the potentially dangerous back-reaction of brane/antibrane pairs and explicit supersymmetry breaking are not present in our scenario. The inflaton back-reaction on the geometry turns out to be controlled by the string coupling g{sub s}. We hope that our setting is simple enough for many critical consistency issues of large-field inflation in string theory to be addressed at a quantitative level.

Axion monodromy inflation with warped KK-modes

International Nuclear Information System (INIS)

Hebecker, Arthur; Moritz, Jakob; Witkowski, Lukas T.

2015-12-01

We present a particularly simple model of axion monodromy inflation: Our axion is the lowest-lying KK-mode of the RR-2-form-potential C 2 in the standard Klebanov-Strassler throat. One can think of this inflaton candidate as being defined by the integral of C 2 over the S 2 cycle of the throat. It obtains an exponentially small mass from the IR-region in which the S 2 shrinks to zero size. Crucially, the S 2 cycle has to be shared between two throats, such that the second locus where the S 2 shrinks is also in a warped region. Well-known problems like the potentially dangerous back-reaction of brane/antibrane pairs and explicit supersymmetry breaking are not present in our scenario. The inflaton back-reaction on the geometry turns out to be controlled by the string coupling g s . We hope that our setting is simple enough for many critical consistency issues of large-field inflation in string theory to be addressed at a quantitative level.

Axion monodromy inflation with warped KK-modes

Science.gov (United States)

Hebecker, Arthur; Moritz, Jakob; Westphal, Alexander; Witkowski, Lukas T.

2016-03-01

We present a particularly simple model of axion monodromy inflation: Our axion is the lowest-lying KK-mode of the RR-2-form-potential C2 in the standard Klebanov-Strassler throat. One can think of this inflaton candidate as being defined by the integral of C2 over the S2 cycle of the throat. It obtains an exponentially small mass from the IR-region in which the S2 shrinks to zero size. Crucially, the S2 cycle has to be shared between two throats, such that the second locus where the S2 shrinks is also in a warped region. Well-known problems like the potentially dangerous back-reaction of brane/antibrane pairs and explicit supersymmetry breaking are not present in our scenario. The inflaton back-reaction on the geometry turns out to be controlled by the string coupling gs. We hope that our setting is simple enough for many critical consistency issues of large-field inflation in string theory to be addressed at a quantitative level.

Adaptive modification of the delayed feedback control algorithm with a continuously varying time delay

International Nuclear Information System (INIS)

Pyragas, V.; Pyragas, K.

2011-01-01

We propose a simple adaptive delayed feedback control algorithm for stabilization of unstable periodic orbits with unknown periods. The state dependent time delay is varied continuously towards the period of controlled orbit according to a gradient-descent method realized through three simple ordinary differential equations. We demonstrate the efficiency of the algorithm with the Roessler and Mackey-Glass chaotic systems. The stability of the controlled orbits is proven by computation of the Lyapunov exponents of linearized equations. -- Highlights: → A simple adaptive modification of the delayed feedback control algorithm is proposed. → It enables the control of unstable periodic orbits with unknown periods. → The delay time is varied continuously according to a gradient descend method. → The algorithm is embodied by three simple ordinary differential equations. → The validity of the algorithm is proven by computation of the Lyapunov exponents.

A polynomial time algorithm for checking regularity of totally normed process algebra

NARCIS (Netherlands)

Yang, F.; Huang, H.

2015-01-01

A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally normed process algebra (PA) processes is given. Its time complexity is O(n 3 +mn) O(n3+mn), where n is the number of transition rules and m is the maximal length of the rules. The algorithm works for

Accuracy evaluation of a new real-time continuous glucose monitoring algorithm in hypoglycemia

DEFF Research Database (Denmark)

Mahmoudi, Zeinab; Jensen, Morten Hasselstrøm; Johansen, Mette Dencker

2014-01-01

UNLABELLED: Abstract Background: The purpose of this study was to evaluate the performance of a new continuous glucose monitoring (CGM) calibration algorithm and to compare it with the Guardian(®) REAL-Time (RT) (Medtronic Diabetes, Northridge, CA) calibration algorithm in hypoglycemia. SUBJECTS...... AND METHODS: CGM data were obtained from 10 type 1 diabetes patients undergoing insulin-induced hypoglycemia. Data were obtained in two separate sessions using the Guardian RT CGM device. Data from the same CGM sensor were calibrated by two different algorithms: the Guardian RT algorithm and a new calibration...... algorithm. The accuracy of the two algorithms was compared using four performance metrics. RESULTS: The median (mean) of absolute relative deviation in the whole range of plasma glucose was 20.2% (32.1%) for the Guardian RT calibration and 17.4% (25.9%) for the new calibration algorithm. The mean (SD...

New time-saving predictor algorithm for multiple breath washout in adolescents

DEFF Research Database (Denmark)

Grønbæk, Jonathan; Hallas, Henrik Wegener; Arianto, Lambang

2016-01-01

BACKGROUND: Multiple breath washout (MBW) is an informative but time-consuming test. This study evaluates the uncertainty of a time-saving predictor algorithm in adolescents. METHODS: Adolescents were recruited from the Copenhagen Prospective Study on Asthma in Childhood (COPSAC2000) birth cohort...

Improved Riccati Transfer Matrix Method for Free Vibration of Non-Cylindrical Helical Springs Including Warping

Directory of Open Access Journals (Sweden)

A.M. Yu

2012-01-01

Full Text Available Free vibration equations for non-cylindrical (conical, barrel, and hyperboloidal types helical springs with noncircular cross-sections, which consist of 14 first-order ordinary differential equations with variable coefficients, are theoretically derived using spatially curved beam theory. In the formulation, the warping effect upon natural frequencies and vibrating mode shapes is first studied in addition to including the rotary inertia, the shear and axial deformation influences. The natural frequencies of the springs are determined by the use of improved Riccati transfer matrix method. The element transfer matrix used in the solution is calculated using the Scaling and Squaring method and Pad'e approximations. Three examples are presented for three types of springs with different cross-sectional shapes under clamped-clamped boundary condition. The accuracy of the proposed method has been compared with the FEM results using three-dimensional solid elements (Solid 45 in ANSYS code. Numerical results reveal that the warping effect is more pronounced in the case of non-cylindrical helical springs than that of cylindrical helical springs, which should be taken into consideration in the free vibration analysis of such springs.

Low scale gravity mediation with warped extra dimension and collider phenomenology on the hidden sector

International Nuclear Information System (INIS)

Itoh, Hideo; Okada, Nobuchika; Yamashita, Toshifumi

2006-01-01

We propose a scenario of gravity mediated supersymmetry breaking (gravity mediation) in a supersymmetric Randall-Sundrum model. In our setup, both the visible sector and the hidden sector coexist on the infrared (IR) brane. We introduce the Polonyi model as a simple hidden sector. Because of the warped metric, the effective cutoff scale on the IR brane is 'warped down', so that the gravity mediation occurs at a low scale. As a result, the gravitino is naturally the lightest superpartner (LSP) and contact interactions between the hidden and the visible sector fields become stronger. We address phenomenologies for various IR cutoff scales. In particular, we investigate collider phenomenology involving a scalar field (Polonyi field) in the hidden sector for the case with the IR cutoff around 10 TeV. We find a possibility that the hidden sector scalar can be produced at the LHC and the international linear collider (ILC). Interestingly, the scalar behaves like the Higgs boson of the standard model in the production process, while its decay process is quite different and, once produced, it will provide us with a very clean signature. The hidden sector may be no longer hidden

Double trigonal warping and the anomalous quantum Hall step in bilayer graphene with Rashba spin-orbit coupling

International Nuclear Information System (INIS)

Wang Bo; Ma Zhongshui; Zhang, C

2012-01-01

We demonstrate that the trigonal warping observed in bilayer graphene is doubled in the presence of Rashba spin-orbit (RSO) coupling, i.e. the Dirac points along the three-fold symmetry axis are doubled. There are now seven Dirac points. Furthermore, the RSO interaction breaks the electron-hole symmetry of the magnetic band structure. The most intriguing feature is that the step of the quantum Hall plateau at zero energy is four times that at finite energy. The number of Dirac points and the zero energy Hall step are only determined by the existence of RSO coupling, but are independent of the strength of the coupling. The robustness of these phenomena suggests equivalence between the RSO coupling and the topological effect in bilayer coupling.

Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis

OpenAIRE

Shmuel, Ori; Cohen, Asaf; Gurewitz, Omer

2017-01-01

Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and usually only one user may transmit at any given time. Assuming a distributed, opportunistic scheduling algorithm, we analyse the system's properties, such as delay, QoS and capacity scaling laws. Specifically, we start with analyzing the performance while \\...

From Massively Parallel Algorithms and Fluctuating Time Horizons to Nonequilibrium Surface Growth

International Nuclear Information System (INIS)

Korniss, G.; Toroczkai, Z.; Novotny, M. A.; Rikvold, P. A.

2000-01-01

We study the asymptotic scaling properties of a massively parallel algorithm for discrete-event simulations where the discrete events are Poisson arrivals. The evolution of the simulated time horizon is analogous to a nonequilibrium surface. Monte Carlo simulations and a coarse-grained approximation indicate that the macroscopic landscape in the steady state is governed by the Edwards-Wilkinson Hamiltonian. Since the efficiency of the algorithm corresponds to the density of local minima in the associated surface, our results imply that the algorithm is asymptotically scalable. (c) 2000 The American Physical Society

A real-time ECG data compression and transmission algorithm for an e-health device.

Science.gov (United States)

Lee, SangJoon; Kim, Jungkuk; Lee, Myoungho

2011-09-01

This paper introduces a real-time data compression and transmission algorithm between e-health terminals for a periodic ECGsignal. The proposed algorithm consists of five compression procedures and four reconstruction procedures. In order to evaluate the performance of the proposed algorithm, the algorithm was applied to all 48 recordings of MIT-BIH arrhythmia database, and the compress ratio (CR), percent root mean square difference (PRD), percent root mean square difference normalized (PRDN), rms, SNR, and quality score (QS) values were obtained. The result showed that the CR was 27.9:1 and the PRD was 2.93 on average for all 48 data instances with a 15% window size. In addition, the performance of the algorithm was compared to those of similar algorithms introduced recently by others. It was found that the proposed algorithm showed clearly superior performance in all 48 data instances at a compression ratio lower than 15:1, whereas it showed similar or slightly inferior PRD performance for a data compression ratio higher than 20:1. In light of the fact that the similarity with the original data becomes meaningless when the PRD is higher than 2, the proposed algorithm shows significantly better performance compared to the performance levels of other algorithms. Moreover, because the algorithm can compress and transmit data in real time, it can be served as an optimal biosignal data transmission method for limited bandwidth communication between e-health devices.

Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

Evaluation of Multiple Kernel Learning Algorithms for Crop Mapping Using Satellite Image Time-Series Data

Science.gov (United States)

Niazmardi, S.; Safari, A.; Homayouni, S.

2017-09-01

Crop mapping through classification of Satellite Image Time-Series (SITS) data can provide very valuable information for several agricultural applications, such as crop monitoring, yield estimation, and crop inventory. However, the SITS data classification is not straightforward. Because different images of a SITS data have different levels of information regarding the classification problems. Moreover, the SITS data is a four-dimensional data that cannot be classified using the conventional classification algorithms. To address these issues in this paper, we presented a classification strategy based on Multiple Kernel Learning (MKL) algorithms for SITS data classification. In this strategy, initially different kernels are constructed from different images of the SITS data and then they are combined into a composite kernel using the MKL algorithms. The composite kernel, once constructed, can be used for the classification of the data using the kernel-based classification algorithms. We compared the computational time and the classification performances of the proposed classification strategy using different MKL algorithms for the purpose of crop mapping. The considered MKL algorithms are: MKL-Sum, SimpleMKL, LPMKL and Group-Lasso MKL algorithms. The experimental tests of the proposed strategy on two SITS data sets, acquired by SPOT satellite sensors, showed that this strategy was able to provide better performances when compared to the standard classification algorithm. The results also showed that the optimization method of the used MKL algorithms affects both the computational time and classification accuracy of this strategy.

Hard Real-Time Task Scheduling in Cloud Computing Using an Adaptive Genetic Algorithm

Directory of Open Access Journals (Sweden)

Amjad Mahmood

2017-04-01

Full Text Available In the Infrastructure-as-a-Service cloud computing model, virtualized computing resources in the form of virtual machines are provided over the Internet. A user can rent an arbitrary number of computing resources to meet their requirements, making cloud computing an attractive choice for executing real-time tasks. Economical task allocation and scheduling on a set of leased virtual machines is an important problem in the cloud computing environment. This paper proposes a greedy and a genetic algorithm with an adaptive selection of suitable crossover and mutation operations (named as AGA to allocate and schedule real-time tasks with precedence constraint on heterogamous virtual machines. A comprehensive simulation study has been done to evaluate the performance of the proposed algorithms in terms of their solution quality and efficiency. The simulation results show that AGA outperforms the greedy algorithm and non-adaptive genetic algorithm in terms of solution quality.

Correlation and Stacking of Relative Paleointensity and Oxygen Isotope Data

Science.gov (United States)

Lurcock, P. C.; Channell, J. E.; Lee, D.

2012-12-01

The transformation of a depth-series into a time-series is routinely implemented in the geological sciences. This transformation often involves correlation of a depth-series to an astronomically calibrated time-series. Eyeball tie-points with linear interpolation are still regularly used, although these have the disadvantages of being non-repeatable and not based on firm correlation criteria. Two automated correlation methods are compared: the simulated annealing algorithm (Huybers and Wunsch, 2004) and the Match protocol (Lisiecki and Lisiecki, 2002). Simulated annealing seeks to minimize energy (cross-correlation) as "temperature" is slowly decreased. The Match protocol divides records into intervals, applies penalty functions that constrain accumulation rates, and minimizes the sum of the squares of the differences between two series while maintaining the data sequence in each series. Paired relative paleointensity (RPI) and oxygen isotope records, such as those from IODP Site U1308 and/or reference stacks such as LR04 and PISO, are warped using known warping functions, and then the un-warped and warped time-series are correlated to evaluate the efficiency of the correlation methods. Correlations are performed in tandem to simultaneously optimize RPI and oxygen isotope data. Noise spectra are introduced at differing levels to determine correlation efficiency as noise levels change. A third potential method, known as dynamic time warping, involves minimizing the sum of distances between correlated point pairs across the whole series. A "cost matrix" between the two series is analyzed to find a least-cost path through the matrix. This least-cost path is used to nonlinearly map the time/depth of one record onto the depth/time of another. Dynamic time warping can be expanded to more than two dimensions and used to stack multiple time-series. This procedure can improve on arithmetic stacks, which often lose coherent high-frequency content during the stacking process.

A Fast Density-Based Clustering Algorithm for Real-Time Internet of Things Stream

Science.gov (United States)

Ying Wah, Teh

2014-01-01

Data streams are continuously generated over time from Internet of Things (IoT) devices. The faster all of this data is analyzed, its hidden trends and patterns discovered, and new strategies created, the faster action can be taken, creating greater value for organizations. Density-based method is a prominent class in clustering data streams. It has the ability to detect arbitrary shape clusters, to handle outlier, and it does not need the number of clusters in advance. Therefore, density-based clustering algorithm is a proper choice for clustering IoT streams. Recently, several density-based algorithms have been proposed for clustering data streams. However, density-based clustering in limited time is still a challenging issue. In this paper, we propose a density-based clustering algorithm for IoT streams. The method has fast processing time to be applicable in real-time application of IoT devices. Experimental results show that the proposed approach obtains high quality results with low computation time on real and synthetic datasets. PMID:25110753

LHC Signals from Warped Extra Dimensions

Energy Technology Data Exchange (ETDEWEB)

Agashe, K.; Belyaev, A.; Krupovnickas, T.; Perez, G.; Virzi, J.

2006-12-06

We study production of Kaluza-Klein gluons (KKG) at the Large Hadron Collider (LHC) in the framework of a warped extra dimension with the Standard Model (SM) fields propagating in the bulk. We show that the detection of KK gluon is challenging since its production is suppressed by small couplings to the proton's constituents. Moreover, the KK gluon decaysmostly to top pairs due to an enhanced coupling and hence is broad. Nevertheless, we demonstrate that for MKKG<~;; 4 TeV, 100 fb-1 of data at the LHC can provide discovery of the KK gluon. We utilize a sizeable left-right polarization asymmetry from the KK gluon resonance to maximize the signal significance, and we explore the novel feature of extremely highly energetic"top-jets." We briefly discuss how the detection of electroweak gauge KK states (Z/W) faces a similar challenge since their leptonic decays ("golden" modes) are suppressed. Our analysis suggests that other frameworks, for example little Higgs, which rely on UV completion via strong dynamics might face similar challenges, namely (1) Suppressed production rates for the new particles (such as Z'), due to their"lightfermion-phobic" nature, and (2) Difficulties in detection since the new particles are broad and decay predominantly to third generation quarks and longitudinal gauge bosons.

LHC Signals from Warped Extra Dimensions

International Nuclear Information System (INIS)

Agashe, K.; Belyaev, A.; Krupovnickas, T.; Perez, G.; Virzi, J.

2006-01-01

We study production of Kaluza-Klein gluons (KKG) at the Large Hadron Collider (LHC) in the framework of a warped extra dimension with the Standard Model (SM) fields propagating in the bulk. We show that the detection of KK gluon is challenging since its production is suppressed by small couplings to the proton's constituents. Moreover, the KK gluon decays mostly to top pairs due to an enhanced coupling and hence is broad. Nevertheless, we demonstrate that for MKKG < 4 TeV, 100 fb-1 of data at the LHC can provide discovery of the KK gluon. We utilize a sizeable left-right polarization asymmetry from the KK gluon resonance to maximize the signal significance, and we explore the novel feature of extremely highly energetic 'top-jets'. We briefly discuss how the detection of electroweak gauge KK states (Z/W) faces a similar challenge since their leptonic decays ('golden' modes) are suppressed. Our analysis suggests that other frameworks, for example little Higgs, which rely on UV completion via strong dynamics might face similar challenges, namely (1) Suppressed production rates for the new particles (such as Z'), due to their 'light fermion-phobic' nature, and (2) Difficulties in detection since the new particles are broad and decay predominantly to third generation quarks and longitudinal gauge bosons

An Efficient Randomized Algorithm for Real-Time Process Scheduling in PicOS Operating System

Science.gov (United States)

Helmy*, Tarek; Fatai, Anifowose; Sallam, El-Sayed

PicOS is an event-driven operating environment designed for use with embedded networked sensors. More specifically, it is designed to support the concurrency in intensive operations required by networked sensors with minimal hardware requirements. Existing process scheduling algorithms of PicOS; a commercial tiny, low-footprint, real-time operating system; have their associated drawbacks. An efficient, alternative algorithm, based on a randomized selection policy, has been proposed, demonstrated, confirmed for efficiency and fairness, on the average, and has been recommended for implementation in PicOS. Simulations were carried out and performance measures such as Average Waiting Time (AWT) and Average Turn-around Time (ATT) were used to assess the efficiency of the proposed randomized version over the existing ones. The results prove that Randomized algorithm is the best and most attractive for implementation in PicOS, since it is most fair and has the least AWT and ATT on average over the other non-preemptive scheduling algorithms implemented in this paper.

A time reversal algorithm in acoustic media with Dirac measure approximations

Science.gov (United States)

Bretin, Élie; Lucas, Carine; Privat, Yannick

2018-04-01

This article is devoted to the study of a photoacoustic tomography model, where one is led to consider the solution of the acoustic wave equation with a source term writing as a separated variables function in time and space, whose temporal component is in some sense close to the derivative of the Dirac distribution at t  =  0. This models a continuous wave laser illumination performed during a short interval of time. We introduce an algorithm for reconstructing the space component of the source term from the measure of the solution recorded by sensors during a time T all along the boundary of a connected bounded domain. It is based at the same time on the introduction of an auxiliary equivalent Cauchy problem allowing to derive explicit reconstruction formula and then to use of a deconvolution procedure. Numerical simulations illustrate our approach. Finally, this algorithm is also extended to elasticity wave systems.

Comprehensive two-dimensional gas chromatography/time-of-flight mass spectrometry peak sorting algorithm.

Science.gov (United States)

Oh, Cheolhwan; Huang, Xiaodong; Regnier, Fred E; Buck, Charles; Zhang, Xiang

2008-02-01

We report a novel peak sorting method for the two-dimensional gas chromatography/time-of-flight mass spectrometry (GC x GC/TOF-MS) system. The objective of peak sorting is to recognize peaks from the same metabolite occurring in different samples from thousands of peaks detected in the analytical procedure. The developed algorithm is based on the fact that the chromatographic peaks for a given analyte have similar retention times in all of the chromatograms. Raw instrument data are first processed by ChromaTOF (Leco) software to provide the peak tables. Our algorithm achieves peak sorting by utilizing the first- and second-dimension retention times in the peak tables and the mass spectra generated during the process of electron impact ionization. The algorithm searches the peak tables for the peaks generated by the same type of metabolite using several search criteria. Our software also includes options to eliminate non-target peaks from the sorting results, e.g., peaks of contaminants. The developed software package has been tested using a mixture of standard metabolites and another mixture of standard metabolites spiked into human serum. Manual validation demonstrates high accuracy of peak sorting with this algorithm.

The Research and Test of Fast Radio Burst Real-time Search Algorithm Based on GPU Acceleration

Science.gov (United States)

Wang, J.; Chen, M. Z.; Pei, X.; Wang, Z. Q.

2017-03-01

In order to satisfy the research needs of Nanshan 25 m radio telescope of Xinjiang Astronomical Observatory (XAO) and study the key technology of the planned QiTai radio Telescope (QTT), the receiver group of XAO studied the GPU (Graphics Processing Unit) based real-time FRB searching algorithm which developed from the original FRB searching algorithm based on CPU (Central Processing Unit), and built the FRB real-time searching system. The comparison of the GPU system and the CPU system shows that: on the basis of ensuring the accuracy of the search, the speed of the GPU accelerated algorithm is improved by 35-45 times compared with the CPU algorithm.

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.

Science.gov (United States)

Ćwik, Michał; Józefczyk, Jerzy

2018-01-01

An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.

Real time algorithm temperature compensation in tunable laser / VCSEL based WDM-PON system

DEFF Research Database (Denmark)

Iglesias Olmedo, Miguel; Rodes Lopez, Roberto; Pham, Tien Thang

2012-01-01

We report on a real time experimental validation of a centralized algorithm for temperature compensation of tunable laser/VCSEL at ONU and OLT, respectively. Locking to a chosen WDM channel is shown for temperature changes over 40°C.......We report on a real time experimental validation of a centralized algorithm for temperature compensation of tunable laser/VCSEL at ONU and OLT, respectively. Locking to a chosen WDM channel is shown for temperature changes over 40°C....

An Adaptive Method for Switching between Pedestrian/Car Indoor Positioning Algorithms based on Multilayer Time Sequences

Directory of Open Access Journals (Sweden)

Zhining Gu

2018-02-01

Full Text Available Pedestrian dead reckoning (PDR positioning algorithms can be used to obtain a target’s location only for movement with step features and not for driving, for which the trilateral Bluetooth indoor positioning method can be used. In this study, to obtain the precise locations of different states (pedestrian/car using the corresponding positioning algorithms, we propose an adaptive method for switching between the PDR and car indoor positioning algorithms based on multilayer time sequences (MTSs. MTSs, which consider the behavior context, comprise two main aspects: filtering of noisy data in small-scale time sequences and using a state chain to reduce the time delay of algorithm switching in large-scale time sequences. The proposed method can be expected to realize the recognition of stationary, walking, driving, or other states; switch to the correct indoor positioning algorithm; and improve the accuracy of localization compared to using a single positioning algorithm. Our experiments show that the recognition of static, walking, driving, and other states improves by 5.5%, 45.47%, 26.23%, and 21% on average, respectively, compared with convolutional neural network (CNN method. The time delay decreases by approximately 0.5–8.5 s for the transition between states and by approximately 24 s for the entire process.

An Adaptive Method for Switching between Pedestrian/Car Indoor Positioning Algorithms based on Multilayer Time Sequences.

Science.gov (United States)

Gu, Zhining; Guo, Wei; Li, Chaoyang; Zhu, Xinyan; Guo, Tao

2018-02-27

Pedestrian dead reckoning (PDR) positioning algorithms can be used to obtain a target's location only for movement with step features and not for driving, for which the trilateral Bluetooth indoor positioning method can be used. In this study, to obtain the precise locations of different states (pedestrian/car) using the corresponding positioning algorithms, we propose an adaptive method for switching between the PDR and car indoor positioning algorithms based on multilayer time sequences (MTSs). MTSs, which consider the behavior context, comprise two main aspects: filtering of noisy data in small-scale time sequences and using a state chain to reduce the time delay of algorithm switching in large-scale time sequences. The proposed method can be expected to realize the recognition of stationary, walking, driving, or other states; switch to the correct indoor positioning algorithm; and improve the accuracy of localization compared to using a single positioning algorithm. Our experiments show that the recognition of static, walking, driving, and other states improves by 5.5%, 45.47%, 26.23%, and 21% on average, respectively, compared with convolutional neural network (CNN) method. The time delay decreases by approximately 0.5-8.5 s for the transition between states and by approximately 24 s for the entire process.

A hybrid algorithm for flexible job-shop scheduling problem with setup times

Directory of Open Access Journals (Sweden)

Ameni Azzouz

2017-01-01

Full Text Available Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a processing time depending on the resource used. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a hybrid algorithm based on genetic algorithm (GA and variable neighbourhood search (VNS to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our algorithm against the available ones in terms of solution quality.

An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems

Science.gov (United States)

1991-07-29

real - time systems in which the value of a task is proportional to its computation time. The system obtains the value of a given task if the task completes by its deadline. Otherwise, the system obtains no value for the task. When such a system is underloaded (i.e. there exists a schedule for which all tasks meet their deadlines), Dertouzos [6] showed that the earliest deadline first algorithm will achieve 100% of the possible value. We consider the case of a possibly overloaded system and present an algorithm which: 1. behaves like the earliest deadline first

Self-Consistent simulations of High-Intensity Beams and E-Clouds with WARP POSINST

International Nuclear Information System (INIS)

Vay, J.-L.; Friendman, A.; Grote, D.P.

2006-01-01

We have developed a new, comprehensive set of simulation tools aimed at modeling the interaction of intense ion beams and electron clouds (e-clouds). The set contains the 3-D accelerator PIC codeWARP and the 2-D ''slice'' ecloud code POSINST, as well as a merger of the two, augmented by new modules for impact ionization and neutral gas generation. The new capability runs on workstations or parallel supercomputers and contains advanced features such as mesh refinement, disparate adaptive time stepping, and a new ''drift-Lorentz'' particle mover for tracking charged particles in magnetic fields using large time steps. It is being applied to the modeling of ion beams (1 MeV, 180 mA, K+) for heavy ion inertial fusion and warm dense matter studies, as they interact with electron clouds in the High-Current Experiment (HCX). In earlier papers, we described the capabilities and presented recent simulation results with detailed comparisons against the HCX experiment, as well as their application (in a different regime) to the modeling of e-clouds in the Large Hadron Collider (LHC). We concentrate here on the description of the implementation of the ''quasi-static'' mode of operation, for comparison with other codes, and introduce a new consideration on the estimate of computing time between the quasi-static and the fully self-consistent modes

Using acoustic analysis to presort warp-prone ponderosa pine 2 by 4s before kiln-drying

Science.gov (United States)

Xiping Wang; William T. Simpson

2006-01-01

This study evaluated the potential of acoustic analysis as presorting criteria to identify warp-prone boards before kiln-drying. Dimension lumber, 38 by 89 mm (nominal 2 by 4 in.) and 2.44 m (8 it) long, sawn from open-grown small-diameter ponderosa pine trees, was acoustically tested lengthwise at green condition. Three acoustic properties (acoustic speed, rate of...

Modified SURF Algorithm Implementation on FPGA For Real-Time Object Tracking

Directory of Open Access Journals (Sweden)

Tomyslav Sledevič

2013-05-01

Full Text Available The paper describes the FPGA-based implementation of the modified speeded-up robust features (SURF algorithm. FPGA was selected for parallel process implementation using VHDL to ensure features extraction in real-time. A sliding 84×84 size window was used to store integral pixels and accelerate Hessian determinant calculation, orientation assignment and descriptor estimation. The local extreme searching was used to find point of interest in 8 scales. The simplified descriptor and orientation vector were calculated in parallel in 6 scales. The algorithm was investigated by tracking marker and drawing a plane or cube. All parts of algorithm worked on 25 MHz clock. The video stream was generated using 60 fps and 640×480 pixel camera.Article in Lithuanian

Time scale algorithm: Definition of ensemble time and possible uses of the Kalman filter

Science.gov (United States)

Tavella, Patrizia; Thomas, Claudine

1990-01-01

The comparative study of two time scale algorithms, devised to satisfy different but related requirements, is presented. They are ALGOS(BIPM), producing the international reference TAI at the Bureau International des Poids et Mesures, and AT1(NIST), generating the real-time time scale AT1 at the National Institute of Standards and Technology. In each case, the time scale is a weighted average of clock readings, but the weight determination and the frequency prediction are different because they are adapted to different purposes. The possibility of using a mathematical tool, such as the Kalman filter, together with the definition of the time scale as a weighted average, is also analyzed. Results obtained by simulation are presented.

Trajectory generation for an on-road autonomous vehicle

Science.gov (United States)

Horst, John; Barbera, Anthony

2006-05-01

We describe an algorithm that generates a smooth trajectory (position, velocity, and acceleration at uniformly sampled instants of time) for a car-like vehicle autonomously navigating within the constraints of lanes in a road. The technique models both vehicle paths and lane segments as straight line segments and circular arcs for mathematical simplicity and elegance, which we contrast with cubic spline approaches. We develop the path in an idealized space, warp the path into real space and compute path length, generate a one-dimensional trajectory along the path length that achieves target speeds and positions, and finally, warp, translate, and rotate the one-dimensional trajectory points onto the path in real space. The algorithm moves a vehicle in lane safely and efficiently within speed and acceleration maximums. The algorithm functions in the context of other autonomous driving functions within a carefully designed vehicle control hierarchy.

A Placement Algorithm for Capital Items that Depreciate with Time

International Nuclear Information System (INIS)

Wweru, R.M

1999-01-01

The replacement algorithm is centred on the prediction of the replacement cost and the determination of the most economical replacement policy. For items whose efficiency depreciates over their life spans e.g. machine tools, vehicles et.c; the prediction of costs involves those factors which contribute to increase operating cost, forced idle time, increase scrap, increased repair cost etc. The alternative to increased cost of operating an aging equipment is the cost of replacing the old equipment with a new one. There is some age at which the replacement of the old equipment is more economical than continuation (of the old one) at the increased operating cost (Johnson R D, Siskin B R, 1989). This algorithm uses certain cost relationships that are vital in minimization of total costs and is focused on capital equipment that depreciates with time as opposed to items with a probabilistic life span

Forecasting nonlinear chaotic time series with function expression method based on an improved genetic-simulated annealing algorithm.

Science.gov (United States)

Wang, Jun; Zhou, Bi-hua; Zhou, Shu-dao; Sheng, Zheng

2015-01-01

The paper proposes a novel function expression method to forecast chaotic time series, using an improved genetic-simulated annealing (IGSA) algorithm to establish the optimum function expression that describes the behavior of time series. In order to deal with the weakness associated with the genetic algorithm, the proposed algorithm incorporates the simulated annealing operation which has the strong local search ability into the genetic algorithm to enhance the performance of optimization; besides, the fitness function and genetic operators are also improved. Finally, the method is applied to the chaotic time series of Quadratic and Rossler maps for validation. The effect of noise in the chaotic time series is also studied numerically. The numerical results verify that the method can forecast chaotic time series with high precision and effectiveness, and the forecasting precision with certain noise is also satisfactory. It can be concluded that the IGSA algorithm is energy-efficient and superior.

An Efficient Algorithm for the Optimal Market Timing over Two Stocks

Institute of Scientific and Technical Information of China (English)

Hui Li; Hong-zhi An; Guo-fu Wu

2004-01-01

In this paper,the optimal trading strategy in timing the market by switching between two stocks is given.In order to deal with a large sample size with a fast turnaround computation time,we propose a class of recursive algorithm.A simulation is given to verify the efiectiveness of our method.

A New Profile Shape Matching Stereovision Algorithm for Real-time Human Pose and Hand Gesture Recognition

Directory of Open Access Journals (Sweden)

Dong Zhang

2014-02-01

Full Text Available This paper presents a new profile shape matching stereovision algorithm that is designed to extract 3D information in real time. This algorithm obtains 3D information by matching profile intensity shapes of each corresponding row of the stereo image pair. It detects the corresponding matching patterns of the intensity profile rather than the intensity values of individual pixels or pixels in a small neighbourhood. This approach reduces the effect of the intensity and colour variations caused by lighting differences. As with all real-time vision algorithms, there is always a trade-off between accuracy and processing speed. This algorithm achieves a balance between the two to produce accurate results for real-time applications. To demonstrate its performance, the proposed algorithm is tested for human pose and hand gesture recognition to control a smart phone and an entertainment system.

A Method Based on Dial's Algorithm for Multi-time Dynamic Traffic Assignment

Directory of Open Access Journals (Sweden)

Rongjie Kuang

2014-03-01

Full Text Available Due to static traffic assignment has poor performance in reflecting actual case and dynamic traffic assignment may incurs excessive compute cost, method of multi-time dynamic traffic assignment combining static and dynamic traffic assignment balances factors of precision and cost effectively. A method based on Dial's logit algorithm is proposed in the article to solve the dynamic stochastic user equilibrium problem in dynamic traffic assignment. Before that, a fitting function that can proximately reflect overloaded traffic condition of link is proposed and used to give corresponding model. Numerical example is given to illustrate heuristic procedure of method and to compare results with one of same example solved by other literature's algorithm. Results show that method based on Dial's algorithm is preferable to algorithm from others.

A parallel algorithm for the two-dimensional time fractional diffusion equation with implicit difference method.

Science.gov (United States)

Gong, Chunye; Bao, Weimin; Tang, Guojian; Jiang, Yuewen; Liu, Jie

2014-01-01

It is very time consuming to solve fractional differential equations. The computational complexity of two-dimensional fractional differential equation (2D-TFDE) with iterative implicit finite difference method is O(M(x)M(y)N(2)). In this paper, we present a parallel algorithm for 2D-TFDE and give an in-depth discussion about this algorithm. A task distribution model and data layout with virtual boundary are designed for this parallel algorithm. The experimental results show that the parallel algorithm compares well with the exact solution. The parallel algorithm on single Intel Xeon X5540 CPU runs 3.16-4.17 times faster than the serial algorithm on single CPU core. The parallel efficiency of 81 processes is up to 88.24% compared with 9 processes on a distributed memory cluster system. We do think that the parallel computing technology will become a very basic method for the computational intensive fractional applications in the near future.

Iris unwrapping using the Bresenham circle algorithm for real-time iris recognition

Science.gov (United States)

Carothers, Matthew T.; Ngo, Hau T.; Rakvic, Ryan N.; Broussard, Randy P.

2015-02-01

An efficient parallel architecture design for the iris unwrapping process in a real-time iris recognition system using the Bresenham Circle Algorithm is presented in this paper. Based on the characteristics of the model parameters this algorithm was chosen over the widely used polar conversion technique as the iris unwrapping model. The architecture design is parallelized to increase the throughput of the system and is suitable for processing an inputted image size of 320 × 240 pixels in real-time using Field Programmable Gate Array (FPGA) technology. Quartus software is used to implement, verify, and analyze the design's performance using the VHSIC Hardware Description Language. The system's predicted processing time is faster than the modern iris unwrapping technique used today∗.

Measuring Regional Changes in the Diastolic Deformation of the Left Ventricle of SHR Rats Using microPET Technology and Hyperelastic Warping

International Nuclear Information System (INIS)

Gullberg, Grant T; VERESS, ALEXANDER I.; WEISS, JEFFREY A.; HUESMAN, RONALD H.; REUTTER, BRYAN W.; TAYLOR, SCOTT E.; SITEK, AREK; FENG, BING; YANG, YONGFENG; GULLBERG, GRANT T.

2008-01-01

The objective of this research was to assess applicability of a technique known as hyperelastic warping for the measurement of local strains in the left ventricle (LV) directly from microPET image data sets. The technique uses differences in image intensities between template (reference) and target (loaded) image data sets to generate a body force that deforms a finite element (FE) representation of the template so that it registers with the target images. For validation, the template image was defined as the end-systolic microPET image data set from a Wistar Kyoto (WKY) rat. The target image was created by mapping the template image using the deformation results obtained from a FE model of diastolic filling. Regression analysis revealed highly significant correlations between the simulated forward FE solution and image derived warping predictions for fiber stretch (R2 = 0.96), circumferential strain (R2 = 0.96), radial strain (R2 = 0.93), and longitudinal strain (R2 = 0.76) (p < 0.001 for all cases). The technology was applied to microPET image data of two spontaneously hypertensive rats (SHR) and a WKY control. Regional analysis revealed that, the lateral freewall in the SHR subjects showed the greatest deformation compared with the other wall segments. This work indicates that warping can accurately predict the strain distributions during diastole from the analysis of microPET data sets

Measuring Regional Changes in the Diastolic Deformation of the Left Ventricle of SHR Rats Using microPET Technology and Hyperelastic Warping

Energy Technology Data Exchange (ETDEWEB)

Gullberg, Grant T; VERESS , ALEXANDER I.; WEISS, JEFFREY A.; HUESMAN, RONALD H.; REUTTER, BRYAN W.; TAYLOR , SCOTT E.; SITEK , AREK; FENG, BING; YANG , YONGFENG; GULLBERG, GRANT T.

2008-04-04

The objective of this research was to assess applicability of a technique known as hyperelastic warping for the measurement of local strains in the left ventricle (LV) directly from microPET image data sets. The technique uses differences in image intensities between template (reference) and target (loaded) image data sets to generate a body force that deforms a finite element (FE) representation of the template so that it registers with the target images. For validation, the template image was defined as the end-systolic microPET image data set from a Wistar Kyoto (WKY) rat. The target image was created by mapping the template image using the deformation results obtained from a FE model of diastolic filling. Regression analysis revealed highly significant correlations between the simulated forward FE solution and image derived warping predictions for fiber stretch (R2 = 0.96), circumferential strain (R2 = 0.96), radial strain (R2 = 0.93), and longitudinal strain (R2 = 0.76) (p<0.001for all cases). The technology was applied to microPET image data of two spontaneously hypertensive rats (SHR) and a WKY control. Regional analysis revealed that, the lateral freewall in the SHR subjects showed the greatest deformation compared with the other wall segments. This work indicates that warping can accurately predict the strain distributions during diastole from the analysis of microPET data sets.

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Directory of Open Access Journals (Sweden)

Sivashan Chetty

2015-01-01

Full Text Available The Just-In-Time (JIT scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA, is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS and Simulated Annealing (SA. SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

Preliminary test results of a flight management algorithm for fuel conservative descents in a time based metered traffic environment. [flight tests of an algorithm to minimize fuel consumption of aircraft based on flight time

Science.gov (United States)

Knox, C. E.; Cannon, D. G.

1979-01-01

A flight management algorithm designed to improve the accuracy of delivering the airplane fuel efficiently to a metering fix at a time designated by air traffic control is discussed. The algorithm provides a 3-D path with time control (4-D) for a test B 737 airplane to make an idle thrust, clean configured descent to arrive at the metering fix at a predetermined time, altitude, and airspeed. The descent path is calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard pressure and temperature effects. The flight management descent algorithms and the results of the flight tests are discussed.

Study of Confinement/Deconfinement Transition in AdS/QCD with Generalized Warp Factors

Directory of Open Access Journals (Sweden)

Shobhit Sachan

2014-01-01

Full Text Available We study analytical solutions of charged black holes and thermally charged AdS with generalized warped factors in Einstein-Maxwell-Dilaton system. We calculate Euclidean action for charged AdS and thermally charged AdS. The actions in both backgrounds are regularized by the method of background subtraction. The study of phase transition between charged black hole and thermally charged AdS gives an insight into the confinement/deconfinement transition. The plots of grand potential versus temperature and chemical potential versus transition temperature are obtained.

Equivalence between Born–Infeld tachyon and effective real scalar field theories for brane structures in warped geometry

International Nuclear Information System (INIS)

Bernardini, A.E.; Bertolami, O.

2013-01-01

An equivalence between Born–Infeld and effective real scalar field theories for brane structures is built in some specific warped space–time scenarios. Once the equations of motion for tachyon fields related to the Born–Infeld action are written as first-order equations, a simple analytical connection with a particular class of real scalar field superpotentials can be found. This equivalence leads to the conclusion that, for a certain class of superpotentials, both systems can support identical thick brane solutions as well as brane structures described through localized energy densities, T 00 (y), in the 5th dimension, y. Our results indicate that thick brane solutions realized by the Born–Infeld cosmology can be connected to real scalar field brane scenarios which can be used to effectively map the tachyon condensation mechanism

A wavelet-based PWTD algorithm-accelerated time domain surface integral equation solver

KAUST Repository

Liu, Yang; Yucel, Abdulkadir C.; Gilbert, Anna C.; Bagci, Hakan; Michielssen, Eric

2015-01-01

© 2015 IEEE. The multilevel plane-wave time-domain (PWTD) algorithm allows for fast and accurate analysis of transient scattering from, and radiation by, electrically large and complex structures. When used in tandem with marching-on-in-time (MOT

Implementation of an iteractive matching scheme for the Kapchinskij-Vladimirskij equations in the WARP code

International Nuclear Information System (INIS)

Chilton, Sven H.

2008-01-01

The WARP code is a robust electrostatic particle-in-cell simulation package used to model charged particle beams with strong space-charge forces. A fundamental operation associated with seeding detailed simulations of a beam transport channel is to generate initial conditions where the beam distribution is matched to the structure of a periodic focusing lattice. This is done by solving for periodic, matched solutions to a coupled set of ODEs called the Kapchinskij-Vladimirskij (KV) envelope equations, which describe the evolution of low-order beam moments subject to applied lattice focusing, space-charge defocusing, and thermal defocusing forces. Recently, an iterative numerical method was developed (Lund, Chilton, and Lee, Efficient computation of matched solutions to the KV envelope equations for periodic focusing lattices, Physical Review Special Topics-Accelerators and Beams 9, 064201 2006) to generate matching conditions in a highly flexible, convergent, and fail-safe manner. This method is extended and implemented in the WARP code as a Python package to vastly ease the setup of detailed simulations. In particular, the Python package accommodates any linear applied lattice focusing functions without skew coupling, and a more general set of beam parameter specifications than its predecessor. Lattice strength iteration tools were added to facilitate the implementation of problems with specific applied focusing strengths

Implementation of an iterative matching scheme for the Kapchinskij-Vladimirskij equations in the WARP code

International Nuclear Information System (INIS)

Chilton, Sven; Chilton, Sven H.

2008-01-01

The WARP code is a robust electrostatic particle-in-cell simulation package used to model charged particle beams with strong space-charge forces. A fundamental operation associated with seeding detailed simulations of a beam transport channel is to generate initial conditions where the beam distribution is matched to the structure of a periodic focusing lattice. This is done by solving for periodic, matched solutions to a coupled set of ODEs called the Kapchinskij-Vladimirskij (KV) envelope equations, which describe the evolution of low-order beam moments subject to applied lattice focusing, space-charge defocusing, and thermal defocusing forces. Recently, an iterative numerical method was developed (Lund, Chilton, and Lee, Efficient computation of matched solutions to the KV envelope equations for periodic focusing lattices, Physical Review Special Topics-Accelerators and Beams 9, 064201 2006) to generate matching conditions in a highly flexible, convergent, and fail-safe manner. This method is extended and implemented in the WARP code as a Python package to vastly ease the setup of detailed simulations. In particular, the Python package accommodates any linear applied lattice focusing functions without skew coupling, and a more general set of beam parameter specifications than its predecessor. Lattice strength iteration tools were added to facilitate the implementation of problems with specific applied focusing strengths

Algorithm for determining two-periodic steady-states in AC machines directly in time domain

Directory of Open Access Journals (Sweden)

Sobczyk Tadeusz J.

2016-09-01

Full Text Available This paper describes an algorithm for finding steady states in AC machines for the cases of their two-periodic nature. The algorithm enables to specify the steady-state solution identified directly in time domain despite of the fact that two-periodic waveforms are not repeated in any finite time interval. The basis for such an algorithm is a discrete differential operator that specifies the temporary values of the derivative of the two-periodic function in the selected set of points on the basis of the values of that function in the same set of points. It allows to develop algebraic equations defining the steady state solution reached in a chosen point set for the nonlinear differential equations describing the AC machines when electrical and mechanical equations should be solved together. That set of those values allows determining the steady state solution at any time instant up to infinity. The algorithm described in this paper is competitive with respect to the one known in literature an approach based on the harmonic balance method operated in frequency domain.

Predicting availability functions in time-dependent complex systems with SAEDES simulation algorithms

International Nuclear Information System (INIS)

Faulin, Javier; Juan, Angel A.; Serrat, Carles; Bargueno, Vicente

2008-01-01

In this paper, we propose the use of discrete-event simulation (DES) as an efficient methodology to obtain estimates of both survival and availability functions in time-dependent real systems-such as telecommunication networks or distributed computer systems. We discuss the use of DES in reliability and availability studies, not only as an alternative to the use of analytical and probabilistic methods, but also as a complementary way to: (i) achieve a better understanding of the system internal behavior and (ii) find out the relevance of each component under reliability/availability considerations. Specifically, this paper describes a general methodology and two DES algorithms, called SAEDES, which can be used to analyze a wide range of time-dependent complex systems, including those presenting multiple states, dependencies among failure/repair times or non-perfect maintenance policies. These algorithms can provide valuable information, specially during the design stages, where different scenarios can be compared in order to select a system design offering adequate reliability and availability levels. Two case studies are discussed, using a C/C++ implementation of the SAEDES algorithms, to show some potential applications of our approach

Predicting availability functions in time-dependent complex systems with SAEDES simulation algorithms

Energy Technology Data Exchange (ETDEWEB)

Faulin, Javier [Department of Statistics and Operations Research, Los Magnolios Building, First Floor, Campus Arrosadia, Public University of Navarre, 31006 Pamplona, Navarre (Spain)], E-mail: javier.faulin@unavarra.es; Juan, Angel A. [Department of Applied Mathematics I, Av. Doctor Maranon 44-50, Technical University of Catalonia, 08028 Barcelona (Spain)], E-mail: angel.alejandro.juan@upc.edu; Serrat, Carles [Department of Applied Mathematics I, Av. Doctor Maranon 44-50, Technical University of Catalonia, 08028 Barcelona (Spain)], E-mail: carles.serrat@upc.edu; Bargueno, Vicente [Department of Applied Mathematics I, ETS Ingenieros Industriales, Universidad Nacional de Educacion a Distancia, 28080 Madrid (Spain)], E-mail: vbargueno@ind.uned.es

2008-11-15

In this paper, we propose the use of discrete-event simulation (DES) as an efficient methodology to obtain estimates of both survival and availability functions in time-dependent real systems-such as telecommunication networks or distributed computer systems. We discuss the use of DES in reliability and availability studies, not only as an alternative to the use of analytical and probabilistic methods, but also as a complementary way to: (i) achieve a better understanding of the system internal behavior and (ii) find out the relevance of each component under reliability/availability considerations. Specifically, this paper describes a general methodology and two DES algorithms, called SAEDES, which can be used to analyze a wide range of time-dependent complex systems, including those presenting multiple states, dependencies among failure/repair times or non-perfect maintenance policies. These algorithms can provide valuable information, specially during the design stages, where different scenarios can be compared in order to select a system design offering adequate reliability and availability levels. Two case studies are discussed, using a C/C++ implementation of the SAEDES algorithms, to show some potential applications of our approach.

Simulation of biochemical reactions with time-dependent rates by the rejection-based algorithm

Energy Technology Data Exchange (ETDEWEB)

Thanh, Vo Hong, E-mail: vo@cosbi.eu [The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Piazza Manifattura 1, Rovereto 38068 (Italy); Priami, Corrado, E-mail: priami@cosbi.eu [The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Piazza Manifattura 1, Rovereto 38068 (Italy); Department of Mathematics, University of Trento, Trento (Italy)

2015-08-07

We address the problem of simulating biochemical reaction networks with time-dependent rates and propose a new algorithm based on our rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)]. The computation for selecting next reaction firings by our time-dependent RSSA (tRSSA) is computationally efficient. Furthermore, the generated trajectory is exact by exploiting the rejection-based mechanism. We benchmark tRSSA on different biological systems with varying forms of reaction rates to demonstrate its applicability and efficiency. We reveal that for nontrivial cases, the selection of reaction firings in existing algorithms introduces approximations because the integration of reaction rates is very computationally demanding and simplifying assumptions are introduced. The selection of the next reaction firing by our approach is easier while preserving the exactness.

Application of the Region-Time-Length algorithm to study of ...

Indian Academy of Sciences (India)

51

analyzed using the Region-Time-Length (RTL) algorithm based statistical technique. The utilized earthquake data were obtained from the International Seismological Centre. Thereafter, the homogeneity and completeness of the catalogue were improved. After performing iterative tests with different values of the r0 and t0 ...

Supersymmetric warped AdS in extended topologically massive supergravity

International Nuclear Information System (INIS)

Deger, N.S.; Kaya, A.; Samtleben, H.; Sezgin, E.

2014-01-01

We determine the most general form of off-shell N=(1,1) supergravity field configurations in three dimensions by requiring that at least one off-shell Killing spinor exists. We then impose the field equations of the topologically massive off-shell supergravity and find a class of solutions whose properties crucially depend on the norm of the auxiliary vector field. These are spacelike-squashed and timelike-stretched AdS 3 for the spacelike and timelike norms, respectively. At the transition point where the norm vanishes, the solution is null warped AdS 3 . This occurs when the coefficient of the Lorentz–Chern–Simons term is related to the AdS radius by μℓ=2. We find that the spacelike-squashed AdS 3 can be modded out by a suitable discrete subgroup of the isometry group, yielding an extremal black hole solution which avoids closed timelike curves

Effective theories and black hole production in warped compactifications

International Nuclear Information System (INIS)

Giddings, Steven B.; Katz, Emanuel

2001-01-01

We investigate aspects of the four-dimensional (4D) effective description of brane world scenarios based on warped compactification on anti-de Sitter space. The low-energy dynamics is described by visible matter gravitationally coupled to a ''dark'' conformal field theory. We give the linearized description of the 4D stress tensor corresponding to an arbitrary 5D matter distribution. In particular a 5D falling particle corresponds to a 4D expanding shell, giving a 4D interpretation of a trajectory that misses a black hole only by moving in the fifth dimension. Breakdown of the effective description occurs when either five-dimensional physics or strong gravity becomes important. In scenarios with a TeV brane, the latter can happen through the production of black holes near the TeV scale. This could provide an interesting experimental window on quantum black hole dynamics

A RECURSIVE ALGORITHM SUITABLE FOR REAL-TIME MEASUREMENT

Directory of Open Access Journals (Sweden)

Giovanni Bucci

1995-12-01

Full Text Available This paper deals with a recursive algorithm suitable for realtime measurement applications, based on an indirect technique, useful in those applications where the required quantities cannot be measured in a straightforward way. To cope with time constraints a parallel formulation of it, suitable to be implemented on multiprocessor systems, is presented. The adopted concurrent implementation is based on factorization techniques. Some experimental results related to the application of the system for carrying out measurements on synchronous motors are included.

Positioning performance analysis of the time sum of arrival algorithm with error features

Science.gov (United States)

Gong, Feng-xun; Ma, Yan-qiu

2018-03-01

The theoretical positioning accuracy of multilateration (MLAT) with the time difference of arrival (TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location performance of the time sum of arrival (TSOA) algorithm from the root mean square error ( RMSE) and geometric dilution of precision (GDOP) in additive white Gaussian noise (AWGN) environment. The TSOA localization model is constructed. Using it, the distribution of location ambiguity region is presented with 4-base stations. And then, the location performance analysis is started from the 4-base stations with calculating the RMSE and GDOP variation. Subsequently, when the location parameters are changed in number of base stations, base station layout and so on, the performance changing patterns of the TSOA location algorithm are shown. So, the TSOA location characteristics and performance are revealed. From the RMSE and GDOP state changing trend, the anti-noise performance and robustness of the TSOA localization algorithm are proved. The TSOA anti-noise performance will be used for reducing the blind-zone and the false location rate of MLAT systems.

A real-time and closed-loop control algorithm for cascaded multilevel inverter based on artificial neural network.

Science.gov (United States)

Wang, Libing; Mao, Chengxiong; Wang, Dan; Lu, Jiming; Zhang, Junfeng; Chen, Xun

2014-01-01

In order to control the cascaded H-bridges (CHB) converter with staircase modulation strategy in a real-time manner, a real-time and closed-loop control algorithm based on artificial neural network (ANN) for three-phase CHB converter is proposed in this paper. It costs little computation time and memory. It has two steps. In the first step, hierarchical particle swarm optimizer with time-varying acceleration coefficient (HPSO-TVAC) algorithm is employed to minimize the total harmonic distortion (THD) and generate the optimal switching angles offline. In the second step, part of optimal switching angles are used to train an ANN and the well-designed ANN can generate optimal switching angles in a real-time manner. Compared with previous real-time algorithm, the proposed algorithm is suitable for a wider range of modulation index and results in a smaller THD and a lower calculation time. Furthermore, the well-designed ANN is embedded into a closed-loop control algorithm for CHB converter with variable direct voltage (DC) sources. Simulation results demonstrate that the proposed closed-loop control algorithm is able to quickly stabilize load voltage and minimize the line current's THD (<5%) when subjecting the DC sources disturbance or load disturbance. In real design stage, a switching angle pulse generation scheme is proposed and experiment results verify its correctness.

A Real-Time and Closed-Loop Control Algorithm for Cascaded Multilevel Inverter Based on Artificial Neural Network

Directory of Open Access Journals (Sweden)

Libing Wang

2014-01-01

Full Text Available In order to control the cascaded H-bridges (CHB converter with staircase modulation strategy in a real-time manner, a real-time and closed-loop control algorithm based on artificial neural network (ANN for three-phase CHB converter is proposed in this paper. It costs little computation time and memory. It has two steps. In the first step, hierarchical particle swarm optimizer with time-varying acceleration coefficient (HPSO-TVAC algorithm is employed to minimize the total harmonic distortion (THD and generate the optimal switching angles offline. In the second step, part of optimal switching angles are used to train an ANN and the well-designed ANN can generate optimal switching angles in a real-time manner. Compared with previous real-time algorithm, the proposed algorithm is suitable for a wider range of modulation index and results in a smaller THD and a lower calculation time. Furthermore, the well-designed ANN is embedded into a closed-loop control algorithm for CHB converter with variable direct voltage (DC sources. Simulation results demonstrate that the proposed closed-loop control algorithm is able to quickly stabilize load voltage and minimize the line current’s THD (<5% when subjecting the DC sources disturbance or load disturbance. In real design stage, a switching angle pulse generation scheme is proposed and experiment results verify its correctness.

Real time processing of neutron monitor data using the edge editor algorithm

Directory of Open Access Journals (Sweden)

Mavromichalaki Helen

2012-09-01

Full Text Available The nucleonic component of the secondary cosmic rays is measured by the worldwide network of neutron monitors (NMs. In most cases, a NM station publishes the measured data in a real time basis in order to be available for instant use from the scientific community. The space weather centers and the online applications such as the ground level enhancement (GLE alert make use of the online data and are highly dependent on their quality. However, the primary data in some cases are distorted due to unpredictable instrument variations. For this reason, the real time primary data processing of the measured data of a station is necessary. The general operational principle of the correction algorithms is the comparison between the different channels of a NM, taking advantage of the fact that a station hosts a number of identical detectors. Median editor, Median editor plus and Super editor are some of the correction algorithms that are being used with satisfactory results. In this work an alternative algorithm is proposed and analyzed. The new algorithm uses a statistical approach to define the distribution of the measurements and introduces an error index which is used for the correction of the measurements that deviate from this distribution.

A Faster Algorithm for Solving One-Clock Priced Timed Games

DEFF Research Database (Denmark)

Hansen, Thomas Dueholm; Ibsen-Jensen, Rasmus; Miltersen, Peter Bro

2013-01-01

previously known time bound for solving one-clock priced timed games was 2O(n2+m) , due to Rutkowski. For our improvement, we introduce and study a new algorithm for solving one-clock priced timed games, based on the sweep-line technique from computational geometry and the strategy iteration paradigm from......One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m 12 n n O(1), where n is the number of states and m is the number of actions. The best...

A Faster Algorithm for Solving One-Clock Priced Timed Games

DEFF Research Database (Denmark)

Hansen, Thomas Dueholm; Ibsen-Jensen, Rasmus; Miltersen, Peter Bro

2012-01-01

previously known time bound for solving one-clock priced timed games was 2^(O(n^2+m)), due to Rutkowski. For our improvement, we introduce and study a new algorithm for solving one-clock priced timed games, based on the sweep-line technique from computational geometry and the strategy iteration paradigm from......One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m 12^n n^(O(1)), where n is the number of states and m is the number of actions. The best...