WorldWideScience

Sample records for split window algorithms

  1. Comparison Spatial Pattern of Land Surface Temperature with Mono Window Algorithm and Split Window Algorithm: A Case Study in South Tangerang, Indonesia

    Science.gov (United States)

    Bunai, Tasya; Rokhmatuloh; Wibowo, Adi

    2018-05-01

    In this paper, two methods to retrieve the Land Surface Temperature (LST) from thermal infrared data supplied by band 10 and 11 of the Thermal Infrared Sensor (TIRS) onboard the Landsat 8 is compared. The first is mono window algorithm developed by Qin et al. and the second is split window algorithm by Rozenstein et al. The purpose of this study is to perform the spatial distribution of land surface temperature, as well as to determine more accurate algorithm for retrieving land surface temperature by calculated root mean square error (RMSE). Finally, we present comparison the spatial distribution of land surface temperature by both of algorithm, and more accurate algorithm is split window algorithm refers to the root mean square error (RMSE) is 7.69° C.

  2. Window Material Daylighting Performance Assessment Algorithm: Comparing Radiosity and Split-Flux Methods

    Directory of Open Access Journals (Sweden)

    Yeo Beom Yoon

    2014-04-01

    Full Text Available Windows are the primary aperture to introduce solar radiation to the interior space of a building. This experiment explores the use of EnergyPlus software for analyzing the illuminance level on the floor of a room with reference to its distance from the window. For this experiment, a double clear glass window has been used. The preliminary modelling in EnergyPlus showed a consistent result with the experimentally monitored data in real time. EnergyPlus has two mainly used daylighting algorithms: DElight method employing radiosity technique and Detailed method employing split-flux technique. Further analysis for illuminance using DElight and Detailed methods showed significant difference in the results. Finally, we compared the algorithms of the two analysis methods in EnergyPlus.

  3. Estimation of the soil temperature from the AVHRR-NOAA satellite data applying split window algorithms

    International Nuclear Information System (INIS)

    Parra, J.C.; Acevedo, P.S.; Sobrino, J.A.; Morales, L.J.

    2006-01-01

    Four algorithms based on the technique of split-window, to estimate the land surface temperature starting from the data provided by the sensor Advanced Very High Resolution radiometer (AVHRR), on board the series of satellites of the National Oceanic and Atmospheric Administration (NOAA), are carried out. These algorithms consider corrections for atmospheric characteristics and emissivity of the different surfaces of the land. Fourteen images AVHRR-NOAA corresponding to the months of October of 2003, and January of 2004 were used. Simultaneously, measurements of soil temperature in the Carillanca hydro-meteorological station were collected in the Region of La Araucana, Chile (38 deg 41 min S; 72 deg 25 min W). Of all the used algorithms, the best results correspond to the model proposed by Sobrino and Raussoni (2000), with a media and standard deviation corresponding to the difference among the temperature of floor measure in situ and the estimated for this algorithm, of -0.06 and 2.11 K, respectively. (Author)

  4. Derivation of Land Surface Temperature for Landsat-8 TIRS Using a Split Window Algorithm

    Directory of Open Access Journals (Sweden)

    Offer Rozenstein

    2014-03-01

    Full Text Available Land surface temperature (LST is one of the most important variables measured by satellite remote sensing. Public domain data are available from the newly operational Landsat-8 Thermal Infrared Sensor (TIRS. This paper presents an adjustment of the split window algorithm (SWA for TIRS that uses atmospheric transmittance and land surface emissivity (LSE as inputs. Various alternatives for estimating these SWA inputs are reviewed, and a sensitivity analysis of the SWA to misestimating the input parameters is performed. The accuracy of the current development was assessed using simulated Modtran data. The root mean square error (RMSE of the simulated LST was calculated as 0.93 °C. This SWA development is leading to progress in the determination of LST by Landsat-8 TIRS.

  5. Generalized Split-Window Algorithm for Estimate of Land Surface Temperature from Chinese Geostationary FengYun Meteorological Satellite (FY-2C Data

    Directory of Open Access Journals (Sweden)

    Jun Xia

    2008-02-01

    Full Text Available On the basis of the radiative transfer theory, this paper addressed the estimate ofLand Surface Temperature (LST from the Chinese first operational geostationarymeteorological satellite-FengYun-2C (FY-2C data in two thermal infrared channels (IR1,10.3-11.3 μ m and IR2, 11.5-12.5 μ m , using the Generalized Split-Window (GSWalgorithm proposed by Wan and Dozier (1996. The coefficients in the GSW algorithmcorresponding to a series of overlapping ranging of the mean emissivity, the atmosphericWater Vapor Content (WVC, and the LST were derived using a statistical regressionmethod from the numerical values simulated with an accurate atmospheric radiativetransfer model MODTRAN 4 over a wide range of atmospheric and surface conditions.The simulation analysis showed that the LST could be estimated by the GSW algorithmwith the Root Mean Square Error (RMSE less than 1 K for the sub-ranges with theViewing Zenith Angle (VZA less than 30° or for the sub-rangs with VZA less than 60°and the atmospheric WVC less than 3.5 g/cm2 provided that the Land Surface Emissivities(LSEs are known. In order to determine the range for the optimum coefficients of theGSW algorithm, the LSEs could be derived from the data in MODIS channels 31 and 32 provided by MODIS/Terra LST product MOD11B1, or be estimated either according tothe land surface classification or using the method proposed by Jiang et al. (2006; and theWVC could be obtained from MODIS total precipitable water product MOD05, or beretrieved using Li et al.’ method (2003. The sensitivity and error analyses in term of theuncertainty of the LSE and WVC as well as the instrumental noise were performed. Inaddition, in order to compare the different formulations of the split-window algorithms,several recently proposed split-window algorithms were used to estimate the LST with thesame simulated FY-2C data. The result of the intercomparsion showed that most of thealgorithms give

  6. Use of GLOBE Observations to Derive a Landsat 8 Split Window Algorithm for Urban Heat Island

    Science.gov (United States)

    Fagerstrom, L.; Czajkowski, K. P.

    2017-12-01

    Surface temperature has been studied to investigate the warming of urban climates, also known as urban heat islands, which can impact urban planning, public health, pollution levels, and energy consumption. However, the full potential of remotely sensed images is limited when analyzing land surface temperature due to the daunting task of correcting for atmospheric effects. Landsat 8 has two thermal infrared sensors. With two bands in the infrared region, a split window algorithm (SWA), can be applied to correct for atmospheric effects. This project used in situ surface temperature measurements from NASA's ground observation program, the Global Learning and Observations to Benefit the Environment (GLOBE), to derive the correcting coefficients for use in the SWA. The GLOBE database provided land surface temperature data that coincided with Landsat 8 overpasses. The land surface temperature derived from Landsat 8 SWA can be used to analyze for urban heat island effect.

  7. Mort Rainey's Split Personality in Secret Window

    OpenAIRE

    Sandjaya, Cynthya; Limanta, Liem Satya

    2013-01-01

    Psychological issue is the main issue discussed in David Koepp's Secret Window through its main character, Mort Rainey. Rainey's psychological struggle will be the main theme in this research. This thesis examines Rainey's split personality. Furthermore, in this study, we want to analyze the process of how Mort Rainey's personality splits into two different personalities. To meet the answer of this study, we will use the theory of Dissociative Identity Disorder with a support from Sigmund Fre...

  8. Lighting energy savings potential of split-pane electrochromic windows controlled for daylighting with visual comfort

    Energy Technology Data Exchange (ETDEWEB)

    Software, Anyhere; Fernandes, Luis; Lee, Eleanor; Ward, Greg

    2013-03-15

    A simulation study was conducted to evaluate lighting energy savings of split-pane electrochromic (EC) windows controlled to satisfy key visual comfort parameters. Using the Radiance lighting simulation software, interior illuminance and luminance levels were computed for a south-facing private office illuminated by a window split into two independently-controlled EC panes. The transmittance of these was optimized hourly for a workplane illuminance target while meeting visual comfort constraints, using a least-squares algorithm with linear inequality constraints. Blinds were successively deployed until visual comfort criteria were satisfied. The energy performance of electrochromics proved to be highly dependent on how blinds were controlled. With hourly blind position adjustments, electrochromics showed significantly higher (62percent and 53percent, respectively without and with overhang) lighting energy consumption than clear glass. With a control algorithm designed to better approximate realistic manual control by an occupant, electrochromics achieved significant savings (48percent and 37percent, respectively without and with overhang). In all cases, energy consumption decreased when the workplace illuminance target was increased. In addition, the fraction of time during which the occupant had an unobstructed view of the outside was significantly greater with electrochromics: 10 months out of the year versus a handful of days for the reference case.

  9. Iterative group splitting algorithm for opportunistic scheduling systems

    KAUST Repository

    Nam, Haewoon; Alouini, Mohamed-Slim

    2014-01-01

    An efficient feedback algorithm for opportunistic scheduling systems based on iterative group splitting is proposed in this paper. Similar to the opportunistic splitting algorithm, the proposed algorithm adjusts (or lowers) the feedback threshold

  10. Stochastic split determinant algorithms

    International Nuclear Information System (INIS)

    Horvatha, Ivan

    2000-01-01

    I propose a large class of stochastic Markov processes associated with probability distributions analogous to that of lattice gauge theory with dynamical fermions. The construction incorporates the idea of approximate spectral split of the determinant through local loop action, and the idea of treating the infrared part of the split through explicit diagonalizations. I suggest that exact algorithms of practical relevance might be based on Markov processes so constructed

  11. Iterative group splitting algorithm for opportunistic scheduling systems

    KAUST Repository

    Nam, Haewoon

    2014-05-01

    An efficient feedback algorithm for opportunistic scheduling systems based on iterative group splitting is proposed in this paper. Similar to the opportunistic splitting algorithm, the proposed algorithm adjusts (or lowers) the feedback threshold during a guard period if no user sends a feedback. However, when a feedback collision occurs at any point of time, the proposed algorithm no longer updates the threshold but narrows down the user search space by dividing the users into multiple groups iteratively, whereas the opportunistic splitting algorithm keeps adjusting the threshold until a single user is found. Since the threshold is only updated when no user sends a feedback, it is shown that the proposed algorithm significantly alleviates the signaling overhead for the threshold distribution to the users by the scheduler. More importantly, the proposed algorithm requires a less number of mini-slots than the opportunistic splitting algorithm to make a user selection with a given level of scheduling outage probability or provides a higher ergodic capacity given a certain number of mini-slots. © 2013 IEEE.

  12. An algorithm for the split-feasibility problems with application to the split-equality problem.

    Science.gov (United States)

    Chuang, Chih-Sheng; Chen, Chi-Ming

    2017-01-01

    In this paper, we study the split-feasibility problem in Hilbert spaces by using the projected reflected gradient algorithm. As applications, we study the convex linear inverse problem and the split-equality problem in Hilbert spaces, and we give new algorithms for these problems. Finally, numerical results are given for our main results.

  13. Threshold Multi Split-Row algorithm for decoding irregular LDPC codes

    Directory of Open Access Journals (Sweden)

    Chakir Aqil

    2017-12-01

    Full Text Available In this work, we propose a new threshold multi split-row algorithm in order to improve the multi split-row algorithm for LDPC irregular codes decoding. We give a complete description of our algorithm as well as its advantages for the LDPC codes. The simulation results over an additive white gaussian channel show that an improvement in code error performance between 0.4 dB and 0.6 dB compared to the multi split-row algorithm.

  14. Energy efficiency and energy saving air conditioners window and split type; Eficiencia energetica e economia de energia de condicionadores de ar tipo janela e split

    Energy Technology Data Exchange (ETDEWEB)

    Souza, Edson Palhares de; Cardoso, Rafael Balbino; Nogueira, Luiz Augusto Horta [Universidade Federal de Itajuba (EXCEN/UNIFEI), MG (Brazil). Centro de Excelencia em Eficiencia Energetica

    2010-07-01

    The air-conditioners of window end Split type are responsible for a significant portion of energy consumption in residential sector of Brazil, from 20% of the sector. This study evaluates the impact energy of the Seal Program PROCEL in air-conditioners of window end Split type, showing the efficiency gains for the country in terms of energy saving. For this evaluation it was considered the effects of temperature and loss of performance due to age, PROCEL Stamp Program resulted in a power savings of 664 GWh in air-conditioners of window type residential sector in 2008. (author)

  15. Effect of threshold quantization in opportunistic splitting algorithm

    KAUST Repository

    Nam, Haewoon; Alouini, Mohamed-Slim

    2011-01-01

    This paper discusses algorithms to find the optimal threshold and also investigates the impact of threshold quantization on the scheduling outage performance of the opportunistic splitting scheduling algorithm. Since this algorithm aims at finding

  16. Generalized field-splitting algorithms for optimal IMRT delivery efficiency

    Energy Technology Data Exchange (ETDEWEB)

    Kamath, Srijit [Department of Radiation Oncology, University of Florida, Gainesville, FL (United States); Sahni, Sartaj [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Li, Jonathan [Department of Radiation Oncology, University of Florida, Gainesville, FL (United States); Ranka, Sanjay [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Palta, Jatinder [Department of Radiation Oncology, University of Florida, Gainesville, FL (United States)

    2007-09-21

    Intensity-modulated radiation therapy (IMRT) uses radiation beams of varying intensities to deliver varying doses of radiation to different areas of the tissue. The use of IMRT has allowed the delivery of higher doses of radiation to the tumor and lower doses to the surrounding healthy tissue. It is not uncommon for head and neck tumors, for example, to have large treatment widths that are not deliverable using a single field. In such cases, the intensity matrix generated by the optimizer needs to be split into two or three matrices, each of which may be delivered using a single field. Existing field-splitting algorithms used the pre-specified arbitrary split line or region where the intensity matrix is split along a column, i.e., all rows of the matrix are split along the same column (with or without the overlapping of split fields, i.e., feathering). If three fields result, then the two splits are along the same two columns for all rows. In this paper we study the problem of splitting a large field into two or three subfields with the field width as the only constraint, allowing for an arbitrary overlap of the split fields, so that the total MU efficiency of delivering the split fields is maximized. Proof of optimality is provided for the proposed algorithm. An average decrease of 18.8% is found in the total MUs when compared to the split generated by a commercial treatment planning system and that of 10% is found in the total MUs when compared to the split generated by our previously published algorithm. For more information on this article, see medicalphysicsweb.org.

  17. Estimation of the second heart sound split using windowed sinusoidal models

    DEFF Research Database (Denmark)

    Sæderup, Rasmus Gundorf; Hoang, Poul; Winther, Simon

    2018-01-01

    to the potential overlap between A2 and P2. In this paper, a model-based approach is proposed where both A2 and P2 are modeled as windowed sinusoids with their sum forming the S2 signal. Estimation of the model parameters and the S2 split form a non-convex optimization problem, where a local minimum is obtained...... using a sequential optimization procedure. First, the window parameters are found as the solution to a regularized least squares problem. Then, the frequencies and phases of the sinusoids are found by locating the maximal peaks of the heart signals’ frequency magnitudes, and using the corresponding...

  18. Simultaneous and semi-alternating projection algorithms for solving split equality problems.

    Science.gov (United States)

    Dong, Qiao-Li; Jiang, Dan

    2018-01-01

    In this article, we first introduce two simultaneous projection algorithms for solving the split equality problem by using a new choice of the stepsize, and then propose two semi-alternating projection algorithms. The weak convergence of the proposed algorithms is analyzed under standard conditions. As applications, we extend the results to solve the split feasibility problem. Finally, a numerical example is presented to illustrate the efficiency and advantage of the proposed algorithms.

  19. Splitting of an electromagnetically induced transparency window of a cascade system with 133Cs Rydberg atoms in a static magnetic field

    International Nuclear Information System (INIS)

    Bao Shanxia; Yang Wenguang; Zhang Hao; Zhang Linjie; Zhao Jianming; Jia Suotang

    2015-01-01

    We investigate the electromagnetically induced transparency (EIT) of 133 Cs vapor at the room temperature in a magnetic field. In a cascade three-level system involved Rydberg state, two collinearly counter-propagating and orthogonally linear-polarized laser fields act on cascaded two transitions, 6S 1/2 → 6P 3/2 and 6P 3/2 ↔ 47D 5/2 , respectively. The EIT window become broadening and split into several sub-EIT windows when the magnetic field is applied. The dependences of splitting shape and intervals of sub-EIT windows on magnetic field are measured experimentally and compared with the theoretical calculation considering the different magnetic effects on ground state, low excited state and Rydberg state. The splitting intervals of sub-EIT windows are well consistent with theoretical calculation. (author)

  20. A splitting algorithm for directional regularization and sparsification

    DEFF Research Database (Denmark)

    Rakêt, Lars Lau; Nielsen, Mads

    2012-01-01

    We present a new split-type algorithm for the minimization of a p-harmonic energy with added data fidelity term. The half-quadratic splitting reduces the original problem to two straightforward problems, that can be minimized efficiently. The minimizers to the two sub-problems can typically...... be computed pointwise and are easily implemented on massively parallel processors. Furthermore the splitting method allows for the computation of solutions to a large number of more advanced directional regularization problems. In particular we are able to handle robust, non-convex data terms, and to define...

  1. Split delivery vehicle routing problem with time windows: a case study

    Science.gov (United States)

    Latiffianti, E.; Siswanto, N.; Firmandani, R. A.

    2018-04-01

    This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.

  2. Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

    Science.gov (United States)

    Povitsky, A.

    1998-01-01

    In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

  3. Comparative Study of Two Daylighting Analysis Methods with Regard to Window Orientation and Interior Wall Reflectance

    Directory of Open Access Journals (Sweden)

    Yeo Beom Yoon

    2014-09-01

    Full Text Available The accuracy and speed of the daylighting analysis developed for use in EnergyPlus is better than its predecessors. In EnergyPlus, the detailed method uses the Split-flux algorithm whereas the DElight method uses the Radiosity algorithm. Many existing studies have addressed the two methods, either individually or compared with other daylight analysis methods like Ray tracing but still there is lack of detailed comparative study of these two methods. Our previous studies show that the Split-flux method overestimates the illuminance, especially for the areas away from the window. The Radiosity method has the advantage of accurately predicting this illuminance because of how it deals with the diffuse light. For this study, the EnergyPlus model, which has been calibrated using data measured in a real building in previous studies, has also been used. The calibrated model has a south oriented window only. This model is then used to analyze the interior illuminance inside the room for north, west and east orientation of the window by rotating the model and by changing the wall reflectance of the model with south oriented window. Direct and diffuse component of the illuminance as well as the algorithms have been compared for a detailed analysis.

  4. The monocortical window (MCW): a modified split-crest technique adopting ligature osteosynthesis.

    Science.gov (United States)

    Contessi, Marcello

    2013-01-01

    Split-crest procedures performed with ultrasonic devices have proven to be a viable and effective surgical treatment when the alveolar ridge shows forms of resorption in thickness while its height remains virtually unchanged. However, in the case of stiff, type 1, corticalized mandibular bone, it may be very difficult or even impossible to have any elasticity and lateral augmentation in between the split bone walls. Furthermore, a complete detachment of the outer lamellae may also occur during expansion maneuvers or during implant insertion. This study describes the use of a steel-wire ligature osteosynthesis technique to give primary stability both to the expanded cortical window and to the implants themselves when they have none at all. This osteosynthesis is simple, quick, safe, and bone-saving in force delivery. It is also extremely cheap as well as being effective in obtaining ridge expansion, bone regeneration, and implant positioning in an all-in-one procedure. This article describes the foundations in the literature as well as new elements in the technique. Three short case studies are used by way of example.

  5. Hybrid Discrete Differential Evolution Algorithm for Lot Splitting with Capacity Constraints in Flexible Job Scheduling

    Directory of Open Access Journals (Sweden)

    Xinli Xu

    2013-01-01

    Full Text Available A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome and a lot scheduling chromosome. To balance global search and local exploration of the differential evolution algorithm, a hybrid discrete differential evolution algorithm (HDDE is presented, in which the local strategy with dynamic random searching based on the critical path and a random mutation operator is developed. The performance of HDDE was experimented with 14 benchmark problems and the practical dye vat scheduling problem. The simulation results showed that the proposed algorithm has the strong global search capability and can effectively solve the practical lot splitting problems with equipment capacity constraints.

  6. Effect of threshold quantization in opportunistic splitting algorithm

    KAUST Repository

    Nam, Haewoon

    2011-12-01

    This paper discusses algorithms to find the optimal threshold and also investigates the impact of threshold quantization on the scheduling outage performance of the opportunistic splitting scheduling algorithm. Since this algorithm aims at finding the user with the highest channel quality within the minimal number of mini-slots by adjusting the threshold every mini-slot, optimizing the threshold is of paramount importance. Hence, in this paper we first discuss how to compute the optimal threshold along with two tight approximations for the optimal threshold. Closed-form expressions are provided for those approximations for simple calculations. Then, we consider linear quantization of the threshold to take the limited number of bits for signaling messages in practical systems into consideration. Due to the limited granularity for the quantized threshold value, an irreducible scheduling outage floor is observed. The numerical results show that the two approximations offer lower scheduling outage probability floors compared to the conventional algorithm when the threshold is quantized. © 2006 IEEE.

  7. Flux-split algorithms for flows with non-equilibrium chemistry and vibrational relaxation

    Science.gov (United States)

    Grossman, B.; Cinnella, P.

    1990-01-01

    The present consideration of numerical computation methods for gas flows with nonequilibrium chemistry thermodynamics gives attention to an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Flux-splitting procedures are developed for the fully-coupled inviscid equations encompassing fluid dynamics and both chemical and internal energy-relaxation processes. A fully coupled and implicit large-block structure is presented which embodies novel forms of flux-vector split and flux-difference split algorithms valid for nonequilibrium flow; illustrative high-temperature shock tube and nozzle flow examples are given.

  8. A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem

    NARCIS (Netherlands)

    K. Dalmeijer (Kevin); R. Spliet (Remy)

    2016-01-01

    textabstractThis paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and

  9. MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines

    Science.gov (United States)

    Ozmutlu, H. Cenk

    2014-01-01

    We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms. PMID:24977204

  10. MIP models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines.

    Science.gov (United States)

    Eroglu, Duygu Yilmaz; Ozmutlu, H Cenk

    2014-01-01

    We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.

  11. Transmission History Based Distributed Adaptive Contention Window Adjustment Algorithm Cooperating with Automatic Rate Fallback for Wireless LANs

    Science.gov (United States)

    Ogawa, Masakatsu; Hiraguri, Takefumi; Nishimori, Kentaro; Takaya, Kazuhiro; Murakawa, Kazuo

    This paper proposes and investigates a distributed adaptive contention window adjustment algorithm based on the transmission history for wireless LANs called the transmission-history-based distributed adaptive contention window adjustment (THAW) algorithm. The objective of this paper is to reduce the transmission delay and improve the channel throughput compared to conventional algorithms. The feature of THAW is that it adaptively adjusts the initial contention window (CWinit) size in the binary exponential backoff (BEB) algorithm used in the IEEE 802.11 standard according to the transmission history and the automatic rate fallback (ARF) algorithm, which is the most basic algorithm in automatic rate controls. This effect is to keep CWinit at a high value in a congested state. Simulation results show that the THAW algorithm outperforms the conventional algorithms in terms of the channel throughput and delay, even if the timer in the ARF is changed.

  12. Field-Split Preconditioned Inexact Newton Algorithms

    KAUST Repository

    Liu, Lulu

    2015-06-02

    The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm is presented as a complement to additive Schwarz preconditioned inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. We consider both types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Numerical experiments show that MSPIN can be significantly more robust than Newton methods based on global linearizations, and that MSPIN can be more robust than ASPIN and maintain fast convergence even for challenging problems, such as high Reynolds number Navier--Stokes equations.

  13. Field-Split Preconditioned Inexact Newton Algorithms

    KAUST Repository

    Liu, Lulu; Keyes, David E.

    2015-01-01

    The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm is presented as a complement to additive Schwarz preconditioned inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. We consider both types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Numerical experiments show that MSPIN can be significantly more robust than Newton methods based on global linearizations, and that MSPIN can be more robust than ASPIN and maintain fast convergence even for challenging problems, such as high Reynolds number Navier--Stokes equations.

  14. Inviscid flux-splitting algorithms for real gases with non-equilibrium chemistry

    Science.gov (United States)

    Shuen, Jian-Shun; Liou, Meng-Sing; Van Leer, Bram

    1990-01-01

    Formulations of inviscid flux splitting algorithms for chemical nonequilibrium gases are presented. A chemical system for air dissociation and recombination is described. Numerical results for one-dimensional shock tube and nozzle flows of air in chemical nonequilibrium are examined.

  15. Weak and Strong Convergence of an Algorithm for the Split Common Fixed-Point of Asymptotically Quasi-Nonexpansive Operators

    Directory of Open Access Journals (Sweden)

    Yazheng Dang

    2013-01-01

    Full Text Available Inspired by the Moudafi (2010, we propose an algorithm for solving the split common fixed-point problem for a wide class of asymptotically quasi-nonexpansive operators and the weak and strong convergence of the algorithm are shown under some suitable conditions in Hilbert spaces. The algorithm and its convergence results improve and develop previous results for split feasibility problems.

  16. 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...

  17. Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

    Science.gov (United States)

    Yurtkuran, Alkın

    2014-01-01

    The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms. PMID:24723834

  18. Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Alkın Yurtkuran

    2014-01-01

    Full Text Available The traveling salesman problem with time windows (TSPTW is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.

  19. 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.

  20. An Adaptive Algorithm for Finding Frequent Sets in Landmark Windows

    DEFF Research Database (Denmark)

    Dang, Xuan-Hong; Ong, Kok-Leong; Lee, Vincent

    2012-01-01

    We consider a CPU constrained environment for finding approximation of frequent sets in data streams using the landmark window. Our algorithm can detect overload situations, i.e., breaching the CPU capacity, and sheds data in the stream to “keep up”. This is done within a controlled error threshold...

  1. An implicit flux-split algorithm to calculate hypersonic flowfields in chemical equilibrium

    Science.gov (United States)

    Palmer, Grant

    1987-01-01

    An implicit, finite-difference, shock-capturing algorithm that calculates inviscid, hypersonic flows in chemical equilibrium is presented. The flux vectors and flux Jacobians are differenced using a first-order, flux-split technique. The equilibrium composition of the gas is determined by minimizing the Gibbs free energy at every node point. The code is validated by comparing results over an axisymmetric hemisphere against previously published results. The algorithm is also applied to more practical configurations. The accuracy, stability, and versatility of the algorithm have been promising.

  2. Branch-and-cut algorithms for the split delivery vehicle routing problem

    NARCIS (Netherlands)

    Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia

    2014-01-01

    In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations

  3. Evolutionary algorithms for the Vehicle Routing Problem with Time Windows

    NARCIS (Netherlands)

    Bräysy, Olli; Dullaert, Wout; Gendreau, Michel

    2004-01-01

    This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way

  4. Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem.

    Science.gov (United States)

    Zhao, Ying; Shi, Luoyi

    2017-01-01

    This paper introduces a new extragradient-type method to solve the multiple-sets split equality problem (MSSEP). Under some suitable conditions, the strong convergence of an algorithm can be verified in the infinite-dimensional Hilbert spaces. Moreover, several numerical results are given to show the effectiveness of our algorithm.

  5. Investigation of energy windowing algorithms for effective cargo screening with radiation portal monitors

    International Nuclear Information System (INIS)

    Hevener, Ryne; Yim, Man-Sung; Baird, Ken

    2013-01-01

    Radiation portal monitors (RPMs) are distributed across the globe in an effort to decrease the illicit trafficking of nuclear materials. Many current generation RPMs utilizes large polyvinyltoluene (PVT) plastic scintillators. These detectors are low cost and reliable but have very poor energy resolution. The lack of spectroscopic detail available from PVT spectra has restricted these systems primarily to performing simple gross counting measurements in the past. A common approach to extend the capability of PVT detectors beyond simple “gross-gamma” use is to apply a technique known as energy windowing (EW) to perform rough nuclide identification with limited spectral information. An approach to creating EW algorithms was developed in this work utilizing a specific set of calibration sources and modified EW equations; this algorithm provided a degree of increased identification capability. A simulated real-time emulation of the algorithm utilizing actual port-of-entry RPM data supplied by ORNL provided an extensive proving ground for the algorithm. This algorithm is able to identify four potential threat nuclides and the major NORM source with a high degree of accuracy. High-energy masking, a major detriment of EW algorithms, is reduced by the algorithm's design. - Highlights: • Gross counting algorithms do not produce detailed screenings. • Energy windowing algorithms enhance nuclide identification capability. • Proper use of EW algorithm can identify multiple threat nuclides. • Utilizing specific set of calibration sources is important for nuclide identification

  6. Convergence of Batch Split-Complex Backpropagation Algorithm for Complex-Valued Neural Networks

    Directory of Open Access Journals (Sweden)

    Huisheng Zhang

    2009-01-01

    Full Text Available The batch split-complex backpropagation (BSCBP algorithm for training complex-valued neural networks is considered. For constant learning rate, it is proved that the error function of BSCBP algorithm is monotone during the training iteration process, and the gradient of the error function tends to zero. By adding a moderate condition, the weights sequence itself is also proved to be convergent. A numerical example is given to support the theoretical analysis.

  7. Total-variation based velocity inversion with Bregmanized operator splitting algorithm

    Science.gov (United States)

    Zand, Toktam; Gholami, Ali

    2018-04-01

    Many problems in applied geophysics can be formulated as a linear inverse problem. The associated problems, however, are large-scale and ill-conditioned. Therefore, regularization techniques are needed to be employed for solving them and generating a stable and acceptable solution. We consider numerical methods for solving such problems in this paper. In order to tackle the ill-conditioning of the problem we use blockiness as a prior information of the subsurface parameters and formulate the problem as a constrained total variation (TV) regularization. The Bregmanized operator splitting (BOS) algorithm as a combination of the Bregman iteration and the proximal forward backward operator splitting method is developed to solve the arranged problem. Two main advantages of this new algorithm are that no matrix inversion is required and that a discrepancy stopping criterion is used to stop the iterations, which allow efficient solution of large-scale problems. The high performance of the proposed TV regularization method is demonstrated using two different experiments: 1) velocity inversion from (synthetic) seismic data which is based on Born approximation, 2) computing interval velocities from RMS velocities via Dix formula. Numerical examples are presented to verify the feasibility of the proposed method for high-resolution velocity inversion.

  8. An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

    Science.gov (United States)

    2015-01-01

    solution approach that combines heuristic search and integer programming. Boudia et al. (2007) solved an SDVRP instance using a memetic algorithm with...Boudia, M., Prins, C., Reghioui, M., 2007. An effective memetic algorithm with population management for the split delivery vehicle routing problem

  9. A backprojection-filtration algorithm for nonstandard spiral cone-beam CT with an n-PI-window

    International Nuclear Information System (INIS)

    Yu Hengyong; Ye Yangbo; Zhao Shiying; Wang Ge

    2005-01-01

    For applications in bolus-chasing computed tomography (CT) angiography and electron-beam micro-CT, the backprojection-filtration (BPF) formula developed by Zou and Pan was recently generalized by Ye et al to reconstruct images from cone-beam data collected along a rather flexible scanning locus, including a nonstandard spiral. A major implication of the generalized BPF formula is that it can be applied for n-PI-window-based reconstruction in the nonstandard spiral scanning case. In this paper, we design an n-PI-window-based BPF algorithm, and report the numerical simulation results with the 3D Shepp-Logan phantom and Defrise disk phantom. The proposed BPF algorithm consists of three steps: cone-beam data differentiation, weighted backprojection and inverse Hilbert filtration. Our simulated results demonstrate the feasibility and merits of the proposed algorithm

  10. A splitting algorithm for the wavelet transform of cubic splines on a nonuniform grid

    Science.gov (United States)

    Sulaimanov, Z. M.; Shumilov, B. M.

    2017-10-01

    For cubic splines with nonuniform nodes, splitting with respect to the even and odd nodes is used to obtain a wavelet expansion algorithm in the form of the solution to a three-diagonal system of linear algebraic equations for the coefficients. Computations by hand are used to investigate the application of this algorithm for numerical differentiation. The results are illustrated by solving a prediction problem.

  11. PPP Sliding Window Algorithm and Its Application in Deformation Monitoring

    Science.gov (United States)

    Song, Weiwei; Zhang, Rui; Yao, Yibin; Liu, Yanyan; Hu, Yuming

    2016-01-01

    Compared with the double-difference relative positioning method, the precise point positioning (PPP) algorithm can avoid the selection of a static reference station and directly measure the three-dimensional position changes at the observation site and exhibit superiority in a variety of deformation monitoring applications. However, because of the influence of various observing errors, the accuracy of PPP is generally at the cm-dm level, which cannot meet the requirements needed for high precision deformation monitoring. For most of the monitoring applications, the observation stations maintain stationary, which can be provided as a priori constraint information. In this paper, a new PPP algorithm based on a sliding window was proposed to improve the positioning accuracy. Firstly, data from IGS tracking station was processed using both traditional and new PPP algorithm; the results showed that the new algorithm can effectively improve positioning accuracy, especially for the elevation direction. Then, an earthquake simulation platform was used to simulate an earthquake event; the results illustrated that the new algorithm can effectively detect the vibrations change of a reference station during an earthquake. At last, the observed Wenchuan earthquake experimental results showed that the new algorithm was feasible to monitor the real earthquakes and provide early-warning alerts. PMID:27241172

  12. VSMURF: A Novel Sliding Window Cleaning Algorithm for RFID Networks

    Directory of Open Access Journals (Sweden)

    He Xu

    2017-01-01

    Full Text Available Radio Frequency Identification (RFID is one of the key technologies of the Internet of Things (IoT and is used in many areas, such as mobile payments, public transportation, smart lock, and environment protection. However, the performance of RFID equipment can be easily affected by the surrounding environment, such as electronic productions and metal appliances. These can impose an impact on the RF signal, which makes the collection of RFID data unreliable. Usually, the unreliability of RFID source data includes three aspects: false negatives, false positives, and dirty data. False negatives are the key problem, as the probability of false positives and dirty data occurrence is relatively small. This paper proposes a novel sliding window cleaning algorithm called VSMURF, which is based on the traditional SMURF algorithm which combines the dynamic change of tags and the value analysis of confidence. Experimental results show that VSMURF algorithm performs better in most conditions and when the tag’s speed is low or high. In particular, if the velocity parameter is set to 2 m/epoch, our proposed VSMURF algorithm performs better than SMURF. The results also show that VSMURF algorithm has better performance than other algorithms in solving the problem of false negatives for RFID networks.

  13. Redesigned-Scale-Free CORDIC Algorithm Based FPGA Implementation of Window Functions to Minimize Area and Latency

    Directory of Open Access Journals (Sweden)

    Supriya Aggarwal

    2012-01-01

    Full Text Available One of the most important steps in spectral analysis is filtering, where window functions are generally used to design filters. In this paper, we modify the existing architecture for realizing the window functions using CORDIC processor. Firstly, we modify the conventional CORDIC algorithm to reduce its latency and area. The proposed CORDIC algorithm is completely scale-free for the range of convergence that spans the entire coordinate space. Secondly, we realize the window functions using a single CORDIC processor as against two serially connected CORDIC processors in existing technique, thus optimizing it for area and latency. The linear CORDIC processor is replaced by a shift-add network which drastically reduces the number of pipelining stages required in the existing design. The proposed design on an average requires approximately 64% less pipeline stages and saves up to 44.2% area. Currently, the processor is designed to implement Blackman windowing architecture, which with slight modifications can be extended to other widow functions as well. The details of the proposed architecture are discussed in the paper.

  14. Polarization-independent transparency window induced by complementary graphene metasurfaces

    International Nuclear Information System (INIS)

    Lu, Wei Bing; Liu, Ji Long; Zhang, Jin; Wang, Jian; Liu, Zhen Guo

    2017-01-01

    A fourfold symmetric graphene-based complementary metasurface featuring a polarization-independent transparency window is proposed and numerically analysed in this paper. The unit cell of the metamaterial consists of a monolayer graphene perforated with a cross and four identical split-ring resonators deposited on a substrate. Our analysis shows that the transparency window can be interpreted as a plasmonic analogy of Autler–Townes splitting. The polarization independence is achieved due to the fourfold symmetry of graphene’s complementary structure. In addition, the frequency range of the transparency window can be dynamically tuned over a broad band by changing the chemical potential of graphene, and the width of the transparency window can also be controlled by changing the split-gap orientation. This work may lead to potential applications in many area, such as slow-light devices and optical sensing. (paper)

  15. Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Marco Antonio Cruz-Chávez

    2016-01-01

    Full Text Available A stochastic algorithm for obtaining feasible initial populations to the Vehicle Routing Problem with Time Windows is presented. The theoretical formulation for the Vehicle Routing Problem with Time Windows is explained. The proposed method is primarily divided into a clustering algorithm and a two-phase algorithm. The first step is the application of a modified k-means clustering algorithm which is proposed in this paper. The two-phase algorithm evaluates a partial solution to transform it into a feasible individual. The two-phase algorithm consists of a hybridization of four kinds of insertions which interact randomly to obtain feasible individuals. It has been proven that different kinds of insertions impact the diversity among individuals in initial populations, which is crucial for population-based algorithm behavior. A modification to the Hamming distance method is applied to the populations generated for the Vehicle Routing Problem with Time Windows to evaluate their diversity. Experimental tests were performed based on the Solomon benchmarking. Experimental results show that the proposed method facilitates generation of highly diverse populations, which vary according to the type and distribution of the instances.

  16. Clinical Applications of a CT Window Blending Algorithm: RADIO (Relative Attenuation-Dependent Image Overlay).

    Science.gov (United States)

    Mandell, Jacob C; Khurana, Bharti; Folio, Les R; Hyun, Hyewon; Smith, Stacy E; Dunne, Ruth M; Andriole, Katherine P

    2017-06-01

    A methodology is described using Adobe Photoshop and Adobe Extendscript to process DICOM images with a Relative Attenuation-Dependent Image Overlay (RADIO) algorithm to visualize the full dynamic range of CT in one view, without requiring a change in window and level settings. The potential clinical uses for such an algorithm are described in a pictorial overview, including applications in emergency radiology, oncologic imaging, and nuclear medicine and molecular imaging.

  17. Parallel Implementation of Isothermal and Isoenergetic Dissipative Particle Dynamics using Shardlow-like Splitting Algorithms

    Czech Academy of Sciences Publication Activity Database

    Larentzos, J.P.; Brennan, J.K.; Moore, J.D.; Lísal, Martin; Mattson, w.D.

    2014-01-01

    Roč. 185, č. 7 (2014), s. 1987-1998 ISSN 0010-4655 Grant - others:ARL(US) W911NF-10-2-0039 Institutional support: RVO:67985858 Keywords : dissipative particle dynamics * shardlow splitting algorithm * numerical integration Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 3.112, year: 2014

  18. Efficient operator splitting algorithm for joint sparsity-regularized SPIRiT-based parallel MR imaging reconstruction.

    Science.gov (United States)

    Duan, Jizhong; Liu, Yu; Jing, Peiguang

    2018-02-01

    Self-consistent parallel imaging (SPIRiT) is an auto-calibrating model for the reconstruction of parallel magnetic resonance imaging, which can be formulated as a regularized SPIRiT problem. The Projection Over Convex Sets (POCS) method was used to solve the formulated regularized SPIRiT problem. However, the quality of the reconstructed image still needs to be improved. Though methods such as NonLinear Conjugate Gradients (NLCG) can achieve higher spatial resolution, these methods always demand very complex computation and converge slowly. In this paper, we propose a new algorithm to solve the formulated Cartesian SPIRiT problem with the JTV and JL1 regularization terms. The proposed algorithm uses the operator splitting (OS) technique to decompose the problem into a gradient problem and a denoising problem with two regularization terms, which is solved by our proposed split Bregman based denoising algorithm, and adopts the Barzilai and Borwein method to update step size. Simulation experiments on two in vivo data sets demonstrate that the proposed algorithm is 1.3 times faster than ADMM for datasets with 8 channels. Especially, our proposal is 2 times faster than ADMM for the dataset with 32 channels. Copyright © 2017 Elsevier Inc. All rights reserved.

  19. Start-up flow in a three-dimensional lid-driven cavity by means of a massively parallel direction splitting algorithm

    KAUST Repository

    Guermond, J. L.; Minev, P. D.

    2011-01-01

    The purpose of this paper is to validate a new highly parallelizable direction splitting algorithm. The parallelization capabilities of this algorithm are illustrated by providing a highly accurate solution for the start-up flow in a three

  20. Statistical behaviour of adaptive multilevel splitting algorithms in simple models

    International Nuclear Information System (INIS)

    Rolland, Joran; Simonnet, Eric

    2015-01-01

    Adaptive multilevel splitting algorithms have been introduced rather recently for estimating tail distributions in a fast and efficient way. In particular, they can be used for computing the so-called reactive trajectories corresponding to direct transitions from one metastable state to another. The algorithm is based on successive selection–mutation steps performed on the system in a controlled way. It has two intrinsic parameters, the number of particles/trajectories and the reaction coordinate used for discriminating good or bad trajectories. We investigate first the convergence in law of the algorithm as a function of the timestep for several simple stochastic models. Second, we consider the average duration of reactive trajectories for which no theoretical predictions exist. The most important aspect of this work concerns some systems with two degrees of freedom. They are studied in detail as a function of the reaction coordinate in the asymptotic regime where the number of trajectories goes to infinity. We show that during phase transitions, the statistics of the algorithm deviate significatively from known theoretical results when using non-optimal reaction coordinates. In this case, the variance of the algorithm is peaking at the transition and the convergence of the algorithm can be much slower than the usual expected central limit behaviour. The duration of trajectories is affected as well. Moreover, reactive trajectories do not correspond to the most probable ones. Such behaviour disappears when using the optimal reaction coordinate called committor as predicted by the theory. We finally investigate a three-state Markov chain which reproduces this phenomenon and show logarithmic convergence of the trajectory durations

  1. The development of flux-split algorithms for flows with non-equilibrium thermodynamics and chemical reactions

    Science.gov (United States)

    Grossman, B.; Cinella, P.

    1988-01-01

    A finite-volume method for the numerical computation of flows with nonequilibrium thermodynamics and chemistry is presented. A thermodynamic model is described which simplifies the coupling between the chemistry and thermodynamics and also results in the retention of the homogeneity property of the Euler equations (including all the species continuity and vibrational energy conservation equations). Flux-splitting procedures are developed for the fully coupled equations involving fluid dynamics, chemical production and thermodynamic relaxation processes. New forms of flux-vector split and flux-difference split algorithms are embodied in a fully coupled, implicit, large-block structure, including all the species conservation and energy production equations. Several numerical examples are presented, including high-temperature shock tube and nozzle flows. The methodology is compared to other existing techniques, including spectral and central-differenced procedures, and favorable comparisons are shown regarding accuracy, shock-capturing and convergence rates.

  2. A de-noising algorithm based on wavelet threshold-exponential adaptive window width-fitting for ground electrical source airborne transient electromagnetic signal

    Science.gov (United States)

    Ji, Yanju; Li, Dongsheng; Yu, Mingmei; Wang, Yuan; Wu, Qiong; Lin, Jun

    2016-05-01

    The ground electrical source airborne transient electromagnetic system (GREATEM) on an unmanned aircraft enjoys considerable prospecting depth, lateral resolution and detection efficiency, etc. In recent years it has become an important technical means of rapid resources exploration. However, GREATEM data are extremely vulnerable to stationary white noise and non-stationary electromagnetic noise (sferics noise, aircraft engine noise and other human electromagnetic noises). These noises will cause degradation of the imaging quality for data interpretation. Based on the characteristics of the GREATEM data and major noises, we propose a de-noising algorithm utilizing wavelet threshold method and exponential adaptive window width-fitting. Firstly, the white noise is filtered in the measured data using the wavelet threshold method. Then, the data are segmented using data window whose step length is even logarithmic intervals. The data polluted by electromagnetic noise are identified within each window based on the discriminating principle of energy detection, and the attenuation characteristics of the data slope are extracted. Eventually, an exponential fitting algorithm is adopted to fit the attenuation curve of each window, and the data polluted by non-stationary electromagnetic noise are replaced with their fitting results. Thus the non-stationary electromagnetic noise can be effectively removed. The proposed algorithm is verified by the synthetic and real GREATEM signals. The results show that in GREATEM signal, stationary white noise and non-stationary electromagnetic noise can be effectively filtered using the wavelet threshold-exponential adaptive window width-fitting algorithm, which enhances the imaging quality.

  3. The effect of windowing on the performance of the CA-CFAR and OS-CFAR algorithms

    CSIR Research Space (South Africa)

    Melebari, A

    2015-10-01

    Full Text Available A major challenge in radar design is to not overflow the processor with false detections. This paper investigates the performance of Constant False Alarm Rate (CFAR) algorithms on maintaining a fixed false alarm rate when windowing is used to reduce...

  4. A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

    Science.gov (United States)

    Fu, Zhuo; Wang, Jiangtao

    2018-01-01

    In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics. PMID:29747469

  5. A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.

    Science.gov (United States)

    Xia, Yangkun; Fu, Zhuo; Tsai, Sang-Bing; Wang, Jiangtao

    2018-05-10

    In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

  6. Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Junhyuk Park

    2017-01-01

    Full Text Available The capacitated team orienteering problem with time windows (CTOPTW is a problem to determine players’ paths that have the maximum rewards while satisfying the constraints. In this paper, we present the exact solution approach for the CTOPTW which has not been done in previous literature. We show that the branch-and-price (B&P scheme which was originally developed for the team orienteering problem can be applied to the CTOPTW. To solve pricing problems, we used implicit enumeration acceleration techniques, heuristic algorithms, and ng-route relaxations.

  7. Comparison of Different Classification Algorithms for the Detection of User's Interaction with Windows in Office Buildings

    DEFF Research Database (Denmark)

    Markovic, Romana; Wolf, Sebastian; Cao, Jun

    2017-01-01

    Occupant behavior in terms of interactions with windows and heating systems is seen as one of the main sources of discrepancy between predicted and measured heating, ventilation and air conditioning (HVAC) building energy consumption. Thus, this work analyzes the performance of several...... classification algorithms for detecting occupant's interactions with windows, while taking the imbalanced properties of the available data set into account. The tested methods include support vector machines (SVM), random forests, and their combination with dynamic Bayesian networks (DBN). The results will show...

  8. Modeling of beam customization devices in the pencil-beam splitting algorithm for heavy charged particle radiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Kanematsu, Nobuyuki, E-mail: nkanemat@nirs.go.jp [Department of Accelerator and Medical Physics, Research Center for Charged Particle Therapy, National Institute of Radiological Sciences, 4-9-1 Anagawa, Inage-ku, Chiba 263-8555 (Japan); Department of Quantum Science and Energy Engineering, School of Engineering, Tohoku University, 6-6 Aramaki Aza Aoba, Aoba-ku, Sendai 980-8579 (Japan)

    2011-03-07

    A broad-beam-delivery system for radiotherapy with protons or ions often employs multiple collimators and a range-compensating filter, which offer complex and potentially useful beam customization. It is however difficult for conventional pencil-beam algorithms to deal with fine structures of these devices due to beam-size growth during transport. This study aims to avoid the difficulty with a novel computational model. The pencil beams are initially defined at the range-compensating filter with angular-acceptance correction for upstream collimation followed by stopping and scattering. They are individually transported with possible splitting near the aperture edge of a downstream collimator to form a sharp field edge. The dose distribution for a carbon-ion beam was calculated and compared with existing experimental data. The penumbra sizes of various collimator edges agreed between them to a submillimeter level. This beam-customization model will be used in the greater framework of the pencil-beam splitting algorithm for accurate and efficient patient dose calculation.

  9. Modeling of beam customization devices in the pencil-beam splitting algorithm for heavy charged particle radiotherapy.

    Science.gov (United States)

    Kanematsu, Nobuyuki

    2011-03-07

    A broad-beam-delivery system for radiotherapy with protons or ions often employs multiple collimators and a range-compensating filter, which offer complex and potentially useful beam customization. It is however difficult for conventional pencil-beam algorithms to deal with fine structures of these devices due to beam-size growth during transport. This study aims to avoid the difficulty with a novel computational model. The pencil beams are initially defined at the range-compensating filter with angular-acceptance correction for upstream collimation followed by stopping and scattering. They are individually transported with possible splitting near the aperture edge of a downstream collimator to form a sharp field edge. The dose distribution for a carbon-ion beam was calculated and compared with existing experimental data. The penumbra sizes of various collimator edges agreed between them to a submillimeter level. This beam-customization model will be used in the greater framework of the pencil-beam splitting algorithm for accurate and efficient patient dose calculation.

  10. VISUALISASI DAN NAVIGASI MEDIA PENYIMPANAN DISK DENGAN MENGGUNAKAN METODE SPLIT SCREEN SYSTEM

    Directory of Open Access Journals (Sweden)

    Yulia yulia

    2002-01-01

    Full Text Available Disk is a very useful device to a computer to save data file. For that, is much needed to have a program that has a capability to represent, navigate, and operate that files. There are many computer programs that used to present, navigate, and operate disk files in text form with a lot of facilities, but only a few programs that can represent files in a graphic form and have special feature, like capability to find the biggest files that use disk space. This capability is very useful in disk file management. This software use split screen system method and tree map algorithm. Split screen system is used to navigate, where the monitor screen divided into two parts to visualize files in a disk, the small part (map navigator visualize the whole content of a drive or directory and the big part visualize the detail of a part according to focus box in the map navigator. A mouse can move focus box in the map navigator and the box size is the comparison between map navigator sizes with map view size. Tree map algorithm is used to calculate the size of box picture of the represented file. This algorithm needs a complete tree structure from a drive or directory that will be painted. The software to make this windows based program is Borland Delphi 5.0. Abstract in Bahasa Indonesia : Disk merupakan alat yang sangat bermanfaat bagi sebuah sistem komputer untuk menyimpan data berupa file. Untuk itu sangat dibutuhkan program yang dapat merepresentasikan, menavigasi dan mengoperasikan file-file tersebut. Banyak program komputer yang digunakan untuk merepresentasikan, menavigasi dan mengoperasikan file-file pada media penyimpanan disk dalam bentuk teks dengan berbagai macam fasilitas, tetapi sangat sedikit program yang merepresentasikan file-file dalam bentuk grafik atau secara visual serta mampu memberikan kelebihan-kelebihan tersendiri, seperti kemampuan untuk merepresentasikan file-file yang paling banyak menggunakan ruang media penyimpanan disk. Kemampuan

  11. A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

    Directory of Open Access Journals (Sweden)

    Qi Hu

    2013-04-01

    Full Text Available State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data’s real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.

  12. A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows.

    Science.gov (United States)

    Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

    2015-08-27

    A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.

  13. Opportunistic splitting for scheduling using a score-based approach

    KAUST Repository

    Rashid, Faraan

    2012-06-01

    We consider the problem of scheduling a user in a multi-user wireless environment in a distributed manner. The opportunistic splitting algorithm is applied to find the best group of users without reporting the channel state information to the centralized scheduler. The users find the best among themselves while requiring just a ternary feedback from the common receiver at the end of each mini-slot. The original splitting algorithm is modified to handle users with asymmetric channel conditions. We use a score-based approach with the splitting algorithm to introduce time and throughput fairness while exploiting the multi-user diversity of the network. Analytical and simulation results are given to show that the modified score-based splitting algorithm works well as a fair scheduling scheme with good spectral efficiency and reduced feedback. © 2012 IEEE.

  14. An improved flux-split algorithm applied to hypersonic flows in chemical equilibrium

    Science.gov (United States)

    Palmer, Grant

    1988-01-01

    An explicit, finite-difference, shock-capturing numerical algorithm is presented and applied to hypersonic flows assumed to be in thermochemical equilibrium. Real-gas chemistry is either loosely coupled to the gasdynamics by way of a Gibbs free energy minimization package or fully coupled using species mass conservation equations with finite-rate chemical reactions. A scheme is developed that maintains stability in the explicit, finite-rate formulation while allowing relatively high time steps. The codes use flux vector splitting to difference the inviscid fluxes and employ real-gas corrections to viscosity and thermal conductivity. Numerical results are compared against existing ballistic range and flight data. Flows about complex geometries are also computed.

  15. Splitting Strip Detector Clusters in Dense Environments

    CERN Document Server

    Nachman, Benjamin Philip; The ATLAS collaboration

    2018-01-01

    Tracking in high density environments, particularly in high energy jets, plays an important role in many physics analyses at the LHC. In such environments, there is significant degradation of track reconstruction performance. Between runs 1 and 2, ATLAS implemented an algorithm that splits pixel clusters originating from multiple charged particles, using charge information, resulting in the recovery of much of the lost efficiency. However, no attempt was made in prior work to split merged clusters in the Semi Conductor Tracker (SCT), which does not measure charge information. In spite of the lack of charge information in SCT, a cluster-splitting algorithm has been developed in this work. It is based primarily on the difference between the observed cluster width and the expected cluster width, which is derived from track incidence angle. The performance of this algorithm is found to be competitive with the existing pixel cluster splitting based on track information.

  16. A Regularized Algorithm for the Proximal Split Feasibility Problem

    Directory of Open Access Journals (Sweden)

    Zhangsong Yao

    2014-01-01

    Full Text Available The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.

  17. Iterative algorithms to approximate canonieal Gabor windows: Computational aspects

    DEFF Research Database (Denmark)

    Janssen, A. J. E. M.; Søndergaard, Peter Lempel

    2007-01-01

    In this article we investigate the computational aspects of some recently proposed iterative methods for approximating the canonical tight and canonical dual window of a Gabor frame (g, a, b). The iterations start with the window g while the iteration steps comprise the window g, the k(th) iteran...

  18. Imitation Monte Carlo methods for problems of the Boltzmann equation with small Knudsen numbers, parallelizing algorithms with splitting

    International Nuclear Information System (INIS)

    Khisamutdinov, A I; Velker, N N

    2014-01-01

    The talk examines a system of pairwise interaction particles, which models a rarefied gas in accordance with the nonlinear Boltzmann equation, the master equations of Markov evolution of this system and corresponding numerical Monte Carlo methods. Selection of some optimal method for simulation of rarefied gas dynamics depends on the spatial size of the gas flow domain. For problems with the Knudsen number K n of order unity 'imitation', or 'continuous time', Monte Carlo methods ([2]) are quite adequate and competitive. However if K n ≤ 0.1 (the large sizes), excessive punctuality, namely, the need to see all the pairs of particles in the latter, leads to a significant increase in computational cost(complexity). We are interested in to construct the optimal methods for Boltzmann equation problems with large enough spatial sizes of the flow. Speaking of the optimal, we mean that we are talking about algorithms for parallel computation to be implemented on high-performance multi-processor computers. The characteristic property of large systems is the weak dependence of sub-parts of each other at a sufficiently small time intervals. This property is taken into account in the approximate methods using various splittings of operator of corresponding master equations. In the paper, we develop the approximate method based on the splitting of the operator of master equations system 'over groups of particles' ([7]). The essence of the method is that the system of particles is divided into spatial subparts which are modeled independently for small intervals of time, using the precise 'imitation' method. The type of splitting used is different from other well-known type 'over collisions and displacements', which is an attribute of the known Direct simulation Monte Carlo methods. The second attribute of the last ones is the grid of the 'interaction cells', which is completely absent in the imitation methods. The

  19. Lempel-Ziv Compression in a Sliding Window

    DEFF Research Database (Denmark)

    Bille, Philip; Cording, Patrick Hagge; Fischer, Johannes

    2017-01-01

    result, we combine a simple modification and augmentation of the suffix tree with periodicity properties of sliding windows. We also apply this new technique to obtain an algorithm for the approximate rightmost LZ77 problem that uses O(n(log z + loglogn)) time and O(n) space and produces a (1 + ϵ......We present new algorithms for the sliding window Lempel-Ziv (LZ77) problem and the approximate rightmost LZ77 parsing problem. Our main result is a new and surprisingly simple algorithm that computes the sliding window LZ77 parse in O(w) space and either O(n) expected time or O(n log log w + z log...

  20. Adaptive thresholding and dynamic windowing method for automatic centroid detection of digital Shack-Hartmann wavefront sensor

    International Nuclear Information System (INIS)

    Yin Xiaoming; Li Xiang; Zhao Liping; Fang Zhongping

    2009-01-01

    A Shack-Hartmann wavefront sensor (SWHS) splits the incident wavefront into many subsections and transfers the distorted wavefront detection into the centroid measurement. The accuracy of the centroid measurement determines the accuracy of the SWHS. Many methods have been presented to improve the accuracy of the wavefront centroid measurement. However, most of these methods are discussed from the point of view of optics, based on the assumption that the spot intensity of the SHWS has a Gaussian distribution, which is not applicable to the digital SHWS. In this paper, we present a centroid measurement algorithm based on the adaptive thresholding and dynamic windowing method by utilizing image processing techniques for practical application of the digital SHWS in surface profile measurement. The method can detect the centroid of each focal spot precisely and robustly by eliminating the influence of various noises, such as diffraction of the digital SHWS, unevenness and instability of the light source, as well as deviation between the centroid of the focal spot and the center of the detection area. The experimental results demonstrate that the algorithm has better precision, repeatability, and stability compared with other commonly used centroid methods, such as the statistical averaging, thresholding, and windowing algorithms.

  1. Optimal field splitting for large intensity-modulated fields

    International Nuclear Information System (INIS)

    Kamath, Srijit; Sahni, Sartaj; Ranka, Sanjay; Li, Jonathan; Palta, Jatinder

    2004-01-01

    The multileaf travel range limitations on some linear accelerators require the splitting of a large intensity-modulated field into two or more adjacent abutting intensity-modulated subfields. The abutting subfields are then delivered as separate treatment fields. This workaround not only increases the treatment delivery time but it also increases the total monitor units (MU) delivered to the patient for a given prescribed dose. It is imperative that the cumulative intensity map of the subfields is exactly the same as the intensity map of the large field generated by the dose optimization algorithm, while satisfying hardware constraints of the delivery system. In this work, we describe field splitting algorithms that split a large intensity-modulated field into two or more intensity-modulated subfields with and without feathering, with optimal MU efficiency while satisfying the hardware constraints. Compared to a field splitting technique (without feathering) used in a commercial planning system, our field splitting algorithm (without feathering) shows a decrease in total MU of up to 26% on clinical cases and up to 63% on synthetic cases

  2. Geometrical splitting in Monte Carlo

    International Nuclear Information System (INIS)

    Dubi, A.; Elperin, T.; Dudziak, D.J.

    1982-01-01

    A statistical model is presented by which a direct statistical approach yielded an analytic expression for the second moment, the variance ratio, and the benefit function in a model of an n surface-splitting Monte Carlo game. In addition to the insight into the dependence of the second moment on the splitting parameters the main importance of the expressions developed lies in their potential to become a basis for in-code optimization of splitting through a general algorithm. Refs

  3. Cortical splitting of the mandible after irradiation. Special reference to osteoradionecrosis

    International Nuclear Information System (INIS)

    Katsura, Kouji; Ito, Jusuke; Hayashi, Takafumi; Taira, Shuhzou; Nakajima, Syunichi

    2001-01-01

    The purpose of this study was to discuss the relationship between radiation bone injuries and a splitting of the cortical bone in the radiation field. Between January 1993 and September 1998, 53 patients with head and neck cancer received radiotherapy. The study cohort consisted of 23 patients who were followed with computed tomographic scans more than one year after radiotherapy. We evaluated clinical and computed tomographic features. Computed tomographic scanning was performed with a section thickness of 3 or 4 mm. Bone images were obtained with identical window width (4000 Haunsfield units) and window level (1000 Haunsfield units). Splitting of the cortical bone was defined as disappearance of bone density in the cortical bone, showing a linear shape running parallel to the surface of the cortex. Splitting appeared in 9 sites in 8 patients. All patients fulfilled UICC criteria for classifying oral cancer. Most of the patients received external irradiation with a total radiation dose of 50 or 60 Gy. In all cases, splitting was found in the mandibular cortex at the site of muscle attachment, that was included in the radiation field. Appearance of bone changes in chronological order were periosteal reaction, splitting and bone necrosis. We speculate that splitting results from injuries to bone structure cells caused by blood flow disturbance after surgery and radiotherapy. It is suggested that such splitting can be a predictor of osteoradionecrosis. (author)

  4. A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Directory of Open Access Journals (Sweden)

    Jose Bernal

    2017-10-01

    Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  5. Cascaded Window Memoization for Medical Imaging

    OpenAIRE

    Khalvati , Farzad; Kianpour , Mehdi; Tizhoosh , Hamid ,

    2011-01-01

    Part 12: Medical Applications of ANN and Ethics of AI; International audience; Window Memoization is a performance improvement technique for image processing algorithms. It is based on removing computational redundancy in an algorithm applied to a single image, which is inherited from data redundancy in the image. The technique employs a fuzzy reuse mechanism to eliminate unnecessary computations. This paper extends the window memoization technique such that in addition to exploiting the data...

  6. Comparison of two split-window methods for retrieving land surface temperature from MODIS data

    Science.gov (United States)

    Zhao, Shaohua; Qin, Qiming; Yang, Yonghui; Xiong, Yujiu; Qiu, Guoyu

    2009-08-01

    Land surface temperature (LST) is a key parameter in environment and earth science study, especially for monitoring drought. The objective of this work is a comparison of two split-window methods: Mao method and Sobrino method, for retrieving LST using MODIS (Moderate-resolution Imaging Spectroradiometer) data in North China Plain. The results show that the max, min and mean errors of Mao method are 1.33K, 1.54K and 0.13K lower than the standard LST product respectively; while those of Sobrino method are 0.73K, 1.46K and 1.50K higher than the standard respectively. Validation of the two methods using LST product based on weather stations shows a good agreement between the standard and Sobrino method, with RMSE of 1.17K, whereas RMSE of Mao method is 1.85K. Finally, the study introduces the Sobmao method, which is based on Sobrino method but simplifies the estimation of atmospheric water vapour content using Mao method. The Sobmao method has almost the same accuracy with Sobrino method. With high accuracy and simplification of water vapour content estimation, the Sobmao method is recommendable in LST inversion for good application in Ningxia region, the northwest China, with mean error of 0.33K and the RMSE value of 0.91K.

  7. Splitting methods for split feasibility problems with application to Dantzig selectors

    International Nuclear Information System (INIS)

    He, Hongjin; Xu, Hong-Kun

    2017-01-01

    The split feasibility problem (SFP), which refers to the task of finding a point that belongs to a given nonempty, closed and convex set, and whose image under a bounded linear operator belongs to another given nonempty, closed and convex set, has promising applicability in modeling a wide range of inverse problems. Motivated by the increasingly data-driven regularization in the areas of signal/image processing and statistical learning, in this paper, we study the regularized split feasibility problem (RSFP), which provides a unified model for treating many real-world problems. By exploiting the split nature of the RSFP, we shall gainfully employ several efficient splitting methods to solve the model under consideration. A remarkable advantage of our methods lies in their easier subproblems in the sense that the resulting subproblems have closed-form representations or can be efficiently solved up to a high precision. As an interesting application, we apply the proposed algorithms for finding Dantzig selectors, in addition to demonstrating the effectiveness of the splitting methods through some computational results on synthetic and real medical data sets. (paper)

  8. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Energy Technology Data Exchange (ETDEWEB)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-07-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  9. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    International Nuclear Information System (INIS)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-01-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  10. Multiple electromechanically-induced-transparency windows and Fano resonances in hybrid nano-electro-optomechanics

    Science.gov (United States)

    Ullah, Kamran; Jing, Hui; Saif, Farhan

    2018-03-01

    We show multiple electromechanically-induced transparency (EMIT) windows in a hybrid nano-electro-optomechanical system in the presence of two-level atoms coupled to a single-mode cavity field. The multiple EMIT-window profile can be observed by controlling the atom field coupling as well as Coulomb coupling between the two charged mechanical resonators. We derive the analytical expression of the multiple-EMIT-windows profile and describe the splitting of multiple EMIT windows as a function of optomechanical coupling, atom-field coupling, and Coulomb coupling. In particular, we discuss the robustness of the system against the cavity decay rate. We compare the results of identical mechanical resonators to different mechanical resonators. We further show how the hybrid nano-electro-optomechanics coupled system can lead to the splitting of the multiple Fano resonances (MFR). The Fano resonances are very sensitive to decay terms in such systems, i.e., atoms, cavities, and the mechanical resonators.

  11. Evaluation of Building Energy Saving Through the Development of Venetian Blinds' Optimal Control Algorithm According to the Orientation and Window-to-Wall Ratio

    Science.gov (United States)

    Kwon, Hyuk Ju; Yeon, Sang Hun; Lee, Keum Ho; Lee, Kwang Ho

    2018-02-01

    As various studies focusing on building energy saving have been continuously conducted, studies utilizing renewable energy sources, instead of fossil fuel, are needed. In particular, studies regarding solar energy are being carried out in the field of building science; in order to utilize such solar energy effectively, solar radiation being brought into the indoors should be acquired and blocked properly. Blinds are a typical solar radiation control device that is capable of controlling indoor thermal and light environments. However, slat-type blinds are manually controlled, giving a negative effect on building energy saving. In this regard, studies regarding the automatic control of slat-type blinds have been carried out for the last couple of decades. Therefore, this study aims to provide preliminary data for optimal control research through the controlling of slat angle in slat-type blinds by comprehensively considering various input variables. The window area ratio and orientation were selected as input variables. It was found that an optimal control algorithm was different among each window-to-wall ratio and window orientation. In addition, through comparing and analyzing the building energy saving performance for each condition by applying the developed algorithms to simulations, up to 20.7 % energy saving was shown in the cooling period and up to 12.3 % energy saving was shown in the heating period. In addition, building energy saving effect was greater as the window area ratio increased given the same orientation, and the effects of window-to-wall ratio in the cooling period were higher than those of window-to-wall ratio in the heating period.

  12. Practical mine ventilation optimization based on genetic algorithms for free splitting networks

    Energy Technology Data Exchange (ETDEWEB)

    Acuna, E.; Maynard, R.; Hall, S. [Laurentian Univ., Sudbury, ON (Canada). Mirarco Mining Innovation; Hardcastle, S.G.; Li, G. [Natural Resources Canada, Sudbury, ON (Canada). CANMET Mining and Mineral Sciences Laboratories; Lowndes, I.S. [Nottingham Univ., Nottingham (United Kingdom). Process and Environmental Research Division; Tonnos, A. [Bestech, Sudbury, ON (Canada)

    2010-07-01

    The method used to optimize the design and operation of mine ventilation has generally been based on case studies and expert knowledge. It has yet to benefit from optimization techniques used and proven in other fields of engineering. Currently, optimization of mine ventilation systems is a manual based decision process performed by an experienced mine ventilation specialist assisted by commercial ventilation distribution solvers. These analysis tools are widely used in the mining industry to evaluate the practical and economic viability of alternative ventilation system configurations. The scenario which is usually selected is the one that reports the lowest energy consumption while delivering the required airflow distribution. Since most commercial solvers do not have an integrated optimization algorithm network, the process of generating a series of potential ventilation solutions using the conventional iterative design strategy can be time consuming. For that reason, a genetic algorithm (GA) optimization routine was developed in combination with a ventilation solver to determine the potential optimal solutions of a primary mine ventilation system based on a free splitting network. The optimization method was used in a small size mine ventilation network. The technique was shown to have the capacity to generate good feasible solutions and improve upon the manual results obtained by mine ventilation specialists. 9 refs., 7 tabs., 3 figs.

  13. A second order splitting algorithm for thermally-driven flow problems

    NARCIS (Netherlands)

    Minev, P.D.; Vosse, van de F.N.; Timmermans, L.J.P.; Steenhoven, van A.A.

    1995-01-01

    A splitting technique for solutions of the Navier—Stokes and the energy equations, in Boussinesq approximately, is presented. The equations are first integrated in time using a splitting procedure and then discretized spatially by means of a high-order spectral element method. The whole technique is

  14. Windowed time-reversal music technique for super-resolution ultrasound imaging

    Science.gov (United States)

    Huang, Lianjie; Labyed, Yassin

    2018-05-01

    Systems and methods for super-resolution ultrasound imaging using a windowed and generalized TR-MUSIC algorithm that divides the imaging region into overlapping sub-regions and applies the TR-MUSIC algorithm to the windowed backscattered ultrasound signals corresponding to each sub-region. The algorithm is also structured to account for the ultrasound attenuation in the medium and the finite-size effects of ultrasound transducer elements.

  15. Adaptive Backoff Algorithm for Contention Window for Dense IEEE 802.11 WLANs

    Directory of Open Access Journals (Sweden)

    Ikram Syed

    2016-01-01

    Full Text Available The performance improvement in IEEE 802.11 WLANs in widely fluctuating network loads is a challenging task. To improve the performance in this saturated state, we develop an adaptive backoff algorithm that maximizes the system throughput, reduces the collision probability, and maintains a high fairness for the IEEE 802.11 DCF under dense network conditions. In this paper, we present two main advantages of the proposed ABA-CW algorithm. First, it estimates the number of active stations and then calculates an optimal contention window based on the active station number. Each station calculates the channel state probabilities by observing the channel for the total backoff period. Based on these channel states probabilities, each station can estimate the number of active stations in the network, after which it calculates the optimal CW utilizing the estimated active number of stations. To evaluate the proposed mechanism, we derive an analytical model to determine the network performance. From our results, the proposed ABA-CW mechanism achieved better system performance compared to fixed-CW (BEB, EIED, LILD, and SETL and adaptive-CW (AMOCW, Idle Sense mechanisms. The simulation results confirmed the outstanding performance of the proposed mechanism in that it led to a lower collision probability, higher throughput, and high fairness.

  16. Start-up flow in a three-dimensional lid-driven cavity by means of a massively parallel direction splitting algorithm

    KAUST Repository

    Guermond, J. L.

    2011-05-04

    The purpose of this paper is to validate a new highly parallelizable direction splitting algorithm. The parallelization capabilities of this algorithm are illustrated by providing a highly accurate solution for the start-up flow in a three-dimensional impulsively started lid-driven cavity of aspect ratio 1×1×2 at Reynolds numbers 1000 and 5000. The computations are done in parallel (up to 1024 processors) on adapted grids of up to 2 billion nodes in three space dimensions. Velocity profiles are given at dimensionless times t=4, 8, and 12; at least four digits are expected to be correct at Re=1000. © 2011 John Wiley & Sons, Ltd.

  17. Optimizing TCP Performance over UMTS with Split TCP Proxy

    DEFF Research Database (Denmark)

    Hu, Liang; Dittmann, Lars

    2009-01-01

    . To cope with large delay bandwidth product, we propose a novel concept of split TCP proxy which is placed at GGSN between UNITS network and Internet. The split proxy divides the bandwidth delay product into two parts, resulting in two TCP connections with smaller bandwidth delay products which can...... be pipelined and thus operating at higher speeds. Simulation results show, the split TCP proxy can significantly improve the TCP performance in terms of RLC throughput under high bit rate DCH channel scenario (e.g.256 kbps). On the other hand, it only brings small performance improvement under low bit rate DCH...... scenario (e.g.64 kbps). Besides, the split TCP proxy brings more performance gain for downloading large files than downloading small ones. To the end, for the configuration of the split proxy, an aggressive initial TCP congestion window size (e.g. 10 MSS) at proxy is particularly useful for radio links...

  18. Are Ducted Mini-Splits Worth It?

    Energy Technology Data Exchange (ETDEWEB)

    Winkler, Jonathan M [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Maguire, Jeffrey B [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Metzger, Cheryn E. [Pacific Northwest National Laboratory; Zhang, Jason [Pacific Northwest National Laboratory

    2018-02-01

    Ducted mini-split heat pumps are gaining popularity in some regions of the country due to their energy-efficient specifications and their ability to be hidden from sight. Although product and install costs are typically higher than the ductless mini-split heat pumps, this technology is well worth the premium for some homeowners who do not like to see an indoor unit in their living area. Due to the interest in this technology by local utilities and homeowners, the Bonneville Power Administration (BPA) has funded the Pacific Northwest National Laboratory (PNNL) and the National Renewable Energy Laboratory (NREL) to develop capabilities within the Building Energy Optimization (BEopt) tool to model ducted mini-split heat pumps. After the fundamental capabilities were added, energy-use results could be compared to other technologies that were already in BEopt, such as zonal electric resistance heat, central air source heat pumps, and ductless mini-split heat pumps. Each of these technologies was then compared using five prototype configurations in three different BPA heating zones to determine how the ducted mini-split technology would perform under different scenarios. The result of this project was a set of EnergyPlus models representing the various prototype configurations in each climate zone. Overall, the ducted mini-split heat pumps saved about 33-60% compared to zonal electric resistance heat (with window AC systems modeled in the summer). The results also showed that the ducted mini-split systems used about 4% more energy than the ductless mini-split systems, which saved about 37-64% compared to electric zonal heat (depending on the prototype and climate).

  19. Detection with Enhanced Energy Windowing Phase I Report

    Energy Technology Data Exchange (ETDEWEB)

    Bass, David A. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Enders, Alexander L. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2016-12-01

    This document reviews the progress of Phase I of the Detection with Enhanced Energy Windowing (DEEW) project. The DEEW project is the implementation of software incorporating an algorithm which reviews data generated by radiation portal monitors and utilizes advanced and novel techniques for detecting radiological and fissile material while not alarming on Naturally Occurring Radioactive Material. Independent testing indicated that the Enhanced Energy Windowing algorithm showed promise at reducing the probability of alarm in the stream of commerce compared to existing algorithms and other developmental algorithms, while still maintaining adequate sensitivity to threats. This document contains a brief description of the project, instructions for setting up and running the applications, and guidance to help make reviewing the output files and source code easier.

  20. SU-F-T-273: Using a Diode Array to Explore the Weakness of TPS DoseCalculation Algorithm for VMAT and Sliding Window Techniques

    Energy Technology Data Exchange (ETDEWEB)

    Park, J; Lu, B; Yan, G; Park, J; Li, F; Li, J; Liu, C [University of Florida, Gainesville, FL (United States)

    2016-06-15

    Purpose: To identify the weakness of dose calculation algorithm in a treatment planning system for volumetric modulated arc therapy (VMAT) and sliding window (SW) techniques using a two-dimensional diode array. Methods: The VMAT quality assurance(QA) was implemented with a diode array using multiple partial arcs that divided from a VMAT plan; each partial arc has the same segments and the original monitor units. Arc angles were less than ± 30°. Multiple arcs delivered through consecutive and repetitive gantry operating clockwise and counterclockwise. The source-toaxis distance setup with the effective depths of 10 and 20 cm were used for a diode array. To figure out dose errors caused in delivery of VMAT fields, the numerous fields having the same segments with the VMAT field irradiated using different delivery techniques of static and step-and-shoot. The dose distributions of the SW technique were evaluated by creating split fields having fine moving steps of multi-leaf collimator leaves. Calculated doses using the adaptive convolution algorithm were analyzed with measured ones with distance-to-agreement and dose difference of 3 mm and 3%.. Results: While the beam delivery through static and step-and-shoot techniques showed the passing rate of 97 ± 2%, partial arc delivery of the VMAT fields brought out passing rate of 85%. However, when leaf motion was restricted less than 4.6 mm/°, passing rate was improved up to 95 ± 2%. Similar passing rate were obtained for both 10 and 20 cm effective depth setup. The calculated doses using the SW technique showed the dose difference over 7% at the final arrival point of moving leaves. Conclusion: Error components in dynamic delivery of modulated beams were distinguished by using the suggested QA method. This partial arc method can be used for routine VMAT QA. Improved SW calculation algorithm is required to provide accurate estimated doses.

  1. Adaptive Window Zero-Crossing-Based Instantaneous Frequency Estimation

    Directory of Open Access Journals (Sweden)

    Sekhar S Chandra

    2004-01-01

    Full Text Available We address the problem of estimating instantaneous frequency (IF of a real-valued constant amplitude time-varying sinusoid. Estimation of polynomial IF is formulated using the zero-crossings of the signal. We propose an algorithm to estimate nonpolynomial IF by local approximation using a low-order polynomial, over a short segment of the signal. This involves the choice of window length to minimize the mean square error (MSE. The optimal window length found by directly minimizing the MSE is a function of the higher-order derivatives of the IF which are not available a priori. However, an optimum solution is formulated using an adaptive window technique based on the concept of intersection of confidence intervals. The adaptive algorithm enables minimum MSE-IF (MMSE-IF estimation without requiring a priori information about the IF. Simulation results show that the adaptive window zero-crossing-based IF estimation method is superior to fixed window methods and is also better than adaptive spectrogram and adaptive Wigner-Ville distribution (WVD-based IF estimators for different signal-to-noise ratio (SNR.

  2. Implicit flux-split schemes for the Euler equations

    Science.gov (United States)

    Thomas, J. L.; Walters, R. W.; Van Leer, B.

    1985-01-01

    Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

  3. A filtered backprojection algorithm with characteristics of the iterative landweber algorithm

    OpenAIRE

    L. Zeng, Gengsheng

    2012-01-01

    Purpose: In order to eventually develop an analytical algorithm with noise characteristics of an iterative algorithm, this technical note develops a window function for the filtered backprojection (FBP) algorithm in tomography that behaves as an iterative Landweber algorithm.

  4. SplitRacer - a new Semi-Automatic Tool to Quantify And Interpret Teleseismic Shear-Wave Splitting

    Science.gov (United States)

    Reiss, M. C.; Rumpker, G.

    2017-12-01

    We have developed a semi-automatic, MATLAB-based GUI to combine standard seismological tasks such as the analysis and interpretation of teleseismic shear-wave splitting. Shear-wave splitting analysis is widely used to infer seismic anisotropy, which can be interpreted in terms of lattice-preferred orientation of mantle minerals, shape-preferred orientation caused by fluid-filled cracks or alternating layers. Seismic anisotropy provides a unique link between directly observable surface structures and the more elusive dynamic processes in the mantle below. Thus, resolving the seismic anisotropy of the lithosphere/asthenosphere is of particular importance for geodynamic modeling and interpretations. The increasing number of seismic stations from temporary experiments and permanent installations creates a new basis for comprehensive studies of seismic anisotropy world-wide. However, the increasingly large data sets pose new challenges for the rapid and reliably analysis of teleseismic waveforms and for the interpretation of the measurements. Well-established routines and programs are available but are often impractical for analyzing large data sets from hundreds of stations. Additionally, shear wave splitting results are seldom evaluated using the same well-defined quality criteria which may complicate comparison with results from different studies. SplitRacer has been designed to overcome these challenges by incorporation of the following processing steps: i) downloading of waveform data from multiple stations in mseed-format using FDSNWS tools; ii) automated initial screening and categorizing of XKS-waveforms using a pre-set SNR-threshold; iii) particle-motion analysis of selected phases at longer periods to detect and correct for sensor misalignment; iv) splitting analysis of selected phases based on transverse-energy minimization for multiple, randomly-selected, relevant time windows; v) one and two-layer joint-splitting analysis for all phases at one station by

  5. Focal plane scanner with reciprocating spatial window

    Science.gov (United States)

    Mao, Chengye (Inventor)

    2000-01-01

    A focal plane scanner having a front objective lens, a spatial window for selectively passing a portion of the image therethrough, and a CCD array for receiving the passed portion of the image. All embodiments have a common feature whereby the spatial window and CCD array are mounted for simultaneous relative reciprocating movement with respect to the front objective lens, and the spatial window is mounted within the focal plane of the front objective. In a first embodiment, the spatial window is a slit and the CCD array is one-dimensional, and successive rows of the image in the focal plane of the front objective lens are passed to the CCD array by an image relay lens interposed between the slit and the CCD array. In a second embodiment, the spatial window is a slit, the CCD array is two-dimensional, and a prism-grating-prism optical spectrometer is interposed between the slit and the CCD array so as to cause the scanned row to be split into a plurality of spectral separations onto the CCD array. In a third embodiment, the CCD array is two-dimensional and the spatial window is a rectangular linear variable filter (LVF) window, so as to cause the scanned rows impinging on the LVF to be bandpass filtered into spectral components onto the CCD array through an image relay lens interposed between the LVF and the CCD array.

  6. Simulated annealing (SA to vehicle routing problems with soft time windows

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2014-12-01

    Full Text Available The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW. For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific period of time to receive them. The Operation Research was representative combinatorial optimization problems and is known to be NP-hard. In this research algorithm, use Simulated Annealing (SA to determine the optimum solutions which rapidly time solving. After developed the algorithms, apply them to examine the factors and the optimum extended time windows and test these factors with vehicle problem routing under specific time windows by Solomon in OR-Library in case of maximum 25 customers. Meanwhile, 6 problems are including of C101, C102, R101, R102, RC101 and RC102 respectively. The result shows the optimum extended time windows at level of 50%. At last, after comparison these answers with the case of vehicle problem routing under specific time windows and flexible time windows, found that percentage errors on number of vehicles approximately by -28.57% and percentage errors on distances approximately by -28.57% which this algorithm spent average processing time on 45.5 sec/problems.

  7. Flow enforcement algorithms for ATM networks

    DEFF Research Database (Denmark)

    Dittmann, Lars; Jacobsen, Søren B.; Moth, Klaus

    1991-01-01

    Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic...

  8. Split-plot designs for robotic serial dilution assays.

    Science.gov (United States)

    Buzas, Jeffrey S; Wager, Carrie G; Lansky, David M

    2011-12-01

    This article explores effective implementation of split-plot designs in serial dilution bioassay using robots. We show that the shortest path for a robot to fill plate wells for a split-plot design is equivalent to the shortest common supersequence problem in combinatorics. We develop an algorithm for finding the shortest common supersequence, provide an R implementation, and explore the distribution of the number of steps required to implement split-plot designs for bioassay through simulation. We also show how to construct collections of split plots that can be filled in a minimal number of steps, thereby demonstrating that split-plot designs can be implemented with nearly the same effort as strip-plot designs. Finally, we provide guidelines for modeling data that result from these designs. © 2011, The International Biometric Society.

  9. A multimodal logistics service network design with time windows and environmental concerns.

    Science.gov (United States)

    Zhang, Dezhi; He, Runzhong; Li, Shuangyan; Wang, Zhongwei

    2017-01-01

    The design of a multimodal logistics service network with customer service time windows and environmental costs is an important and challenging issue. Accordingly, this work established a model to minimize the total cost of multimodal logistics service network design with time windows and environmental concerns. The proposed model incorporates CO2 emission costs to determine the optimal transportation mode combinations and investment selections for transfer nodes, which consider transport cost, transport time, carbon emission, and logistics service time window constraints. Furthermore, genetic and heuristic algorithms are proposed to set up the abovementioned optimal model. A numerical example is provided to validate the model and the abovementioned two algorithms. Then, comparisons of the performance of the two algorithms are provided. Finally, this work investigates the effects of the logistics service time windows and CO2 emission taxes on the optimal solution. Several important management insights are obtained.

  10. Single-machine common/slack due window assignment problems with linear decreasing processing times

    Science.gov (United States)

    Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia

    2017-08-01

    This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.

  11. Energy management of a power-split plug-in hybrid electric vehicle based on genetic algorithm and quadratic programming

    Science.gov (United States)

    Chen, Zheng; Mi, Chris Chunting; Xiong, Rui; Xu, Jun; You, Chenwen

    2014-02-01

    This paper introduces an online and intelligent energy management controller to improve the fuel economy of a power-split plug-in hybrid electric vehicle (PHEV). Based on analytic analysis between fuel-rate and battery current at different driveline power and vehicle speed, quadratic equations are applied to simulate the relationship between battery current and vehicle fuel-rate. The power threshold at which engine is turned on is optimized by genetic algorithm (GA) based on vehicle fuel-rate, battery state of charge (SOC) and driveline power demand. The optimal battery current when the engine is on is calculated using quadratic programming (QP) method. The proposed algorithm can control the battery current effectively, which makes the engine work more efficiently and thus reduce the fuel-consumption. Moreover, the controller is still applicable when the battery is unhealthy. Numerical simulations validated the feasibility of the proposed controller.

  12. Computing Diameter in the Streaming and Sliding-Window Models (Preprint)

    National Research Council Canada - National Science Library

    Feigenbaum, Joan; Kannan, Sampath; Zhang, Jian

    2002-01-01

    We investigate the diameter problem in the streaming and sliding-window models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diameter requires Omega(n) bits of space...

  13. Solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators.

    Science.gov (United States)

    Zhao, Jing; Zong, Haili

    2018-01-01

    In this paper, we propose parallel and cyclic iterative algorithms for solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators. We also combine the process of cyclic and parallel iterative methods and propose two mixed iterative algorithms. Our several algorithms do not need any prior information about the operator norms. Under mild assumptions, we prove weak convergence of the proposed iterative sequences in Hilbert spaces. As applications, we obtain several iterative algorithms to solve the multiple-set split equality problem.

  14. Two-loop QED corrections to the Altarelli-Parisi splitting functions

    Energy Technology Data Exchange (ETDEWEB)

    Florian, Daniel de [International Center for Advanced Studies (ICAS), UNSAM,Campus Miguelete, 25 de Mayo y Francia (1650) Buenos Aires (Argentina); Sborlini, Germán F.R.; Rodrigo, Germán [Instituto de Física Corpuscular, Universitat de València,Consejo Superior de Investigaciones Científicas,Parc Científic, E-46980 Paterna, Valencia (Spain)

    2016-10-11

    We compute the two-loop QED corrections to the Altarelli-Parisi (AP) splitting functions by using a deconstructive algorithmic Abelianization of the well-known NLO QCD corrections. We present explicit results for the full set of splitting kernels in a basis that includes the leptonic distribution functions that, starting from this order in the QED coupling, couple to the partonic densities. Finally, we perform a phenomenological analysis of the impact of these corrections in the splitting functions.

  15. SplitRacer - a semi-automatic tool for the analysis and interpretation of teleseismic shear-wave splitting

    Science.gov (United States)

    Reiss, Miriam Christina; Rümpker, Georg

    2017-04-01

    We present a semi-automatic, graphical user interface tool for the analysis and interpretation of teleseismic shear-wave splitting in MATLAB. Shear wave splitting analysis is a standard tool to infer seismic anisotropy, which is often interpreted as due to lattice-preferred orientation of e.g. mantle minerals or shape-preferred orientation caused by cracks or alternating layers in the lithosphere and hence provides a direct link to the earth's kinematic processes. The increasing number of permanent stations and temporary experiments result in comprehensive studies of seismic anisotropy world-wide. Their successive comparison with a growing number of global models of mantle flow further advances our understanding the earth's interior. However, increasingly large data sets pose the inevitable question as to how to process them. Well-established routines and programs are accurate but often slow and impractical for analyzing a large amount of data. Additionally, shear wave splitting results are seldom evaluated using the same quality criteria which complicates a straight-forward comparison. SplitRacer consists of several processing steps: i) download of data per FDSNWS, ii) direct reading of miniSEED-files and an initial screening and categorizing of XKS-waveforms using a pre-set SNR-threshold. iii) an analysis of the particle motion of selected phases and successive correction of the sensor miss-alignment based on the long-axis of the particle motion. iv) splitting analysis of selected events: seismograms are first rotated into radial and transverse components, then the energy-minimization method is applied, which provides the polarization and delay time of the phase. To estimate errors, the analysis is done for different randomly-chosen time windows. v) joint-splitting analysis for all events for one station, where the energy content of all phases is inverted simultaneously. This allows to decrease the influence of noise and to increase robustness of the measurement

  16. Fully automatic time-window selection using machine learning for global adjoint tomography

    Science.gov (United States)

    Chen, Y.; Hill, J.; Lei, W.; Lefebvre, M. P.; Bozdag, E.; Komatitsch, D.; Tromp, J.

    2017-12-01

    Selecting time windows from seismograms such that the synthetic measurements (from simulations) and measured observations are sufficiently close is indispensable in a global adjoint tomography framework. The increasing amount of seismic data collected everyday around the world demands "intelligent" algorithms for seismic window selection. While the traditional FLEXWIN algorithm can be "automatic" to some extent, it still requires both human input and human knowledge or experience, and thus is not deemed to be fully automatic. The goal of intelligent window selection is to automatically select windows based on a learnt engine that is built upon a huge number of existing windows generated through the adjoint tomography project. We have formulated the automatic window selection problem as a classification problem. All possible misfit calculation windows are classified as either usable or unusable. Given a large number of windows with a known selection mode (select or not select), we train a neural network to predict the selection mode of an arbitrary input window. Currently, the five features we extract from the windows are its cross-correlation value, cross-correlation time lag, amplitude ratio between observed and synthetic data, window length, and minimum STA/LTA value. More features can be included in the future. We use these features to characterize each window for training a multilayer perceptron neural network (MPNN). Training the MPNN is equivalent to solve a non-linear optimization problem. We use backward propagation to derive the gradient of the loss function with respect to the weighting matrices and bias vectors and use the mini-batch stochastic gradient method to iteratively optimize the MPNN. Numerical tests show that with a careful selection of the training data and a sufficient amount of training data, we are able to train a robust neural network that is capable of detecting the waveforms in an arbitrary earthquake data with negligible detection error

  17. Inversion of Land Surface Temperature (LST Using Terra ASTER Data: A Comparison of Three Algorithms

    Directory of Open Access Journals (Sweden)

    Milton Isaya Ndossi

    2016-12-01

    Full Text Available Land Surface Temperature (LST is an important measurement in studies related to the Earth surface’s processes. The Advanced Space-borne Thermal Emission and Reflection Radiometer (ASTER instrument onboard the Terra spacecraft is the currently available Thermal Infrared (TIR imaging sensor with the highest spatial resolution. This study involves the comparison of LSTs inverted from the sensor using the Split Window Algorithm (SWA, the Single Channel Algorithm (SCA and the Planck function. This study has used the National Oceanic and Atmospheric Administration’s (NOAA data to model and compare the results from the three algorithms. The data from the sensor have been processed by the Python programming language in a free and open source software package (QGIS to enable users to make use of the algorithms. The study revealed that the three algorithms are suitable for LST inversion, whereby the Planck function showed the highest level of accuracy, the SWA had moderate level of accuracy and the SCA had the least accuracy. The algorithms produced results with Root Mean Square Errors (RMSE of 2.29 K, 3.77 K and 2.88 K for the Planck function, the SCA and SWA respectively.

  18. Efficient scheduling request algorithm for opportunistic wireless access

    KAUST Repository

    Nam, Haewoon

    2011-08-01

    An efficient scheduling request algorithm for opportunistic wireless access based on user grouping is proposed in this paper. Similar to the well-known opportunistic splitting algorithm, the proposed algorithm initially adjusts (or lowers) the threshold during a guard period if no user sends a scheduling request. However, if multiple users make requests simultaneously and therefore a collision occurs, the proposed algorithm no longer updates the threshold but narrows down the user search space by splitting the users into multiple groups iteratively, whereas the opportunistic splitting algorithm keeps adjusting the threshold until a single user is found. Since the threshold is only updated when no user sends a request, it is shown that the proposed algorithm significantly alleviates the burden of the signaling for the threshold distribution to the users by the scheduler. More importantly, the proposed algorithm requires a less number of mini-slots to make a user selection given a certain scheduling outage probability. © 2011 IEEE.

  19. Analysis of inconsistent source sampling in monte carlo weight-window variance reduction methods

    Directory of Open Access Journals (Sweden)

    David P. Griesheimer

    2017-09-01

    Full Text Available The application of Monte Carlo (MC to large-scale fixed-source problems has recently become possible with new hybrid methods that automate generation of parameters for variance reduction techniques. Two common variance reduction techniques, weight windows and source biasing, have been automated and popularized by the consistent adjoint-driven importance sampling (CADIS method. This method uses the adjoint solution from an inexpensive deterministic calculation to define a consistent set of weight windows and source particles for a subsequent MC calculation. One of the motivations for source consistency is to avoid the splitting or rouletting of particles at birth, which requires computational resources. However, it is not always possible or desirable to implement such consistency, which results in inconsistent source biasing. This paper develops an original framework that mathematically expresses the coupling of the weight window and source biasing techniques, allowing the authors to explore the impact of inconsistent source sampling on the variance of MC results. A numerical experiment supports this new framework and suggests that certain classes of problems may be relatively insensitive to inconsistent source sampling schemes with moderate levels of splitting and rouletting.

  20. Evaluation of Certain Pharmaceutical Quality Attributes of Lisinopril Split Tablets

    Directory of Open Access Journals (Sweden)

    Khairi M. S. Fahelelbom

    2016-10-01

    Full Text Available Tablet splitting is an accepted practice for the administration of drugs for a variety of reasons, including dose adjustment, ease of swallowing and cost savings. The purpose of this study was to evaluate the physical properties of lisinopril tablets as a result of splitting the tablets either by hand or with a splitting device. The impact of the splitting technique of lisinopril (Zestril® tablets, 20 mg on certain physical parameters such as weight variation, friability, disintegration, dissolution and drug content were studied. Splitting the tablets either by hand or with a splitter resulted in a minute but statistically significant average weight loss of <0.25% of the tablet to the surrounding environment. The variability in the weight of the hand-split tablet halves was more pronounced (37 out of 40 tablet halves varied by more than 10% from the mean weight than when using the tablet splitter (3 out of 40 tablet halves. The dissolution and drug content of the hand-split tablets were therefore affected because of weight differences. However, the pharmacopoeia requirements for friability and disintegration time were met. Hand splitting of tablets can result in an inaccurate dose and may present clinical safety issues, especially for drugs with a narrow therapeutic window in which large fluctuations in drug concentrations are undesirable. It is recommended to use tablets with the exact desired dose, but if this is not an option, then a tablet splitter could be used.

  1. Conserved PCR primer set designing for closely-related species to complete mitochondrial genome sequencing using a sliding window-based PSO algorithm.

    Directory of Open Access Journals (Sweden)

    Cheng-Hong Yang

    Full Text Available BACKGROUND: Complete mitochondrial (mt genome sequencing is becoming increasingly common for phylogenetic reconstruction and as a model for genome evolution. For long template sequencing, i.e., like the entire mtDNA, it is essential to design primers for Polymerase Chain Reaction (PCR amplicons which are partly overlapping each other. The presented chromosome walking strategy provides the overlapping design to solve the problem for unreliable sequencing data at the 5' end and provides the effective sequencing. However, current algorithms and tools are mostly focused on the primer design for a local region in the genomic sequence. Accordingly, it is still challenging to provide the primer sets for the entire mtDNA. METHODOLOGY/PRINCIPAL FINDINGS: The purpose of this study is to develop an integrated primer design algorithm for entire mt genome in general, and for the common primer sets for closely-related species in particular. We introduce ClustalW to generate the multiple sequence alignment needed to find the conserved sequences in closely-related species. These conserved sequences are suitable for designing the common primers for the entire mtDNA. Using a heuristic algorithm particle swarm optimization (PSO, all the designed primers were computationally validated to fit the common primer design constraints, such as the melting temperature, primer length and GC content, PCR product length, secondary structure, specificity, and terminal limitation. The overlap requirement for PCR amplicons in the entire mtDNA is satisfied by defining the overlapping region with the sliding window technology. Finally, primer sets were designed within the overlapping region. The primer sets for the entire mtDNA sequences were successfully demonstrated in the example of two closely-related fish species. The pseudo code for the primer design algorithm is provided. CONCLUSIONS/SIGNIFICANCE: In conclusion, it can be said that our proposed sliding window-based PSO

  2. Mesh-based weight window approach for Monte Carlo simulation

    International Nuclear Information System (INIS)

    Liu, L.; Gardner, R.P.

    1997-01-01

    The Monte Carlo method has been increasingly used to solve particle transport problems. Statistical fluctuation from random sampling is the major limiting factor of its application. To obtain the desired precision, variance reduction techniques are indispensable for most practical problems. Among various variance reduction techniques, the weight window method proves to be one of the most general, powerful, and robust. The method is implemented in the current MCNP code. An importance map is estimated during a regular Monte Carlo run, and then the map is used in the subsequent run for splitting and Russian roulette games. The major drawback of this weight window method is lack of user-friendliness. It normally requires that users divide the large geometric cells into smaller ones by introducing additional surfaces to ensure an acceptable spatial resolution of the importance map. In this paper, we present a new weight window approach to overcome this drawback

  3. Split and delay photon correlation spectroscopy with a visible light

    International Nuclear Information System (INIS)

    Rasch, Marten

    2016-04-01

    The development and performance of a setup constructed with the aim for the split pulse photon correlation spectroscopy is presented in this thesis. The double pulse time structure is accomplished with help of an Acusto-Optic Modulator (AOM) crystal, which mimics the splitting and delaying of photon pulses. The setup provides double pulses and allows to control the pulse width and delay and to synchronize them into one camera exposure window. The performance of the setup was successfully verified in a proof of principle experiment with a model system of polystyrene particles following Brownian motion. The measured radius of particles obtained with from the split pulse experiment (R h =(2.567±0.097) μm) is in agreement with the particle size provided by the manufacturer (R=(2.26±0.08) μm). The achieved results show higher statistics compared to a standard Dynamic Light Scattering (DLS) measurement.

  4. Effective Approach to Calculate Analysis Window in Infinite Discrete Gabor Transform

    Directory of Open Access Journals (Sweden)

    Rui Li

    2018-01-01

    Full Text Available The long-periodic/infinite discrete Gabor transform (DGT is more effective than the periodic/finite one in many applications. In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT. By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT. The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms. The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.

  5. Understanding Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  6. Iterative algorithms to approximate canonical Gabor windows: Computational aspects

    DEFF Research Database (Denmark)

    Janssen, A.J.E.M; Søndergaard, Peter Lempel

    in the iteration step: norm scaling, where in each step the windows are normalized, and initial scaling where we only scale in the very beginning. Norm scaling leads to fast, but conditionally convergent methods, while initial scaling leads to unconditionally convergent methods, but with possibly suboptimal...

  7. Distributed Solutions for Loosely Coupled Feasibility Problems Using Proximal Splitting Methods

    DEFF Research Database (Denmark)

    Pakazad, Sina Khoshfetrat; Andersen, Martin Skovgaard; Hansson, Anders

    2014-01-01

    In this paper,we consider convex feasibility problems (CFPs) where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal splitting methods to convex minimization reformulations ...

  8. A novel power harmonic analysis method based on Nuttall-Kaiser combination window double spectrum interpolated FFT algorithm

    Science.gov (United States)

    Jin, Tao; Chen, Yiyang; Flesch, Rodolfo C. C.

    2017-11-01

    Harmonics pose a great threat to safe and economical operation of power grids. Therefore, it is critical to detect harmonic parameters accurately to design harmonic compensation equipment. The fast Fourier transform (FFT) is widely used for electrical popular power harmonics analysis. However, the barrier effect produced by the algorithm itself and spectrum leakage caused by asynchronous sampling often affects the harmonic analysis accuracy. This paper examines a new approach for harmonic analysis based on deducing the modifier formulas of frequency, phase angle, and amplitude, utilizing the Nuttall-Kaiser window double spectrum line interpolation method, which overcomes the shortcomings in traditional FFT harmonic calculations. The proposed approach is verified numerically and experimentally to be accurate and reliable.

  9. An Improved Mono-Window Algorithm for Land Surface Temperature Retrieval from Landsat 8 Thermal Infrared Sensor Data

    Directory of Open Access Journals (Sweden)

    Fei Wang

    2015-04-01

    Full Text Available The successful launch of the Landsat 8 satellite with two thermal infrared bands on February 11, 2013, for continuous Earth observation provided another opportunity for remote sensing of land surface temperature (LST. However, calibration notices issued by the United States Geological Survey (USGS indicated that data from the Landsat 8 Thermal Infrared Sensor (TIRS Band 11 have large uncertainty and suggested using TIRS Band 10 data as a single spectral band for LST estimation. In this study, we presented an improved mono-window (IMW algorithm for LST retrieval from the Landsat 8 TIRS Band 10 data. Three essential parameters (ground emissivity, atmospheric transmittance and effective mean atmospheric temperature were required for the IMW algorithm to retrieve LST. A new method was proposed to estimate the parameter of effective mean atmospheric temperature from local meteorological data. The other two essential parameters could be both estimated through the so-called land cover approach. Sensitivity analysis conducted for the IMW algorithm revealed that the possible error in estimating the required atmospheric water vapor content has the most significant impact on the probable LST estimation error. Under moderate errors in both water vapor content and ground emissivity, the algorithm had an accuracy of ~1.4 K for LST retrieval. Validation of the IMW algorithm using the simulated datasets for various situations indicated that the LST difference between the retrieved and the simulated ones was 0.67 K on average, with an RMSE of 0.43 K. Comparison of our IMW algorithm with the single-channel (SC algorithm for three main atmosphere profiles indicated that the average error and RMSE of the IMW algorithm were −0.05 K and 0.84 K, respectively, which were less than the −2.86 K and 1.05 K of the SC algorithm. Application of the IMW algorithm to Nanjing and its vicinity in east China resulted in a reasonable LST estimation for the region. Spatial

  10. Iterated local search algorithm for solving the orienteering problem with soft time windows.

    Science.gov (United States)

    Aghezzaf, Brahim; Fahim, Hassan El

    2016-01-01

    In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.

  11. Modified Projection Algorithms for Solving the Split Equality Problems

    Directory of Open Access Journals (Sweden)

    Qiao-Li Dong

    2014-01-01

    proposed a CQ algorithm for solving it. In this paper, we propose a modification for the CQ algorithm, which computes the stepsize adaptively and performs an additional projection step onto two half-spaces in each iteration. We further propose a relaxation scheme for the self-adaptive projection algorithm by using projections onto half-spaces instead of those onto the original convex sets, which is much more practical. Weak convergence results for both algorithms are analyzed.

  12. New Splitting Criteria for Decision Trees in Stationary Data Streams.

    Science.gov (United States)

    Jaworski, Maciej; Duda, Piotr; Rutkowski, Leszek; Jaworski, Maciej; Duda, Piotr; Rutkowski, Leszek; Rutkowski, Leszek; Duda, Piotr; Jaworski, Maciej

    2018-06-01

    The most popular tools for stream data mining are based on decision trees. In previous 15 years, all designed methods, headed by the very fast decision tree algorithm, relayed on Hoeffding's inequality and hundreds of researchers followed this scheme. Recently, we have demonstrated that although the Hoeffding decision trees are an effective tool for dealing with stream data, they are a purely heuristic procedure; for example, classical decision trees such as ID3 or CART cannot be adopted to data stream mining using Hoeffding's inequality. Therefore, there is an urgent need to develop new algorithms, which are both mathematically justified and characterized by good performance. In this paper, we address this problem by developing a family of new splitting criteria for classification in stationary data streams and investigating their probabilistic properties. The new criteria, derived using appropriate statistical tools, are based on the misclassification error and the Gini index impurity measures. The general division of splitting criteria into two types is proposed. Attributes chosen based on type- splitting criteria guarantee, with high probability, the highest expected value of split measure. Type- criteria ensure that the chosen attribute is the same, with high probability, as it would be chosen based on the whole infinite data stream. Moreover, in this paper, two hybrid splitting criteria are proposed, which are the combinations of single criteria based on the misclassification error and Gini index.

  13. The Efficiency of Split Panel Designs in an Analysis of Variance Model

    Science.gov (United States)

    Wang, Wei-Guo; Liu, Hai-Jun

    2016-01-01

    We consider split panel design efficiency in analysis of variance models, that is, the determination of the cross-sections series optimal proportion in all samples, to minimize parametric best linear unbiased estimators of linear combination variances. An orthogonal matrix is constructed to obtain manageable expression of variances. On this basis, we derive a theorem for analyzing split panel design efficiency irrespective of interest and budget parameters. Additionally, relative estimator efficiency based on the split panel to an estimator based on a pure panel or a pure cross-section is present. The analysis shows that the gains from split panel can be quite substantial. We further consider the efficiency of split panel design, given a budget, and transform it to a constrained nonlinear integer programming. Specifically, an efficient algorithm is designed to solve the constrained nonlinear integer programming. Moreover, we combine one at time designs and factorial designs to illustrate the algorithm’s efficiency with an empirical example concerning monthly consumer expenditure on food in 1985, in the Netherlands, and the efficient ranges of the algorithm parameters are given to ensure a good solution. PMID:27163447

  14. Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

    Directory of Open Access Journals (Sweden)

    Johan Oscar Ong

    2011-01-01

    Full Text Available Transportation planning is one of the important components to increase efficiency and effectiveness in the supply chain system. Good planning will give a saving in total cost of the supply chain. This paper develops the new VRP variants’, VRP with backhauls, multiple trips, and time window (VRPBMTTW along with its problem solving techniques by using Ant Colony Optimization (ACO and Sequential Insertion as initial solution algorithm. ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window. This algorithm is tested by using set of random data and verified as well as analyzed its parameter changing’s. The computational results for hypothetical data with 50% backhaul and mix time windows are reported.

  15. Source splitting via the point source method

    International Nuclear Information System (INIS)

    Potthast, Roland; Fazi, Filippo M; Nelson, Philip A

    2010-01-01

    We introduce a new algorithm for source identification and field splitting based on the point source method (Potthast 1998 A point-source method for inverse acoustic and electromagnetic obstacle scattering problems IMA J. Appl. Math. 61 119–40, Potthast R 1996 A fast new method to solve inverse scattering problems Inverse Problems 12 731–42). The task is to separate the sound fields u j , j = 1, ..., n of n element of N sound sources supported in different bounded domains G 1 , ..., G n in R 3 from measurements of the field on some microphone array—mathematically speaking from the knowledge of the sum of the fields u = u 1 + ... + u n on some open subset Λ of a plane. The main idea of the scheme is to calculate filter functions g 1 ,…, g n , n element of N, to construct u l for l = 1, ..., n from u| Λ in the form u l (x) = ∫ Λ g l,x (y)u(y)ds(y), l=1,... n. (1) We will provide the complete mathematical theory for the field splitting via the point source method. In particular, we describe uniqueness, solvability of the problem and convergence and stability of the algorithm. In the second part we describe the practical realization of the splitting for real data measurements carried out at the Institute for Sound and Vibration Research at Southampton, UK. A practical demonstration of the original recording and the splitting results for real data is available online

  16. Extending Correlation Filter-Based Visual Tracking by Tree-Structured Ensemble and Spatial Windowing.

    Science.gov (United States)

    Gundogdu, Erhan; Ozkan, Huseyin; Alatan, A Aydin

    2017-11-01

    Correlation filters have been successfully used in visual tracking due to their modeling power and computational efficiency. However, the state-of-the-art correlation filter-based (CFB) tracking algorithms tend to quickly discard the previous poses of the target, since they consider only a single filter in their models. On the contrary, our approach is to register multiple CFB trackers for previous poses and exploit the registered knowledge when an appearance change occurs. To this end, we propose a novel tracking algorithm [of complexity O(D) ] based on a large ensemble of CFB trackers. The ensemble [of size O(2 D ) ] is organized over a binary tree (depth D ), and learns the target appearance subspaces such that each constituent tracker becomes an expert of a certain appearance. During tracking, the proposed algorithm combines only the appearance-aware relevant experts to produce boosted tracking decisions. Additionally, we propose a versatile spatial windowing technique to enhance the individual expert trackers. For this purpose, spatial windows are learned for target objects as well as the correlation filters and then the windowed regions are processed for more robust correlations. In our extensive experiments on benchmark datasets, we achieve a substantial performance increase by using the proposed tracking algorithm together with the spatial windowing.

  17. Thermal and structural behavior of filters and windows for synchrotron x-ray sources

    International Nuclear Information System (INIS)

    Wang, Z.; Hahn, U.; Dejus, R.; Kuzay, T.

    1993-01-01

    This report contains the following discussions: Introduction: Use of filters and windows in the front end designs; An interactive code for 3D graphic viewing of absorbed power in filters/windows and a new heat load generation algorithm for the finite element analysis; Failure criteria and analysis methods for the filter and window assembly; Comparison with test data and existing devices in HASYLAB; Cooling the filter: Radiation cooling or conduction cooling?; Consideration of window and filter thickness: Thicker or thinner?; Material selection criteria for filters/windows; Photon transmission through filters/windows; Window and filter design for APS undulators; Window and filter design for APS wigglers; and Window design for APS bending magnet front ends

  18. Window Glazing Types | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  19. Window Frame Types | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  20. Window Operator Types | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  1. Biased random key genetic algorithm with insertion and gender selection for capacitated vehicle routing problem with time windows

    Science.gov (United States)

    Rochman, Auliya Noor; Prasetyo, Hari; Nugroho, Munajat Tri

    2017-06-01

    Vehicle Routing Problem (VRP) often occurs when the manufacturers need to distribute their product to some customers/outlets. The distribution process is typically restricted by the capacity of the vehicle and the working hours at the distributor. This type of VRP is also known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). A Biased Random Key Genetic Algorithm (BRKGA) was designed and coded in MATLAB to solve the CVRPTW case of soft drink distribution. The standard BRKGA was then modified by applying chromosome insertion into the initial population and defining chromosome gender for parent undergoing crossover operation. The performance of the established algorithms was then compared to a heuristic procedure for solving a soft drink distribution. Some findings are revealed (1) the total distribution cost of BRKGA with insertion (BRKGA-I) results in a cost saving of 39% compared to the total cost of heuristic method, (2) BRKGA with the gender selection (BRKGA-GS) could further improve the performance of the heuristic method. However, the BRKGA-GS tends to yield worse results compared to that obtained from the standard BRKGA.

  2. Observation of the widening and shifting of EIT windows in a quasi-degenerate two-level atomic system

    International Nuclear Information System (INIS)

    Dong Yabin; Zhang Junxiang; Wang Haihong; Gao Jiangrui

    2006-01-01

    Widening and shifting the EIT windows in a closed transition F e = 2 ↔ F g = 3 driven by linearly polarized coupling lights and probed by circularly polarized lights are observed in Cs vapour. It is shown that by increasing the strength of magnetic field i.e. Zeeman splitting in the upper and lower levels, the electromagnetically induced transparency window is divided into two windows and the EIT maxima are shifted away from the zero detuning. In the contrast, if the strength of the magnetic field is fixed and the Rabi frequency of coupling beam is increased, the two EIT windows become wider, and the gap between the two EIT windows becomes smaller and smaller. These effects are also theoretically discussed and they are qualitatively in agreement with the theoretical results

  3. Weighted combination of LOD values oa splitted into frequency windows

    Science.gov (United States)

    Fernandez, L. I.; Gambis, D.; Arias, E. F.

    In this analysis a one-day combined time series of LOD(length-of-day) estimates is presented. We use individual data series derived by 7 GPS and 3 SLR analysis centers, which routinely contribute to the IERS database over a recent 27-month period (Jul 1996 - Oct 1998). The result is compared to the multi-technique combined series C04 produced by the Central Bureau of the IERS that is commonly used as a reference for the study of the phenomena of Earth rotation variations. The Frequency Windows Combined Series procedure brings out a time series, which is close to C04 but shows an amplitude difference that might explain the evident periodic behavior present in the differences of these two combined series. This method could be useful to generate a new time series to be used as a reference in the high frequency variations of the Earth rotation studies.

  4. Efficient scheduling request algorithm for opportunistic wireless access

    KAUST Repository

    Nam, Haewoon; Alouini, Mohamed-Slim

    2011-01-01

    An efficient scheduling request algorithm for opportunistic wireless access based on user grouping is proposed in this paper. Similar to the well-known opportunistic splitting algorithm, the proposed algorithm initially adjusts (or lowers

  5. Design, implementation, and experimental validation of optimal power split control for hybrid electric trucks

    NARCIS (Netherlands)

    Keulen, T. van; Mullem, D. van; Jager, B. van; Kessels, J.T.B.A.; Steinbuch, M.

    2012-01-01

    Hybrid electric vehicles require an algorithm that controls the power split between the internal combustion engine and electric machine(s), and the opening and closing of the clutch. Optimal control theory is applied to derive a methodology for a real-time optimal-control-based power split

  6. PREFACE: INERA Workshop: Transition Metal Oxide Thin Films-functional Layers in "Smart windows" and Water Splitting Devices. Parallel session of the 18th International School on Condensed Matter Physics

    Science.gov (United States)

    2014-11-01

    The Special issue presents the papers for the INERA Workshop entitled "Transition Metal Oxides as Functional Layers in Smart windows and Water Splitting Devices", which was held in Varna, St. Konstantin and Elena, Bulgaria, from the 4th-6th September 2014. The Workshop is organized within the context of the INERA "Research and Innovation Capacity Strengthening of ISSP-BAS in Multifunctional Nanostructures", FP7 Project REGPOT 316309 program, European project of the Institute of Solid State Physics at the Bulgarian Academy of Sciences. There were 42 participants at the workshop, 16 from Sweden, Germany, Romania and Hungary, 11 invited lecturers, and 28 young participants. There were researchers present from prestigious European laboratories which are leaders in the field of transition metal oxide thin film technologies. The event contributed to training young researchers in innovative thin film technologies, as well as thin films characterization techniques. The topics of the Workshop cover the field of technology and investigation of thin oxide films as functional layers in "Smart windows" and "Water splitting" devices. The topics are related to the application of novel technologies for the preparation of transition metal oxide films and the modification of chromogenic properties towards the improvement of electrochromic and termochromic device parameters for possible industrial deployment. The Workshop addressed the following topics: Metal oxide films-functional layers in energy efficient devices; Photocatalysts and chemical sensing; Novel thin film technologies and applications; Methods of thin films characterizations; From the 37 abstracts sent, 21 manuscripts were written and later refereed. We appreciate the comments from all the referees, and we are grateful for their valuable contributions. Guest Editors: Assoc. Prof. Dr.Tatyana Ivanova Prof. DSc Kostadinka Gesheva Prof. DSc Hassan Chamatti Assoc. Prof. Dr. Georgi Popkirov Workshop Organizing Committee Prof

  7. Ensemble Classification of Data Streams Based on Attribute Reduction and a Sliding Window

    Directory of Open Access Journals (Sweden)

    Yingchun Chen

    2018-04-01

    Full Text Available With the current increasing volume and dimensionality of data, traditional data classification algorithms are unable to satisfy the demands of practical classification applications of data streams. To deal with noise and concept drift in data streams, we propose an ensemble classification algorithm based on attribute reduction and a sliding window in this paper. Using mutual information, an approximate attribute reduction algorithm based on rough sets is used to reduce data dimensionality and increase the diversity of reduced results in the algorithm. A double-threshold concept drift detection method and a three-stage sliding window control strategy are introduced to improve the performance of the algorithm when dealing with both noise and concept drift. The classification precision is further improved by updating the base classifiers and their nonlinear weights. Experiments on synthetic datasets and actual datasets demonstrate the performance of the algorithm in terms of classification precision, memory use, and time efficiency.

  8. Applying Particle Swarm Optimization for Solving Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    The Jin Ai

    2014-01-01

    Full Text Available The Team Orienteering Problem With Time Windows (TOPTW is a transportation problem case that have a set of vertices with a score, service time, and the time windows, start and final at a depot location. A number of paths are constructed to maximize the total collected score by the vertices which is visited. Each vertice can be visited only once and the visit can only start during the  time window of vertices. This paper proposes a Particle Swarm Optimization algorithm for solving the TOPTW, by defining a specific particle for representing the solution of TOPTW within the PSO algorithm and two alternatives, called PSO_TOPTW1 and PSO_TOPTW2, for translating the particle position to form the routes of the path. The performance of the proposed PSO algorithm is evaluated through some benchmark data problem available in the literature. The computational results show that the proposed PSO is able to produce sufficiently good TOPTW solutions that are comparable with corresponding solutions from other existing methods for solving the TOPTW.

  9. Mao-Gilles Stabilization Algorithm

    OpenAIRE

    Jérôme Gilles

    2013-01-01

    Originally, the Mao-Gilles stabilization algorithm was designed to compensate the non-rigid deformations due to atmospheric turbulence. Given a sequence of frames affected by atmospheric turbulence, the algorithm uses a variational model combining optical flow and regularization to characterize the static observed scene. The optimization problem is solved by Bregman Iteration and the operator splitting method. The algorithm is simple, efficient, and can be easily generalized for different sce...

  10. Proper Installation of Replacement Windows | Efficient Windows

    Science.gov (United States)

    Collaborative Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring

  11. Analysis of oil-pipeline distribution of multiple products subject to delivery time-windows

    Science.gov (United States)

    Jittamai, Phongchai

    This dissertation defines the operational problems of, and develops solution methodologies for, a distribution of multiple products into oil pipeline subject to delivery time-windows constraints. A multiple-product oil pipeline is a pipeline system composing of pipes, pumps, valves and storage facilities used to transport different types of liquids. Typically, products delivered by pipelines are petroleum of different grades moving either from production facilities to refineries or from refineries to distributors. Time-windows, which are generally used in logistics and scheduling areas, are incorporated in this study. The distribution of multiple products into oil pipeline subject to delivery time-windows is modeled as multicommodity network flow structure and mathematically formulated. The main focus of this dissertation is the investigation of operating issues and problem complexity of single-source pipeline problems and also providing solution methodology to compute input schedule that yields minimum total time violation from due delivery time-windows. The problem is proved to be NP-complete. The heuristic approach, a reversed-flow algorithm, is developed based on pipeline flow reversibility to compute input schedule for the pipeline problem. This algorithm is implemented in no longer than O(T·E) time. This dissertation also extends the study to examine some operating attributes and problem complexity of multiple-source pipelines. The multiple-source pipeline problem is also NP-complete. A heuristic algorithm modified from the one used in single-source pipeline problems is introduced. This algorithm can also be implemented in no longer than O(T·E) time. Computational results are presented for both methodologies on randomly generated problem sets. The computational experience indicates that reversed-flow algorithms provide good solutions in comparison with the optimal solutions. Only 25% of the problems tested were more than 30% greater than optimal values and

  12. Performance Standards for Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  13. Benefits of Efficient Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  14. Assessing Window Replacement Options | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  15. Windows for New Construction | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  16. Algoritmos genéticos e computação paralela para problemas de roteirização de veículos com janelas de tempo e entregas fracionadas Genetic algorithms and parallel computing for a vehicle routing problem with time windows and split deliveries

    Directory of Open Access Journals (Sweden)

    Guilherme Guidolin de Campos

    2006-05-01

    Full Text Available O presente trabalho propõe a utilização de metaheurísticas e computação paralela para a resolução de um problema real de roteirização de veículos com frota heterogênea, janelas de tempo e entregas fracionadas, no qual a demanda dos clientes pode ser maior que a capacidade dos veículos. O problema consiste na determinação de um conjunto de rotas econômicas que devem atender à necessidade de cada cliente respeitando todas as restrições. A estratégia adotada para a resolução do problema consiste na utilização de uma adaptação da heurística construtiva proposta por Clarke e Wright (1964 como solução inicial. Posteriormente, implementa-se um algoritmo genético paralelo que é resolvido com o auxílio de um cluster de computadores, com o objetivo de explorar novos espaços de soluções. Os resultados obtidos demonstram que a heurística construtiva básica apresenta resultados satisfatórios para o problema, mas pode ser melhorada substancialmente com o uso de técnicas mais sofisticadas. A aplicação do algoritmo genético paralelo de múltiplas populações com solução inicial, que apresentou os melhores resultados, proporciona redução no custo total da operação da ordem de 10%, em relação à heurística construtiva, e 13%, quando comparada às soluções utilizadas originalmente pela empresa.The present work considers the use of metaheuristics and parallel computing to solve a real problem of vehicle routing involving a heterogeneous fleet, time windows and split deliveries, in which customer demand can exceed vehicle capacity. The problem consists of determining a set of economical routes that meet each customer's needs while still being subject to all the constraints. The strategy adopted to solve the problem consists of an adaptation of the constructive heuristics proposed by Clarke & Wright (1964 as the initial solution. More sophisticated algorithms are then applied to achieve improvements, such as

  17. Embryo splitting

    Directory of Open Access Journals (Sweden)

    Karl Illmensee

    2010-04-01

    Full Text Available Mammalian embryo splitting has successfully been established in farm animals. Embryo splitting is safely and efficiently used for assisted reproduction in several livestock species. In the mouse, efficient embryo splitting as well as single blastomere cloning have been developed in this animal system. In nonhuman primates embryo splitting has resulted in several pregnancies. Human embryo splitting has been reported recently. Microsurgical embryo splitting under Institutional Review Board approval has been carried out to determine its efficiency for blastocyst development. Embryo splitting at the 6–8 cell stage provided a much higher developmental efficiency compared to splitting at the 2–5 cell stage. Embryo splitting may be advantageous for providing additional embryos to be cryopreserved and for patients with low response to hormonal stimulation in assisted reproduction programs. Social and ethical issues concerning embryo splitting are included regarding ethics committee guidelines. Prognostic perspectives are presented for human embryo splitting in reproductive medicine.

  18. Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

    Science.gov (United States)

    Suthikarnnarunai, N.; Olinick, E.

    2009-01-01

    We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.

  19. Opportunistic splitting for scheduling using a score-based approach

    KAUST Repository

    Rashid, Faraan; Nam, Haewoon; Alouini, Mohamed-Slim

    2012-01-01

    to the centralized scheduler. The users find the best among themselves while requiring just a ternary feedback from the common receiver at the end of each mini-slot. The original splitting algorithm is modified to handle users with asymmetric channel conditions. We

  20. Informed baseline subtraction of proteomic mass spectrometry data aided by a novel sliding window algorithm.

    Science.gov (United States)

    Stanford, Tyman E; Bagley, Christopher J; Solomon, Patty J

    2016-01-01

    Proteomic matrix-assisted laser desorption/ionisation (MALDI) linear time-of-flight (TOF) mass spectrometry (MS) may be used to produce protein profiles from biological samples with the aim of discovering biomarkers for disease. However, the raw protein profiles suffer from several sources of bias or systematic variation which need to be removed via pre-processing before meaningful downstream analysis of the data can be undertaken. Baseline subtraction, an early pre-processing step that removes the non-peptide signal from the spectra, is complicated by the following: (i) each spectrum has, on average, wider peaks for peptides with higher mass-to-charge ratios ( m / z ), and (ii) the time-consuming and error-prone trial-and-error process for optimising the baseline subtraction input arguments. With reference to the aforementioned complications, we present an automated pipeline that includes (i) a novel 'continuous' line segment algorithm that efficiently operates over data with a transformed m / z -axis to remove the relationship between peptide mass and peak width, and (ii) an input-free algorithm to estimate peak widths on the transformed m / z scale. The automated baseline subtraction method was deployed on six publicly available proteomic MS datasets using six different m/z-axis transformations. Optimality of the automated baseline subtraction pipeline was assessed quantitatively using the mean absolute scaled error (MASE) when compared to a gold-standard baseline subtracted signal. Several of the transformations investigated were able to reduce, if not entirely remove, the peak width and peak location relationship resulting in near-optimal baseline subtraction using the automated pipeline. The proposed novel 'continuous' line segment algorithm is shown to far outperform naive sliding window algorithms with regard to the computational time required. The improvement in computational time was at least four-fold on real MALDI TOF-MS data and at least an order of

  1. Single and multi-band electromagnetic induced transparency-like metamaterials with coupled split ring resonators

    Science.gov (United States)

    Bagci, Fulya; Akaoglu, Baris

    2017-08-01

    We present a metamaterial configuration exhibiting single and multi-band electromagnetic induced transparency (EIT)-like properties. The unit cell of the single band EIT-like metamaterial consists of a multi-split ring resonator surrounded by a split ring resonator. The multi-split ring resonator acts as a quasi-dark or dark resonator, depending on the polarization of the incident wave, and the split ring resonator serves as the bright resonator. Combination of these two resonators results in a single band EIT-like transmission inside the stop band. EIT-like transmission phenomenon is also clearly observed in the measured transmission spectrum at almost the same frequencies for vertical and horizontal polarized waves, and the numerical results are verified for normal incidence. Moreover, multi-band transmission windows are created within a wide band by combining the two slightly different single band EIT-like metamaterial unit cells that exhibit two different coupling strengths inside a supercell configuration. Group indices as high as 123 for single band and 488 for tri-band transmission, accompanying with high transmission rates (over 80%), are achieved, rendering the metamaterial very suitable for multi-band slow light applications. It is shown that the group delay of the propagating wave can be increased and dynamically controlled by changing the polarization angle. Multi-band EIT-like transmission is also verified experimentally, and a good agreement with simulations is obtained. The proposed novel methodology for obtaining multi-band EIT, which takes advantage of a supercell configuration by hosting slightly different configured unit cells, can be utilized for easily formation and manipulation of multi-band transmission windows inside a stop band.

  2. Tuneable complementary metamaterial structures based on graphene for single and multiple transparency windows.

    Science.gov (United States)

    Ding, Jun; Arigong, Bayaner; Ren, Han; Zhou, Mi; Shao, Jin; Lu, Meng; Chai, Yang; Lin, Yuankun; Zhang, Hualiang

    2014-08-22

    Novel graphene-based tunable plasmonic metamaterials featuring single and multiple transparency windows are numerically studied in this paper. The designed structures consist of a graphene layer perforated with quadrupole slot structures and dolmen-like slot structures printed on a substrate. Specifically, the graphene-based quadrupole slot structure can realize a single transparency window, which is achieved without breaking the structure symmetry. Further investigations have shown that the single transparency window in the proposed quadrupole slot structure is more likely originated from the quantum effect of Autler-Townes splitting. Then, by introducing a dipole slot to the quadrupole slot structure to form the dolmen-like slot structure, an additional transmission dip could occur in the transmission spectrum, thus, a multiple-transparency-window system can be achieved (for the first time for graphene-based devices). More importantly, the transparency windows for both the quadrupole slot and the dolmen-like slot structures can be dynamically controlled over a broad frequency range by varying the Fermi energy levels of the graphene layer (through electrostatic gating). The proposed slot metamaterial structures with tunable single and multiple transparency windows could find potential applications in many areas such as multiple-wavelength slow-light devices, active plasmonic switching, and optical sensing.

  3. Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

    Science.gov (United States)

    Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

    2018-03-01

    Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

  4. A Preconditioning Technique for First-Order Primal-Dual Splitting Method in Convex Optimization

    Directory of Open Access Journals (Sweden)

    Meng Wen

    2017-01-01

    Full Text Available We introduce a preconditioning technique for the first-order primal-dual splitting method. The primal-dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self-adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.

  5. The split symbol moments SNR estimator in narrow-band channels

    Science.gov (United States)

    Shah, Biren; Hinedi, Sami

    1990-01-01

    The split symbol moments estimator is an algorithm that is designed to estimate symbol SNR in the presence of additive white Gaussian noise. The performance of the algorithm in band-limited channels is examined, and the effects of the resulting intersymbol interference are quantified. All results obtained are in closed form and can be easily evaluated numerically for performance-prediction purposes. The results are also validated through digital simulations.

  6. Student paper competition: Splitting the determinants of upper Hessenberg matrices and the Hyman method

    Energy Technology Data Exchange (ETDEWEB)

    Zou, Xiulin [Michigan State Univ., East Lansing, MI (United States)

    1996-12-31

    In this article, an iterative algorithm is established that splits the evaluation of determinant of an upper Hessenberg matrix into two independent parts so that the evaluation can be done in parallel. This algorithm has application in parallel non-symmetric eigenvalue problems.

  7. MOVING WINDOW SEGMENTATION FRAMEWORK FOR POINT CLOUDS

    Directory of Open Access Journals (Sweden)

    G. Sithole

    2012-07-01

    Full Text Available As lidar point clouds become larger streamed processing becomes more attractive. This paper presents a framework for the streamed segmentation of point clouds with the intention of segmenting unstructured point clouds in real-time. The framework is composed of two main components. The first component segments points within a window shifting over the point cloud. The second component stitches the segments within the windows together. In this fashion a point cloud can be streamed through these two components in sequence, thus producing a segmentation. The algorithm has been tested on airborne lidar point cloud and some results of the performance of the framework are presented.

  8. Mao-Gilles Stabilization Algorithm

    Directory of Open Access Journals (Sweden)

    Jérôme Gilles

    2013-07-01

    Full Text Available Originally, the Mao-Gilles stabilization algorithm was designed to compensate the non-rigid deformations due to atmospheric turbulence. Given a sequence of frames affected by atmospheric turbulence, the algorithm uses a variational model combining optical flow and regularization to characterize the static observed scene. The optimization problem is solved by Bregman Iteration and the operator splitting method. The algorithm is simple, efficient, and can be easily generalized for different scenarios involving non-rigid deformations.

  9. Managing coherence via put/get windows

    Science.gov (United States)

    Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton on Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk [Ossining, NY; Ohmacht, Martin [Yorktown Heights, NY

    2011-01-11

    A method and apparatus for managing coherence between two processors of a two processor node of a multi-processor computer system. Generally the present invention relates to a software algorithm that simplifies and significantly speeds the management of cache coherence in a message passing parallel computer, and to hardware apparatus that assists this cache coherence algorithm. The software algorithm uses the opening and closing of put/get windows to coordinate the activated required to achieve cache coherence. The hardware apparatus may be an extension to the hardware address decode, that creates, in the physical memory address space of the node, an area of virtual memory that (a) does not actually exist, and (b) is therefore able to respond instantly to read and write requests from the processing elements.

  10. Managing coherence via put/get windows

    Science.gov (United States)

    Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton on Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk [Ossining, NY; Ohmacht, Martin [Yorktown Heights, NY

    2012-02-21

    A method and apparatus for managing coherence between two processors of a two processor node of a multi-processor computer system. Generally the present invention relates to a software algorithm that simplifies and significantly speeds the management of cache coherence in a message passing parallel computer, and to hardware apparatus that assists this cache coherence algorithm. The software algorithm uses the opening and closing of put/get windows to coordinate the activated required to achieve cache coherence. The hardware apparatus may be an extension to the hardware address decode, that creates, in the physical memory address space of the node, an area of virtual memory that (a) does not actually exist, and (b) is therefore able to respond instantly to read and write requests from the processing elements.

  11. Replacement Windows for Existing Homes Homes | Efficient Windows

    Science.gov (United States)

    Collaborative Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring

  12. Merged Search Algorithms for Radio Frequency Identification Anticollision

    Directory of Open Access Journals (Sweden)

    Bih-Yaw Shih

    2012-01-01

    The arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem with the existence of multiple tags in the interrogation field of a transponder. A splitting algorithm which is called Binary Search Tree (BST is well known for multitags arbitration. In the current study, a splitting-based schema called Merged Search Tree is proposed to capture identification codes correctly for anticollision. Performance of the proposed algorithm is compared with the original BST according to time and power consumed during the arbitration process. The results show that the proposed model can reduce searching time and power consumed to achieve a better performance arbitration.

  13. Design Guidance for New Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  14. Selection Process for New Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  15. Selection Process for Replacement Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  16. Design Guidance for Replacement Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  17. Proper Installation of New Windows | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  18. Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows

    DEFF Research Database (Denmark)

    Røpke, Stefan; Cordeau, Jean-Francois

    2009-01-01

    In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch......-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and a non-elementary shortest path problem. Valid inequalities...

  19. Exclusive queueing model including the choice of service windows

    Science.gov (United States)

    Tanaka, Masahiro; Yanagisawa, Daichi; Nishinari, Katsuhiro

    2018-01-01

    In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells. We contrived a logit-based choice algorithm for agents considering the numbers of agents and the distances to all service windows. Simulations were conducted with various parameters of agent choice preference for these two elements and for different floor configurations, including the floor length and the number of service windows. We investigated the model from the viewpoint of transit times and entrance block rates. The influences of the parameters on these factors were surveyed in detail and we determined that there are optimum floor lengths that minimize the transit times. In addition, we observed that the transit times were determined almost entirely by the entrance block rates. The results of the presented model are relevant to understanding queueing systems including the choice of service windows and can be employed to optimize facility design and floor management.

  20. Automatic selection of optimal systolic and diastolic reconstruction windows for dual-source CT coronary angiography

    International Nuclear Information System (INIS)

    Seifarth, H.; Puesken, M.; Wienbeck, S.; Maintz, D.; Heindel, W.; Juergens, K.U.; Fischbach, R.

    2009-01-01

    The aim of this study was to assess the performance of a motion-map algorithm that automatically determines optimal reconstruction windows for dual-source coronary CT angiography. In datasets from 50 consecutive patients, optimal systolic and diastolic reconstruction windows were determined using the motion-map algorithm. For manual determination of the optimal reconstruction window, datasets were reconstructed in 5% steps throughout the RR interval. Motion artifacts were rated for each major coronary vessel using a five-point scale. Mean motion scores using the motion-map algorithm were 2.4 ± 0.8 for systolic reconstructions and 1.9 ± 0.8 for diastolic reconstructions. Using the manual approach, overall motion scores were significantly better (1.9 ± 0.5 and 1.7 ± 0.6, p 90% of cases using either approach. Using the automated approach, there was a negative correlation between heart rate and motion scores for systolic reconstructions (ρ = -0.26, p 80 bpm (systolic reconstruction). (orig.)

  1. Multi-scale window specification over streaming trajectories

    Directory of Open Access Journals (Sweden)

    Kostas Patroumpas

    2013-12-01

    Full Text Available Enormous amounts of positional information are collected by monitoring applications in domains such as fleet management, cargo transport, wildlife protection, etc. With the advent of modern location-based services, processing such data mostly focuses on providing real-time response to a variety of user requests in continuous and scalable fashion. An important class of such queries concerns evolving trajectories that continuously trace the streaming locations of moving objects, like GPS-equipped vehicles, commodities with RFID's, people with smartphones etc. In this work, we propose an advanced windowing operator that enables online, incremental examination of recent motion paths at multiple resolutions for numerous point entities. When applied against incoming positions, this window can abstract trajectories at coarser representations towards the past, while retaining progressively finer features closer to the present. We explain the semantics of such multi-scale sliding windows through parameterized functions that reflect the sequential nature of trajectories and can effectively capture their spatiotemporal properties. Such window specification goes beyond its usual role for non-blocking processing of multiple concurrent queries. Actually, it can offer concrete subsequences from each trajectory, thus preserving continuity in time and contiguity in space along the respective segments. Further, we suggest language extensions in order to express characteristic spatiotemporal queries using windows. Finally, we discuss algorithms for nested maintenance of multi-scale windows and evaluate their efficiency against streaming positional data, offering empirical evidence of their benefits to online trajectory processing.

  2. A Windows Phone 7 Oriented Secure Architecture for Business Intelligence Mobile Applications

    Directory of Open Access Journals (Sweden)

    Silvia TRIF

    2011-01-01

    Full Text Available This paper present and implement a Windows Phone 7 Oriented Secure Architecture for Business Intelligence Mobile Application. In the developing process is used a Windows Phone 7 application that interact with a WCF Web Service and a database. The types of Business Intelligence Mobile Applications are presented. The Windows mobile devices security and restrictions are presented. The namespaces and security algorithms used in .NET Compact Framework for assuring the application security are presented. The proposed architecture is showed underlying the flows between the application and the web service.

  3. Optimizing Time Windows For Managing Export Container Arrivals At Chinese Container Terminals

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen

    2010-01-01

    window management programme that is widely used in Chinese terminals to facilitate terminal and truck delivery operations. Firstly, the arrangement of time windows is assumed to follow the principle of minimizing transport costs. A cost function is defined that includes the costs of truck and driver...... waiting time, fuel consumption associated with truck idling, storage time of the containerized cargos and yard fee. Secondly, to minimize the total cost, a heuristic is developed based on a genetic algorithm to find a near optimal time window arrangement. The optimized solution involves the position...

  4. Measurement of $k_T$ splitting scales in $W \\to l\

    CERN Document Server

    Aad, Georges; Abbott, Brad; Abdallah, Jalal; Abdel Khalek, Samah; Abdelalim, Ahmed Ali; Abdinov, Ovsat; Aben, Rosemarie; Abi, Babak; Abolins, Maris; AbouZeid, Ossama; Abramowicz, Halina; Abreu, Henso; Acharya, Bobby Samir; Adamczyk, Leszek; Adams, David; Addy, Tetteh; Adelman, Jahred; Adomeit, Stefanie; Adragna, Paolo; Adye, Tim; Aefsky, Scott; Aguilar-Saavedra, Juan Antonio; Agustoni, Marco; Ahlen, Steven; Ahles, Florian; Ahmad, Ashfaq; Ahsan, Mahsana; Aielli, Giulio; Åkesson, Torsten Paul Ake; Akimoto, Ginga; Akimov, Andrei; Alam, Muhammad Aftab; Albert, Justin; Albrand, Solveig; Aleksa, Martin; Aleksandrov, Igor; Alessandria, Franco; Alexa, Calin; Alexander, Gideon; Alexandre, Gauthier; Alexopoulos, Theodoros; Alhroob, Muhammad; Aliev, Malik; Alimonti, Gianluca; Alison, John; Allbrooke, Benedict; Allison, Lee John; Allport, Phillip; Allwood-Spiers, Sarah; Almond, John; Aloisio, Alberto; Alon, Raz; Alonso, Alejandro; Alonso, Francisco; Altheimer, Andrew David; Alvarez Gonzalez, Barbara; Alviggi, Mariagrazia; Amako, Katsuya; Amelung, Christoph; Ammosov, Vladimir; Amor Dos Santos, Susana Patricia; Amorim, Antonio; Amoroso, Simone; Amram, Nir; Anastopoulos, Christos; Ancu, Lucian Stefan; Andari, Nansi; Andeen, Timothy; Anders, Christoph Falk; Anders, Gabriel; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Anduaga, Xabier; Angelidakis, Stylianos; Anger, Philipp; Angerami, Aaron; Anghinolfi, Francis; Anisenkov, Alexey; Anjos, Nuno; Annovi, Alberto; Antonaki, Ariadni; Antonelli, Mario; Antonov, Alexey; Antos, Jaroslav; Anulli, Fabio; Aoki, Masato; Aperio Bella, Ludovica; Apolle, Rudi; Arabidze, Giorgi; Aracena, Ignacio; Arai, Yasuo; Arce, Ayana; Arfaoui, Samir; Arguin, Jean-Francois; Argyropoulos, Spyridon; Arik, Engin; Arik, Metin; Armbruster, Aaron James; Arnaez, Olivier; Arnal, Vanessa; Artamonov, Andrei; Artoni, Giacomo; Arutinov, David; Asai, Shoji; Ask, Stefan; Åsman, Barbro; Asquith, Lily; Assamagan, Ketevi; Astalos, Robert; Astbury, Alan; Atkinson, Markus; Auerbach, Benjamin; Auge, Etienne; Augsten, Kamil; Aurousseau, Mathieu; Avolio, Giuseppe; Axen, David; Azuelos, Georges; Azuma, Yuya; Baak, Max; Baccaglioni, Giuseppe; Bacci, Cesare; Bach, Andre; Bachacou, Henri; Bachas, Konstantinos; Backes, Moritz; Backhaus, Malte; Backus Mayes, John; Badescu, Elisabeta; Bagnaia, Paolo; Bai, Yu; Bailey, David; Bain, Travis; Baines, John; Baker, Oliver Keith; Baker, Sarah; Balek, Petr; Balli, Fabrice; Banas, Elzbieta; Banerjee, Piyali; Banerjee, Swagato; Banfi, Danilo; Bangert, Andrea Michelle; Bansal, Vikas; Bansil, Hardeep Singh; Barak, Liron; Baranov, Sergei; Barber, Tom; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Bardin, Dmitri; Barillari, Teresa; Barisonzi, Marcello; Barklow, Timothy; Barlow, Nick; Barnett, Bruce; Barnett, Michael; Baroncelli, Antonio; Barone, Gaetano; Barr, Alan; Barreiro, Fernando; Barreiro Guimarães da Costa, João; Bartoldus, Rainer; Barton, Adam Edward; Bartsch, Valeria; Basye, Austin; Bates, Richard; Batkova, Lucia; Batley, Richard; Battaglia, Andreas; Battistin, Michele; Bauer, Florian; Bawa, Harinder Singh; Beale, Steven; Beau, Tristan; Beauchemin, Pierre-Hugues; Beccherle, Roberto; Bechtle, Philip; Beck, Hans Peter; Becker, Anne Kathrin; Becker, Sebastian; Beckingham, Matthew; Becks, Karl-Heinz; Beddall, Andrew; Beddall, Ayda; Bedikian, Sourpouhi; Bednyakov, Vadim; Bee, Christopher; Beemster, Lars; Beermann, Thomas; Begel, Michael; Behar Harpaz, Silvia; Belanger-Champagne, Camille; Bell, Paul; Bell, William; Bella, Gideon; Bellagamba, Lorenzo; Bellomo, Massimiliano; Belloni, Alberto; Beloborodova, Olga; Belotskiy, Konstantin; Beltramello, Olga; Benary, Odette; Benchekroun, Driss; Bendtz, Katarina; Benekos, Nektarios; Benhammou, Yan; Benhar Noccioli, Eleonora; Benitez Garcia, Jorge-Armando; Benjamin, Douglas; Benoit, Mathieu; Bensinger, James; Benslama, Kamal; Bentvelsen, Stan; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Berghaus, Frank; Berglund, Elina; Beringer, Jürg; Bernat, Pauline; Bernhard, Ralf; Bernius, Catrin; Bernlochner, Florian Urs; Berry, Tracey; Bertella, Claudia; Bertin, Antonio; Bertolucci, Federico; Besana, Maria Ilaria; Besjes, Geert-Jan; Besson, Nathalie; Bethke, Siegfried; Bhimji, Wahid; Bianchi, Riccardo-Maria; Bianchini, Louis; Bianco, Michele; Biebel, Otmar; Bieniek, Stephen Paul; Bierwagen, Katharina; Biesiada, Jed; Biglietti, Michela; Bilokon, Halina; Bindi, Marcello; Binet, Sebastien; Bingul, Ahmet; Bini, Cesare; Biscarat, Catherine; Bittner, Bernhard; Black, Curtis; Black, James; Black, Kevin; Blair, Robert; Blanchard, Jean-Baptiste; Blazek, Tomas; Bloch, Ingo; Blocker, Craig; Blocki, Jacek; Blum, Walter; Blumenschein, Ulrike; Bobbink, Gerjan; Bobrovnikov, Victor; Bocchetta, Simona Serena; Bocci, Andrea; Boddy, Christopher Richard; Boehler, Michael; Boek, Jennifer; Boek, Thorsten Tobias; Boelaert, Nele; Bogaerts, Joannes Andreas; Bogdanchikov, Alexander; Bogouch, Andrei; Bohm, Christian; Bohm, Jan; Boisvert, Veronique; Bold, Tomasz; Boldea, Venera; Bolnet, Nayanka Myriam; Bomben, Marco; Bona, Marcella; Boonekamp, Maarten; Bordoni, Stefania; Borer, Claudia; Borisov, Anatoly; Borissov, Guennadi; Borjanovic, Iris; Borri, Marcello; Borroni, Sara; Bortfeldt, Jonathan; Bortolotto, Valerio; Bos, Kors; Boscherini, Davide; Bosman, Martine; Boterenbrood, Hendrik; Bouchami, Jihene; Boudreau, Joseph; Bouhova-Thacker, Evelina Vassileva; Boumediene, Djamel Eddine; Bourdarios, Claire; Bousson, Nicolas; Boutouil, Sara; Boveia, Antonio; Boyd, James; Boyko, Igor; Bozovic-Jelisavcic, Ivanka; Bracinik, Juraj; Branchini, Paolo; Brandt, Andrew; Brandt, Gerhard; Brandt, Oleg; Bratzler, Uwe; Brau, Benjamin; Brau, James; Braun, Helmut; Brazzale, Simone Federico; Brelier, Bertrand; Bremer, Johan; Brendlinger, Kurt; Brenner, Richard; Bressler, Shikma; Bristow, Timothy Michael; Britton, Dave; Brochu, Frederic; Brock, Ian; Brock, Raymond; Broggi, Francesco; Bromberg, Carl; Bronner, Johanna; Brooijmans, Gustaaf; Brooks, Timothy; Brooks, William; Brown, Gareth; Bruckman de Renstrom, Pawel; Bruncko, Dusan; Bruneliere, Renaud; Brunet, Sylvie; Bruni, Alessia; Bruni, Graziano; Bruschi, Marco; Bryngemark, Lene; Buanes, Trygve; Buat, Quentin; Bucci, Francesca; Buchanan, James; Buchholz, Peter; Buckingham, Ryan; Buckley, Andrew; Buda, Stelian Ioan; Budagov, Ioulian; Budick, Burton; Bugge, Lars; Bulekov, Oleg; Bundock, Aaron Colin; Bunse, Moritz; Buran, Torleiv; Burckhart, Helfried; Burdin, Sergey; Burgess, Thomas; Burke, Stephen; Busato, Emmanuel; Büscher, Volker; Bussey, Peter; Buszello, Claus-Peter; Butler, Bart; Butler, John; Buttar, Craig; Butterworth, Jonathan; Buttinger, William; Byszewski, Marcin; Cabrera Urbán, Susana; Caforio, Davide; Cakir, Orhan; Calafiura, Paolo; Calderini, Giovanni; Calfayan, Philippe; Calkins, Robert; Caloba, Luiz; Caloi, Rita; Calvet, David; Calvet, Samuel; Camacho Toro, Reina; Camarri, Paolo; Cameron, David; Caminada, Lea Michaela; Caminal Armadans, Roger; Campana, Simone; Campanelli, Mario; Canale, Vincenzo; Canelli, Florencia; Canepa, Anadi; Cantero, Josu; Cantrill, Robert; Cao, Tingting; Capeans Garrido, Maria Del Mar; Caprini, Irinel; Caprini, Mihai; Capriotti, Daniele; Capua, Marcella; Caputo, Regina; Cardarelli, Roberto; Carli, Tancredi; Carlino, Gianpaolo; Carminati, Leonardo; Caron, Sascha; Carquin, Edson; Carrillo-Montoya, German D; Carter, Antony; Carter, Janet; Carvalho, João; Casadei, Diego; Casado, Maria Pilar; Cascella, Michele; Caso, Carlo; Castaneda-Miranda, Elizabeth; Castillo Gimenez, Victoria; Castro, Nuno Filipe; Cataldi, Gabriella; Catastini, Pierluigi; Catinaccio, Andrea; Catmore, James; Cattai, Ariella; Cattani, Giordano; Caughron, Seth; Cavaliere, Viviana; Cavalleri, Pietro; Cavalli, Donatella; Cavalli-Sforza, Matteo; Cavasinni, Vincenzo; Ceradini, Filippo; Santiago Cerqueira, Augusto; Cerri, Alessandro; Cerrito, Lucio; Cerutti, Fabio; Cetin, Serkant Ali; Chafaq, Aziz; Chakraborty, Dhiman; Chalupkova, Ina; Chan, Kevin; Chang, Philip; Chapleau, Bertrand; Chapman, John Derek; Chapman, John Wehrley; Charlton, Dave; Chavda, Vikash; Chavez Barajas, Carlos Alberto; Cheatham, Susan; Chekanov, Sergei; Chekulaev, Sergey; Chelkov, Gueorgui; Chelstowska, Magda Anna; Chen, Chunhui; Chen, Hucheng; Chen, Shenjian; Chen, Xin; Chen, Yujiao; Cheng, Yangyang; Cheplakov, Alexander; Cherkaoui El Moursli, Rajaa; Chernyatin, Valeriy; Cheu, Elliott; Cheung, Sing-Leung; Chevalier, Laurent; Chiefari, Giovanni; Chikovani, Leila; Childers, John Taylor; Chilingarov, Alexandre; Chiodini, Gabriele; Chisholm, Andrew; Chislett, Rebecca Thalatta; Chitan, Adrian; Chizhov, Mihail; Choudalakis, Georgios; Chouridou, Sofia; Chow, Bonnie Kar Bo; Christidi, Ilektra-Athanasia; Christov, Asen; Chromek-Burckhart, Doris; Chu, Ming-Lee; Chudoba, Jiri; Ciapetti, Guido; Ciftci, Abbas Kenan; Ciftci, Rena; Cinca, Diane; Cindro, Vladimir; Ciocio, Alessandra; Cirilli, Manuela; Cirkovic, Predrag; Citron, Zvi Hirsh; Citterio, Mauro; Ciubancan, Mihai; Clark, Allan G; Clark, Philip James; Clarke, Robert; Cleland, Bill; Clemens, Jean-Claude; Clement, Benoit; Clement, Christophe; Coadou, Yann; Cobal, Marina; Coccaro, Andrea; Cochran, James H; Coffey, Laurel; Cogan, Joshua Godfrey; Coggeshall, James; Colas, Jacques; Cole, Stephen; Colijn, Auke-Pieter; Collins, Neil; Collins-Tooth, Christopher; Collot, Johann; Colombo, Tommaso; Colon, German; Compostella, Gabriele; Conde Muiño, Patricia; Coniavitis, Elias; Conidi, Maria Chiara; Consonni, Sofia Maria; Consorti, Valerio; Constantinescu, Serban; Conta, Claudio; Conti, Geraldine; Conventi, Francesco; Cooke, Mark; Cooper, Ben; Cooper-Sarkar, Amanda; Cooper-Smith, Neil; Copic, Katherine; Cornelissen, Thijs; Corradi, Massimo; Corriveau, Francois; Cortes-Gonzalez, Arely; Cortiana, Giorgio; Costa, Giuseppe; Costa, María José; Costanzo, Davide; Côté, David; Cottin, Giovanna; Courneyea, Lorraine; Cowan, Glen; Cox, Brian; Cranmer, Kyle; Crépé-Renaudin, Sabine; Crescioli, Francesco; Cristinziani, Markus; Crosetti, Giovanni; Cuciuc, Constantin-Mihai; Cuenca Almenar, Cristóbal; Cuhadar Donszelmann, Tulay; Cummings, Jane; Curatolo, Maria; Curtis, Chris; Cuthbert, Cameron; Cwetanski, Peter; Czirr, Hendrik; Czodrowski, Patrick; Czyczula, Zofia; D'Auria, Saverio; D'Onofrio, Monica; D'Orazio, Alessia; Da Cunha Sargedas De Sousa, Mario Jose; Da Via, Cinzia; Dabrowski, Wladyslaw; Dafinca, Alexandru; Dai, Tiesheng; Dallaire, Frederick; Dallapiccola, Carlo; Dam, Mogens; Damiani, Daniel; Danielsson, Hans Olof; Dao, Valerio; Darbo, Giovanni; Darlea, Georgiana Lavinia; Darmora, Smita; Dassoulas, James; Davey, Will; Davidek, Tomas; Davidson, Nadia; Davidson, Ruth; Davies, Eleanor; Davies, Merlin; Davignon, Olivier; Davison, Adam; Davygora, Yuriy; Dawe, Edmund; Dawson, Ian; Daya-Ishmukhametova, Rozmin; De, Kaushik; de Asmundis, Riccardo; De Castro, Stefano; De Cecco, Sandro; de Graat, Julien; De Groot, Nicolo; de Jong, Paul; De La Taille, Christophe; De la Torre, Hector; De Lorenzi, Francesco; De Nooij, Lucie; De Pedis, Daniele; De Salvo, Alessandro; De Sanctis, Umberto; De Santo, Antonella; De Vivie De Regie, Jean-Baptiste; De Zorzi, Guido; Dearnaley, William James; Debbe, Ramiro; Debenedetti, Chiara; Dechenaux, Benjamin; Dedovich, Dmitri; Degenhardt, James; Del Peso, Jose; Del Prete, Tarcisio; Delemontex, Thomas; Deliyergiyev, Maksym; Dell'Acqua, Andrea; Dell'Asta, Lidia; Della Pietra, Massimo; della Volpe, Domenico; Delmastro, Marco; Delsart, Pierre-Antoine; Deluca, Carolina; Demers, Sarah; Demichev, Mikhail; Demirkoz, Bilge; Denisov, Sergey; Derendarz, Dominik; Derkaoui, Jamal Eddine; Derue, Frederic; Dervan, Paul; Desch, Klaus Kurt; Deviveiros, Pier-Olivier; Dewhurst, Alastair; DeWilde, Burton; Dhaliwal, Saminder; Dhullipudi, Ramasudhakar; Di Ciaccio, Anna; Di Ciaccio, Lucia; Di Donato, Camilla; Di Girolamo, Alessandro; Di Girolamo, Beniamino; Di Luise, Silvestro; Di Mattia, Alessandro; Di Micco, Biagio; Di Nardo, Roberto; Di Simone, Andrea; Di Sipio, Riccardo; Diaz, Marco Aurelio; Diehl, Edward; Dietrich, Janet; Dietzsch, Thorsten; Diglio, Sara; Dindar Yagci, Kamile; Dingfelder, Jochen; Dinut, Florin; Dionisi, Carlo; Dita, Petre; Dita, Sanda; Dittus, Fridolin; Djama, Fares; Djobava, Tamar; Barros do Vale, Maria Aline; Do Valle Wemans, André; Doan, Thi Kieu Oanh; Dobbs, Matt; Dobos, Daniel; Dobson, Ellie; Dodd, Jeremy; Doglioni, Caterina; Doherty, Tom; Dohmae, Takeshi; Doi, Yoshikuni; Dolejsi, Jiri; Dolezal, Zdenek; Dolgoshein, Boris; Donadelli, Marisilvia; Donini, Julien; Dopke, Jens; Doria, Alessandra; Dos Anjos, Andre; Dotti, Andrea; Dova, Maria-Teresa; Doyle, Tony; Dressnandt, Nandor; Dris, Manolis; Dubbert, Jörg; Dube, Sourabh; Dubreuil, Emmanuelle; Duchovni, Ehud; Duckeck, Guenter; Duda, Dominik; Dudarev, Alexey; Dudziak, Fanny; Duerdoth, Ian; Duflot, Laurent; Dufour, Marc-Andre; Duguid, Liam; Dührssen, Michael; Dunford, Monica; Duran Yildiz, Hatice; Düren, Michael; Duxfield, Robert; Dwuznik, Michal; Ebenstein, William; Ebke, Johannes; Eckweiler, Sebastian; Edson, William; Edwards, Clive; Edwards, Nicholas Charles; Ehrenfeld, Wolfgang; Eifert, Till; Eigen, Gerald; Einsweiler, Kevin; Eisenhandler, Eric; Ekelof, Tord; El Kacimi, Mohamed; Ellert, Mattias; Elles, Sabine; Ellinghaus, Frank; Ellis, Katherine; Ellis, Nicolas; Elmsheuser, Johannes; Elsing, Markus; Emeliyanov, Dmitry; Enari, Yuji; Engelmann, Roderich; Engl, Albert; Epp, Brigitte; Erdmann, Johannes; Ereditato, Antonio; Eriksson, Daniel; Ernst, Jesse; Ernst, Michael; Ernwein, Jean; Errede, Deborah; Errede, Steven; Ertel, Eugen; Escalier, Marc; Esch, Hendrik; Escobar, Carlos; Espinal Curull, Xavier; Esposito, Bellisario; Etienne, Francois; Etienvre, Anne-Isabelle; Etzion, Erez; Evangelakou, Despoina; Evans, Hal; Fabbri, Laura; Fabre, Caroline; Facini, Gabriel; Fakhrutdinov, Rinat; Falciano, Speranza; Fang, Yaquan; Fanti, Marcello; Farbin, Amir; Farilla, Addolorata; Farley, Jason; Farooque, Trisha; Farrell, Steven; Farrington, Sinead; Farthouat, Philippe; Fassi, Farida; Fassnacht, Patrick; Fassouliotis, Dimitrios; Fatholahzadeh, Baharak; Favareto, Andrea; Fayard, Louis; Federic, Pavol; Fedin, Oleg; Fedorko, Wojciech; Fehling-Kaschek, Mirjam; Feligioni, Lorenzo; Feng, Cunfeng; Feng, Eric; Fenyuk, Alexander; Ferencei, Jozef; Fernando, Waruna; Ferrag, Samir; Ferrando, James; Ferrara, Valentina; Ferrari, Arnaud; Ferrari, Pamela; Ferrari, Roberto; Ferreira de Lima, Danilo Enoque; Ferrer, Antonio; Ferrere, Didier; Ferretti, Claudio; Ferretto Parodi, Andrea; Fiascaris, Maria; Fiedler, Frank; Filipčič, Andrej; Filthaut, Frank; Fincke-Keeler, Margret; Fiolhais, Miguel; Fiorini, Luca; Firan, Ana; Fischer, Julia; Fisher, Matthew; Fitzgerald, Eric Andrew; Flechl, Martin; Fleck, Ivor; Fleischmann, Philipp; Fleischmann, Sebastian; Fletcher, Gareth Thomas; Fletcher, Gregory; Flick, Tobias; Floderus, Anders; Flores Castillo, Luis; Florez Bustos, Andres Carlos; Flowerdew, Michael; Fonseca Martin, Teresa; Formica, Andrea; Forti, Alessandra; Fortin, Dominique; Fournier, Daniel; Fowler, Andrew; Fox, Harald; Francavilla, Paolo; Franchini, Matteo; Franchino, Silvia; Francis, David; Frank, Tal; Franklin, Melissa; Franz, Sebastien; Fraternali, Marco; Fratina, Sasa; French, Sky; Friedrich, Conrad; Friedrich, Felix; Froidevaux, Daniel; Frost, James; Fukunaga, Chikara; Fullana Torregrosa, Esteban; Fulsom, Bryan Gregory; Fuster, Juan; Gabaldon, Carolina; Gabizon, Ofir; Gadatsch, Stefan; Gadfort, Thomas; Gadomski, Szymon; Gagliardi, Guido; Gagnon, Pauline; Galea, Cristina; Galhardo, Bruno; Gallas, Elizabeth; Gallo, Valentina Santina; Gallop, Bruce; Gallus, Petr; Gan, KK; Gandrajula, Reddy Pratap; Gao, Yongsheng; Gaponenko, Andrei; Garay Walls, Francisca; Garberson, Ford; García, Carmen; García Navarro, José Enrique; Garcia-Sciveres, Maurice; Gardner, Robert; Garelli, Nicoletta; Garonne, Vincent; Gatti, Claudio; Gaudio, Gabriella; Gaur, Bakul; Gauthier, Lea; Gauzzi, Paolo; Gavrilenko, Igor; Gay, Colin; Gaycken, Goetz; Gazis, Evangelos; Ge, Peng; Gecse, Zoltan; Gee, Norman; Geerts, Daniël Alphonsus Adrianus; Geich-Gimbel, Christoph; Gellerstedt, Karl; Gemme, Claudia; Gemmell, Alistair; Genest, Marie-Hélène; Gentile, Simonetta; George, Matthias; George, Simon; Gerbaudo, Davide; Gerlach, Peter; Gershon, Avi; Geweniger, Christoph; Ghazlane, Hamid; Ghodbane, Nabil; Giacobbe, Benedetto; Giagu, Stefano; Giangiobbe, Vincent; Gianotti, Fabiola; Gibbard, Bruce; Gibson, Adam; Gibson, Stephen; Gilchriese, Murdock; Gillam, Thomas; Gillberg, Dag; Gillman, Tony; Gingrich, Douglas; Ginzburg, Jonatan; Giokaris, Nikos; Giordani, MarioPaolo; Giordano, Raffaele; Giorgi, Francesco Michelangelo; Giovannini, Paola; Giraud, Pierre-Francois; Giugni, Danilo; Giunta, Michele; Gjelsten, Børge Kile; Gladilin, Leonid; Glasman, Claudia; Glatzer, Julian; Glazov, Alexandre; Glonti, George; Goddard, Jack Robert; Godfrey, Jennifer; Godlewski, Jan; Goebel, Martin; Goeringer, Christian; Goldfarb, Steven; Golling, Tobias; Golubkov, Dmitry; Gomes, Agostinho; Gomez Fajardo, Luz Stella; Gonçalo, Ricardo; Goncalves Pinto Firmino Da Costa, Joao; Gonella, Laura; González de la Hoz, Santiago; Gonzalez Parra, Garoe; Gonzalez Silva, Laura; Gonzalez-Sevilla, Sergio; Goodson, Jeremiah Jet; Goossens, Luc; Göpfert, Thomas; Gorbounov, Petr Andreevich; Gordon, Howard; Gorelov, Igor; Gorfine, Grant; Gorini, Benedetto; Gorini, Edoardo; Gorišek, Andrej; Gornicki, Edward; Goshaw, Alfred; Gössling, Claus; Gostkin, Mikhail Ivanovitch; Gough Eschrich, Ivo; Gouighri, Mohamed; Goujdami, Driss; Goulette, Marc Phillippe; Goussiou, Anna; Goy, Corinne; Gozpinar, Serdar; Graber, Lars; Grabowska-Bold, Iwona; Grafström, Per; Grahn, Karl-Johan; Gramstad, Eirik; Grancagnolo, Francesco; Grancagnolo, Sergio; Grassi, Valerio; Gratchev, Vadim; Gray, Heather; Gray, Julia Ann; Graziani, Enrico; Grebenyuk, Oleg; Greenshaw, Timothy; Greenwood, Zeno Dixon; Gregersen, Kristian; Gregor, Ingrid-Maria; Grenier, Philippe; Griffiths, Justin; Grigalashvili, Nugzar; Grillo, Alexander; Grimm, Kathryn; Grinstein, Sebastian; Gris, Philippe Luc Yves; Grishkevich, Yaroslav; Grivaz, Jean-Francois; Grohs, Johannes Philipp; Grohsjean, Alexander; Gross, Eilam; Grosse-Knetter, Joern; Groth-Jensen, Jacob; Grybel, Kai; Guest, Daniel; Gueta, Orel; Guicheney, Christophe; Guido, Elisa; Guillemin, Thibault; Guindon, Stefan; Gul, Umar; Gunther, Jaroslav; Guo, Bin; Guo, Jun; Gutierrez, Phillip; Guttman, Nir; Gutzwiller, Olivier; Guyot, Claude; Gwenlan, Claire; Gwilliam, Carl; Haas, Andy; Haas, Stefan; Haber, Carl; Hadavand, Haleh Khani; Hadley, David; Haefner, Petra; Hajduk, Zbigniew; Hakobyan, Hrachya; Hall, David; Halladjian, Garabed; Hamacher, Klaus; Hamal, Petr; Hamano, Kenji; Hamer, Matthias; Hamilton, Andrew; Hamilton, Samuel; Han, Liang; Hanagaki, Kazunori; Hanawa, Keita; Hance, Michael; Handel, Carsten; Hanke, Paul; Hansen, John Renner; Hansen, Jørgen Beck; Hansen, Jorn Dines; Hansen, Peter Henrik; Hansson, Per; Hara, Kazuhiko; Harenberg, Torsten; Harkusha, Siarhei; Harper, Devin; Harrington, Robert; Harris, Orin; Hartert, Jochen; Hartjes, Fred; Haruyama, Tomiyoshi; Harvey, Alex; Hasegawa, Satoshi; Hasegawa, Yoji; Hassani, Samira; Haug, Sigve; Hauschild, Michael; Hauser, Reiner; Havranek, Miroslav; Hawkes, Christopher; Hawkings, Richard John; Hawkins, Anthony David; Hayakawa, Takashi; Hayashi, Takayasu; Hayden, Daniel; Hays, Chris; Hayward, Helen; Haywood, Stephen; Head, Simon; Heck, Tobias; Hedberg, Vincent; Heelan, Louise; Heim, Sarah; Heinemann, Beate; Heisterkamp, Simon; Helary, Louis; Heller, Claudio; Heller, Matthieu; Hellman, Sten; Hellmich, Dennis; Helsens, Clement; Henderson, Robert; Henke, Michael; Henrichs, Anna; Henriques Correia, Ana Maria; Henrot-Versille, Sophie; Hensel, Carsten; Medina Hernandez, Carlos; Hernández Jiménez, Yesenia; Herrberg, Ruth; Herten, Gregor; Hertenberger, Ralf; Hervas, Luis; Hesketh, Gavin Grant; Hessey, Nigel; Hickling, Robert; Higón-Rodriguez, Emilio; Hill, John; Hiller, Karl Heinz; Hillert, Sonja; Hillier, Stephen; Hinchliffe, Ian; Hines, Elizabeth; Hirose, Minoru; Hirsch, Florian; Hirschbuehl, Dominic; Hobbs, John; Hod, Noam; Hodgkinson, Mark; Hodgson, Paul; Hoecker, Andreas; Hoeferkamp, Martin; Hoffman, Julia; Hoffmann, Dirk; Hohlfeld, Marc; Holmgren, Sven-Olof; Holy, Tomas; Holzbauer, Jenny; Hong, Tae Min; Hooft van Huysduynen, Loek; Hostachy, Jean-Yves; Hou, Suen; Hoummada, Abdeslam; Howard, Jacob; Howarth, James; Hrabovsky, Miroslav; Hristova, Ivana; Hrivnac, Julius; Hryn'ova, Tetiana; Hsu, Pai-hsien Jennifer; Hsu, Shih-Chieh; Hu, Diedi; Hubacek, Zdenek; Hubaut, Fabrice; Huegging, Fabian; Huettmann, Antje; Huffman, Todd Brian; Hughes, Emlyn; Hughes, Gareth; Huhtinen, Mika; Hülsing, Tobias Alexander; Hurwitz, Martina; Huseynov, Nazim; Huston, Joey; Huth, John; Iacobucci, Giuseppe; Iakovidis, Georgios; Ibbotson, Michael; Ibragimov, Iskander; Iconomidou-Fayard, Lydia; Idarraga, John; Iengo, Paolo; Igonkina, Olga; Ikegami, Yoichi; Ikematsu, Katsumasa; Ikeno, Masahiro; Iliadis, Dimitrios; Ilic, Nikolina; Ince, Tayfun; Ioannou, Pavlos; Iodice, Mauro; Iordanidou, Kalliopi; Ippolito, Valerio; Irles Quiles, Adrian; Isaksson, Charlie; Ishino, Masaya; Ishitsuka, Masaki; Ishmukhametov, Renat; Issever, Cigdem; Istin, Serhat; Ivashin, Anton; Iwanski, Wieslaw; Iwasaki, Hiroyuki; Izen, Joseph; Izzo, Vincenzo; Jackson, Brett; Jackson, John; Jackson, Paul; Jaekel, Martin; Jain, Vivek; Jakobs, Karl; Jakobsen, Sune; Jakoubek, Tomas; Jakubek, Jan; Jamin, David Olivier; Jana, Dilip; Jansen, Eric; Jansen, Hendrik; Janssen, Jens; Jantsch, Andreas; Janus, Michel; Jared, Richard; Jarlskog, Göran; Jeanty, Laura; Jeng, Geng-yuan; Jen-La Plante, Imai; Jennens, David; Jenni, Peter; Jeske, Carl; Jež, Pavel; Jézéquel, Stéphane; Jha, Manoj Kumar; Ji, Haoshuang; Ji, Weina; Jia, Jiangyong; Jiang, Yi; Jimenez Belenguer, Marcos; Jin, Shan; Jinnouchi, Osamu; Joergensen, Morten Dam; Joffe, David; Johansen, Marianne; Johansson, Erik; Johansson, Per; Johnert, Sebastian; Johns, Kenneth; Jon-And, Kerstin; Jones, Graham; Jones, Roger; Jones, Tim; Joram, Christian; Jorge, Pedro; Joshi, Kiran Daniel; Jovicevic, Jelena; Jovin, Tatjana; Ju, Xiangyang; Jung, Christian; Jungst, Ralph Markus; Juranek, Vojtech; Jussel, Patrick; Juste Rozas, Aurelio; Kabana, Sonja; Kaci, Mohammed; Kaczmarska, Anna; Kadlecik, Peter; Kado, Marumi; Kagan, Harris; Kagan, Michael; Kajomovitz, Enrique; Kalinin, Sergey; Kama, Sami; Kanaya, Naoko; Kaneda, Michiru; Kaneti, Steven; Kanno, Takayuki; Kantserov, Vadim; Kanzaki, Junichi; Kaplan, Benjamin; Kapliy, Anton; Kar, Deepak; Karagounis, Michael; Karakostas, Konstantinos; Karnevskiy, Mikhail; Kartvelishvili, Vakhtang; Karyukhin, Andrey; Kashif, Lashkar; Kasieczka, Gregor; Kass, Richard; Kastanas, Alex; Kataoka, Yousuke; Katzy, Judith; Kaushik, Venkatesh; Kawagoe, Kiyotomo; Kawamoto, Tatsuo; Kawamura, Gen; Kazama, Shingo; Kazanin, Vassili; Kazarinov, Makhail; Keeler, Richard; Keener, Paul; Kehoe, Robert; Keil, Markus; Keller, John; Kenyon, Mike; Keoshkerian, Houry; Kepka, Oldrich; Kerschen, Nicolas; Kerševan, Borut Paul; Kersten, Susanne; Kessoku, Kohei; Keung, Justin; Khalil-zada, Farkhad; Khandanyan, Hovhannes; Khanov, Alexander; Kharchenko, Dmitri; Khodinov, Alexander; Khomich, Andrei; Khoo, Teng Jian; Khoriauli, Gia; Khoroshilov, Andrey; Khovanskiy, Valery; Khramov, Evgeniy; Khubua, Jemal; Kim, Hyeon Jin; Kim, Shinhong; Kimura, Naoki; Kind, Oliver; King, Barry; King, Matthew; King, Robert Steven Beaufoy; Kirk, Julie; Kiryunin, Andrey; Kishimoto, Tomoe; Kisielewska, Danuta; Kitamura, Takumi; Kittelmann, Thomas; Kiuchi, Kenji; Kladiva, Eduard; Klein, Max; Klein, Uta; Kleinknecht, Konrad; Klemetti, Miika; Klier, Amit; Klimek, Pawel; Klimentov, Alexei; Klingenberg, Reiner; Klinger, Joel Alexander; Klinkby, Esben; Klioutchnikova, Tatiana; Klok, Peter; Klous, Sander; Kluge, Eike-Erik; Kluge, Thomas; Kluit, Peter; Kluth, Stefan; Kneringer, Emmerich; Knoops, Edith; Knue, Andrea; Ko, Byeong Rok; Kobayashi, Tomio; Kobel, Michael; Kocian, Martin; Kodys, Peter; Koenig, Sebastian; Koetsveld, Folkert; Koevesarki, Peter; Koffas, Thomas; Koffeman, Els; Kogan, Lucy Anne; Kohlmann, Simon; Kohn, Fabian; Kohout, Zdenek; Kohriki, Takashi; Koi, Tatsumi; Kolanoski, Hermann; Kolesnikov, Vladimir; Koletsou, Iro; Koll, James; Komar, Aston; Komori, Yuto; Kondo, Takahiko; Köneke, Karsten; König, Adriaan; Kono, Takanori; Kononov, Anatoly; Konoplich, Rostislav; Konstantinidis, Nikolaos; Kopeliansky, Revital; Koperny, Stefan; Köpke, Lutz; Kopp, Anna Katharina; Korcyl, Krzysztof; Kordas, Kostantinos; Korn, Andreas; Korol, Aleksandr; Korolkov, Ilya; Korolkova, Elena; Korotkov, Vladislav; Kortner, Oliver; Kortner, Sandra; Kostyukhin, Vadim; Kotov, Sergey; Kotov, Vladislav; Kotwal, Ashutosh; Kourkoumelis, Christine; Kouskoura, Vasiliki; Koutsman, Alex; Kowalewski, Robert Victor; Kowalski, Tadeusz; Kozanecki, Witold; Kozhin, Anatoly; Kral, Vlastimil; Kramarenko, Viktor; Kramberger, Gregor; Krasny, Mieczyslaw Witold; Krasznahorkay, Attila; Kraus, Jana; Kravchenko, Anton; Kreiss, Sven; Krejci, Frantisek; Kretzschmar, Jan; Kreutzfeldt, Kristof; Krieger, Nina; Krieger, Peter; Kroeninger, Kevin; Kroha, Hubert; Kroll, Joe; Kroseberg, Juergen; Krstic, Jelena; Kruchonak, Uladzimir; Krüger, Hans; Kruker, Tobias; Krumnack, Nils; Krumshteyn, Zinovii; Kruse, Mark; Kubota, Takashi; Kuday, Sinan; Kuehn, Susanne; Kugel, Andreas; Kuhl, Thorsten; Kukhtin, Victor; Kulchitsky, Yuri; Kuleshov, Sergey; Kuna, Marine; Kunkle, Joshua; Kupco, Alexander; Kurashige, Hisaya; Kurata, Masakazu; Kurochkin, Yurii; Kus, Vlastimil; Kuwertz, Emma Sian; Kuze, Masahiro; Kvita, Jiri; Kwee, Regina; La Rosa, Alessandro; La Rotonda, Laura; Labarga, Luis; Lablak, Said; Lacasta, Carlos; Lacava, Francesco; Lacey, James; Lacker, Heiko; Lacour, Didier; Lacuesta, Vicente Ramón; Ladygin, Evgueni; Lafaye, Remi; Laforge, Bertrand; Lagouri, Theodota; Lai, Stanley; Laisne, Emmanuel; Lambourne, Luke; Lampen, Caleb; Lampl, Walter; Lançon, Eric; Landgraf, Ulrich; Landon, Murrough; Lang, Valerie Susanne; Lange, Clemens; Lankford, Andrew; Lanni, Francesco; Lantzsch, Kerstin; Lanza, Agostino; Laplace, Sandrine; Lapoire, Cecile; Laporte, Jean-Francois; Lari, Tommaso; Larner, Aimee; Lassnig, Mario; Laurelli, Paolo; Lavorini, Vincenzo; Lavrijsen, Wim; Laycock, Paul; Le Dortz, Olivier; Le Guirriec, Emmanuel; Le Menedeu, Eve; LeCompte, Thomas; Ledroit-Guillon, Fabienne Agnes Marie; Lee, Hurng-Chun; Lee, Jason; Lee, Shih-Chang; Lee, Lawrence; Lefebvre, Michel; Legendre, Marie; Legger, Federica; Leggett, Charles; Lehmacher, Marc; Lehmann Miotto, Giovanna; Leister, Andrew Gerard; Leite, Marco Aurelio Lisboa; Leitner, Rupert; Lellouch, Daniel; Lemmer, Boris; Lendermann, Victor; Leney, Katharine; Lenz, Tatiana; Lenzen, Georg; Lenzi, Bruno; Leonhardt, Kathrin; Leontsinis, Stefanos; Lepold, Florian; Leroy, Claude; Lessard, Jean-Raphael; Lester, Christopher; Lester, Christopher Michael; Levêque, Jessica; Levin, Daniel; Levinson, Lorne; Lewis, Adrian; Lewis, George; Leyko, Agnieszka; Leyton, Michael; Li, Bing; Li, Bo; Li, Haifeng; Li, Ho Ling; Li, Shu; Li, Xuefei; Liang, Zhijun; Liao, Hongbo; Liberti, Barbara; Lichard, Peter; Lie, Ki; Liebal, Jessica; Liebig, Wolfgang; Limbach, Christian; Limosani, Antonio; Limper, Maaike; Lin, Simon; Linde, Frank; Linnemann, James; Lipeles, Elliot; Lipniacka, Anna; Lisovyi, Mykhailo; Liss, Tony; Lissauer, David; Lister, Alison; Litke, Alan; Liu, Dong; Liu, Jianbei; Liu, Lulu; Liu, Minghui; Liu, Yanwen; Livan, Michele; Livermore, Sarah; Lleres, Annick; Llorente Merino, Javier; Lloyd, Stephen; Lo Sterzo, Francesco; Lobodzinska, Ewelina; Loch, Peter; Lockman, William; Loddenkoetter, Thomas; Loebinger, Fred; Loevschall-Jensen, Ask Emil; Loginov, Andrey; Loh, Chang Wei; Lohse, Thomas; Lohwasser, Kristin; Lokajicek, Milos; Lombardo, Vincenzo Paolo; Long, Robin Eamonn; Lopes, Lourenco; Lopez Mateos, David; Lorenz, Jeanette; Lorenzo Martinez, Narei; Losada, Marta; Loscutoff, Peter; Losty, Michael; Lou, XinChou; Lounis, Abdenour; Loureiro, Karina; Love, Jeremy; Love, Peter; Lowe, Andrew; Lu, Feng; Lubatti, Henry; Luci, Claudio; Lucotte, Arnaud; Ludwig, Dörthe; Ludwig, Inga; Ludwig, Jens; Luehring, Frederick; Lukas, Wolfgang; Luminari, Lamberto; Lund, Esben; Lundberg, Björn; Lundberg, Johan; Lundberg, Olof; Lund-Jensen, Bengt; Lundquist, Johan; Lungwitz, Matthias; Lynn, David; Lysak, Roman; Lytken, Else; Ma, Hong; Ma, Lian Liang; Maccarrone, Giovanni; Macchiolo, Anna; Maček, Boštjan; Machado Miguens, Joana; Macina, Daniela; Mackeprang, Rasmus; Madar, Romain; Madaras, Ronald; Maddocks, Harvey Jonathan; Mader, Wolfgang; Madsen, Alexander; Maeno, Mayuko; Maeno, Tadashi; Magnoni, Luca; Magradze, Erekle; Mahboubi, Kambiz; Mahlstedt, Joern; Mahmoud, Sara; Mahout, Gilles; Maiani, Camilla; Maidantchik, Carmen; Maio, Amélia; Majewski, Stephanie; Makida, Yasuhiro; Makovec, Nikola; Mal, Prolay; Malaescu, Bogdan; Malecki, Pawel; Malecki, Piotr; Maleev, Victor; Malek, Fairouz; Mallik, Usha; Malon, David; Malone, Caitlin; Maltezos, Stavros; Malyshev, Vladimir; Malyukov, Sergei; Mamuzic, Judita; Manabe, Atsushi; Mandelli, Luciano; Mandić, Igor; Mandrysch, Rocco; Maneira, José; Manfredini, Alessandro; Manhaes de Andrade Filho, Luciano; Manjarres Ramos, Joany Andreina; Mann, Alexander; Manning, Peter; Manousakis-Katsikakis, Arkadios; Mansoulie, Bruno; Mantifel, Rodger; Mapelli, Alessandro; Mapelli, Livio; March, Luis; Marchand, Jean-Francois; Marchese, Fabrizio; Marchiori, Giovanni; Marcisovsky, Michal; Marino, Christopher; Marroquim, Fernando; Marshall, Zach; Marti, Lukas Fritz; Marti-Garcia, Salvador; Martin, Brian; Martin, Brian Thomas; Martin, Jean-Pierre; Martin, Tim; Martin, Victoria Jane; Martin dit Latour, Bertrand; Martinez, Homero; Martinez, Mario; Martinez Outschoorn, Verena; Martin-Haugh, Stewart; Martyniuk, Alex; Marx, Marilyn; Marzano, Francesco; Marzin, Antoine; Masetti, Lucia; Mashimo, Tetsuro; Mashinistov, Ruslan; Masik, Jiri; Maslennikov, Alexey; Massa, Ignazio; Massol, Nicolas; Mastrandrea, Paolo; Mastroberardino, Anna; Masubuchi, Tatsuya; Matsunaga, Hiroyuki; Matsushita, Takashi; Mättig, Peter; Mättig, Stefan; Mattravers, Carly; Maurer, Julien; Maxfield, Stephen; Maximov, Dmitriy; Mazini, Rachid; Mazur, Michael; Mazzaferro, Luca; Mazzanti, Marcello; Mc Donald, Jeffrey; Mc Kee, Shawn Patrick; McCarn, Allison; McCarthy, Robert; McCarthy, Tom; McCubbin, Norman; McFarlane, Kenneth; Mcfayden, Josh; Mchedlidze, Gvantsa; Mclaughlan, Tom; McMahon, Steve; McPherson, Robert; Meade, Andrew; Mechnich, Joerg; Mechtel, Markus; Medinnis, Mike; Meehan, Samuel; Meera-Lebbai, Razzak; Meguro, Tatsuma; Mehlhase, Sascha; Mehta, Andrew; Meier, Karlheinz; Meineck, Christian; Meirose, Bernhard; Melachrinos, Constantinos; Mellado Garcia, Bruce Rafael; Meloni, Federico; Mendoza Navas, Luis; Meng, Zhaoxia; Mengarelli, Alberto; Menke, Sven; Meoni, Evelin; Mercurio, Kevin Michael; Meric, Nicolas; Mermod, Philippe; Merola, Leonardo; Meroni, Chiara; Merritt, Frank; Merritt, Hayes; Messina, Andrea; Metcalfe, Jessica; Mete, Alaettin Serhan; Meyer, Carsten; Meyer, Christopher; Meyer, Jean-Pierre; Meyer, Jochen; Meyer, Joerg; Michal, Sebastien; Micu, Liliana; Middleton, Robin; Migas, Sylwia; Mijović, Liza; Mikenberg, Giora; Mikestikova, Marcela; Mikuž, Marko; Miller, David; Miller, Robert; Mills, Bill; Mills, Corrinne; Milov, Alexander; Milstead, David; Milstein, Dmitry; Minaenko, Andrey; Miñano Moya, Mercedes; Minashvili, Irakli; Mincer, Allen; Mindur, Bartosz; Mineev, Mikhail; Ming, Yao; Mir, Lluisa-Maria; Mirabelli, Giovanni; Mitrevski, Jovan; Mitsou, Vasiliki A; Mitsui, Shingo; Miyagawa, Paul; Mjörnmark, Jan-Ulf; Moa, Torbjoern; Moeller, Victoria; Mohapatra, Soumya; Mohr, Wolfgang; Moles-Valls, Regina; Molfetas, Angelos; Mönig, Klaus; Monini, Caterina; Monk, James; Monnier, Emmanuel; Montejo Berlingen, Javier; Monticelli, Fernando; Monzani, Simone; Moore, Roger; Mora Herrera, Clemencia; Moraes, Arthur; Morange, Nicolas; Morel, Julien; Moreno, Deywis; Moreno Llácer, María; Morettini, Paolo; Morgenstern, Marcus; Morii, Masahiro; Morley, Anthony Keith; Mornacchi, Giuseppe; Morris, John; Morvaj, Ljiljana; Möser, Nicolas; Moser, Hans-Guenther; Mosidze, Maia; Moss, Josh; Mount, Richard; Mountricha, Eleni; Mouraviev, Sergei; Moyse, Edward; Mueller, Felix; Mueller, James; Mueller, Klemens; Mueller, Timo; Muenstermann, Daniel; Müller, Thomas; Munwes, Yonathan; Murray, Bill; Mussche, Ido; Musto, Elisa; Myagkov, Alexey; Myska, Miroslav; Nackenhorst, Olaf; Nadal, Jordi; Nagai, Koichi; Nagai, Ryo; Nagai, Yoshikazu; Nagano, Kunihiro; Nagarkar, Advait; Nagasaka, Yasushi; Nagel, Martin; Nairz, Armin Michael; Nakahama, Yu; Nakamura, Koji; Nakamura, Tomoaki; Nakano, Itsuo; Namasivayam, Harisankar; Nanava, Gizo; Napier, Austin; Narayan, Rohin; Nash, Michael; Nattermann, Till; Naumann, Thomas; Navarro, Gabriela; Neal, Homer; Nechaeva, Polina; Neep, Thomas James; Negri, Andrea; Negri, Guido; Negrini, Matteo; Nektarijevic, Snezana; Nelson, Andrew; Nelson, Timothy Knight; Nemecek, Stanislav; Nemethy, Peter; Nepomuceno, Andre Asevedo; Nessi, Marzio; Neubauer, Mark; Neumann, Manuel; Neusiedl, Andrea; Neves, Ricardo; Nevski, Pavel; Newcomer, Mitchel; Newman, Paul; Nguyen, Duong Hai; Nguyen Thi Hong, Van; Nickerson, Richard; Nicolaidou, Rosy; Nicquevert, Bertrand; Niedercorn, Francois; Nielsen, Jason; Nikiforou, Nikiforos; Nikiforov, Andriy; Nikolaenko, Vladimir; Nikolic-Audit, Irena; Nikolics, Katalin; Nikolopoulos, Konstantinos; Nilsen, Henrik; Nilsson, Paul; Ninomiya, Yoichi; Nisati, Aleandro; Nisius, Richard; Nobe, Takuya; Nodulman, Lawrence; Nomachi, Masaharu; Nomidis, Ioannis; Norberg, Scarlet; Nordberg, Markus; Novakova, Jana; Nozaki, Mitsuaki; Nozka, Libor; Nuncio-Quiroz, Adriana-Elizabeth; Nunes Hanninger, Guilherme; Nunnemann, Thomas; Nurse, Emily; O'Brien, Brendan Joseph; O'Neil, Dugan; O'Shea, Val; Oakes, Louise Beth; Oakham, Gerald; Oberlack, Horst; Ocariz, Jose; Ochi, Atsuhiko; Ochoa, Ines; Oda, Susumu; Odaka, Shigeru; Odier, Jerome; Ogren, Harold; Oh, Alexander; Oh, Seog; Ohm, Christian; Ohshima, Takayoshi; Okamura, Wataru; Okawa, Hideki; Okumura, Yasuyuki; Okuyama, Toyonobu; Olariu, Albert; Olchevski, Alexander; Olivares Pino, Sebastian Andres; Oliveira, Miguel Alfonso; Oliveira Damazio, Denis; Oliver Garcia, Elena; Olivito, Dominick; Olszewski, Andrzej; Olszowska, Jolanta; Onofre, António; Onyisi, Peter; Oram, Christopher; Oreglia, Mark; Oren, Yona; Orestano, Domizia; Orlando, Nicola; Oropeza Barrera, Cristina; Orr, Robert; Osculati, Bianca; Ospanov, Rustem; Osuna, Carlos; Otero y Garzon, Gustavo; Ottersbach, John; Ouchrif, Mohamed; Ouellette, Eric; Ould-Saada, Farid; Ouraou, Ahmimed; Ouyang, Qun; Ovcharova, Ana; Owen, Mark; Owen, Simon; Ozcan, Veysi Erkcan; Ozturk, Nurcan; Pacheco Pages, Andres; Padilla Aranda, Cristobal; Pagan Griso, Simone; Paganis, Efstathios; Pahl, Christoph; Paige, Frank; Pais, Preema; Pajchel, Katarina; Palacino, Gabriel; Paleari, Chiara; Palestini, Sandro; Pallin, Dominique; Palma, Alberto; Palmer, Jody; Pan, Yibin; Panagiotopoulou, Evgenia; Panduro Vazquez, William; Pani, Priscilla; Panikashvili, Natalia; Panitkin, Sergey; Pantea, Dan; Papadelis, Aras; Papadopoulou, Theodora; Paramonov, Alexander; Paredes Hernandez, Daniela; Park, Woochun; Parker, Michael Andrew; Parodi, Fabrizio; Parsons, John; Parzefall, Ulrich; Pashapour, Shabnaz; Pasqualucci, Enrico; Passaggio, Stefano; Passeri, Antonio; Pastore, Fernanda; Pastore, Francesca; Pásztor, Gabriella; Pataraia, Sophio; Patel, Nikhul; Pater, Joleen; Patricelli, Sergio; Pauly, Thilo; Pearce, James; Pedersen, Maiken; Pedraza Lopez, Sebastian; Pedraza Morales, Maria Isabel; Peleganchuk, Sergey; Pelikan, Daniel; Peng, Haiping; Penning, Bjoern; Penson, Alexander; Penwell, John; Perez Cavalcanti, Tiago; Perez Codina, Estel; Pérez García-Estañ, María Teresa; Perez Reale, Valeria; Perini, Laura; Pernegger, Heinz; Perrino, Roberto; Perrodo, Pascal; Peshekhonov, Vladimir; Peters, Krisztian; Peters, Yvonne; Petersen, Brian; Petersen, Jorgen; Petersen, Troels; Petit, Elisabeth; Petridis, Andreas; Petridou, Chariclia; Petrolo, Emilio; Petrucci, Fabrizio; Petschull, Dennis; Petteni, Michele; Pezoa, Raquel; Phan, Anna; Phillips, Peter William; Piacquadio, Giacinto; Pianori, Elisabetta; Picazio, Attilio; Piccaro, Elisa; Piccinini, Maurizio; Piec, Sebastian Marcin; Piegaia, Ricardo; Pignotti, David; Pilcher, James; Pilkington, Andrew; Pina, João Antonio; Pinamonti, Michele; Pinder, Alex; Pinfold, James; Pingel, Almut; Pinto, Belmiro; Pizio, Caterina; Pleier, Marc-Andre; Pleskot, Vojtech; Plotnikova, Elena; Plucinski, Pawel; Poblaguev, Andrei; Poddar, Sahill; Podlyski, Fabrice; Poettgen, Ruth; Poggioli, Luc; Pohl, David-leon; Pohl, Martin; Polesello, Giacomo; Policicchio, Antonio; Polifka, Richard; Polini, Alessandro; Poll, James; Polychronakos, Venetios; Pomeroy, Daniel; Pommès, Kathy; Pontecorvo, Ludovico; Pope, Bernard; Popeneciu, Gabriel Alexandru; Popovic, Dragan; Poppleton, Alan; Portell Bueso, Xavier; Pospelov, Guennady; Pospisil, Stanislav; Potrap, Igor; Potter, Christina; Potter, Christopher; Poulard, Gilbert; Poveda, Joaquin; Pozdnyakov, Valery; Prabhu, Robindra; Pralavorio, Pascal; Pranko, Aliaksandr; Prasad, Srivas; Pravahan, Rishiraj; Prell, Soeren; Pretzl, Klaus Peter; Price, Darren; Price, Joe; Price, Lawrence; Prieur, Damien; Primavera, Margherita; Proissl, Manuel; Prokofiev, Kirill; Prokoshin, Fedor; Protopapadaki, Eftychia-sofia; Protopopescu, Serban; Proudfoot, James; Prudent, Xavier; Przybycien, Mariusz; Przysiezniak, Helenka; Psoroulas, Serena; Ptacek, Elizabeth; Pueschel, Elisa; Puldon, David; Purohit, Milind; Puzo, Patrick; Pylypchenko, Yuriy; Qian, Jianming; Quadt, Arnulf; Quarrie, David; Quayle, William; Quilty, Donnchadha; Raas, Marcel; Radeka, Veljko; Radescu, Voica; Radloff, Peter; Ragusa, Francesco; Rahal, Ghita; Rahimi, Amir; Rajagopalan, Srinivasan; Rammensee, Michael; Rammes, Marcus; Randle-Conde, Aidan Sean; Randrianarivony, Koloina; Rangel-Smith, Camila; Rao, Kanury; Rauscher, Felix; Rave, Tobias Christian; Ravenscroft, Thomas; Raymond, Michel; Read, Alexander Lincoln; Rebuzzi, Daniela; Redelbach, Andreas; Redlinger, George; Reece, Ryan; Reeves, Kendall; Reinsch, Andreas; Reisinger, Ingo; Relich, Matthew; Rembser, Christoph; Ren, Zhongliang; Renaud, Adrien; Rescigno, Marco; Resconi, Silvia; Resende, Bernardo; Reznicek, Pavel; Rezvani, Reyhaneh; Richter, Robert; Richter-Was, Elzbieta; Ridel, Melissa; Rieck, Patrick; Rijssenbeek, Michael; Rimoldi, Adele; Rinaldi, Lorenzo; Rios, Ryan Randy; Ritsch, Elmar; Riu, Imma; Rivoltella, Giancesare; Rizatdinova, Flera; Rizvi, Eram; Robertson, Steven; Robichaud-Veronneau, Andree; Robinson, Dave; Robinson, James; Robson, Aidan; Rocha de Lima, Jose Guilherme; Roda, Chiara; Roda Dos Santos, Denis; Roe, Adam; Roe, Shaun; Røhne, Ole; Rolli, Simona; Romaniouk, Anatoli; Romano, Marino; Romeo, Gaston; Romero Adam, Elena; Rompotis, Nikolaos; Roos, Lydia; Ros, Eduardo; Rosati, Stefano; Rosbach, Kilian; Rose, Anthony; Rose, Matthew; Rosenbaum, Gabriel; Rosendahl, Peter Lundgaard; Rosenthal, Oliver; Rosselet, Laurent; Rossetti, Valerio; Rossi, Elvira; Rossi, Leonardo Paolo; Rotaru, Marina; Roth, Itamar; Rothberg, Joseph; Rousseau, David; Royon, Christophe; Rozanov, Alexandre; Rozen, Yoram; Ruan, Xifeng; Rubbo, Francesco; Rubinskiy, Igor; Ruckstuhl, Nicole; Rud, Viacheslav; Rudolph, Christian; Rudolph, Matthew Scott; Rühr, Frederik; Ruiz-Martinez, Aranzazu; Rumyantsev, Leonid; Rurikova, Zuzana; Rusakovich, Nikolai; Ruschke, Alexander; Rutherfoord, John; Ruthmann, Nils; Ruzicka, Pavel; Ryabov, Yury; Rybar, Martin; Rybkin, Grigori; Ryder, Nick; Saavedra, Aldo; Sadeh, Iftach; Sadrozinski, Hartmut; Sadykov, Renat; Safai Tehrani, Francesco; Sakamoto, Hiroshi; Salamanna, Giuseppe; Salamon, Andrea; Saleem, Muhammad; Salek, David; Salihagic, Denis; Salnikov, Andrei; Salt, José; Salvachua Ferrando, Belén; Salvatore, Daniela; Salvatore, Pasquale Fabrizio; Salvucci, Antonio; Salzburger, Andreas; Sampsonidis, Dimitrios; Sanchez, Arturo; Sánchez, Javier; Sanchez Martinez, Victoria; Sandaker, Heidi; Sander, Heinz Georg; Sanders, Michiel; Sandhoff, Marisa; Sandoval, Tanya; Sandoval, Carlos; Sandstroem, Rikard; Sankey, Dave; Sansoni, Andrea; Santamarina Rios, Cibran; Santoni, Claudio; Santonico, Rinaldo; Santos, Helena; Santoyo Castillo, Itzebelt; Sapp, Kevin; Saraiva, João; Sarangi, Tapas; Sarkisyan-Grinbaum, Edward; Sarrazin, Bjorn; Sarri, Francesca; Sartisohn, Georg; Sasaki, Osamu; Sasaki, Yuichi; Sasao, Noboru; Satsounkevitch, Igor; Sauvage, Gilles; Sauvan, Emmanuel; Sauvan, Jean-Baptiste; Savard, Pierre; Savinov, Vladimir; Savu, Dan Octavian; Sawyer, Lee; Saxon, David; Saxon, James; Sbarra, Carla; Sbrizzi, Antonio; Scannicchio, Diana; Scarcella, Mark; Schaarschmidt, Jana; Schacht, Peter; Schaefer, Douglas; Schaelicke, Andreas; Schaepe, Steffen; Schaetzel, Sebastian; Schäfer, Uli; Schaffer, Arthur; Schaile, Dorothee; Schamberger, R. Dean; Scharf, Veit; Schegelsky, Valery; Scheirich, Daniel; Schernau, Michael; Scherzer, Max; Schiavi, Carlo; Schieck, Jochen; Schillo, Christian; Schioppa, Marco; Schlenker, Stefan; Schmidt, Evelyn; Schmieden, Kristof; Schmitt, Christian; Schmitt, Christopher; Schmitt, Sebastian; Schneider, Basil; Schnellbach, Yan Jie; Schnoor, Ulrike; Schoeffel, Laurent; Schoening, Andre; Schorlemmer, Andre Lukas; Schott, Matthias; Schouten, Doug; Schovancova, Jaroslava; Schram, Malachi; Schroeder, Christian; Schroer, Nicolai; Schultens, Martin Johannes; Schultes, Joachim; Schultz-Coulon, Hans-Christian; Schulz, Holger; Schumacher, Markus; Schumm, Bruce; Schune, Philippe; Schwartzman, Ariel; Schwegler, Philipp; Schwemling, Philippe; Schwienhorst, Reinhard; Schwindling, Jerome; Schwindt, Thomas; Schwoerer, Maud; Sciacca, Gianfranco; Scifo, Estelle; Sciolla, Gabriella; Scott, Bill; Searcy, Jacob; Sedov, George; Sedykh, Evgeny; Seidel, Sally; Seiden, Abraham; Seifert, Frank; Seixas, José; Sekhniaidze, Givi; Sekula, Stephen; Selbach, Karoline Elfriede; Seliverstov, Dmitry; Sellden, Bjoern; Sellers, Graham; Seman, Michal; Semprini-Cesari, Nicola; Serfon, Cedric; Serin, Laurent; Serkin, Leonid; Serre, Thomas; Seuster, Rolf; Severini, Horst; Sfyrla, Anna; Shabalina, Elizaveta; Shamim, Mansoora; Shan, Lianyou; Shank, James; Shao, Qi Tao; Shapiro, Marjorie; Shatalov, Pavel; Shaw, Kate; Sherwood, Peter; Shimizu, Shima; Shimojima, Makoto; Shin, Taeksu; Shiyakova, Mariya; Shmeleva, Alevtina; Shochet, Mel; Short, Daniel; Shrestha, Suyog; Shulga, Evgeny; Shupe, Michael; Sicho, Petr; Sidoti, Antonio; Siegert, Frank; Sijacki, Djordje; Silbert, Ohad; Silva, José; Silver, Yiftah; Silverstein, Daniel; Silverstein, Samuel; Simak, Vladislav; Simard, Olivier; Simic, Ljiljana; Simion, Stefan; Simioni, Eduard; Simmons, Brinick; Simoniello, Rosa; Simonyan, Margar; Sinervo, Pekka; Sinev, Nikolai; Sipica, Valentin; Siragusa, Giovanni; Sircar, Anirvan; Sisakyan, Alexei; Sivoklokov, Serguei; Sjölin, Jörgen; Sjursen, Therese; Skinnari, Louise Anastasia; Skottowe, Hugh Philip; Skovpen, Kirill; Skubic, Patrick; Slater, Mark; Slavicek, Tomas; Sliwa, Krzysztof; Smakhtin, Vladimir; Smart, Ben; Smestad, Lillian; Smirnov, Sergei; Smirnov, Yury; Smirnova, Lidia; Smirnova, Oxana; Smith, Ben Campbell; Smith, Kenway; Smizanska, Maria; Smolek, Karel; Snesarev, Andrei; Snidero, Giacomo; Snow, Steve; Snow, Joel; Snyder, Scott; Sobie, Randall; Sodomka, Jaromir; Soffer, Abner; Soh, Dart-yin; Solans, Carlos; Solar, Michael; Solc, Jaroslav; Soldatov, Evgeny; Soldevila, Urmila; Solfaroli Camillocci, Elena; Solodkov, Alexander; Solovyanov, Oleg; Solovyev, Victor; Soni, Nitesh; Sood, Alexander; Sopko, Vit; Sopko, Bruno; Sosebee, Mark; Soualah, Rachik; Soueid, Paul; Soukharev, Andrey; South, David; Spagnolo, Stefania; Spanò, Francesco; Spighi, Roberto; Spigo, Giancarlo; Spiwoks, Ralf; Spousta, Martin; Spreitzer, Teresa; Spurlock, Barry; St Denis, Richard Dante; Stahlman, Jonathan; Stamen, Rainer; Stanecka, Ewa; Stanek, Robert; Stanescu, Cristian; Stanescu-Bellu, Madalina; Stanitzki, Marcel Michael; Stapnes, Steinar; Starchenko, Evgeny; Stark, Jan; Staroba, Pavel; Starovoitov, Pavel; Staszewski, Rafal; Staude, Arnold; Stavina, Pavel; Steele, Genevieve; Steinbach, Peter; Steinberg, Peter; Stekl, Ivan; Stelzer, Bernd; Stelzer, Harald Joerg; Stelzer-Chilton, Oliver; Stenzel, Hasko; Stern, Sebastian; Stewart, Graeme; Stillings, Jan Andre; Stockton, Mark; Stoebe, Michael; Stoerig, Kathrin; Stoicea, Gabriel; Stonjek, Stefan; Strachota, Pavel; Stradling, Alden; Straessner, Arno; Strandberg, Jonas; Strandberg, Sara; Strandlie, Are; Strang, Michael; Strauss, Emanuel; Strauss, Michael; Strizenec, Pavol; Ströhmer, Raimund; Strom, David; Strong, John; Stroynowski, Ryszard; Stugu, Bjarne; Stumer, Iuliu; Stupak, John; Sturm, Philipp; Styles, Nicholas Adam; Su, Dong; Subramania, Halasya Siva; Subramaniam, Rajivalochan; Succurro, Antonella; Sugaya, Yorihito; Suhr, Chad; Suk, Michal; Sulin, Vladimir; Sultansoy, Saleh; Sumida, Toshi; Sun, Xiaohu; Sundermann, Jan Erik; Suruliz, Kerim; Susinno, Giancarlo; Sutton, Mark; Suzuki, Yu; Suzuki, Yuta; Svatos, Michal; Swedish, Stephen; Swiatlowski, Maximilian; Sykora, Ivan; Sykora, Tomas; Ta, Duc; Tackmann, Kerstin; Taffard, Anyes; Tafirout, Reda; Taiblum, Nimrod; Takahashi, Yuta; Takai, Helio; Takashima, Ryuichi; Takeda, Hiroshi; Takeshita, Tohru; Takubo, Yosuke; Talby, Mossadek; Talyshev, Alexey; Tam, Jason; Tamsett, Matthew; Tan, Kong Guan; Tanaka, Junichi; Tanaka, Reisaburo; Tanaka, Satoshi; Tanaka, Shuji; Tanasijczuk, Andres Jorge; Tani, Kazutoshi; Tannoury, Nancy; Tapprogge, Stefan; Tardif, Dominique; Tarem, Shlomit; Tarrade, Fabien; Tartarelli, Giuseppe Francesco; Tas, Petr; Tasevsky, Marek; Tassi, Enrico; Tayalati, Yahya; Taylor, Christopher; Taylor, Frank; Taylor, Geoffrey; Taylor, Wendy; Teinturier, Marthe; Teischinger, Florian Alfred; Teixeira Dias Castanheira, Matilde; Teixeira-Dias, Pedro; Temming, Kim Katrin; Ten Kate, Herman; Teng, Ping-Kun; Terada, Susumu; Terashi, Koji; Terron, Juan; Testa, Marianna; Teuscher, Richard; Therhaag, Jan; Theveneaux-Pelzer, Timothée; Thoma, Sascha; Thomas, Juergen; Thompson, Emily; Thompson, Paul; Thompson, Peter; Thompson, Stan; Thomsen, Lotte Ansgaard; Thomson, Evelyn; Thomson, Mark; Thong, Wai Meng; Thun, Rudolf; Tian, Feng; Tibbetts, Mark James; Tic, Tomáš; Tikhomirov, Vladimir; Tikhonov, Yury; Timoshenko, Sergey; Tiouchichine, Elodie; Tipton, Paul; Tisserant, Sylvain; Todorov, Theodore; Todorova-Nova, Sharka; Toggerson, Brokk; Tojo, Junji; Tokár, Stanislav; Tokushuku, Katsuo; Tollefson, Kirsten; Tomlinson, Lee; Tomoto, Makoto; Tompkins, Lauren; Toms, Konstantin; Tonoyan, Arshak; Topfel, Cyril; Topilin, Nikolai; Torrence, Eric; Torres, Heberth; Torró Pastor, Emma; Toth, Jozsef; Touchard, Francois; Tovey, Daniel; Tran, Huong Lan; Trefzger, Thomas; Tremblet, Louis; Tricoli, Alesandro; Trigger, Isabel Marian; Trincaz-Duvoid, Sophie; Tripiana, Martin; Triplett, Nathan; Trischuk, William; Trocmé, Benjamin; Troncon, Clara; Trottier-McDonald, Michel; Trovatelli, Monica; True, Patrick; Trzebinski, Maciej; Trzupek, Adam; Tsarouchas, Charilaos; Tseng, Jeffrey; Tsiakiris, Menelaos; Tsiareshka, Pavel; Tsionou, Dimitra; Tsipolitis, Georgios; Tsiskaridze, Shota; Tsiskaridze, Vakhtang; Tskhadadze, Edisher; Tsukerman, Ilya; Tsulaia, Vakhtang; Tsung, Jieh-Wen; Tsuno, Soshi; Tsybychev, Dmitri; Tua, Alan; Tudorache, Alexandra; Tudorache, Valentina; Tuggle, Joseph; Turala, Michal; Turecek, Daniel; Turk Cakir, Ilkay; Turra, Ruggero; Tuts, Michael; Tykhonov, Andrii; Tylmad, Maja; Tyndel, Mike; Tzanakos, George; Uchida, Kirika; Ueda, Ikuo; Ueno, Ryuichi; Ughetto, Michael; Ugland, Maren; Uhlenbrock, Mathias; Ukegawa, Fumihiko; Unal, Guillaume; Undrus, Alexander; Unel, Gokhan; Ungaro, Francesca; Unno, Yoshinobu; Urbaniec, Dustin; Urquijo, Phillip; Usai, Giulio; Vacavant, Laurent; Vacek, Vaclav; Vachon, Brigitte; Vahsen, Sven; Valencic, Nika; Valentinetti, Sara; Valero, Alberto; Valery, Loic; Valkar, Stefan; Valladolid Gallego, Eva; Vallecorsa, Sofia; Valls Ferrer, Juan Antonio; Van Berg, Richard; Van Der Deijl, Pieter; van der Geer, Rogier; van der Graaf, Harry; Van Der Leeuw, Robin; van der Poel, Egge; van der Ster, Daniel; van Eldik, Niels; van Gemmeren, Peter; Van Nieuwkoop, Jacobus; van Vulpen, Ivo; Vanadia, Marco; Vandelli, Wainer; Vaniachine, Alexandre; Vankov, Peter; Vannucci, Francois; Vari, Riccardo; Varnes, Erich; Varol, Tulin; Varouchas, Dimitris; Vartapetian, Armen; Varvell, Kevin; Vassilakopoulos, Vassilios; Vazeille, Francois; Vazquez Schroeder, Tamara; Veloso, Filipe; Veneziano, Stefano; Ventura, Andrea; Ventura, Daniel; Venturi, Manuela; Venturi, Nicola; Vercesi, Valerio; Verducci, Monica; Verkerke, Wouter; Vermeulen, Jos; Vest, Anja; Vetterli, Michel; Vichou, Irene; Vickey, Trevor; Vickey Boeriu, Oana Elena; Viehhauser, Georg; Viel, Simon; Villa, Mauro; Villaplana Perez, Miguel; Vilucchi, Elisabetta; Vincter, Manuella; Vinek, Elisabeth; Vinogradov, Vladimir; Virzi, Joseph; Vitells, Ofer; Viti, Michele; Vivarelli, Iacopo; Vives Vaque, Francesc; Vlachos, Sotirios; Vladoiu, Dan; Vlasak, Michal; Vogel, Adrian; Vokac, Petr; Volpi, Guido; Volpi, Matteo; Volpini, Giovanni; von der Schmitt, Hans; von Radziewski, Holger; von Toerne, Eckhard; Vorobel, Vit; Vorwerk, Volker; Vos, Marcel; Voss, Rudiger; Vossebeld, Joost; Vranjes, Nenad; Vranjes Milosavljevic, Marija; Vrba, Vaclav; Vreeswijk, Marcel; Vu Anh, Tuan; Vuillermet, Raphael; Vukotic, Ilija; Vykydal, Zdenek; Wagner, Wolfgang; Wagner, Peter; Wahlen, Helmut; Wahrmund, Sebastian; Wakabayashi, Jun; Walch, Shannon; Walder, James; Walker, Rodney; Walkowiak, Wolfgang; Wall, Richard; Waller, Peter; Walsh, Brian; Wang, Chiho; Wang, Haichen; Wang, Hulin; Wang, Jike; Wang, Jin; Wang, Kuhan; Wang, Rui; Wang, Song-Ming; Wang, Tan; Wang, Xiaoxiao; Warburton, Andreas; Ward, Patricia; Wardrope, David Robert; Warsinsky, Markus; Washbrook, Andrew; Wasicki, Christoph; Watanabe, Ippei; Watkins, Peter; Watson, Alan; Watson, Ian; Watson, Miriam; Watts, Gordon; Watts, Stephen; Waugh, Anthony; Waugh, Ben; Weber, Michele; Webster, Jordan S; Weidberg, Anthony; Weigell, Philipp; Weingarten, Jens; Weiser, Christian; Wells, Phillippa; Wenaus, Torre; Wendland, Dennis; Weng, Zhili; Wengler, Thorsten; Wenig, Siegfried; Wermes, Norbert; Werner, Matthias; Werner, Per; Werth, Michael; Wessels, Martin; Wetter, Jeffrey; Weydert, Carole; Whalen, Kathleen; White, Andrew; White, Martin; White, Sebastian; Whitehead, Samuel Robert; Whiteson, Daniel; Whittington, Denver; Wicke, Daniel; Wickens, Fred; Wiedenmann, Werner; Wielers, Monika; Wienemann, Peter; Wiglesworth, Craig; Wiik-Fuchs, Liv Antje Mari; Wijeratne, Peter Alexander; Wildauer, Andreas; Wildt, Martin Andre; Wilhelm, Ivan; Wilkens, Henric George; Will, Jonas Zacharias; Williams, Eric; Williams, Hugh; Williams, Sarah; Willis, William; Willocq, Stephane; Wilson, John; Wilson, Michael Galante; Wilson, Alan; Wingerter-Seez, Isabelle; Winkelmann, Stefan; Winklmeier, Frank; Wittgen, Matthias; Wittig, Tobias; Wittkowski, Josephine; Wollstadt, Simon Jakob; Wolter, Marcin Wladyslaw; Wolters, Helmut; Wong, Wei-Cheng; Wooden, Gemma; Wosiek, Barbara; Wotschack, Jorg; Woudstra, Martin; Wozniak, Krzysztof; Wraight, Kenneth; Wright, Michael; Wrona, Bozydar; Wu, Sau Lan; Wu, Xin; Wu, Yusheng; Wulf, Evan; Wynne, Benjamin; Xella, Stefania; Xiao, Meng; Xie, Song; Xu, Chao; Xu, Da; Xu, Lailin; Yabsley, Bruce; Yacoob, Sahal; Yamada, Miho; Yamaguchi, Hiroshi; Yamaguchi, Yohei; Yamamoto, Akira; Yamamoto, Kyoko; Yamamoto, Shimpei; Yamamura, Taiki; Yamanaka, Takashi; Yamauchi, Katsuya; Yamazaki, Takayuki; Yamazaki, Yuji; Yan, Zhen; Yang, Haijun; Yang, Hongtao; Yang, Un-Ki; Yang, Yi; Yang, Zhaoyu; Yanush, Serguei; Yao, Liwen; Yasu, Yoshiji; Yatsenko, Elena; Ye, Jingbo; Ye, Shuwei; Yen, Andy L; Yilmaz, Metin; Yoosoofmiya, Reza; Yorita, Kohei; Yoshida, Rikutaro; Yoshihara, Keisuke; Young, Charles; Young, Christopher John; Youssef, Saul; Yu, Dantong; Yu, David Ren-Hwa; Yu, Jaehoon; Yu, Jie; Yuan, Li; Yurkewicz, Adam; Zabinski, Bartlomiej; Zaidan, Remi; Zaitsev, Alexander; Zambito, Stefano; Zanello, Lucia; Zanzi, Daniele; Zaytsev, Alexander; Zeitnitz, Christian; Zeman, Martin; Zemla, Andrzej; Zenin, Oleg; Ženiš, Tibor; Zerwas, Dirk; Zevi della Porta, Giovanni; Zhang, Dongliang; Zhang, Huaqiao; Zhang, Jinlong; Zhang, Lei; Zhang, Xueyao; Zhang, Zhiqing; Zhao, Long; Zhao, Zhengguo; Zhemchugov, Alexey; Zhong, Jiahang; Zhou, Bing; Zhou, Ning; Zhou, Yue; Zhu, Cheng Guang; Zhu, Hongbo; Zhu, Junjie; Zhu, Yingchun; Zhuang, Xuai; Zhuravlov, Vadym; Zibell, Andre; Zieminska, Daria; Zimin, Nikolai; Zimmermann, Robert; Zimmermann, Simone; Zimmermann, Stephanie; Zinonos, Zinonas; Ziolkowski, Michael; Zitoun, Robert; Živković, Lidija; Zmouchko, Viatcheslav; Zobernig, Georg; Zoccoli, Antonio; zur Nedden, Martin; Zutshi, Vishnu; Zwalinski, Lukasz

    2013-05-15

    A measurement of splitting scales, as defined by the $k_T$ clustering algorithm, is presented for final states containing a W boson produced in proton--proton collisions at a centre-of-mass energy of 7 TeV. The measurement is based on the full 2010 data sample corresponding to an integrated luminosity of 36 pb$^{-1}$ which was collected using the ATLAS detector at the CERN Large Hadron Collider. Cluster splitting scales are measured in events containing W bosons decaying to electrons or muons. The measurement comprises the four hardest splitting scales in a $k_T$ cluster sequence of the hadronic activity accompanying the W boson, and ratios of these splitting scales. Backgrounds such as multi-jet and top-quark-pair production are subtracted and the results are corrected for detector effects. Predictions from various Monte Carlo event generators at particle level are compared to the data. Overall, reasonable agreement is found with all generators, but larger deviations between the predictions and the data are ...

  5. Fpga As A Part Of Ms Windows Control Environment

    Directory of Open Access Journals (Sweden)

    Krzysztof Kołek

    2007-01-01

    Full Text Available The attention is focused on the Windows operating system (OS used as a control and measurementenvironment. Windows OS due to extensions becomes a real-time OS (RTOS.Benefits and drawbacks of typical software extensions are compared. As far as hardwaresolutions are concerned the field programmable gate arrays FPGA technology is proposed toensure fast time-critical operations. FPGA-based parallel execution and hardware implementationof the data processing algorithms significantly outperform the classical microprocessoroperating modes. Suitability of the RTOS for a particular application and FPGA hardwaremaintenance is studied.

  6. An Improved Split-Step Wavelet Transform Method for Anomalous Radio Wave Propagation Modelling

    Directory of Open Access Journals (Sweden)

    A. Iqbal

    2014-12-01

    Full Text Available Anomalous tropospheric propagation caused by ducting phenomenon is a major problem in wireless communication. Thus, it is important to study the behavior of radio wave propagation in tropospheric ducts. The Parabolic Wave Equation (PWE method is considered most reliable to model anomalous radio wave propagation. In this work, an improved Split Step Wavelet transform Method (SSWM is presented to solve PWE for the modeling of tropospheric propagation over finite and infinite conductive surfaces. A large number of numerical experiments are carried out to validate the performance of the proposed algorithm. Developed algorithm is compared with previously published techniques; Wavelet Galerkin Method (WGM and Split-Step Fourier transform Method (SSFM. A very good agreement is found between SSWM and published techniques. It is also observed that the proposed algorithm is about 18 times faster than WGM and provide more details of propagation effects as compared to SSFM.

  7. Windows

    DEFF Research Database (Denmark)

    Heiselberg, Per; Svidt, Kjeld; Nielsen, Peter V.

    In natural ventilation systems fresh air is often provided through opening of windows. However, the knowledge of the performance of windows is rather limited. Computation of natural ventilation air flow through windows is most commonly made using discharge coefficients, that are regarded as being...... constant. The reported results show that the discharge coefficient for a window opening cannot be regarded as a constant and that it varies considerably with the size of the opening area, the window type and the temperature difference. Therefore, the use of a constant value can lead to serious errors...

  8. Handling data redundancy in helical cone beam reconstruction with a cone-angle-based window function and its asymptotic approximation

    International Nuclear Information System (INIS)

    Tang Xiangyang; Hsieh Jiang

    2007-01-01

    A cone-angle-based window function is defined in this manuscript for image reconstruction using helical cone beam filtered backprojection (CB-FBP) algorithms. Rather than defining the window boundaries in a two-dimensional detector acquiring projection data for computed tomographic imaging, the cone-angle-based window function deals with data redundancy by selecting rays with the smallest cone angle relative to the reconstruction plane. To be computationally efficient, an asymptotic approximation of the cone-angle-based window function is also given and analyzed in this paper. The benefit of using such an asymptotic approximation also includes the avoidance of functional discontinuities that cause artifacts in reconstructed tomographic images. The cone-angle-based window function and its asymptotic approximation provide a way, equivalent to the Tam-Danielsson-window, for helical CB-FBP reconstruction algorithms to deal with data redundancy, regardless of where the helical pitch is constant or dynamically variable during a scan. By taking the cone-parallel geometry as an example, a computer simulation study is conducted to evaluate the proposed window function and its asymptotic approximation for helical CB-FBP reconstruction algorithm to handle data redundancy. The computer simulated Forbild head and thorax phantoms are utilized in the performance evaluation, showing that the proposed cone-angle-based window function and its asymptotic approximation can deal with data redundancy very well in cone beam image reconstruction from projection data acquired along helical source trajectories. Moreover, a numerical study carried out in this paper reveals that the proposed cone-angle-based window function is actually equivalent to the Tam-Danielsson-window, and rigorous mathematical proofs are being investigated

  9. A theoretical derivation of the condensed history algorithm

    International Nuclear Information System (INIS)

    Larsen, E.W.

    1992-01-01

    Although the Condensed History Algorithm is a successful and widely-used Monte Carlo method for solving electron transport problems, it has been derived only by an ad-hoc process based on physical reasoning. In this paper we show that the Condensed History Algorithm can be justified as a Monte Carlo simulation of an operator-split procedure in which the streaming, angular scattering, and slowing-down operators are separated within each time step. Different versions of the operator-split procedure lead to Ο(Δs) and Ο(Δs 2 ) versions of the method, where Δs is the path-length step. Our derivation also indicates that higher-order versions of the Condensed History Algorithm may be developed. (Author)

  10. Upper Mantle Seismic Anisotropy Beneath West Antarctica from Shear Wave Splitting Analysis of POLENET/ANET Data

    Science.gov (United States)

    Accardo, N.; Wiens, D. A.; Hernandez, S.; Aster, R. C.; Nyblade, A.; Anandakrishnan, S.; Huerta, A. D.; Wilson, T. J.

    2011-12-01

    We constrain azimuthal anisotropy in the Antarctic upper mantle using shear wave splitting parameters obtained from teleseismic SKS, SKKS, and PKS phases recorded at 30 broad-band seismometers deployed in West Antarctica, and the Transantarctic Mountains as a part of POLENET/ANET. The first seismometers were deployed in late 2007 and additional seismometers were deployed in 2008 and 2009. The seismometers generally operate year-round using solar power, insulated boxes, and either rechargeable AGM or primary lithium batteries. We used an eigenvalue technique to linearize the rotated and shifted shear wave particle motions and determine the best splitting parameters. Robust windows around the individual phases were chosen using the Teanby cluster-analysis algorithm. We visually inspected all results and assigned a quality rating based on factors including signal-to-noise ratios, particle motions, and error contours. The best results for each station were then stacked to get an average splitting direction and delay time. The delay times range from 0.33 to 1.33 s, but generally average about 1 s. We conclude that the splitting results from anisotropy in the upper mantle, since the large splitting times cannot be accumulated in the relatively thin crust (20-30 km) of the region. Overall, fast directions in West Antarctica are at large angles to the direction of Antarctic absolute plate motion in either hotspot or no-net rotation frameworks, showing that the anisotropic fabric does not result from shear associated with the motion of Antarctica over the mantle. The West Antarctic fast directions are also much different than those found in East Antarctica by previous studies. We suggest that the East Antarctic splitting results from anisotropy frozen into the cold cratonic continental lithosphere, whereas West Antarctic splitting is related to Cenozoic tectonism. Stations within the West Antarctic Rift System (WARS), a region of Cenozoic extension, show fast directions

  11. Sparse Parallel MRI Based on Accelerated Operator Splitting Schemes.

    Science.gov (United States)

    Cai, Nian; Xie, Weisi; Su, Zhenghang; Wang, Shanshan; Liang, Dong

    2016-01-01

    Recently, the sparsity which is implicit in MR images has been successfully exploited for fast MR imaging with incomplete acquisitions. In this paper, two novel algorithms are proposed to solve the sparse parallel MR imaging problem, which consists of l 1 regularization and fidelity terms. The two algorithms combine forward-backward operator splitting and Barzilai-Borwein schemes. Theoretically, the presented algorithms overcome the nondifferentiable property in l 1 regularization term. Meanwhile, they are able to treat a general matrix operator that may not be diagonalized by fast Fourier transform and to ensure that a well-conditioned optimization system of equations is simply solved. In addition, we build connections between the proposed algorithms and the state-of-the-art existing methods and prove their convergence with a constant stepsize in Appendix. Numerical results and comparisons with the advanced methods demonstrate the efficiency of proposed algorithms.

  12. Regularization iteration imaging algorithm for electrical capacitance tomography

    Science.gov (United States)

    Tong, Guowei; Liu, Shi; Chen, Hongyan; Wang, Xueyao

    2018-03-01

    The image reconstruction method plays a crucial role in real-world applications of the electrical capacitance tomography technique. In this study, a new cost function that simultaneously considers the sparsity and low-rank properties of the imaging targets is proposed to improve the quality of the reconstruction images, in which the image reconstruction task is converted into an optimization problem. Within the framework of the split Bregman algorithm, an iterative scheme that splits a complicated optimization problem into several simpler sub-tasks is developed to solve the proposed cost function efficiently, in which the fast-iterative shrinkage thresholding algorithm is introduced to accelerate the convergence. Numerical experiment results verify the effectiveness of the proposed algorithm in improving the reconstruction precision and robustness.

  13. Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle

    Directory of Open Access Journals (Sweden)

    Wang Li-ying

    2015-11-01

    Full Text Available This paper presents the electric vehicle (EV multiple charging station location-routing problem with time window to optimize the routing plan of capacitated EVs and the strategy of charging stations. In particular, the strategy of charging stations includes both infrastructure-type selection and station location decisions. The problem accounts for two critical constraints in logistic practice: the vehicle loading capacity and the customer time windows. A hybrid heuristic that incorporates an adaptive variable neighborhood search (AVNS with the tabu search algorithm for intensification was developed to address the problem. The specialized neighborhood structures and the selection methods of charging station used in the shaking step of AVNS were proposed. In contrast to the commercial solver CPLEX, experimental results on small-scale test instances demonstrate that the algorithm can find nearly optimal solutions on small-scale instances. The results on large-scale instances also show the effectiveness of the algorithm.

  14. Approximation algorithms for deadline-TSP and vehicle routing with time-windows

    NARCIS (Netherlands)

    Bansal, N.; Blum, A.; Chawla, S.; Meyerson, A.; Babai, L.

    2004-01-01

    Given a metric space G on n nodes, with a start node r and deadlines D(v) for each vertex v, we consider the Deadline-TSP problem of finding a path starting at r that visits as many nodes as possible by their deadlines. We also consider the more general Vehicle Routing with Time-Windows problem, in

  15. A biological inspired fuzzy adaptive window median filter (FAWMF) for enhancing DNA signal processing.

    Science.gov (United States)

    Ahmad, Muneer; Jung, Low Tan; Bhuiyan, Al-Amin

    2017-10-01

    Digital signal processing techniques commonly employ fixed length window filters to process the signal contents. DNA signals differ in characteristics from common digital signals since they carry nucleotides as contents. The nucleotides own genetic code context and fuzzy behaviors due to their special structure and order in DNA strand. Employing conventional fixed length window filters for DNA signal processing produce spectral leakage and hence results in signal noise. A biological context aware adaptive window filter is required to process the DNA signals. This paper introduces a biological inspired fuzzy adaptive window median filter (FAWMF) which computes the fuzzy membership strength of nucleotides in each slide of window and filters nucleotides based on median filtering with a combination of s-shaped and z-shaped filters. Since coding regions cause 3-base periodicity by an unbalanced nucleotides' distribution producing a relatively high bias for nucleotides' usage, such fundamental characteristic of nucleotides has been exploited in FAWMF to suppress the signal noise. Along with adaptive response of FAWMF, a strong correlation between median nucleotides and the Π shaped filter was observed which produced enhanced discrimination between coding and non-coding regions contrary to fixed length conventional window filters. The proposed FAWMF attains a significant enhancement in coding regions identification i.e. 40% to 125% as compared to other conventional window filters tested over more than 250 benchmarked and randomly taken DNA datasets of different organisms. This study proves that conventional fixed length window filters applied to DNA signals do not achieve significant results since the nucleotides carry genetic code context. The proposed FAWMF algorithm is adaptive and outperforms significantly to process DNA signal contents. The algorithm applied to variety of DNA datasets produced noteworthy discrimination between coding and non-coding regions contrary

  16. Improved Bunch Splitting for the 75ns LHC Beam

    CERN Document Server

    Damerau, H

    2011-01-01

    The 75ns variant was added to the PS arsenal of LHC-type beams by adapting the 20MHz cavity used to produce the 25 and 50ns variants to operate at a switchable 13MHz. This permitted splitting from harmonic 14 to 28, but at a cost in adiabaticity compared with the h=2142 splitting of the other two cases. Consequently, a delicate empirical optimization was necessary to bring the 75ns beam inside specification. More recently the speed at which the bunches, once fully distinct, are moved apart has been revisited and further optimization achieved. As a by-product, deliberately degrading the splitting by moving the bunches apart too quickly led to sufficient coherent motion in the resultant bunch pair to permit a voltage calibration of the 13MHz cavity by means of the influence on convergence of the rf voltage input into the iterative algorithm of the Tomoscope [1,2].

  17. SplitDist—Calculating Split-Distances for Sets of Trees

    DEFF Research Database (Denmark)

    Mailund, T

    2004-01-01

    We present a tool for comparing a set of input trees, calculating for each pair of trees the split-distances, i.e., the number of splits in one tree not present in the other.......We present a tool for comparing a set of input trees, calculating for each pair of trees the split-distances, i.e., the number of splits in one tree not present in the other....

  18. Electric efficiency in lighting system and air conditioners replacement and automation of air conditioners split type in public buildings; Eficiencia eletrica na substituicao do sistema de iluminacao e de condicionadores de ar e automacao do sistema de condicionadores de ar tipo split em predios publicos

    Energy Technology Data Exchange (ETDEWEB)

    Vasconcellos, Arnulfo Barroso de; Apolonio, Roberto; Silva, Luciana Oliveira da; Gomes, Fernanda Leles [Universidade Federal de Mato Grosso (UFMT), MT (Brazil); Malheiro, Teresa Irene Ribeiro de Carvalho [Instituto Federal de Educacao, Ciencia e Tecnologia de Mato Grosso (IFMT), MT (Brazil); Barros, Regiane Silva de [Universidade Estadual de Campinas (UNICAMP), SP (Brazil)

    2010-07-01

    The reduction in expenditure on electricity is a major benefit not only consumers but also to utilities. In this context, this article examines the process of replacing the system of internal lighting, window type air conditioners and automation of Split type air conditioners from buildings of public institutions of the state of Mato Grosso during 2009 year and verifies the reduction in annual consumption of electric power and demand active power. Thus, measurements and calculations performed are presented for the interior lighting systems and air conditioners of these buildings before and after implementation of the process of replacing the system of internal lighting and window type air conditioners and automation of Split type air conditioners. This work is the result of integration among the Dealer Network Energy Rede Cemat, the Federal University of Mato Grosso (UFMT) and the Administration of all public buildings, where the academy answered these real issues, solving the specific problem presented. (author)

  19. Fully multidimensional flux-corrected transport algorithms for fluids

    International Nuclear Information System (INIS)

    Zalesak, S.T.

    1979-01-01

    The theory of flux-corrected transport (FCT) developed by Boris and Book is placed in a simple, generalized format, and a new algorithm for implementing the critical flux limiting stage in multidimensions without resort to time splitting is presented. The new flux limiting algorithm allows the use of FCT techniques in multidimensional fluid problems for which time splitting would produce unacceptable numerical results, such as those involving incompressible or nearly incompressible flow fields. The 'clipping' problem associated with the original one dimensional flux limiter is also eliminated or alleviated. Test results and applications to a two dimensional fluid plasma problem are presented

  20. Automated cloud screening of AVHRR imagery using split-and-merge clustering

    Science.gov (United States)

    Gallaudet, Timothy C.; Simpson, James J.

    1991-01-01

    Previous methods to segment clouds from ocean in AVHRR imagery have shown varying degrees of success, with nighttime approaches being the most limited. An improved method of automatic image segmentation, the principal component transformation split-and-merge clustering (PCTSMC) algorithm, is presented and applied to cloud screening of both nighttime and daytime AVHRR data. The method combines spectral differencing, the principal component transformation, and split-and-merge clustering to sample objectively the natural classes in the data. This segmentation method is then augmented by supervised classification techniques to screen clouds from the imagery. Comparisons with other nighttime methods demonstrate its improved capability in this application. The sensitivity of the method to clustering parameters is presented; the results show that the method is insensitive to the split-and-merge thresholds.

  1. Evaluation of TCP Congestion Control Algorithms on the Windows Vista Platform

    Energy Technology Data Exchange (ETDEWEB)

    Li, Yee-Ting; /SLAC

    2006-07-07

    CTCP, an innovative TCP congestion control algorithm developed by Microsoft, is evaluated and compared to HSTCP and StandardTCP. Tests were performed on the production Internet from Stanford Linear Accelerator Center (SLAC) to various geographically located hosts to give a broad overview of the performances. We find that certain issues were apparent during testing (not directly related to the congestion control algorithms) which may skew results. With this in mind, we find that CTCP performed similarly to HSTCP across a multitude of different network environments. However, to improve the fairness and to reduce the impact of CTCP upon existing StandardTCP traffic, two areas of further research were investigated. Algorithmic additions to CTCP for burst control to reduce the aggressiveness of its cwnd increments demonstrated beneficial improvements in both fairness and throughput over the original CTCP algorithm. Similarly, {gamma} auto-tuning algorithms were investigated to dynamically adapt CTCP flows to their network conditions for optimal performance. While the effects of these auto-tuning algorithms when used in addition to burst control showed little to no benefit to fairness nor throughput for the limited number of network paths tested, one of the auto-tuning algorithms performed such that there was negligible impact upon StandardTCP. With these improvements, CTCP was found to perform better than HSTCP in terms of fairness and similarly in terms of throughput under the production environments tested.

  2. Evaluation of TCP Congestion Control Algorithms on the Windows Vista Platform

    International Nuclear Information System (INIS)

    Li, Y

    2006-01-01

    CTCP, an innovative TCP congestion control algorithm developed by Microsoft, is evaluated and compared to HSTCP and StandardTCP. Tests were performed on the production Internet from Stanford Linear Accelerator Center (SLAC) to various geographically located hosts to give a broad overview of the performances. We find that certain issues were apparent during testing (not directly related to the congestion control algorithms) which may skew results. With this in mind, we find that CTCP performed similarly to HSTCP across a multitude of different network environments. However, to improve the fairness and to reduce the impact of CTCP upon existing StandardTCP traffic, two areas of further research were investigated. Algorithmic additions to CTCP for burst control to reduce the aggressiveness of its cwnd increments demonstrated beneficial improvements in both fairness and throughput over the original CTCP algorithm. Similarly, auto-tuning algorithms were investigated to dynamically adapt CTCP flows to their network conditions for optimal performance. Whilst the effects of these auto-tuning algorithms when used in addition to burst control showed little to no benefit to fairness nor throughput for the limited number of network paths tested, one of the auto-tuning algorithms performed such that there was negligible impact upon StandardTCP. With these improvements, CTCP was found to perform better than HSTCP in terms of fairness and similarly in terms of throughput under the production environments tested

  3. A parallelizable real-time motion tracking algorithm with applications to ultrasonic strain imaging

    International Nuclear Information System (INIS)

    Jiang, J; Hall, T J

    2007-01-01

    Ultrasound-based mechanical strain imaging systems utilize signals from conventional diagnostic ultrasound systems to image tissue elasticity contrast that provides new diagnostically valuable information. Previous works (Hall et al 2003 Ultrasound Med. Biol. 29 427, Zhu and Hall 2002 Ultrason. Imaging 24 161) demonstrated that uniaxial deformation with minimal elevation motion is preferred for breast strain imaging and real-time strain image feedback to operators is important to accomplish this goal. The work reported here enhances the real-time speckle tracking algorithm with two significant modifications. One fundamental change is that the proposed algorithm is a column-based algorithm (a column is defined by a line of data parallel to the ultrasound beam direction, i.e. an A-line), as opposed to a row-based algorithm (a row is defined by a line of data perpendicular to the ultrasound beam direction). Then, displacement estimates from its adjacent columns provide good guidance for motion tracking in a significantly reduced search region to reduce computational cost. Consequently, the process of displacement estimation can be naturally split into at least two separated tasks, computed in parallel, propagating outward from the center of the region of interest (ROI). The proposed algorithm has been implemented and optimized in a Windows (registered) system as a stand-alone ANSI C++ program. Results of preliminary tests, using numerical and tissue-mimicking phantoms, and in vivo tissue data, suggest that high contrast strain images can be consistently obtained with frame rates (10 frames s -1 ) that exceed our previous methods

  4. OPTIMIZING TIME WINDOWS FOR MANAGING ARRIVALS OF EXPORT CONTAINERS AT CHINESE CONTAINER TERMINALS

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen

    2009-01-01

    of driver and truck waiting time, the cost of container cargo storage time, the truck idle cost and terminal yard fee. Secondly, to minimize the costs, a heuristic is developed based on a genetic algorithm to optimize the time window arrangement. The optimal solution involves the position and the length...... window management programme that is widely used in Chinese terminals to facilitate the terminal operations and the truck delivery operations. Firstly, the arrangement of time windows is assumed to follow the principle of minimizing the transport costs. A cost function is defined that includes the cost...

  5. Windows Azure

    CERN Document Server

    Johnson, Bruce; Chambers, James; Garber, Danny; Malik, Jamal; Fazio, Adam

    2013-01-01

    A collection of five must-have Azure titles, from some of the biggest names in the field Available individually, but at a discounted rate for the collection, this bundle of five e-books covers key developer and IT topics of Windows Azure, including ASP.NET, mobile services, web sites, data storage, and the hybrid cloud. A host of Microsoft employees and MPVs come together to cover the biggest challenges that professionals face when working with Windows Azure. The e-books included are as follows: Windows Azure and ASP.NET MVC MigrationWindows Azure Mobile ServicesWindows Azure Web SitesWindows

  6. Splitting of inviscid fluxes for real gases

    Science.gov (United States)

    Liou, Meng-Sing; Van Leer, Bram; Shuen, Jian-Shun

    1990-01-01

    Flux-vector and flux-difference splittings for the inviscid terms of the compressible flow equations are derived under the assumption of a general equation of state for a real gas in equilibrium. No necessary assumptions, approximations for auxiliary quantities are introduced. The formulas derived include several particular cases known for ideal gases and readily apply to curvilinear coordinates. Applications of the formulas in a TVD algorithm to one-dimensional shock-tube and nozzle problems show their quality and robustness.

  7. Learning Windows Azure Mobile Services for Windows 8 and Windows Phone 8

    CERN Document Server

    Webber-Cross, Geoff

    2014-01-01

    This book is based around a case study game which was written for the book. This means that the chapters progress in a logical way and build upon lessons learned as we go. Real-world examples are provided for each topic that are practical and not given out-of-context so they can be applied directly to other applications.If you are a developer who wishes to build Windows 8 and Phone 8 applications and integrate them with Windows Azure Mobile Services, this book is for you. Basic C# and JavaScript skills are advantageous, as well as some knowledge of building Windows 8 or Windows Phone 8 applica

  8. Wide-Range Motion Estimation Architecture with Dual Search Windows for High Resolution Video Coding

    Science.gov (United States)

    Dung, Lan-Rong; Lin, Meng-Chun

    This paper presents a memory-efficient motion estimation (ME) technique for high-resolution video compression. The main objective is to reduce the external memory access, especially for limited local memory resource. The reduction of memory access can successfully save the notorious power consumption. The key to reduce the memory accesses is based on center-biased algorithm in that the center-biased algorithm performs the motion vector (MV) searching with the minimum search data. While considering the data reusability, the proposed dual-search-windowing (DSW) approaches use the secondary windowing as an option per searching necessity. By doing so, the loading of search windows can be alleviated and hence reduce the required external memory bandwidth. The proposed techniques can save up to 81% of external memory bandwidth and require only 135 MBytes/sec, while the quality degradation is less than 0.2dB for 720p HDTV clips coded at 8Mbits/sec.

  9. The EEG Split Alpha Peak: Phenomenological Origins and Methodological Aspects of Detection and Evaluation.

    Science.gov (United States)

    Olejarczyk, Elzbieta; Bogucki, Piotr; Sobieszek, Aleksander

    2017-01-01

    Electroencephalographic (EEG) patterns were analyzed in a group of ambulatory patients who ranged in age and sex using spectral analysis as well as Directed Transfer Function, a method used to evaluate functional brain connectivity. We tested the impact of window size and choice of reference electrode on the identification of two or more peaks with close frequencies in the spectral power distribution, so called "split alpha." Together with the connectivity analysis, examination of spatiotemporal maps showing the distribution of amplitudes of EEG patterns allowed for better explanation of the mechanisms underlying the generation of split alpha peaks. It was demonstrated that the split alpha spectrum can be generated by two or more independent and interconnected alpha wave generators located in different regions of the cerebral cortex, but not necessarily in the occipital cortex. We also demonstrated the importance of appropriate reference electrode choice during signal recording. In addition, results obtained using the original data were compared with results obtained using re-referenced data, using average reference electrode and reference electrode standardization techniques.

  10. Optimizing Ship Speed to Minimize Total Fuel Consumption with Multiple Time Windows

    Directory of Open Access Journals (Sweden)

    Jae-Gon Kim

    2016-01-01

    Full Text Available We study the ship speed optimization problem with the objective of minimizing the total fuel consumption. We consider multiple time windows for each port call as constraints and formulate the problem as a nonlinear mixed integer program. We derive intrinsic properties of the problem and develop an exact algorithm based on the properties. Computational experiments show that the suggested algorithm is very efficient in finding an optimal solution.

  11. Finding Frequent Closed Itemsets in Sliding Window in Linear Time

    Science.gov (United States)

    Chen, Junbo; Zhou, Bo; Chen, Lu; Wang, Xinyu; Ding, Yiqun

    One of the most well-studied problems in data mining is computing the collection of frequent itemsets in large transactional databases. Since the introduction of the famous Apriori algorithm [14], many others have been proposed to find the frequent itemsets. Among such algorithms, the approach of mining closed itemsets has raised much interest in data mining community. The algorithms taking this approach include TITANIC [8], CLOSET+[6], DCI-Closed [4], FCI-Stream [3], GC-Tree [15], TGC-Tree [16] etc. Among these algorithms, FCI-Stream, GC-Tree and TGC-Tree are online algorithms work under sliding window environments. By the performance evaluation in [16], GC-Tree [15] is the fastest one. In this paper, an improved algorithm based on GC-Tree is proposed, the computational complexity of which is proved to be a linear combination of the average transaction size and the average closed itemset size. The algorithm is based on the essential theorem presented in Sect. 4.2. Empirically, the new algorithm is several orders of magnitude faster than the state of art algorithm, GC-Tree.

  12. The development of Windows based control system for the tele-robotics

    International Nuclear Information System (INIS)

    Kim, Byung Soo; Kim, Seung Ho; Seo, Yong Chil; Kim, Ki Ho; Hwang, Suk Yeoung; Kim, Chang Hoi; Jung, Seung Ho; Lee, Young Kwang

    1998-03-01

    The WSCS (Windows-based Supervisory Control System) has been developed for the efficient control of the mobile robot in the hazardous area, such as reactor surroundings of HPWR (Heavy Pressurized Water Reactor). The WSCS is basically computer program which consists windows menu-program, socket-based communication program, force reflection joystick program, and OpenGL-based 3D graphic program. Also, the WSCS includes the force control algorithm of a master control device ( in this case, joystick) for the enhanced operability. To evaluate the effectiveness of the designed WSCS and the force reflection control algorithm, a series of experiments has been made in such a way that human operators command the desired motion of robot by manipulating the joystick in the virtual environment. As a result, it was proven that the designed WSCS is very easy-to-use and effective. Also, the developed force reflection algorithm is more efficient than that of general tele-operation, even though there are some difference in human dexterity. In near future, the WSCS will be applied in the next version of KAEROT. (author). 11 refs., 14 tabs., 1 fig

  13. Gaussian elimination in split unitary groups with an application to public-key cryptography

    Directory of Open Access Journals (Sweden)

    Ayan Mahalanobis

    2017-07-01

    Full Text Available Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to split unitary groups. These algorithms have an application in building a public-key cryptosystem, we demonstrate that.

  14. Windows server cookbook for Windows server 2003 and Windows 2000

    CERN Document Server

    Allen, Robbie

    2005-01-01

    This practical reference guide offers hundreds of useful tasks for managing Windows 2000 and Windows Server 2003, Microsoft's latest server. These concise, on-the-job solutions to common problems are certain to save you many hours of time searching through Microsoft documentation. Topics include files, event logs, security, DHCP, DNS, backup/restore, and more

  15. Daytime Land Surface Temperature Extraction from MODIS Thermal Infrared Data under Cirrus Clouds

    Directory of Open Access Journals (Sweden)

    Xiwei Fan

    2015-04-01

    Full Text Available Simulated data showed that cirrus clouds could lead to a maximum land surface temperature (LST retrieval error of 11.0 K when using the generalized split-window (GSW algorithm with a cirrus optical depth (COD at 0.55 μm of 0.4 and in nadir view. A correction term in the COD linear function was added to the GSW algorithm to extend the GSW algorithm to cirrus cloudy conditions. The COD was acquired by a look up table of the isolated cirrus bidirectional reflectance at 0.55 μm. Additionally, the slope k of the linear function was expressed as a multiple linear model of the top of the atmospheric brightness temperatures of MODIS channels 31–34 and as the difference between split-window channel emissivities. The simulated data showed that the LST error could be reduced from 11.0 to 2.2 K. The sensitivity analysis indicated that the total errors from all the uncertainties of input parameters, extension algorithm accuracy, and GSW algorithm accuracy were less than 2.5 K in nadir view. Finally, the Great Lakes surface water temperatures measured by buoys showed that the retrieval accuracy of the GSW algorithm was improved by at least 1.5 K using the proposed extension algorithm for cirrus skies.

  16. MS Windows domēna darbstaciju migrācija no MS Windows XP uz Windows Vista.

    OpenAIRE

    Tetere, Agate

    2009-01-01

    Kvalifikācijas darbā izpētīju darbstaciju migrācijas no Windows XP uz Windows Vista plusus un mīnusus. Darba gaitā tika veikti sekojoši uzdevumi: 1.Veikta Windows XP un Windows Vista darbstaciju instalācija, iestatījumu konfigurēšana un tika pārbaudīta sistēmas darbība 2.Veikta Windows Server 2003 un Windows Server 2008 instalācija, iestatījumu konfigurēšana un tika pārbaudīta sistēmas darbība 3.Izstrādāts migrācijas modelis 4.Veikta migrācijas optimizēšana 5.Veikta datu migrāc...

  17. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yingcheng Xu

    2013-01-01

    Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

  18. An adaptive sampling and windowing interrogation method in PIV

    Science.gov (United States)

    Theunissen, R.; Scarano, F.; Riethmuller, M. L.

    2007-01-01

    This study proposes a cross-correlation based PIV image interrogation algorithm that adapts the number of interrogation windows and their size to the image properties and to the flow conditions. The proposed methodology releases the constraint of uniform sampling rate (Cartesian mesh) and spatial resolution (uniform window size) commonly adopted in PIV interrogation. Especially in non-optimal experimental conditions where the flow seeding is inhomogeneous, this leads either to loss of robustness (too few particles per window) or measurement precision (too large or coarsely spaced interrogation windows). Two criteria are investigated, namely adaptation to the local signal content in the image and adaptation to local flow conditions. The implementation of the adaptive criteria within a recursive interrogation method is described. The location and size of the interrogation windows are locally adapted to the image signal (i.e., seeding density). Also the local window spacing (commonly set by the overlap factor) is put in relation with the spatial variation of the velocity field. The viability of the method is illustrated over two experimental cases where the limitation of a uniform interrogation approach appears clearly: a shock-wave-boundary layer interaction and an aircraft vortex wake. The examples show that the spatial sampling rate can be adapted to the actual flow features and that the interrogation window size can be arranged so as to follow the spatial distribution of seeding particle images and flow velocity fluctuations. In comparison with the uniform interrogation technique, the spatial resolution is locally enhanced while in poorly seeded regions the level of robustness of the analysis (signal-to-noise ratio) is kept almost constant.

  19. A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

    Directory of Open Access Journals (Sweden)

    N. Rincon-Garcia

    2017-01-01

    Full Text Available This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%, travel distance (10.88% and travel time (12.00% compared to previous implementations in reasonable time.

  20. Grab Windows training opportunities; check CERN Windows roadmap!

    CERN Multimedia

    IT Department

    2011-01-01

    CERN Operating Systems and Information Services group (IT-OIS) actively monitors market trends to check how new software products correspond to CERN needs. In the Windows world, Windows 7 has been a big hit, with over 1500 Windows 7 PCs within less than a year since its support was introduced at CERN. No wonder: Windows XP is nearly 10 years old and is steadily approaching the end of its life-cycle. At CERN, support for Windows XP will stop at the end of December 2012. Compared to Vista, Windows 7 has the same basic hardware requirements, but offers higher performance, so the decision to upgrade is rather straightforward. CERN support for Vista will end in June 2011. In the world of Microsoft Office, version 2007 offers better integration with the central services than the older version 2003. Progressive upgrade from 2003 to 2007 is planned to finish in September 2011, but users are encouraged to pro-actively upgrade at their convenience. Please note that Office 2007 brings an important change in the area of ...

  1. Creating ensembles of oblique decision trees with evolutionary algorithms and sampling

    Science.gov (United States)

    Cantu-Paz, Erick [Oakland, CA; Kamath, Chandrika [Tracy, CA

    2006-06-13

    A decision tree system that is part of a parallel object-oriented pattern recognition system, which in turn is part of an object oriented data mining system. A decision tree process includes the step of reading the data. If necessary, the data is sorted. A potential split of the data is evaluated according to some criterion. An initial split of the data is determined. The final split of the data is determined using evolutionary algorithms and statistical sampling techniques. The data is split. Multiple decision trees are combined in ensembles.

  2. Combined First and Second Order Total Variation Inpainting using Split Bregman

    KAUST Repository

    Papafitsoros, Konstantinos

    2013-07-12

    In this article we discuss the implementation of the combined first and second order total variation inpainting that was introduced by Papafitsoros and Schdönlieb. We describe the algorithm we use (split Bregman) in detail, and we give some examples that indicate the difference between pure first and pure second order total variation inpainting.

  3. Combined First and Second Order Total Variation Inpainting using Split Bregman

    KAUST Repository

    Papafitsoros, Konstantinos; Schoenlieb, Carola Bibiane; Sengul, Bati

    2013-01-01

    In this article we discuss the implementation of the combined first and second order total variation inpainting that was introduced by Papafitsoros and Schdönlieb. We describe the algorithm we use (split Bregman) in detail, and we give some examples that indicate the difference between pure first and pure second order total variation inpainting.

  4. On using moving windows in finite element time domain simulation for long accelerator structures

    International Nuclear Information System (INIS)

    Lee, L.-Q.; Candel, Arno; Ng, Cho; Ko, Kwok

    2010-01-01

    A finite element moving window technique is developed to simulate the propagation of electromagnetic waves induced by the transit of a charged particle beam inside large and long structures. The window moving along with the beam in the computational domain adopts high-order finite element basis functions through p refinement and/or a high-resolution mesh through h refinement so that a sufficient accuracy is attained with substantially reduced computational costs. Algorithms to transfer discretized fields from one mesh to another, which are the keys to implementing a moving window in a finite element unstructured mesh, are presented. Numerical experiments are carried out using the moving window technique to compute short-range wakefields in long accelerator structures. The results are compared with those obtained from the normal finite element time domain (FETD) method and the advantages of using the moving window technique are discussed.

  5. A detailed analysis of inviscid flux splitting algorithms for real gases with equilibrium or finite-rate chemistry

    Science.gov (United States)

    Shuen, Jian-Shun; Liou, Meng-Sing; Van Leer, Bram

    1989-01-01

    The extension of the known flux-vector and flux-difference splittings to real gases via rigorous mathematical procedures is demonstrated. Formulations of both equilibrium and finite-rate chemistry for real-gas flows are described, with emphasis on derivations of finite-rate chemistry. Split-flux formulas from other authors are examined. A second-order upwind-based TVD scheme is adopted to eliminate oscillations and to obtain a sharp representation of discontinuities.

  6. Optimal allocation and sizing of PV/Wind/Split-diesel/Battery hybrid energy system for minimizing life cycle cost, carbon emission and dump energy of remote residential building

    International Nuclear Information System (INIS)

    Ogunjuyigbe, A.S.O.; Ayodele, T.R.; Akinola, O.A.

    2016-01-01

    Highlights: • Genetic Algorithm is used for tri-objective design of hybrid energy system. • The objective is minimizing the Life Cycle Cost, CO_2 emissions and dump energy. • Small split diesel generators are used in place of big single diesel generator. • The split diesel generators are aggregable based on certain set of rules. • The proposed algorithm achieves the set objectives (LCC, CO_2 emission and dump). - Abstract: In this paper, a Genetic Algorithm (GA) is utilized to implement a tri-objective design of a grid independent PV/Wind/Split-diesel/Battery hybrid energy system for a typical residential building with the objective of minimizing the Life Cycle Cost (LCC), CO_2 emissions and dump energy. To achieve some of these objectives, small split Diesel generators are used in place of single big Diesel generator and are aggregable based on certain set of rules depending on available renewable energy resources and state of charge of the battery. The algorithm was utilized to study five scenarios (PV/Battery, Wind/Battery, Single big Diesel generator, aggregable 3-split Diesel generators, PV/Wind/Split-diesel/Battery) for a typical load profile of a residential house using typical wind and solar radiation data. The results obtained revealed that the PV/Wind/Split-diesel/Battery is the most attractive scenario (optimal) having LCC of $11,273, COE of 0.13 ($/kW h), net dump energy of 3 MW h, and net CO_2 emission of 13,273 kg. It offers 46%, 28%, 82% and 94% reduction in LCC, COE, CO_2 emission and dump energy respectively when compared to a single big Diesel generator scenario.

  7. 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.

  8. Verification of split spectrum technique for ultrasonic inspection of welded structures in nuclear reactors

    International Nuclear Information System (INIS)

    Ericsson, L.; Stepinski, T.

    1992-01-01

    Ultrasonic nondestructive inspection of materials is often limited by the presence of backscattered echoes from the material structure. A digital signal processing technique for removal of this material noise, referred to as split spectrum processing (SSP), has been developed and verified using simple laboratory experiments during the last decade. However, application of the split spectrum processing algorithm to industrial conditions has been rarely reported. In the paper the results of the practical evaluation of the SSP technique are presented. A number of different ultrasonic transducers were used for acquiring echoes from artificial flaws as well as natural cracks. The flaws were located in test blocks employed by the Swedish Nuclear Power Companies as reference during ultrasonic inspection of nuclear reactor vessels. The acquired ultrasonic A-scan signals were processed off-line using specially developed algorithms on a personal computer (PC). The experiments show evidence that properly tuned SSP algorithms result in a considerable improvement of the signal to material noise ratio. The enhancements were similar irrespective of the features of the transducer used or the nature of the inspected flaw. The problems related to the development of self-tuning SSP algorithms for on-line processing of B-scans are discussed. (author)

  9. Algebraic techniques for diagonalization of a split quaternion matrix in split quaternionic mechanics

    International Nuclear Information System (INIS)

    Jiang, Tongsong; Jiang, Ziwu; Zhang, Zhaozhong

    2015-01-01

    In the study of the relation between complexified classical and non-Hermitian quantum mechanics, physicists found that there are links to quaternionic and split quaternionic mechanics, and this leads to the possibility of employing algebraic techniques of split quaternions to tackle some problems in complexified classical and quantum mechanics. This paper, by means of real representation of a split quaternion matrix, studies the problem of diagonalization of a split quaternion matrix and gives algebraic techniques for diagonalization of split quaternion matrices in split quaternionic mechanics

  10. Estimación de la temperatura superficial del mar desde datos satelitales NOAA-AVHRR: validación de algoritmos aplicados a la costa norte de Chile Sea surface temperature estimation from NOAA-AVHRR satellite data: validation of algorithms applied to the northern coast of Chile

    Directory of Open Access Journals (Sweden)

    Juan C Parra

    2011-01-01

    Full Text Available Se aplicaron y compararon tres algoritmos del tipo Split-Window (SW, que permitieron estimar la temperatura superficial del mar desde datos aportados por el sensor Advanced Very High Resolution Radiometer (AVHRR, a bordo de la serie de satélites de la National Oceanic and Atmospheric Administration (NOAA. La validación de los algoritmos fue lograda por comparación con mediciones in situ de temperatura del mar provenientes de una boya hidrográfica, ubicada frente a la costa norte de Chile (21°21'S, 70°6'W; Región de Tarapacá, a 3 km de la costa aproximadamente. Los mejores resultados se obtuvieron por aplicación del algoritmo propuesto por Sobrino & Raissouni (2000. En efecto, diferencias entre la temperatura medida in situ y la estimada por SW, permitieron evidenciar una media y desviación estándar de 0,3° y 0,8°K, respectivamente.The present article applies and compares three split-window (SW algorithms, which allowed the estimation of sea surface temperature using data obtained from the Advanced Very High Resolution Radiometer (AVHRR on board the National Oceanic and Atmospheric Administration (NOAA series of satellites. The algorithms were validated by comparison with in situ measurements of sea temperature obtained from a hydrographical buoy located off the coast of northern Chile (21°21'S, 70°6'W; Tarapacá Región, approximately 3 km from the coast. The best results were obtained by the application of the algorithm proposed by Sobrino & Raissouni (2000. The mean and standard deviation of the differences between the temperatures measured in situ and those estimated by SW were 0.3° and 0.8°K, respectively.

  11. A Parallel, Finite-Volume Algorithm for Large-Eddy Simulation of Turbulent Flows

    Science.gov (United States)

    Bui, Trong T.

    1999-01-01

    A parallel, finite-volume algorithm has been developed for large-eddy simulation (LES) of compressible turbulent flows. This algorithm includes piecewise linear least-square reconstruction, trilinear finite-element interpolation, Roe flux-difference splitting, and second-order MacCormack time marching. Parallel implementation is done using the message-passing programming model. In this paper, the numerical algorithm is described. To validate the numerical method for turbulence simulation, LES of fully developed turbulent flow in a square duct is performed for a Reynolds number of 320 based on the average friction velocity and the hydraulic diameter of the duct. Direct numerical simulation (DNS) results are available for this test case, and the accuracy of this algorithm for turbulence simulations can be ascertained by comparing the LES solutions with the DNS results. The effects of grid resolution, upwind numerical dissipation, and subgrid-scale dissipation on the accuracy of the LES are examined. Comparison with DNS results shows that the standard Roe flux-difference splitting dissipation adversely affects the accuracy of the turbulence simulation. For accurate turbulence simulations, only 3-5 percent of the standard Roe flux-difference splitting dissipation is needed.

  12. Window Stories

    DEFF Research Database (Denmark)

    Hauge, Bettina

    This research project has investigated 17 households in Germany (cities and rural areas). The main aim was to learn about the significance of the window to these people: What they think of their windows, how, when and why they use them in their everyday life, if they have a favorite window and wh...

  13. Windows 10 simplified

    CERN Document Server

    McFedries, Paul

    2015-01-01

    Learn Windows 10 quickly and painlessly with this beginner's guide Windows 10 Simplified is your absolute beginner's guide to the ins and outs of Windows. Fully updated to cover Windows 10, this highly visual guide covers all the new features in addition to the basics, giving you a one-stop resource for complete Windows 10 mastery. Every page features step-by-step screen shots and plain-English instructions that walk you through everything you need to know, no matter how new you are to Windows. You'll master the basics as you learn how to navigate the user interface, work with files, create

  14. Windows and doors

    Energy Technology Data Exchange (ETDEWEB)

    1988-01-01

    A complete manual is presented on windows and doors for the housing contractor. In order to understand the role of windows and doors in a house's energy performance, an introduction explains the house as a system of components that can have effects on each other. Further chapters explain in detail the parts of a window, window types and RSI values; window servicing and repair; window replacement; parts of a door, door types and RSI values; door service and repair, including weatherstripping; door replacement; and how to ensure quality, service, and customer satisfaction. A glossary of terms is included. 61 figs., 3 tabs.

  15. Dynamic Allan Variance Analysis Method with Time-Variant Window Length Based on Fuzzy Control

    Directory of Open Access Journals (Sweden)

    Shanshan Gu

    2015-01-01

    Full Text Available To solve the problem that dynamic Allan variance (DAVAR with fixed length of window cannot meet the identification accuracy requirement of fiber optic gyro (FOG signal over all time domains, a dynamic Allan variance analysis method with time-variant window length based on fuzzy control is proposed. According to the characteristic of FOG signal, a fuzzy controller with the inputs of the first and second derivatives of FOG signal is designed to estimate the window length of the DAVAR. Then the Allan variances of the signals during the time-variant window are simulated to obtain the DAVAR of the FOG signal to describe the dynamic characteristic of the time-varying FOG signal. Additionally, a performance evaluation index of the algorithm based on radar chart is proposed. Experiment results show that, compared with different fixed window lengths DAVAR methods, the change of FOG signal with time can be identified effectively and the evaluation index of performance can be enhanced by 30% at least by the DAVAR method with time-variant window length based on fuzzy control.

  16. Validation of vision-based obstacle detection algorithms for low-altitude helicopter flight

    Science.gov (United States)

    Suorsa, Raymond; Sridhar, Banavar

    1991-01-01

    A validation facility being used at the NASA Ames Research Center is described which is aimed at testing vision based obstacle detection and range estimation algorithms suitable for low level helicopter flight. The facility is capable of processing hundreds of frames of calibrated multicamera 6 degree-of-freedom motion image sequencies, generating calibrated multicamera laboratory images using convenient window-based software, and viewing range estimation results from different algorithms along with truth data using powerful window-based visualization software.

  17. MS Windows domēna darbstacijas migrācijas iespējas no MS Windows XP uz MS Windows 7.

    OpenAIRE

    Zariņš, Valdis

    2009-01-01

    Kvalifikācijas darbā tiek aprakstītas MS Windows domēna darbstacijas migrācijas iespējas no MS Windows XP uz MS Windows 7, kā servera operētājsistēmas izmantojot tādus Microsoft produktus, kā Microsoft Windows Server 2003 un Microsoft Windows Server 2008. Kvalifikācijas darba teorētiskaja daļā tiek apskatīti Microsoft Windows 7 priekšrocības un uzlabojumus gan no darbstacijas lietotāja , gan no darbstacijas administratora puses. Ir aprakstītas Microsoft Windows Server 2008 jauninājumu ie...

  18. A novel configurable VLSI architecture design of window-based image processing method

    Science.gov (United States)

    Zhao, Hui; Sang, Hongshi; Shen, Xubang

    2018-03-01

    Most window-based image processing architecture can only achieve a certain kind of specific algorithms, such as 2D convolution, and therefore lack the flexibility and breadth of application. In addition, improper handling of the image boundary can cause loss of accuracy, or consume more logic resources. For the above problems, this paper proposes a new VLSI architecture of window-based image processing operations, which is configurable and based on consideration of the image boundary. An efficient technique is explored to manage the image borders by overlapping and flushing phases at the end of row and the end of frame, which does not produce new delay and reduce the overhead in real-time applications. Maximize the reuse of the on-chip memory data, in order to reduce the hardware complexity and external bandwidth requirements. To perform different scalar function and reduction function operations in pipeline, this can support a variety of applications of window-based image processing. Compared with the performance of other reported structures, the performance of the new structure has some similarities to some of the structures, but also superior to some other structures. Especially when compared with a systolic array processor CWP, this structure at the same frequency of approximately 12.9% of the speed increases. The proposed parallel VLSI architecture was implemented with SIMC 0.18-μm CMOS technology, and the maximum clock frequency, power consumption, and area are 125Mhz, 57mW, 104.8K Gates, respectively, furthermore the processing time is independent of the different window-based algorithms mapped to the structure

  19. Polarization Insensitivity in Double-Split Ring and Triple-Split Ring Terahertz Resonators

    International Nuclear Information System (INIS)

    Wu Qian-Nan; Lan Feng; Tang Xiao-Pin; Yang Zi-Qiang

    2015-01-01

    A modified double-split ring resonator and a modified triple-split ring resonator, which offer polarization-insensitive performance, are investigated, designed and fabricated. By displacing the two gaps of the conventional double-split ring resonator away from the center, the second resonant frequency for the 0° polarized wave and the resonant frequency for the 90° polarized wave become increasingly close to each other until they are finally identical. Theoretical and experimental results show that the modified double-split ring resonator and the modified triple-split ring resonator are insensitive to different polarized waves and show strong resonant frequency dips near 433 and 444 GHz, respectively. The results of this work suggest new opportunities for the investigation and design of polarization-dependent terahertz devices based on split ring resonators. (paper)

  20. Resources | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  1. Links | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  2. Efficient Windows Collaborative | Home

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  3. FAQ | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  4. Glossary | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  5. An Optimization Method of Time Window Based on Travel Time and Reliability

    Directory of Open Access Journals (Sweden)

    Fengjie Fu

    2015-01-01

    Full Text Available The dynamic change of urban road travel time was analyzed using video image detector data, and it showed cyclic variation, so the signal cycle length at the upstream intersection was conducted as the basic unit of time window; there was some evidence of bimodality in the actual travel time distributions; therefore, the fitting parameters of the travel time bimodal distribution were estimated using the EM algorithm. Then the weighted average value of the two means was indicated as the travel time estimation value, and the Modified Buffer Time Index (MBIT was expressed as travel time variability; based on the characteristics of travel time change and MBIT along with different time windows, the time window was optimized dynamically for minimum MBIT, requiring that the travel time change be lower than the threshold value and traffic incidents can be detected real time; finally, travel times on Shandong Road in Qingdao were estimated every 10 s, 120 s, optimal time windows, and 480 s and the comparisons demonstrated that travel time estimation in optimal time windows can exactly and steadily reflect the real-time traffic. It verifies the effectiveness of the optimization method.

  6. Some Notes on the Use of theWindowed Fourier Transform for Spectral Analysis of Discretely Sampled Data

    Directory of Open Access Journals (Sweden)

    Robert W. Johnson

    2013-06-01

    Full Text Available The properties of the Gabor and Morlet transforms are examined with respect to the Fourier analysis of discretely sampled data. Forward and inverse transform pairs based on a fixed window with uniform sampling of the frequency axis can satisfy numerically the energy and reconstruction theorems; however, transform pairs based on a variable window or nonuniform frequency sampling in general do not. Instead of selecting the shape of the window as some function of the central frequency, we propose constructing a single window with unit energy from an arbitrary set of windows that is applied over the entire frequency axis. By virtue of using a fixed window with uniform frequency sampling, such a transform satisfies the energy and reconstruction theorems. The shape of the window can be tailored to meet the requirements of the investigator in terms of time/frequency resolution. The algorithm extends naturally to the case of nonuniform signal sampling without modification beyond identification of the Nyquist interval.

  7. Windows® Internals

    CERN Document Server

    Russinovich, Mark E; Ionescu, Alex

    2009-01-01

    See how the core components of the Windows operating system work behind the scenes-guided by a team of internationally renowned internals experts. Fully updated for Windows Server 2008 and Windows Vista, this classic guide delivers key architectural insights on system design, debugging, performance, and support-along with hands-on experiments to experience Windows internal behavior firsthand.Delve inside Windows architecture and internals:Understand how the core system and management mechanisms work-from the object manager to services to the registryExplore internal system data structures usin

  8. Mixed analytical-stochastic simulation method for the recovery of a Brownian gradient source from probability fluxes to small windows.

    Science.gov (United States)

    Dobramysl, U; Holcman, D

    2018-02-15

    Is it possible to recover the position of a source from the steady-state fluxes of Brownian particles to small absorbing windows located on the boundary of a domain? To address this question, we develop a numerical procedure to avoid tracking Brownian trajectories in the entire infinite space. Instead, we generate particles near the absorbing windows, computed from the analytical expression of the exit probability. When the Brownian particles are generated by a steady-state gradient at a single point, we compute asymptotically the fluxes to small absorbing holes distributed on the boundary of half-space and on a disk in two dimensions, which agree with stochastic simulations. We also derive an expression for the splitting probability between small windows using the matched asymptotic method. Finally, when there are more than two small absorbing windows, we show how to reconstruct the position of the source from the diffusion fluxes. The present approach provides a computational first principle for the mechanism of sensing a gradient of diffusing particles, a ubiquitous problem in cell biology.

  9. Bad splits in bilateral sagittal split osteotomy: systematic review of fracture patterns.

    Science.gov (United States)

    Steenen, S A; Becking, A G

    2016-07-01

    An unfavourable and unanticipated pattern of the mandibular sagittal split osteotomy is generally referred to as a 'bad split'. Few restorative techniques to manage the situation have been described. In this article, a classification of reported bad split pattern types is proposed and appropriate salvage procedures to manage the different types of undesired fracture are presented. A systematic review was undertaken, yielding a total of 33 studies published between 1971 and 2015. These reported a total of 458 cases of bad splits among 19,527 sagittal ramus osteotomies in 10,271 patients. The total reported incidence of bad split was 2.3% of sagittal splits. The most frequently encountered were buccal plate fractures of the proximal segment (types 1A-F) and lingual fractures of the distal segment (types 2A and 2B). Coronoid fractures (type 3) and condylar neck fractures (type 4) have seldom been reported. The various types of bad split may require different salvage approaches. Copyright © 2016 International Association of Oral and Maxillofacial Surgeons. Published by Elsevier Ltd. All rights reserved.

  10. Automatic design of decision-tree induction algorithms

    CERN Document Server

    Barros, Rodrigo C; Freitas, Alex A

    2015-01-01

    Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning, and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain o

  11. Robust and accurate detection algorithm for multimode polymer optical FBG sensor system

    DEFF Research Database (Denmark)

    Ganziy, Denis; Jespersen, O.; Rose, B.

    2015-01-01

    We propose a novel dynamic gate algorithm (DGA) for robust and fast peak detection. The algorithm uses a threshold determined detection window and center of gravity algorithm with bias compensation. Our experiment demonstrates that the DGA method is fast and robust with better stability and accur...

  12. A supervised contextual classifier based on a region-growth algorithm

    DEFF Research Database (Denmark)

    Lira, Jorge; Maletti, Gabriela Mariel

    2002-01-01

    A supervised classification scheme to segment optical multi-spectral images has been developed. In this classifier, an automated region-growth algorithm delineates the training sets. This algorithm handles three parameters: an initial pixel seed, a window size and a threshold for each class. A su...

  13. An Efficient Algorithm for the Discrete Gabor Transform using full length Windows

    DEFF Research Database (Denmark)

    Søndergaard, Peter Lempel

    2007-01-01

    This paper extends the efficient factorization of the Gabor frame operator developed by Strohmer in [1] to the Gabor analysis/synthesis operator. This provides a fast method for computing the discrete Gabor transform (DGT) and several algorithms associated with it. The algorithm is used...

  14. Windows 2012 Server network security securing your Windows network systems and infrastructure

    CERN Document Server

    Rountree, Derrick

    2013-01-01

    Windows 2012 Server Network Security provides the most in-depth guide to deploying and maintaining a secure Windows network. The book drills down into all the new features of Windows 2012 and provides practical, hands-on methods for securing your Windows systems networks, including: Secure remote access Network vulnerabilities and mitigations DHCP installations configuration MAC filtering DNS server security WINS installation configuration Securing wired and wireless connections Windows personal firewall

  15. Market Structure and Stock Splits

    OpenAIRE

    David Michayluk; Paul Kofman

    2001-01-01

    Enhanced liquidity is one possible motivation for stock splits but empirical research frequently documents declines in liquidity following stock splits. Despite almost thirty years of inquiry, little is known about all the changes in a stock's trading activity following a stock split. We examine how liquidity measures change around more than 2,500 stock splits and find a pervasive decline in most measures. Large stock splits exhibit a more severe liquidity decline than small stock splits, esp...

  16. Windows 8.1 bible

    CERN Document Server

    Boyce, Jim; Tidrow, Rob

    2014-01-01

    Windows 8.1 coverage that goes above and beyond all competitors? Serving as an evolutionary update to Windows 8, Windows 8.1 provides critical changes to parts of Windows 8, such as greater customization of the interface and boot operations, return of a 'start button' that reveals apps, greater integration between the two interfaces, and updates to apps. Weighing in at nearly 1000 pages, Windows 8.1 Bible provides deeper Windows insight than any other book on the market. It's valuable for both professionals needing a guide to the nooks and crannies of Windows and regular users wanting a wide

  17. Multi-objective optimization of linear multi-state multiple sliding window system

    International Nuclear Information System (INIS)

    Konak, Abdullah; Kulturel-Konak, Sadan; Levitin, Gregory

    2012-01-01

    This paper considers the optimal element sequencing in a linear multi-state multiple sliding window system that consists of n linearly ordered multi-state elements. Each multi-state element can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. The failure of type i in the system occurs if for any i (1≤i≤I) the cumulative performance of any r i consecutive elements is lower than w i . The element sequence strongly affects the probability of any type of system failure. The sequence that minimizes the probability of certain type of failure can provide high probability of other types of failures. Therefore the optimization problem for the multiple sliding window system is essentially multi-objective. The paper formulates and solves the multi-objective optimization problem for the multiple sliding window systems. A multi-objective Genetic Algorithm is used as the optimization engine. Illustrative examples are presented.

  18. Fast parallel MR image reconstruction via B1-based, adaptive restart, iterative soft thresholding algorithms (BARISTA).

    Science.gov (United States)

    Muckley, Matthew J; Noll, Douglas C; Fessler, Jeffrey A

    2015-02-01

    Sparsity-promoting regularization is useful for combining compressed sensing assumptions with parallel MRI for reducing scan time while preserving image quality. Variable splitting algorithms are the current state-of-the-art algorithms for SENSE-type MR image reconstruction with sparsity-promoting regularization. These methods are very general and have been observed to work with almost any regularizer; however, the tuning of associated convergence parameters is a commonly-cited hindrance in their adoption. Conversely, majorize-minimize algorithms based on a single Lipschitz constant have been observed to be slow in shift-variant applications such as SENSE-type MR image reconstruction since the associated Lipschitz constants are loose bounds for the shift-variant behavior. This paper bridges the gap between the Lipschitz constant and the shift-variant aspects of SENSE-type MR imaging by introducing majorizing matrices in the range of the regularizer matrix. The proposed majorize-minimize methods (called BARISTA) converge faster than state-of-the-art variable splitting algorithms when combined with momentum acceleration and adaptive momentum restarting. Furthermore, the tuning parameters associated with the proposed methods are unitless convergence tolerances that are easier to choose than the constraint penalty parameters required by variable splitting algorithms.

  19. Performance of the split-symbol moments SNR estimator in the presence of inter-symbol interference

    Science.gov (United States)

    Shah, B.; Hinedi, S.

    1989-01-01

    The Split-Symbol Moments Estimator (SSME) is an algorithm that is designed to estimate symbol signal-to-noise ratio (SNR) in the presence of additive white Gaussian noise (AWGN). The performance of the SSME algorithm in band-limited channels is examined. The effects of the resulting inter-symbol interference (ISI) are quantified. All results obtained are in closed form and can be easily evaluated numerically for performance prediction purposes. Furthermore, they are validated through digital simulations.

  20. Performance of genetic algorithms in search for water splitting perovskites

    DEFF Research Database (Denmark)

    Jain, A.; Castelli, Ivano Eligio; Hautier, G.

    2013-01-01

    We examine the performance of genetic algorithms (GAs) in uncovering solar water light splitters over a space of almost 19,000 perovskite materials. The entire search space was previously calculated using density functional theory to determine solutions that fulfill constraints on stability, band...

  1. Splitting turbulence algorithm for mixing parameterization embedded in the ocean climate model. Examples of data assimilation and Prandtl number variations.

    Science.gov (United States)

    Moshonkin, Sergey; Gusev, Anatoly; Zalesny, Vladimir; Diansky, Nikolay

    2017-04-01

    Series of experiments were performed with a three-dimensional, free surface, sigma coordinate eddy-permitting ocean circulation model for Atlantic (from 30°S) - Arctic and Bering sea domain (0.25 degrees resolution, Institute of Numerical Mathematics Ocean Model or INMOM) using vertical grid refinement in the zone of fully developed turbulence (40 sigma-levels). The model variables are horizontal velocity components, potential temperature, and salinity as well as free surface height. For parameterization of viscosity and diffusivity, the original splitting turbulence algorithm (STA) is used when total evolutionary equations for the turbulence kinetic energy (TKE) and turbulence dissipation frequency (TDF) split into the stages of transport-diffusion and generation-dissipation. For the generation-dissipation stage the analytical solution was obtained for TKE and TDF as functions of the buoyancy and velocity shift frequencies (BF and VSF). The proposed model with STA is similar to the contemporary differential turbulence models, concerning the physical formulations. At the same time, its algorithm has high enough computational efficiency. For mixing simulation in the zone of turbulence decay, the two kind numerical experiments were carried out, as with assimilation of annual mean climatic buoyancy frequency, as with variation of Prandtl number function dependence upon the BF, VSF, TKE and TDF. The CORE-II data for 1948-2009 were used for experiments. Quality of temperature T and salinity S structure simulation is estimated by the comparison of model monthly profiles T and S averaged for 1980-2009, with T and S monthly data from the World Ocean Atlas 2013. Form of coefficients in equations for TKE and TDF on the generation-dissipation stage makes it possible to assimilate annual mean climatic buoyancy frequency in a varying degree that cardinally improves adequacy of model results to climatic data in all analyzed model domain. The numerical experiments with modified

  2. An upwind, kinetic flux-vector splitting method for flows in chemical and thermal non-equilibrium

    Science.gov (United States)

    Eppard, W. M.; Grossman, B.

    1993-01-01

    We have developed new upwind kinetic difference schemes for flows with non-equilibrium thermodynamics and chemistry. These schemes are derived from the Boltzmann equation with the resulting Euler schemes developed as moments of the discretized Boltzmann scheme with a locally Maxwellian velocity distribution. Splitting the velocity distribution at the Boltzmann level is seen to result in a flux-split Euler scheme and is called Kinetic Flux Vector Splitting (KFVS). Extensions to flows with finite-rate chemistry and vibrational relaxation is accomplished utilizing nonequilibrium kinetic theory. Computational examples are presented comparing KFVS with the schemes of Van Leer and Roe for a quasi-one-dimensional flow through a supersonic diffuser, inviscid flow through two-dimensional inlet, and viscous flow over a cone at zero angle-of-attack. Calculations are also shown for the transonic flow over a bump in a channel and the transonic flow over an NACA 0012 airfoil. The results show that even though the KFVS scheme is a Riemann solver at the kinetic level, its behavior at the Euler level is more similar to the existing flux-vector splitting algorithms than to the flux-difference splitting scheme of Roe.

  3. Efficient Windows Collaborative

    Energy Technology Data Exchange (ETDEWEB)

    Nils Petermann

    2010-02-28

    The project goals covered both the residential and commercial windows markets and involved a range of audiences such as window manufacturers, builders, homeowners, design professionals, utilities, and public agencies. Essential goals included: (1) Creation of 'Master Toolkits' of information that integrate diverse tools, rating systems, and incentive programs, customized for key audiences such as window manufacturers, design professionals, and utility programs. (2) Delivery of education and outreach programs to multiple audiences through conference presentations, publication of articles for builders and other industry professionals, and targeted dissemination of efficient window curricula to professionals and students. (3) Design and implementation of mechanisms to encourage and track sales of more efficient products through the existing Window Products Database as an incentive for manufacturers to improve products and participate in programs such as NFRC and ENERGY STAR. (4) Development of utility incentive programs to promote more efficient residential and commercial windows. Partnership with regional and local entities on the development of programs and customized information to move the market toward the highest performing products. An overarching project goal was to ensure that different audiences adopt and use the developed information, design and promotion tools and thus increase the market penetration of energy efficient fenestration products. In particular, a crucial success criterion was to move gas and electric utilities to increase the promotion of energy efficient windows through demand side management programs as an important step toward increasing the market share of energy efficient windows.

  4. A Multilevel Adaptive Reaction-splitting Simulation Method for Stochastic Reaction Networks

    KAUST Repository

    Moraes, Alvaro; Tempone, Raul; Vilanova, Pedro

    2016-01-01

    In this work, we present a novel multilevel Monte Carlo method for kinetic simulation of stochastic reaction networks characterized by having simultaneously fast and slow reaction channels. To produce efficient simulations, our method adaptively classifies the reactions channels into fast and slow channels. To this end, we first introduce a state-dependent quantity named level of activity of a reaction channel. Then, we propose a low-cost heuristic that allows us to adaptively split the set of reaction channels into two subsets characterized by either a high or a low level of activity. Based on a time-splitting technique, the increments associated with high-activity channels are simulated using the tau-leap method, while those associated with low-activity channels are simulated using an exact method. This path simulation technique is amenable for coupled path generation and a corresponding multilevel Monte Carlo algorithm. To estimate expected values of observables of the system at a prescribed final time, our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This goal is achieved with a computational complexity of order O(TOL-2), the same as with a pathwise-exact method, but with a smaller constant. We also present a novel low-cost control variate technique based on the stochastic time change representation by Kurtz, showing its performance on a numerical example. We present two numerical examples extracted from the literature that show how the reaction-splitting method obtains substantial gains with respect to the standard stochastic simulation algorithm and the multilevel Monte Carlo approach by Anderson and Higham. © 2016 Society for Industrial and Applied Mathematics.

  5. A Multilevel Adaptive Reaction-splitting Simulation Method for Stochastic Reaction Networks

    KAUST Repository

    Moraes, Alvaro

    2016-07-07

    In this work, we present a novel multilevel Monte Carlo method for kinetic simulation of stochastic reaction networks characterized by having simultaneously fast and slow reaction channels. To produce efficient simulations, our method adaptively classifies the reactions channels into fast and slow channels. To this end, we first introduce a state-dependent quantity named level of activity of a reaction channel. Then, we propose a low-cost heuristic that allows us to adaptively split the set of reaction channels into two subsets characterized by either a high or a low level of activity. Based on a time-splitting technique, the increments associated with high-activity channels are simulated using the tau-leap method, while those associated with low-activity channels are simulated using an exact method. This path simulation technique is amenable for coupled path generation and a corresponding multilevel Monte Carlo algorithm. To estimate expected values of observables of the system at a prescribed final time, our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This goal is achieved with a computational complexity of order O(TOL-2), the same as with a pathwise-exact method, but with a smaller constant. We also present a novel low-cost control variate technique based on the stochastic time change representation by Kurtz, showing its performance on a numerical example. We present two numerical examples extracted from the literature that show how the reaction-splitting method obtains substantial gains with respect to the standard stochastic simulation algorithm and the multilevel Monte Carlo approach by Anderson and Higham. © 2016 Society for Industrial and Applied Mathematics.

  6. Windows 10 for dummies

    CERN Document Server

    Rathbone, Andy

    2015-01-01

    The fast and easy way to get up and running with Windows 10 Windows 10 For Dummies covers the latest version of Windows and gets you up and running with the changes and new features you'll find in this updated operating system. Packed with time-saving tips to help you get the most out of the software, this helpful Windows 10 guide shows you how to manage Windows tasks like navigating the interface with a mouse or touchscreen, connecting to the web, and troubleshooting problems and making quick fixes. Assuming no prior knowledge of the software, Windows 10 For Dummies addresses the updates to

  7. Coded Splitting Tree Protocols

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar

    2013-01-01

    This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...

  8. Note: Split PID control--two sensors can be better than one.

    Science.gov (United States)

    Znaimer, Leith; Bechhoefer, John

    2014-10-01

    The traditional proportional-integral-derivative (PID) algorithm for regulation suffers from a tradeoff: placing the sensor near the sample being regulated ensures that its steady-state temperature matches the desired setpoint. However, the propagation delay (lag) between heater and sample can limit the control bandwidth. Moving the sensor closer to the heater reduces the lag and increases the bandwidth but introduces offsets and drifts into the temperature of the sample. Here, we explore the consequences of using two probes-one near the heater, one near the sample-and assigning the integral term to the sample probe and the other terms to the heater probe. The split-PID algorithm can outperform PID control loops based on one sensor.

  9. Provide Views | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  10. Reduced Fading | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  11. EWC Members | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  12. Visible Transmittance | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  13. Gas Fills | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  14. EWC Membership | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  15. Reducing Condensation | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  16. Improved Comfort | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  17. Financing & Incentives | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  18. Tools & Resources | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  19. Books & Publications | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  20. Design Considerations | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  1. Windows forensic analysis toolkit advanced analysis techniques for Windows 7

    CERN Document Server

    Carvey, Harlan

    2012-01-01

    Now in its third edition, Harlan Carvey has updated "Windows Forensic Analysis Toolkit" to cover Windows 7 systems. The primary focus of this edition is on analyzing Windows 7 systems and on processes using free and open-source tools. The book covers live response, file analysis, malware detection, timeline, and much more. The author presents real-life experiences from the trenches, making the material realistic and showing the why behind the how. New to this edition, the companion and toolkit materials are now hosted online. This material consists of electronic printable checklists, cheat sheets, free custom tools, and walk-through demos. This edition complements "Windows Forensic Analysis Toolkit, 2nd Edition", (ISBN: 9781597494229), which focuses primarily on XP. It includes complete coverage and examples on Windows 7 systems. It contains Lessons from the Field, Case Studies, and War Stories. It features companion online material, including electronic printable checklists, cheat sheets, free custom tools, ...

  2. Robustness of the ATLAS pixel clustering neural network algorithm

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00407780; The ATLAS collaboration

    2016-01-01

    Proton-proton collisions at the energy frontier puts strong constraints on track reconstruction algorithms. In the ATLAS track reconstruction algorithm, an artificial neural network is utilised to identify and split clusters of neighbouring read-out elements in the ATLAS pixel detector created by multiple charged particles. The robustness of the neural network algorithm is presented, probing its sensitivity to uncertainties in the detector conditions. The robustness is studied by evaluating the stability of the algorithm's performance under a range of variations in the inputs to the neural networks. Within reasonable variation magnitudes, the neural networks prove to be robust to most variation types.

  3. Advanced energy efficient windows

    DEFF Research Database (Denmark)

    Thomsen, Kirsten Engelund

    2007-01-01

    Windows should be paid special attention as they contribute a significant part of the total heat-loss coefficient of the building. Contrary to other parts of the thermal envelope the windows are not only heat loosers, but may gain heat in the day-time. Therefore there are possibilities for large...... energy savings. In terms of energy, windows occupy a special position compared with other thermal envelope structures due to their many functions: 1) windows let daylight into the building and provide occupants with visual contact with their surroundings 2) windows protect against the outdoor climate 3......) windows transmit solar energy that may contribute to a reduction of energy consumption, but which may also lead to unpleasant overheating. In the following paragraphs the current use of windows is reviewed with an emphasis on energy, while special products like solar protection glazing and security...

  4. Multi-line split DNA synthesis: a novel combinatorial method to make high quality peptide libraries

    Directory of Open Access Journals (Sweden)

    Ueno Shingo

    2004-09-01

    Full Text Available Abstract Background We developed a method to make a various high quality random peptide libraries for evolutionary protein engineering based on a combinatorial DNA synthesis. Results A split synthesis in codon units was performed with mixtures of bases optimally designed by using a Genetic Algorithm program. It required only standard DNA synthetic reagents and standard DNA synthesizers in three lines. This multi-line split DNA synthesis (MLSDS is simply realized by adding a mix-and-split process to normal DNA synthesis protocol. Superiority of MLSDS method over other methods was shown. We demonstrated the synthesis of oligonucleotide libraries with 1016 diversity, and the construction of a library with random sequence coding 120 amino acids containing few stop codons. Conclusions Owing to the flexibility of the MLSDS method, it will be able to design various "rational" libraries by using bioinformatics databases.

  5. Windows 8 secrets

    CERN Document Server

    Thurrott, Paul

    2012-01-01

    Tips, tricks, treats, and secrets revealed on Windows 8 Microsoft is introducing a major new release of its Windows operating system, Windows 8, and what better way to learn all its ins and outs than from two internationally recognized Windows experts and Microsoft insiders, authors Paul Thurrott and Rafael Rivera? They cut through the hype to get at useful information you'll not find anywhere else, including what role this new OS plays in a mobile and tablet world. Regardless of your level of knowledge, you'll discover little-known facts about how things work, what's new and different, and h

  6. Programming Windows Azure

    CERN Document Server

    Krishnan, Sriram

    2010-01-01

    Learn the nuts and bolts of cloud computing with Windows Azure, Microsoft's new Internet services platform. Written by a key member of the product development team, this book shows you how to build, deploy, host, and manage applications using Windows Azure's programming model and essential storage services. Chapters in Programming Windows Azure are organized to reflect the platform's buffet of services. The book's first half focuses on how to write and host application code on Windows Azure, while the second half explains all of the options you have for storing and accessing data on the plat

  7. Beginning Windows 8

    CERN Document Server

    Halsey, Mike

    2012-01-01

    Windows 8 has been described by Microsoft as its 'boldest' Windows release ever. Beginning Windows 8 takes you through the new features and helps you get more out of the familiar to reveal the possibilities for this amazing new operating system. You will learn, with non-technical language used throughout, how to get up and running in the new Windows interface, minimize downtime, maximize productivity, and harness the features you never knew existed to take control of your computer and enjoy the peace of mind and excitement that comes with it. From tips and tweaks to easy-to-follow guides and d

  8. Windows 8 tweaks

    CERN Document Server

    Sinchak, Steve

    2013-01-01

    Acres of Windows 8 tweaks from a Microsoft MVP and creator of Tweaks.com! From a Microsoft MVP, who is also the savvy creator of Tweaks.com, comes this ultimate collection of Windows 8 workarounds. Steve Sinchak takes you way beyond default system settings, deep under the hood of Windows 8, down to the hidden gems that let you customize your Windows 8 system like you wouldn't believe. From helping you customize the appearance to setting up home networking, sharing media, and squeezing every ounce of performance out of the OS, this book delivers. Get ready to rock and roll with Wind

  9. Reducing Marine Container Terminal Gate Congestion with Vessel-Dependent Time Windows For Truck Entries

    DEFF Research Database (Denmark)

    Chen, Gang; Yang, Zhongzhen; Jiang, Liping

    In recent years, marine container terminal gate congestion has become a serious issue, because it not only limits the efficiency of the logistics system but also generates serious air pollution. The direct reason has been recognized to be the unmanaged container truck arrivals. One of the possible...... and the heuristic of genetic algorithm is improved to be more efficient. Then two optimization strategies are proposed namely fixed end-point time window (FEP) and variable end-point time window (VEP). To compare the effectiveness of two strategies, the optimization model and the heuristic are applied to some tests...

  10. High order three part split symplectic integrators: Efficient techniques for the long time simulation of the disordered discrete nonlinear Schrödinger equation

    Energy Technology Data Exchange (ETDEWEB)

    Skokos, Ch., E-mail: haris.skokos@uct.ac.za [Physics Department, Aristotle University of Thessaloniki, GR-54124 Thessaloniki (Greece); Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch 7701 (South Africa); Gerlach, E. [Lohrmann Observatory, Technical University Dresden, D-01062 Dresden (Germany); Bodyfelt, J.D., E-mail: J.Bodyfelt@massey.ac.nz [Centre for Theoretical Chemistry and Physics, The New Zealand Institute for Advanced Study, Massey University, Albany, Private Bag 102904, North Shore City, Auckland 0745 (New Zealand); Papamikos, G. [School of Mathematics, Statistics and Actuarial Science, University of Kent, Canterbury, CT2 7NF (United Kingdom); Eggl, S. [IMCCE, Observatoire de Paris, 77 Avenue Denfert-Rochereau, F-75014 Paris (France)

    2014-05-01

    While symplectic integration methods based on operator splitting are well established in many branches of science, high order methods for Hamiltonian systems that split in more than two parts have not been studied in great detail. Here, we present several high order symplectic integrators for Hamiltonian systems that can be split in exactly three integrable parts. We apply these techniques, as a practical case, for the integration of the disordered, discrete nonlinear Schrödinger equation (DDNLS) and compare their efficiencies. Three part split algorithms provide effective means to numerically study the asymptotic behavior of wave packet spreading in the DDNLS – a hotly debated subject in current scientific literature.

  11. High order three part split symplectic integrators: Efficient techniques for the long time simulation of the disordered discrete nonlinear Schrödinger equation

    International Nuclear Information System (INIS)

    Skokos, Ch.; Gerlach, E.; Bodyfelt, J.D.; Papamikos, G.; Eggl, S.

    2014-01-01

    While symplectic integration methods based on operator splitting are well established in many branches of science, high order methods for Hamiltonian systems that split in more than two parts have not been studied in great detail. Here, we present several high order symplectic integrators for Hamiltonian systems that can be split in exactly three integrable parts. We apply these techniques, as a practical case, for the integration of the disordered, discrete nonlinear Schrödinger equation (DDNLS) and compare their efficiencies. Three part split algorithms provide effective means to numerically study the asymptotic behavior of wave packet spreading in the DDNLS – a hotly debated subject in current scientific literature.

  12. Evaluation of Mandibular Anatomy Associated With Bad Splits in Sagittal Split Ramus Osteotomy of Mandible.

    Science.gov (United States)

    Wang, Tongyue; Han, Jeong Joon; Oh, Hee-Kyun; Park, Hong-Ju; Jung, Seunggon; Park, Yeong-Joon; Kook, Min-Suk

    2016-07-01

    This study aimed to identify risk factors associated with bad splits during sagittal split ramus osteotomy by using three-dimensional computed tomography. This study included 8 bad splits and 47 normal patients without bad splits. Mandibular anatomic parameters related to osteotomy line were measured. These included anteroposterior width of the ramus at level of lingula, distance between external oblique ridge and lingula, distance between sigmoid notch and inferior border of mandible, mandibular angle, distance between inferior outer surface of mandibular canal and inferior border of mandible under distal root of second molar (MCEM), buccolingual thickness of the ramus at level of lingula, and buccolingual thickness of the area just distal to first molar (BTM1) and second molar (BTM2). The incidence of bad splits in 625 sagittal split osteotomies was 1.28%. Compared with normal group, bad split group exhibited significantly thinner BTM2 and shorter sigmoid notch and inferior border of mandible (P bad splits. These anatomic data may help surgeons to choose the safest surgical techniques and best osteotomy sites.

  13. A transport-based condensed history algorithm

    International Nuclear Information System (INIS)

    Tolar, D. R. Jr.

    1999-01-01

    Condensed history algorithms are approximate electron transport Monte Carlo methods in which the cumulative effects of multiple collisions are modeled in a single step of (user-specified) path length s 0 . This path length is the distance each Monte Carlo electron travels between collisions. Current condensed history techniques utilize a splitting routine over the range 0 le s le s 0 . For example, the PEnELOPE method splits each step into two substeps; one with length ξs 0 and one with length (1 minusξ)s 0 , where ξ is a random number from 0 0 is fixed (not sampled from an exponential distribution), conventional condensed history schemes are not transport processes. Here the authors describe a new condensed history algorithm that is a transport process. The method simulates a transport equation that approximates the exact Boltzmann equation. The new transport equation has a larger mean free path than, and preserves two angular moments of, the Boltzmann equation. Thus, the new process is solved more efficiently by Monte Carlo, and it conserves both particles and scattering power

  14. Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Damianos Gavalas

    2016-01-01

    Full Text Available Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within their respective time window and the overall duration of each walk should be below a certain threshold. In this paper we introduce the MTOPTW, which can be used for modeling a realistic variant of the Tourist Trip Design Problem where the objective is the derivation of near-optimal multiple-day itineraries for tourists visiting a destination which features several points of interest (POIs and scenic routes. Since the MTOPTW is a NP-hard problem, we propose the first metaheuristic approaches to tackle it. The effectiveness of our algorithms is validated through a number of experiments on POI and scenic route sets compiled from the city of Athens (Greece.

  15. Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO

    Directory of Open Access Journals (Sweden)

    Xiaobing Gan

    2012-01-01

    Full Text Available This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW. The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA and particle swarm optimization (PSO algorithm, the MCPSO algorithm performs best for solving this problem.

  16. Window selection for dual photopeak window scatter correction in Tc-99m imaging

    International Nuclear Information System (INIS)

    Vries, D.J. de; King, M.A.

    1994-01-01

    The width and placement of the windows for the dual photopeak window (DPW) scatter subtraction method for Tc-99m imaging is investigated in order to obtain a method that is stable on a multihead detector system for single photon emission computed tomography (SPECT) and is capable of providing a good scatter estimate for extended objects. For various window pairs, stability and noise were examined with experiments using a SPECT system, while Monte Carlo simulations were used to predict the accuracy of scatter estimates for a variety of objects and to guide the development of regression relations for various window pairs. The DPW method that resulted from this study was implemented with a symmetric 20% photopeak window composed of a 15% asymmetric photopeak window and a 5% lower window abutted at 7 keV below the peak. A power function regression was used to relate the scatter-to-total ratio to the lower window-to-total ratio at each pixel, from which an estimated scatter image was calculated. DPW demonstrated good stability, achieved by abutting the two windows away from the peak. Performance was assessed and compared with Compton window subtraction (CWS). For simulated extended objects, DPW generally produced a less biased scatter estimate than the commonly used CWS method with k = 0.5. In acquisitions of a clinical SPECT phantom, contrast recovery was comparable for both DPW and CWS; however, DPW showed greater visual contrast in clinical SPECT bone studies

  17. The artificial-free technique along the objective direction for the simplex algorithm

    International Nuclear Information System (INIS)

    Boonperm, Aua-aree; Sinapiromsaran, Krung

    2014-01-01

    The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm

  18. The artificial-free technique along the objective direction for the simplex algorithm

    Science.gov (United States)

    Boonperm, Aua-aree; Sinapiromsaran, Krung

    2014-03-01

    The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm.

  19. Adaptive multilevel splitting for Monte Carlo particle transport

    Directory of Open Access Journals (Sweden)

    Louvin Henri

    2017-01-01

    Full Text Available In the Monte Carlo simulation of particle transport, and especially for shielding applications, variance reduction techniques are widely used to help simulate realisations of rare events and reduce the relative errors on the estimated scores for a given computation time. Adaptive Multilevel Splitting (AMS is one of these variance reduction techniques that has recently appeared in the literature. In the present paper, we propose an alternative version of the AMS algorithm, adapted for the first time to the field of particle transport. Within this context, it can be used to build an unbiased estimator of any quantity associated with particle tracks, such as flux, reaction rates or even non-Boltzmann tallies like pulse-height tallies and other spectra. Furthermore, the efficiency of the AMS algorithm is shown not to be very sensitive to variations of its input parameters, which makes it capable of significant variance reduction without requiring extended user effort.

  20. Multilevel hybrid split-step implicit tau-leap

    KAUST Repository

    Ben Hammouda, Chiheb

    2016-06-17

    In biochemically reactive systems with small copy numbers of one or more reactant molecules, the dynamics is dominated by stochastic effects. To approximate those systems, discrete state-space and stochastic simulation approaches have been shown to be more relevant than continuous state-space and deterministic ones. In systems characterized by having simultaneously fast and slow timescales, existing discrete space-state stochastic path simulation methods, such as the stochastic simulation algorithm (SSA) and the explicit tau-leap (explicit-TL) method, can be very slow. Implicit approximations have been developed to improve numerical stability and provide efficient simulation algorithms for those systems. Here, we propose an efficient Multilevel Monte Carlo (MLMC) method in the spirit of the work by Anderson and Higham (SIAM Multiscal Model. Simul. 10(1), 2012). This method uses split-step implicit tau-leap (SSI-TL) at levels where the explicit-TL method is not applicable due to numerical stability issues. We present numerical examples that illustrate the performance of the proposed method. © 2016 Springer Science+Business Media New York

  1. Study of Various Photomultiplier Tubes for Window Events: Upgrade R\\&D for CMS Hadron Forward Calorimeters

    CERN Document Server

    Bilki, Burak

    2010-01-01

    The PMTs of the CMS Hadron Forward calorimeter were found to generate a large amount of signal when their windows were traversed by energetic charged particles. This signal, which is due to \\u{C}erenkov light production at the PMT window, could interfere with the calorimeter signal and mislead the measurements. In order to find a viable solution to this problem, the response of different types of PMTs to muons traversing their windows at different orientations is measured at the H2 beam-line at CERN. Certain kinds of PMTs with thinner windows show significantly lower response to direct muon incidence. For one specific type -the four anode PMT- a simple and powerful algorithm to identify such events and recover the PMT signal using the signals of the quadrants without window hits is also presented. For the measurement of PMT responses to \\u{C}erenkov light, the Hadron Forward calorimeter signal was mimicked by two different setups in electron beams and the PMT performances were compared with each other. Superi...

  2. On the fixed-stress split scheme as smoother in multigrid methods for coupling flow and geomechanics

    NARCIS (Netherlands)

    F.J. Gaspar Lorenz (Franscisco); C. Rodrigo (Carmen)

    2017-01-01

    textabstractThe fixed-stress split method has been widely used as solution method in the coupling of flow and geomechanics. In this work, we analyze the behavior of an inexact version of this algorithm as smoother within a geometric multigrid method, in order to obtain an efficient monolithic solver

  3. Multidepot UAV Routing Problem with Weapon Configuration and Time Window

    Directory of Open Access Journals (Sweden)

    Tianren Zhou

    2018-01-01

    Full Text Available In recent wars, there is an increasing trend that unmanned aerial vehicles (UAVs are utilized to conduct military attacking missions. In this paper, we investigate a novel multidepot UAV routing problem with consideration of weapon configuration in the UAV and the attacking time window of the target. A mixed-integer linear programming model is developed to jointly optimize three kinds of decisions: the weapon configuration strategy in the UAV, the routing strategy of target, and the allocation strategy of weapons to targets. An adaptive large neighborhood search (ALNS algorithm is proposed for solving the problem, which is tested by randomly generated instances covering the small, medium, and large sizes. Experimental results confirm the effectiveness and robustness of the proposed ALNS algorithm.

  4. Location-Based Top-k Term Querying over Sliding Window

    KAUST Repository

    Xu, Ying

    2017-10-03

    In part due to the proliferation of GPS-equipped mobile devices, massive svolumes of geo-tagged streaming text messages are becoming available on social media. It is of great interest to discover most frequent nearby terms from such tremendous stream data. In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k locally popular nearby terms over a sliding window. Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering both the term frequency and the proximities between the messages containing the term and the query location. We develop a novel and efficient mechanism to solve the problem, including a quad-tree based indexing structure, indexing update technique, and a best-first based searching algorithm. An empirical study is conducted to show that our proposed techniques are efficient and fit for users’ requirements through varying a number of parameters.

  5. Location-Based Top-k Term Querying over Sliding Window

    KAUST Repository

    Xu, Ying; Chen, Lisi; Yao, Bin; Shang, Shuo; Zhu, Shunzhi; Zheng, Kai; Li, Fang

    2017-01-01

    In part due to the proliferation of GPS-equipped mobile devices, massive svolumes of geo-tagged streaming text messages are becoming available on social media. It is of great interest to discover most frequent nearby terms from such tremendous stream data. In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k locally popular nearby terms over a sliding window. Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering both the term frequency and the proximities between the messages containing the term and the query location. We develop a novel and efficient mechanism to solve the problem, including a quad-tree based indexing structure, indexing update technique, and a best-first based searching algorithm. An empirical study is conducted to show that our proposed techniques are efficient and fit for users’ requirements through varying a number of parameters.

  6. Windows for Intel Macs

    CERN Document Server

    Ogasawara, Todd

    2008-01-01

    Even the most devoted Mac OS X user may need to use Windows XP, or may just be curious about XP and its applications. This Short Cut is a concise guide for OS X users who need to quickly get comfortable and become productive with Windows XP basics on their Macs. It covers: Security Networking ApplicationsMac users can easily install and use Windows thanks to Boot Camp and Parallels Desktop for Mac. Boot Camp lets an Intel-based Mac install and boot Windows XP on its own hard drive partition. Parallels Desktop for Mac uses virtualization technology to run Windows XP (or other operating systems

  7. The Split-Brain Phenomenon Revisited: A Single Conscious Agent with Split Perception.

    Science.gov (United States)

    Pinto, Yair; de Haan, Edward H F; Lamme, Victor A F

    2017-11-01

    The split-brain phenomenon is caused by the surgical severing of the corpus callosum, the main route of communication between the cerebral hemispheres. The classical view of this syndrome asserts that conscious unity is abolished. The left hemisphere consciously experiences and functions independently of the right hemisphere. This view is a cornerstone of current consciousness research. In this review, we first discuss the evidence for the classical view. We then propose an alternative, the 'conscious unity, split perception' model. This model asserts that a split brain produces one conscious agent who experiences two parallel, unintegrated streams of information. In addition to changing our view of the split-brain phenomenon, this new model also poses a serious challenge for current dominant theories of consciousness. Copyright © 2017 Elsevier Ltd. All rights reserved.

  8. An efficient and fast detection algorithm for multimode FBG sensing

    DEFF Research Database (Denmark)

    Ganziy, Denis; Jespersen, O.; Rose, B.

    2015-01-01

    We propose a novel dynamic gate algorithm (DGA) for fast and accurate peak detection. The algorithm uses threshold determined detection window and Center of gravity algorithm with bias compensation. We analyze the wavelength fit resolution of the DGA for different values of signal to noise ratio...... and different typical peak shapes. Our simulations and experiments demonstrate that the DGA method is fast and robust with higher stability and accuracy compared to conventional algorithms. This makes it very attractive for future implementation in sensing systems especially based on multimode fiber Bragg...

  9. A frequency-domain implementation of a sliding-window traffic sign detector for large scale panoramic datasets

    NARCIS (Netherlands)

    Creusen, I.M.; Hazelhoff, L.; With, de P.H.N.

    2013-01-01

    In large-scale automatic traffic sign surveying systems, the primary computational effort is concentrated at the traffic sign detection stage. This paper focuses on reducing the computational load of particularly the sliding window object detection algorithm which is employed for traffic sign

  10. Efficient Parallel Algorithms for Unsteady Incompressible Flows

    KAUST Repository

    Guermond, Jean-Luc; Minev, Peter D.

    2013-01-01

    The objective of this paper is to give an overview of recent developments on splitting schemes for solving the time-dependent incompressible Navier–Stokes equations and to discuss possible extensions to the variable density/viscosity case. A particular attention is given to algorithms that can be implemented efficiently on large parallel clusters.

  11. Triadic split-merge sampler

    Science.gov (United States)

    van Rossum, Anne C.; Lin, Hai Xiang; Dubbeldam, Johan; van der Herik, H. Jaap

    2018-04-01

    In machine vision typical heuristic methods to extract parameterized objects out of raw data points are the Hough transform and RANSAC. Bayesian models carry the promise to optimally extract such parameterized objects given a correct definition of the model and the type of noise at hand. A category of solvers for Bayesian models are Markov chain Monte Carlo methods. Naive implementations of MCMC methods suffer from slow convergence in machine vision due to the complexity of the parameter space. Towards this blocked Gibbs and split-merge samplers have been developed that assign multiple data points to clusters at once. In this paper we introduce a new split-merge sampler, the triadic split-merge sampler, that perform steps between two and three randomly chosen clusters. This has two advantages. First, it reduces the asymmetry between the split and merge steps. Second, it is able to propose a new cluster that is composed out of data points from two different clusters. Both advantages speed up convergence which we demonstrate on a line extraction problem. We show that the triadic split-merge sampler outperforms the conventional split-merge sampler. Although this new MCMC sampler is demonstrated in this machine vision context, its application extend to the very general domain of statistical inference.

  12. The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

    2009-01-01

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

  13. Windows XP ends its life at CERN – register for Windows 7 training!

    CERN Multimedia

    Michał Kwiatek (IT-OIS)

    2012-01-01

    Windows XP has been around for over 10 years and it is now time to move on. At CERN, general support for Windows XP will end in December 2012, and before this date users are requested to schedule a migration to the next version of WindowsWindows 7.   Windows 7 is already well established at CERN – it is used by a large majority of users. In fact, there was a considerable user demand even before its official release in October 2009 and its adoption has been smooth. Users praise Windows 7 for its improved stability and a clear advantage on laptops is a much more efficient implementation of offline files. The migration to Windows 7 involves a reinstallation of the operating system. Files stored in user home folders on DFS will be immediately available after the reinstallation. Applications will be upgraded to more recent versions and in certain cases, an application may even be replaced by another application providing the same functionality. Microsoft Office suite is a good ...

  14. Thermal bridges of modern windows

    DEFF Research Database (Denmark)

    Hansen, Ernst Jan de Place; Møller, Eva B.; Nielsen, Anker

    2013-01-01

    if the window has an U-factor of 1 W/(m2·K) or lower. This paper describes the development of modern, energy efficient Danish windows with reduced thermal bridges. It focuses on materials, geometry, and sealing of window panes based on a literature review. Examples of modern windows are presented. Experience...... been an important driver for the development of new window solutions in Denmark, increasing the inner-surface temperature at the sealing of window panes. However, it will not stop complaints fromconsumers, as this temperature is calculated under standardized conditions. Increasing requirements...

  15. SWCD: a sliding window and self-regulated learning-based background updating method for change detection in videos

    Science.gov (United States)

    Işık, Şahin; Özkan, Kemal; Günal, Serkan; Gerek, Ömer Nezih

    2018-03-01

    Change detection with background subtraction process remains to be an unresolved issue and attracts research interest due to challenges encountered on static and dynamic scenes. The key challenge is about how to update dynamically changing backgrounds from frames with an adaptive and self-regulated feedback mechanism. In order to achieve this, we present an effective change detection algorithm for pixelwise changes. A sliding window approach combined with dynamic control of update parameters is introduced for updating background frames, which we called sliding window-based change detection. Comprehensive experiments on related test videos show that the integrated algorithm yields good objective and subjective performance by overcoming illumination variations, camera jitters, and intermittent object motions. It is argued that the obtained method makes a fair alternative in most types of foreground extraction scenarios; unlike case-specific methods, which normally fail for their nonconsidered scenarios.

  16. Comparison of Firefly algorithm and Artificial Immune System algorithm for lot streaming in -machine flow shop scheduling

    Directory of Open Access Journals (Sweden)

    G. Vijay Chakaravarthy

    2012-11-01

    Full Text Available Lot streaming is a technique used to split the processing of lots into several sublots (transfer batches to allow the overlapping of operations in a multistage manufacturing systems thereby shortening the production time (makespan. The objective of this paper is to minimize the makespan and total flow time of -job, -machine lot streaming problem in a flow shop with equal and variable size sublots and also to determine the optimal sublot size. In recent times researchers are concentrating and applying intelligent heuristics to solve flow shop problems with lot streaming. In this research, Firefly Algorithm (FA and Artificial Immune System (AIS algorithms are used to solve the problem. The results obtained by the proposed algorithms are also compared with the performance of other worked out traditional heuristics. The computational results shows that the identified algorithms are more efficient, effective and better than the algorithms already tested for this problem.

  17. Tokamak physics experiment: Diagnostic windows study

    International Nuclear Information System (INIS)

    Merrigan, M.; Wurden, G.A.

    1995-11-01

    We detail the study of diagnostic windows and window thermal stress remediation in the long-pulse, high-power Tokamak Physics Experiment (TPX) operation. The operating environment of the TPX diagnostic windows is reviewed, thermal loads on the windows estimated, and cooling requirements for the windows considered. Applicable window-cooling technology from other fields is reviewed and its application to the TPX windows considered. Methods for TPX window thermal conditioning are recommended, with some discussion of potential implementation problems provided. Recommendations for further research and development work to ensure performance of windows in the TPX system are presented

  18. The suppression effect of a periodic surface with semicircular grooves on the high power microwave long pill-box window multipactor phenomenon

    International Nuclear Information System (INIS)

    Zhang, Xue; Wang, Yong; Fan, Junjie; Zhong, Yong; Zhang, Rui

    2014-01-01

    To improve the transmitting power in an S-band klystron, a long pill-box window that has a disk with grooves with a semicircular cross section is theoretically investigated and simulated. A Monte-Carlo algorithm is used to track the secondary electron trajectories and analyze the multipactor scenario in the long pill-box window and on the grooved surface. Extending the height of the long-box window can decrease the normal electric field on the surface of the window disk, but the single surface multipactor still exists. It is confirmed that the window disk with periodic semicircular grooves can explicitly suppress the multipactor and predominantly depresses the local field enhancement and the bottom continuous multipactor. The difference between semicircular and sharp boundary grooves is clarified numerically and analytically

  19. The suppression effect of a periodic surface with semicircular grooves on the high power microwave long pill-box window multipactor phenomenon

    Science.gov (United States)

    Zhang, Xue; Wang, Yong; Fan, Junjie; Zhong, Yong; Zhang, Rui

    2014-09-01

    To improve the transmitting power in an S-band klystron, a long pill-box window that has a disk with grooves with a semicircular cross section is theoretically investigated and simulated. A Monte-Carlo algorithm is used to track the secondary electron trajectories and analyze the multipactor scenario in the long pill-box window and on the grooved surface. Extending the height of the long-box window can decrease the normal electric field on the surface of the window disk, but the single surface multipactor still exists. It is confirmed that the window disk with periodic semicircular grooves can explicitly suppress the multipactor and predominantly depresses the local field enhancement and the bottom continuous multipactor. The difference between semicircular and sharp boundary grooves is clarified numerically and analytically.

  20. The suppression effect of a periodic surface with semicircular grooves on the high power microwave long pill-box window multipactor phenomenon

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Xue, E-mail: zhangxue.iecas@yahoo.com; Wang, Yong; Fan, Junjie; Zhong, Yong; Zhang, Rui [Institute of Electronics, Chinese Academy of Sciences, Peking, 100190 China (China)

    2014-09-15

    To improve the transmitting power in an S-band klystron, a long pill-box window that has a disk with grooves with a semicircular cross section is theoretically investigated and simulated. A Monte-Carlo algorithm is used to track the secondary electron trajectories and analyze the multipactor scenario in the long pill-box window and on the grooved surface. Extending the height of the long-box window can decrease the normal electric field on the surface of the window disk, but the single surface multipactor still exists. It is confirmed that the window disk with periodic semicircular grooves can explicitly suppress the multipactor and predominantly depresses the local field enhancement and the bottom continuous multipactor. The difference between semicircular and sharp boundary grooves is clarified numerically and analytically.

  1. Mastering Windows 7 Deployment

    CERN Document Server

    Finn, Aidan; van Surksum, Kenneth

    2011-01-01

    Get professional-level instruction on Windows 7 deployment tools Enterprise-level operating system deployment is challenging and requires knowledge of specific tools. It is expected that Windows 7 will be extensively deployed in businesses worldwide. This comprehensive Sybex guide provides thorough coverage of the Microsoft deployment tools that were specifically created for Windows 7, preparing system administrators, MIS professionals, and corporate programmers to tackle the task effectively.Companies worldwide are expected to deploy Windows 7 as their enterprise operating system; system admi

  2. An algorithm for determination of peak regions and baseline elimination in spectroscopic data

    International Nuclear Information System (INIS)

    Morhac, Miroslav

    2009-01-01

    In the paper we propose a new algorithm for the determination of peaks containing regions and their separation from peak-free regions. Further based on this algorithm we propose a new background elimination algorithm which allows more accurate estimate of the background beneath the peaks than the algorithms known so far. The algorithm is based on a clipping operation with the window adjustable automatically to the widths of identified peak regions. The illustrative examples presented in the paper prove in favor of the proposed algorithms.

  3. Handbook on Windows and Energy

    DEFF Research Database (Denmark)

    Thomsen, Kirsten Engelund; Schultz, Jørgen Munthe; Svendsen, Sv Aa Højgaard

    The handbook on windows and energy is a general description of windows with the main focus put on the energy performance. Common window products are described by commonly used nomenclature, description of frame and sash conctructions and description of commonly used glazing types.The energy...... transmission through windows is described in detail including radiation, convection and conduction as well as solar transmittance of window glazing. The most used terms related to characterization of window energy performance are defined and calculation methods according to international standards...... flow and detailed calculation of light and solar transmittance is given.Different measurement techniques for characterization of window heat loss coefficient and total solar energy transmittance is described and references to interantional standards are given.Finally, the handbook includes...

  4. Mining top-k frequent closed itemsets in data streams using sliding window

    International Nuclear Information System (INIS)

    Rehman, Z.; Shahbaz, M.

    2013-01-01

    Frequent itemset mining has become a popular research area in data mining community since the last few years. T here are two main technical hitches while finding frequent itemsets. First, to provide an appropriate minimum support value to start and user need to tune this minimum support value by running the algorithm again and again. Secondly, generated frequent itemsets are mostly numerous and as a result a number of association rules generated are also very large in numbers. Applications dealing with streaming environment need to process the data received at high rate, therefore, finding frequent itemsets in data streams becomes complex. In this paper, we present an algorithm to mine top-k frequent closed itemsets using sliding window approach from streaming data. We developed a single-pass algorithm to find frequent closed itemsets of length between user's defined minimum and maximum- length. To improve the performance of algorithm and to avoid rescanning of data, we have transformed data into bitmap based tree data structure. (author)

  5. DETECTION OF FLUX EMERGENCE, SPLITTING, MERGING, AND CANCELLATION OF NETWORK FIELD. I. SPLITTING AND MERGING

    Energy Technology Data Exchange (ETDEWEB)

    Iida, Y.; Yokoyama, T. [Department of Earth and Planetary Science, University of Tokyo, Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Hagenaar, H. J. [Lockheed Martin Advanced Technology Center, Org. ADBS, Building 252, 3251 Hanover Street, Palo Alto, CA 94304 (United States)

    2012-06-20

    Frequencies of magnetic patch processes on the supergranule boundary, namely, flux emergence, splitting, merging, and cancellation, are investigated through automatic detection. We use a set of line-of-sight magnetograms taken by the Solar Optical Telescope (SOT) on board the Hinode satellite. We found 1636 positive patches and 1637 negative patches in the data set, whose time duration is 3.5 hr and field of view is 112'' Multiplication-Sign 112''. The total numbers of magnetic processes are as follows: 493 positive and 482 negative splittings, 536 positive and 535 negative mergings, 86 cancellations, and 3 emergences. The total numbers of emergence and cancellation are significantly smaller than those of splitting and merging. Further, the frequency dependence of the merging and splitting processes on the flux content are investigated. Merging has a weak dependence on the flux content with a power-law index of only 0.28. The timescale for splitting is found to be independent of the parent flux content before splitting, which corresponds to {approx}33 minutes. It is also found that patches split into any flux contents with the same probability. This splitting has a power-law distribution of the flux content with an index of -2 as a time-independent solution. These results support that the frequency distribution of the flux content in the analyzed flux range is rapidly maintained by merging and splitting, namely, surface processes. We suggest a model for frequency distributions of cancellation and emergence based on this idea.

  6. An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

    Science.gov (United States)

    Korte, John J.

    1991-01-01

    An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required

  7. Finite frequency shear wave splitting tomography: a model space search approach

    Science.gov (United States)

    Mondal, P.; Long, M. D.

    2017-12-01

    Observations of seismic anisotropy provide key constraints on past and present mantle deformation. A common method for upper mantle anisotropy is to measure shear wave splitting parameters (delay time and fast direction). However, the interpretation is not straightforward, because splitting measurements represent an integration of structure along the ray path. A tomographic approach that allows for localization of anisotropy is desirable; however, tomographic inversion for anisotropic structure is a daunting task, since 21 parameters are needed to describe general anisotropy. Such a large parameter space does not allow a straightforward application of tomographic inversion. Building on previous work on finite frequency shear wave splitting tomography, this study aims to develop a framework for SKS splitting tomography with a new parameterization of anisotropy and a model space search approach. We reparameterize the full elastic tensor, reducing the number of parameters to three (a measure of strength based on symmetry considerations for olivine, plus the dip and azimuth of the fast symmetry axis). We compute Born-approximation finite frequency sensitivity kernels relating model perturbations to splitting intensity observations. The strong dependence of the sensitivity kernels on the starting anisotropic model, and thus the strong non-linearity of the inverse problem, makes a linearized inversion infeasible. Therefore, we implement a Markov Chain Monte Carlo technique in the inversion procedure. We have performed tests with synthetic data sets to evaluate computational costs and infer the resolving power of our algorithm for synthetic models with multiple anisotropic layers. Our technique can resolve anisotropic parameters on length scales of ˜50 km for realistic station and event configurations for dense broadband experiments. We are proceeding towards applications to real data sets, with an initial focus on the High Lava Plains of Oregon.

  8. Measurement of kT splitting scales in W→ℓν events at [Formula: see text] with the ATLAS detector.

    Science.gov (United States)

    Aad, G; Abajyan, T; Abbott, B; Abdallah, J; Abdel Khalek, S; Abdelalim, A A; Abdinov, O; Aben, R; Abi, B; Abolins, M; AbouZeid, O S; Abramowicz, H; Abreu, H; Acharya, B S; Adamczyk, L; Adams, D L; Addy, T N; Adelman, J; Adomeit, S; Adragna, P; Adye, T; Aefsky, S; Aguilar-Saavedra, J A; Agustoni, M; Ahlen, S P; Ahles, F; Ahmad, A; Ahsan, M; Aielli, G; Åkesson, T P A; Akimoto, G; Akimov, A V; Alam, M A; Albert, J; Albrand, S; Aleksa, M; Aleksandrov, I N; Alessandria, F; Alexa, C; Alexander, G; Alexandre, G; Alexopoulos, T; Alhroob, M; Aliev, M; Alimonti, G; Alison, J; Allbrooke, B M M; Allison, L J; Allport, P P; Allwood-Spiers, S E; Almond, J; Aloisio, A; Alon, R; Alonso, A; Alonso, F; Altheimer, A; Alvarez Gonzalez, B; Alviggi, M G; Amako, K; Amelung, C; Ammosov, V V; Amor Dos Santos, S P; Amorim, A; Amoroso, S; Amram, N; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, G; Anderson, K J; Andreazza, A; Andrei, V; Anduaga, X S; Angelidakis, S; Anger, P; Angerami, A; Anghinolfi, F; Anisenkov, A; Anjos, N; Annovi, A; Antonaki, A; Antonelli, M; Antonov, A; Antos, J; Anulli, F; Aoki, M; Aperio Bella, L; Apolle, R; Arabidze, G; Aracena, I; Arai, Y; Arce, A T H; Arfaoui, S; Arguin, J-F; Argyropoulos, S; Arik, E; Arik, M; Armbruster, A J; Arnaez, O; Arnal, V; Artamonov, A; Artoni, G; Arutinov, D; Asai, S; Ask, S; Åsman, B; Asquith, L; Assamagan, K; Astalos, R; Astbury, A; Atkinson, M; Auerbach, B; Auge, E; Augsten, K; Aurousseau, M; Avolio, G; Axen, D; Azuelos, G; Azuma, Y; Baak, M A; Baccaglioni, G; Bacci, C; Bach, A M; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Backus Mayes, J; Badescu, E; Bagnaia, P; Bai, Y; Bailey, D C; Bain, T; Baines, J T; Baker, O K; Baker, S; Balek, P; Balli, F; Banas, E; Banerjee, P; Banerjee, Sw; Banfi, D; Bangert, A; Bansal, V; Bansil, H S; Barak, L; Baranov, S P; Barber, T; Barberio, E L; Barberis, D; Barbero, M; Bardin, D Y; Barillari, T; Barisonzi, M; Barklow, T; Barlow, N; Barnett, B M; Barnett, R M; Baroncelli, A; Barone, G; Barr, A J; Barreiro, F; Barreiro Guimarães da Costa, J; Bartoldus, R; Barton, A E; Bartsch, V; Basye, A; Bates, R L; Batkova, L; Batley, J R; Battaglia, A; Battistin, M; Bauer, F; Bawa, H S; Beale, S; Beau, T; Beauchemin, P H; Beccherle, R; Bechtle, P; Beck, H P; Becker, K; Becker, S; Beckingham, M; Becks, K H; Beddall, A J; Beddall, A; Bedikian, S; Bednyakov, V A; Bee, C P; Beemster, L J; Beermann, T A; Begel, M; Behar Harpaz, S; Belanger-Champagne, C; Bell, P J; Bell, W H; Bella, G; Bellagamba, L; Bellomo, M; Belloni, A; Beloborodova, O; Belotskiy, K; Beltramello, O; Benary, O; Benchekroun, D; Bendtz, K; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez Garcia, J A; Benjamin, D P; Benoit, M; Bensinger, J R; Benslama, K; Bentvelsen, S; Berge, D; Bergeaas Kuutmann, E; Berger, N; Berghaus, F; Berglund, E; Beringer, J; Bernat, P; Bernhard, R; Bernius, C; Bernlochner, F U; Berry, T; Bertella, C; Bertin, A; Bertolucci, F; Besana, M I; Besjes, G J; Besson, N; Bethke, S; Bhimji, W; Bianchi, R M; Bianchini, L; Bianco, M; Biebel, O; Bieniek, S P; Bierwagen, K; Biesiada, J; Biglietti, M; Bilokon, H; Bindi, M; Binet, S; Bingul, A; Bini, C; Biscarat, C; Bittner, B; Black, C W; Black, J E; Black, K M; Blair, R E; Blanchard, J-B; Blazek, T; Bloch, I; Blocker, C; Blocki, J; Blum, W; Blumenschein, U; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Boddy, C R; Boehler, M; Boek, J; Boek, T T; Boelaert, N; Bogaerts, J A; Bogdanchikov, A; Bogouch, A; Bohm, C; Bohm, J; Boisvert, V; Bold, T; Boldea, V; Bolnet, N M; Bomben, M; Bona, M; Boonekamp, M; Bordoni, S; Borer, C; Borisov, A; Borissov, G; Borjanovic, I; Borri, M; Borroni, S; Bortfeldt, J; Bortolotto, V; Bos, K; Boscherini, D; Bosman, M; Boterenbrood, H; Bouchami, J; Boudreau, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Bousson, N; Boutouil, S; Boveia, A; Boyd, J; Boyko, I R; Bozovic-Jelisavcic, I; Bracinik, J; Branchini, P; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Braun, H M; Brazzale, S F; Brelier, B; Bremer, J; Brendlinger, K; Brenner, R; Bressler, S; Bristow, T M; Britton, D; Brochu, F M; Brock, I; Brock, R; Broggi, F; Bromberg, C; Bronner, J; Brooijmans, G; Brooks, T; Brooks, W K; Brown, G; Bruckman de Renstrom, P A; Bruncko, D; Bruneliere, R; Brunet, S; Bruni, A; Bruni, G; Bruschi, M; Bryngemark, L; Buanes, T; Buat, Q; Bucci, F; Buchanan, J; Buchholz, P; Buckingham, R M; Buckley, A G; Buda, S I; Budagov, I A; Budick, B; Bugge, L; Bulekov, O; Bundock, A C; Bunse, M; Buran, T; Burckhart, H; Burdin, S; Burgess, T; Burke, S; Busato, E; Büscher, V; Bussey, P; Buszello, C P; Butler, B; Butler, J M; Buttar, C M; Butterworth, J M; Buttinger, W; Byszewski, M; Cabrera Urbán, S; Caforio, D; Cakir, O; Calafiura, P; Calderini, G; Calfayan, P; Calkins, R; Caloba, L P; Caloi, R; Calvet, D; Calvet, S; Camacho Toro, R; Camarri, P; Cameron, D; Caminada, L M; Caminal Armadans, R; Campana, S; Campanelli, M; Canale, V; Canelli, F; Canepa, A; Cantero, J; Cantrill, R; Cao, T; Capeans Garrido, M D M; Caprini, I; Caprini, M; Capriotti, D; Capua, M; Caputo, R; Cardarelli, R; Carli, T; Carlino, G; Carminati, L; Caron, S; Carquin, E; Carrillo-Montoya, G D; Carter, A A; Carter, J R; Carvalho, J; Casadei, D; Casado, M P; Cascella, M; Caso, C; Castaneda-Miranda, E; Castillo Gimenez, V; Castro, N F; Cataldi, G; Catastini, P; Catinaccio, A; Catmore, J R; Cattai, A; Cattani, G; Caughron, S; Cavaliere, V; Cavalleri, P; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Ceradini, F; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cetin, S A; Chafaq, A; Chakraborty, D; Chalupkova, I; Chan, K; Chang, P; Chapleau, B; Chapman, J D; Chapman, J W; Charlton, D G; Chavda, V; Chavez Barajas, C A; Cheatham, S; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, S; Chen, X; Chen, Y; Cheng, Y; Cheplakov, A; Cherkaoui El Moursli, R; Chernyatin, V; Cheu, E; Cheung, S L; Chevalier, L; Chiefari, G; Chikovani, L; Childers, J T; Chilingarov, A; Chiodini, G; Chisholm, A S; Chislett, R T; Chitan, A; Chizhov, M V; Choudalakis, G; Chouridou, S; Chow, B K B; Christidi, I A; Christov, A; Chromek-Burckhart, D; Chu, M L; Chudoba, J; Ciapetti, G; Ciftci, A K; Ciftci, R; Cinca, D; Cindro, V; Ciocio, A; Cirilli, M; Cirkovic, P; Citron, Z H; Citterio, M; Ciubancan, M; Clark, A; Clark, P J; Clarke, R N; Cleland, W; Clemens, J C; Clement, B; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Coffey, L; Cogan, J G; Coggeshall, J; Colas, J; Cole, S; Colijn, A P; Collins, N J; Collins-Tooth, C; Collot, J; Colombo, T; Colon, G; Compostella, G; Conde Muiño, P; Coniavitis, E; Conidi, M C; Consonni, S M; Consorti, V; Constantinescu, S; Conta, C; Conti, G; Conventi, F; Cooke, M; Cooper, B D; Cooper-Sarkar, A M; Cooper-Smith, N J; Copic, K; Cornelissen, T; Corradi, M; Corriveau, F; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Côté, D; Cottin, G; Courneyea, L; Cowan, G; Cox, B E; Cranmer, K; Crépé-Renaudin, S; Crescioli, F; Cristinziani, M; Crosetti, G; Cuciuc, C-M; Cuenca Almenar, C; Cuhadar Donszelmann, T; Cummings, J; Curatolo, M; Curtis, C J; Cuthbert, C; Cwetanski, P; Czirr, H; Czodrowski, P; Czyczula, Z; D'Auria, S; D'Onofrio, M; D'Orazio, A; Da Cunha Sargedas De Sousa, M J; Da Via, C; Dabrowski, W; Dafinca, A; Dai, T; Dallaire, F; Dallapiccola, C; Dam, M; Damiani, D S; Danielsson, H O; Dao, V; Darbo, G; Darlea, G L; Darmora, S; Dassoulas, J A; Davey, W; Davidek, T; Davidson, N; Davidson, R; Davies, E; Davies, M; Davignon, O; Davison, A R; Davygora, Y; Dawe, E; Dawson, I; Daya-Ishmukhametova, R K; De, K; de Asmundis, R; De Castro, S; De Cecco, S; de Graat, J; De Groot, N; de Jong, P; De La Taille, C; De la Torre, H; De Lorenzi, F; De Nooij, L; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Vivie De Regie, J B; De Zorzi, G; Dearnaley, W J; Debbe, R; Debenedetti, C; Dechenaux, B; Dedovich, D V; Degenhardt, J; Del Peso, J; Del Prete, T; Delemontex, T; Deliyergiyev, M; Dell'Acqua, A; Dell'Asta, L; Della Pietra, M; Della Volpe, D; Delmastro, M; Delsart, P A; Deluca, C; Demers, S; Demichev, M; Demirkoz, B; Denisov, S P; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deviveiros, P O; Dewhurst, A; DeWilde, B; Dhaliwal, S; Dhullipudi, R; Di Ciaccio, A; Di Ciaccio, L; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Luise, S; Di Mattia, A; Di Micco, B; Di Nardo, R; Di Simone, A; Di Sipio, R; Diaz, M A; Diehl, E B; Dietrich, J; Dietzsch, T A; Diglio, S; Dindar Yagci, K; Dingfelder, J; Dinut, F; Dionisi, C; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; do Vale, M A B; Do Valle Wemans, A; Doan, T K O; Dobbs, M; Dobos, D; Dobson, E; Dodd, J; Doglioni, C; Doherty, T; Dohmae, T; Doi, Y; Dolejsi, J; Dolezal, Z; Dolgoshein, B A; Donadelli, M; Donini, J; Dopke, J; Doria, A; Dos Anjos, A; Dotti, A; Dova, M T; Doyle, A T; Dressnandt, N; Dris, M; Dubbert, J; Dube, S; Dubreuil, E; Duchovni, E; Duckeck, G; Duda, D; Dudarev, A; Dudziak, F; Duerdoth, I P; Duflot, L; Dufour, M-A; Duguid, L; Dührssen, M; Dunford, M; Duran Yildiz, H; Düren, M; Duxfield, R; Dwuznik, M; Ebenstein, W L; Ebke, J; Eckweiler, S; Edson, W; Edwards, C A; Edwards, N C; Ehrenfeld, W; Eifert, T; Eigen, G; Einsweiler, K; Eisenhandler, E; Ekelof, T; El Kacimi, M; Ellert, M; Elles, S; Ellinghaus, F; Ellis, K; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Engelmann, R; Engl, A; Epp, B; Erdmann, J; Ereditato, A; Eriksson, D; Ernst, J; Ernst, M; Ernwein, J; Errede, D; Errede, S; Ertel, E; Escalier, M; Esch, H; Escobar, C; Espinal Curull, X; Esposito, B; Etienne, F; Etienvre, A I; Etzion, E; Evangelakou, D; Evans, H; Fabbri, L; Fabre, C; Facini, G; Fakhrutdinov, R M; Falciano, S; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farley, J; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Fatholahzadeh, B; Favareto, A; Fayard, L; Federic, P; Fedin, O L; Fedorko, W; Fehling-Kaschek, M; Feligioni, L; Feng, C; Feng, E J; Fenyuk, A B; Ferencei, J; Fernando, W; Ferrag, S; Ferrando, J; Ferrara, V; Ferrari, A; Ferrari, P; Ferrari, R; Ferreira de Lima, D E; Ferrer, A; Ferrere, D; Ferretti, C; Ferretto Parodi, A; Fiascaris, M; Fiedler, F; Filipčič, A; Filthaut, F; Fincke-Keeler, M; Fiolhais, M C N; Fiorini, L; Firan, A; Fischer, J; Fisher, M J; Fitzgerald, E A; Flechl, M; Fleck, I; Fleischmann, P; Fleischmann, S; Fletcher, G T; Fletcher, G; Flick, T; Floderus, A; Flores Castillo, L R; Florez Bustos, A C; Flowerdew, M J; Fonseca Martin, T; Formica, A; Forti, A; Fortin, D; Fournier, D; Fowler, A J; Fox, H; Francavilla, P; Franchini, M; Franchino, S; Francis, D; Frank, T; Franklin, M; Franz, S; Fraternali, M; Fratina, S; French, S T; Friedrich, C; Friedrich, F; Froidevaux, D; Frost, J A; Fukunaga, C; Fullana Torregrosa, E; Fulsom, B G; Fuster, J; Gabaldon, C; Gabizon, O; Gadatsch, S; Gadfort, T; Gadomski, S; Gagliardi, G; Gagnon, P; Galea, C; Galhardo, B; Gallas, E J; Gallo, V; Gallop, B J; Gallus, P; Gan, K K; Gandrajula, R P; Gao, Y S; Gaponenko, A; Garay Walls, F M; Garberson, F; García, C; García Navarro, J E; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Gatti, C; Gaudio, G; Gaur, B; Gauthier, L; Gauzzi, P; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Ge, P; Gecse, Z; Gee, C N P; Geerts, D A A; Geich-Gimbel, Ch; Gellerstedt, K; Gemme, C; Gemmell, A; Genest, M H; Gentile, S; George, M; George, S; Gerbaudo, D; Gerlach, P; Gershon, A; Geweniger, C; Ghazlane, H; Ghodbane, N; Giacobbe, B; Giagu, S; Giangiobbe, V; Gianotti, F; Gibbard, B; Gibson, A; Gibson, S M; Gilchriese, M; Gillam, T P S; Gillberg, D; Gillman, A R; Gingrich, D M; Ginzburg, J; Giokaris, N; Giordani, M P; Giordano, R; Giorgi, F M; Giovannini, P; Giraud, P F; Giugni, D; Giunta, M; Gjelsten, B K; Gladilin, L K; Glasman, C; Glatzer, J; Glazov, A; Glonti, G L; Goddard, J R; Godfrey, J; Godlewski, J; Goebel, M; Goeringer, C; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gomez Fajardo, L S; Gonçalo, R; Goncalves Pinto Firmino Da Costa, J; Gonella, L; González de la Hoz, S; Gonzalez Parra, G; Gonzalez Silva, M L; Gonzalez-Sevilla, S; Goodson, J J; Goossens, L; Göpfert, T; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorfine, G; Gorini, B; Gorini, E; Gorišek, A; Gornicki, E; Goshaw, A T; Gössling, C; Gostkin, M I; Gough Eschrich, I; Gouighri, M; Goujdami, D; Goulette, M P; Goussiou, A G; Goy, C; Gozpinar, S; Graber, L; Grabowska-Bold, I; Grafström, P; Grahn, K-J; Gramstad, E; Grancagnolo, F; Grancagnolo, S; Grassi, V; Gratchev, V; Gray, H M; Gray, J A; Graziani, E; Grebenyuk, O G; Greenshaw, T; Greenwood, Z D; Gregersen, K; Gregor, I M; Grenier, P; Griffiths, J; Grigalashvili, N; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grishkevich, Y V; Grivaz, J-F; Grohs, J P; Grohsjean, A; Gross, E; Grosse-Knetter, J; Groth-Jensen, J; Grybel, K; Guest, D; Gueta, O; Guicheney, C; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gunther, J; Guo, B; Guo, J; Gutierrez, P; Guttman, N; Gutzwiller, O; Guyot, C; Gwenlan, C; Gwilliam, C B; Haas, A; Haas, S; Haber, C; Hadavand, H K; Hadley, D R; Haefner, P; Hajduk, Z; Hakobyan, H; Hall, D; Halladjian, G; Hamacher, K; Hamal, P; Hamano, K; Hamer, M; Hamilton, A; Hamilton, S; Han, L; Hanagaki, K; Hanawa, K; Hance, M; Handel, C; Hanke, P; Hansen, J R; Hansen, J B; Hansen, J D; Hansen, P H; Hansson, P; Hara, K; Harenberg, T; Harkusha, S; Harper, D; Harrington, R D; Harris, O M; Hartert, J; Hartjes, F; Haruyama, T; Harvey, A; Hasegawa, S; Hasegawa, Y; Hassani, S; Haug, S; Hauschild, M; Hauser, R; Havranek, M; Hawkes, C M; Hawkings, R J; Hawkins, A D; Hayakawa, T; Hayashi, T; Hayden, D; Hays, C P; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heim, S; Heinemann, B; Heisterkamp, S; Helary, L; Heller, C; Heller, M; Hellman, S; Hellmich, D; Helsens, C; Henderson, R C W; Henke, M; Henrichs, A; Henriques Correia, A M; Henrot-Versille, S; Hensel, C; Hernandez, C M; Hernández Jiménez, Y; Herrberg, R; Herten, G; Hertenberger, R; Hervas, L; Hesketh, G G; Hessey, N P; Hickling, R; Higón-Rodriguez, E; Hill, J C; Hiller, K H; Hillert, S; Hillier, S J; Hinchliffe, I; Hines, E; Hirose, M; Hirsch, F; Hirschbuehl, D; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoffman, J; Hoffmann, D; Hohlfeld, M; Holmgren, S O; Holy, T; Holzbauer, J L; Hong, T M; Hooft van Huysduynen, L; Hostachy, J-Y; Hou, S; Hoummada, A; Howard, J; Howarth, J; Hrabovsky, M; Hristova, I; Hrivnac, J; Hryn'ova, T; Hsu, P J; Hsu, S-C; Hu, D; Hubacek, Z; Hubaut, F; Huegging, F; Huettmann, A; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Hülsing, T A; Hurwitz, M; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibbotson, M; Ibragimov, I; Iconomidou-Fayard, L; Idarraga, J; Iengo, P; Igonkina, O; Ikegami, Y; Ikematsu, K; Ikeno, M; Iliadis, D; Ilic, N; Ince, T; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Irles Quiles, A; Isaksson, C; Ishino, M; Ishitsuka, M; Ishmukhametov, R; Issever, C; Istin, S; Ivashin, A V; Iwanski, W; Iwasaki, H; Izen, J M; Izzo, V; Jackson, B; Jackson, J N; Jackson, P; Jaekel, M R; Jain, V; Jakobs, K; Jakobsen, S; Jakoubek, T; Jakubek, J; Jamin, D O; Jana, D K; Jansen, E; Jansen, H; Janssen, J; Jantsch, A; Janus, M; Jared, R C; Jarlskog, G; Jeanty, L; Jeng, G-Y; Jen-La Plante, I; Jennens, D; Jenni, P; Jeske, C; Jež, P; Jézéquel, S; Jha, M K; Ji, H; Ji, W; Jia, J; Jiang, Y; Jimenez Belenguer, M; Jin, S; Jinnouchi, O; Joergensen, M D; Joffe, D; Johansen, M; Johansson, K E; Johansson, P; Johnert, S; Johns, K A; Jon-And, K; Jones, G; Jones, R W L; Jones, T J; Joram, C; Jorge, P M; Joshi, K D; Jovicevic, J; Jovin, T; Ju, X; Jung, C A; Jungst, R M; Juranek, V; Jussel, P; Juste Rozas, A; Kabana, S; Kaci, M; Kaczmarska, A; Kadlecik, P; Kado, M; Kagan, H; Kagan, M; Kajomovitz, E; Kalinin, S; Kama, S; Kanaya, N; Kaneda, M; Kaneti, S; Kanno, T; Kantserov, V A; Kanzaki, J; Kaplan, B; Kapliy, A; Kar, D; Karagounis, M; Karakostas, K; Karnevskiy, M; Kartvelishvili, V; Karyukhin, A N; Kashif, L; Kasieczka, G; Kass, R D; Kastanas, A; Kataoka, Y; Katzy, J; Kaushik, V; Kawagoe, K; Kawamoto, T; Kawamura, G; Kazama, S; Kazanin, V F; Kazarinov, M Y; Keeler, R; Keener, P T; Kehoe, R; Keil, M; Keller, J S; Kenyon, M; Keoshkerian, H; Kepka, O; Kerschen, N; Kerševan, B P; Kersten, S; Kessoku, K; Keung, J; Khalil-Zada, F; Khandanyan, H; Khanov, A; Kharchenko, D; Khodinov, A; Khomich, A; Khoo, T J; Khoriauli, G; Khoroshilov, A; Khovanskiy, V; Khramov, E; Khubua, J; Kim, H; Kim, S H; Kimura, N; Kind, O; King, B T; King, M; King, R S B; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kitamura, T; Kittelmann, T; Kiuchi, K; Kladiva, E; Klein, M; Klein, U; Kleinknecht, K; Klemetti, M; Klier, A; Klimek, P; Klimentov, A; Klingenberg, R; Klinger, J A; Klinkby, E B; Klioutchnikova, T; Klok, P F; Klous, S; Kluge, E-E; Kluge, T; Kluit, P; Kluth, S; Kneringer, E; Knoops, E B F G; Knue, A; Ko, B R; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koenig, S; Koetsveld, F; Koevesarki, P; Koffas, T; Koffeman, E; Kogan, L A; Kohlmann, S; Kohn, F; Kohout, Z; Kohriki, T; Koi, T; Kolanoski, H; Kolesnikov, V; Koletsou, I; Koll, J; Komar, A A; Komori, Y; Kondo, T; Köneke, K; König, A C; Kono, T; Kononov, A I; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Köpke, L; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A; Korolkov, I; Korolkova, E V; Korotkov, V A; Kortner, O; Kortner, S; Kostyukhin, V V; Kotov, S; Kotov, V M; Kotwal, A; Kourkoumelis, C; Kouskoura, V; Koutsman, A; Kowalewski, R; Kowalski, T Z; Kozanecki, W; Kozhin, A S; Kral, V; Kramarenko, V A; Kramberger, G; Krasny, M W; Krasznahorkay, A; Kraus, J K; Kravchenko, A; Kreiss, S; Krejci, F; Kretzschmar, J; Kreutzfeldt, K; Krieger, N; Krieger, P; Kroeninger, K; Kroha, H; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Kruker, T; Krumnack, N; Krumshteyn, Z V; Kruse, M K; Kubota, T; Kuday, S; Kuehn, S; Kugel, A; Kuhl, T; Kukhtin, V; Kulchitsky, Y; Kuleshov, S; Kuna, M; Kunkle, J; Kupco, A; Kurashige, H; Kurata, M; Kurochkin, Y A; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; Kwee, R; La Rosa, A; La Rotonda, L; Labarga, L; Lablak, S; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Lacuesta, V R; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Laisne, E; Lambourne, L; Lampen, C L; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lang, V S; Lange, C; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Laplace, S; Lapoire, C; Laporte, J F; Lari, T; Larner, A; Lassnig, M; Laurelli, P; Lavorini, V; Lavrijsen, W; Laycock, P; Le Dortz, O; Le Guirriec, E; Le Menedeu, E; LeCompte, T; Ledroit-Guillon, F; Lee, H; Lee, J S H; Lee, S C; Lee, L; Lefebvre, M; Legendre, M; Legger, F; Leggett, C; Lehmacher, M; Lehmann Miotto, G; Leister, A G; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Lendermann, V; Leney, K J C; Lenz, T; Lenzen, G; Lenzi, B; Leonhardt, K; Leontsinis, S; Lepold, F; Leroy, C; Lessard, J-R; Lester, C G; Lester, C M; Levêque, J; Levin, D; Levinson, L J; Lewis, A; Lewis, G H; Leyko, A M; Leyton, M; Li, B; Li, B; Li, H; Li, H L; Li, S; Li, X; Liang, Z; Liao, H; Liberti, B; Lichard, P; Lie, K; Liebal, J; Liebig, W; Limbach, C; Limosani, A; Limper, M; Lin, S C; Linde, F; Linnemann, J T; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lissauer, D; Lister, A; Litke, A M; Liu, D; Liu, J B; Liu, L; Liu, M; Liu, Y; Livan, M; Livermore, S S A; Lleres, A; Llorente Merino, J; Lloyd, S L; Lo Sterzo, F; Lobodzinska, E; Loch, P; Lockman, W S; Loddenkoetter, T; Loebinger, F K; Loevschall-Jensen, A E; Loginov, A; Loh, C W; Lohse, T; Lohwasser, K; Lokajicek, M; Lombardo, V P; Long, R E; Lopes, L; Lopez Mateos, D; Lorenz, J; Lorenzo Martinez, N; Losada, M; Loscutoff, P; Losty, M J; Lou, X; Lounis, A; Loureiro, K F; Love, J; Love, P A; Lowe, A J; Lu, F; Lubatti, H J; Luci, C; Lucotte, A; Ludwig, D; Ludwig, I; Ludwig, J; Luehring, F; Lukas, W; Luminari, L; Lund, E; Lundberg, B; Lundberg, J; Lundberg, O; Lund-Jensen, B; Lundquist, J; Lungwitz, M; Lynn, D; Lysak, R; Lytken, E; Ma, H; Ma, L L; Maccarrone, G; Macchiolo, A; Maček, B; Machado Miguens, J; Macina, D; Mackeprang, R; Madar, R; Madaras, R J; Maddocks, H J; Mader, W F; Madsen, A; Maeno, M; Maeno, T; Magnoni, L; Magradze, E; Mahboubi, K; Mahlstedt, J; Mahmoud, S; Mahout, G; Maiani, C; Maidantchik, C; Maio, A; Majewski, S; Makida, Y; Makovec, N; Mal, P; Malaescu, B; Malecki, Pa; Malecki, P; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyshev, V; Malyukov, S; Mamuzic, J; Manabe, A; Mandelli, L; Mandić, I; Mandrysch, R; Maneira, J; Manfredini, A; Manhaes de Andrade Filho, L; Manjarres Ramos, J A; Mann, A; Manning, P M; Manousakis-Katsikakis, A; Mansoulie, B; Mantifel, R; Mapelli, A; Mapelli, L; March, L; Marchand, J F; Marchese, F; Marchiori, G; Marcisovsky, M; Marino, C P; Marroquim, F; Marshall, Z; Marti, L F; Marti-Garcia, S; Martin, B; Martin, B; Martin, J P; Martin, T A; Martin, V J; Martin Dit Latour, B; Martinez, H; Martinez, M; Martinez Outschoorn, V; Martin-Haugh, S; Martyniuk, A C; Marx, M; Marzano, F; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, I; Massol, N; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Matsunaga, H; Matsushita, T; Mättig, P; Mättig, S; Mattravers, C; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Mazur, M; Mazzaferro, L; Mazzanti, M; Mc Donald, J; Mc Kee, S P; McCarn, A; McCarthy, R L; McCarthy, T G; McCubbin, N A; McFarlane, K W; Mcfayden, J A; Mchedlidze, G; Mclaughlan, T; McMahon, S J; McPherson, R A; Meade, A; Mechnich, J; Mechtel, M; Medinnis, M; Meehan, S; Meera-Lebbai, R; Meguro, T; Mehlhase, S; Mehta, A; Meier, K; Meineck, C; Meirose, B; Melachrinos, C; Mellado Garcia, B R; Meloni, F; Mendoza Navas, L; Meng, Z; Mengarelli, A; Menke, S; Meoni, E; Mercurio, K M; Meric, N; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Merritt, H; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, C; Meyer, J-P; Meyer, J; Meyer, J; Michal, S; Micu, L; Middleton, R P; Migas, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Miller, D W; Miller, R J; Mills, W J; Mills, C; Milov, A; Milstead, D A; Milstein, D; Minaenko, A A; Miñano Moya, M; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Ming, Y; Mir, L M; Mirabelli, G; Mitrevski, J; Mitsou, V A; Mitsui, S; Miyagawa, P S; Mjörnmark, J U; Moa, T; Moeller, V; Mohapatra, S; Mohr, W; Moles-Valls, R; Molfetas, A; Mönig, K; Monini, C; Monk, J; Monnier, E; Montejo Berlingen, J; Monticelli, F; Monzani, S; Moore, R W; Mora Herrera, C; Moraes, A; Morange, N; Morel, J; Moreno, D; Moreno Llácer, M; Morettini, P; Morgenstern, M; Morii, M; Morley, A K; Mornacchi, G; Morris, J D; Morvaj, L; Möser, N; Moser, H G; Mosidze, M; Moss, J; Mount, R; Mountricha, E; Mouraviev, S V; Moyse, E J W; Mueller, F; Mueller, J; Mueller, K; Mueller, T; Muenstermann, D; Müller, T A; Munwes, Y; Murray, W J; Mussche, I; Musto, E; Myagkov, A G; Myska, M; Nackenhorst, O; Nadal, J; Nagai, K; Nagai, R; Nagai, Y; Nagano, K; Nagarkar, A; Nagasaka, Y; Nagel, M; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Namasivayam, H; Nanava, G; Napier, A; Narayan, R; Nash, M; Nattermann, T; Naumann, T; Navarro, G; Neal, H A; Nechaeva, P Yu; Neep, T J; Negri, A; Negri, G; Negrini, M; Nektarijevic, S; Nelson, A; Nelson, T K; Nemecek, S; Nemethy, P; Nepomuceno, A A; Nessi, M; Neubauer, M S; Neumann, M; Neusiedl, A; Neves, R M; Nevski, P; Newcomer, F M; Newman, P R; Nguyen, D H; Nguyen Thi Hong, V; Nickerson, R B; Nicolaidou, R; Nicquevert, B; Niedercorn, F; Nielsen, J; Nikiforou, N; Nikiforov, A; Nikolaenko, V; Nikolic-Audit, I; Nikolics, K; Nikolopoulos, K; Nilsen, H; Nilsson, P; Ninomiya, Y; Nisati, A; Nisius, R; Nobe, T; Nodulman, L; Nomachi, M; Nomidis, I; Norberg, S; Nordberg, M; Novakova, J; Nozaki, M; Nozka, L; Nuncio-Quiroz, A-E; Nunes Hanninger, G; Nunnemann, T; Nurse, E; O'Brien, B J; O'Neil, D C; O'Shea, V; Oakes, L B; Oakham, F G; Oberlack, H; Ocariz, J; Ochi, A; Ochoa, M I; Oda, S; Odaka, S; Odier, J; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohshima, T; Okamura, W; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Olchevski, A G; Olivares Pino, S A; Oliveira, M; Oliveira Damazio, D; Oliver Garcia, E; Olivito, D; Olszewski, A; Olszowska, J; Onofre, A; Onyisi, P U E; Oram, C J; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Oropeza Barrera, C; Orr, R S; Osculati, B; Ospanov, R; Osuna, C; Otero Y Garzon, G; Ottersbach, J P; Ouchrif, M; Ouellette, E A; Ould-Saada, F; Ouraou, A; Ouyang, Q; Ovcharova, A; Owen, M; Owen, S; Ozcan, V E; Ozturk, N; Pacheco Pages, A; Padilla Aranda, C; Pagan Griso, S; Paganis, E; Pahl, C; Paige, F; Pais, P; Pajchel, K; Palacino, G; Paleari, C P; Palestini, S; Pallin, D; Palma, A; Palmer, J D; Pan, Y B; Panagiotopoulou, E; Panduro Vazquez, J G; Pani, P; Panikashvili, N; Panitkin, S; Pantea, D; Papadelis, A; Papadopoulou, Th D; Paramonov, A; Paredes Hernandez, D; Park, W; Parker, M A; Parodi, F; Parsons, J A; Parzefall, U; Pashapour, S; Pasqualucci, E; Passaggio, S; Passeri, A; Pastore, F; Pastore, Fr; Pásztor, G; Pataraia, S; Patel, N D; Pater, J R; Patricelli, S; Pauly, T; Pearce, J; Pedersen, M; Pedraza Lopez, S; Pedraza Morales, M I; Peleganchuk, S V; Pelikan, D; Peng, H; Penning, B; Penson, A; Penwell, J; Perez Cavalcanti, T; Perez Codina, E; Pérez García-Estañ, M T; Perez Reale, V; Perini, L; Pernegger, H; Perrino, R; Perrodo, P; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, J; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petrolo, E; Petrucci, F; Petschull, D; Petteni, M; Pezoa, R; Phan, A; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Piccinini, M; Piec, S M; Piegaia, R; Pignotti, D T; Pilcher, J E; Pilkington, A D; Pina, J; Pinamonti, M; Pinder, A; Pinfold, J L; Pingel, A; Pinto, B; Pizio, C; Pleier, M-A; Pleskot, V; Plotnikova, E; Plucinski, P; Poblaguev, A; Poddar, S; Podlyski, F; Poettgen, R; Poggioli, L; Pohl, D; Pohl, M; Polesello, G; Policicchio, A; Polifka, R; Polini, A; Poll, J; Polychronakos, V; Pomeroy, D; Pommès, K; Pontecorvo, L; Pope, B G; Popeneciu, G A; Popovic, D S; Poppleton, A; Portell Bueso, X; Pospelov, G E; Pospisil, S; Potrap, I N; Potter, C J; Potter, C T; Poulard, G; Poveda, J; Pozdnyakov, V; Prabhu, R; Pralavorio, P; Pranko, A; Prasad, S; Pravahan, R; Prell, S; Pretzl, K; Price, D; Price, J; Price, L E; Prieur, D; Primavera, M; Proissl, M; Prokofiev, K; Prokoshin, F; Protopapadaki, E; Protopopescu, S; Proudfoot, J; Prudent, X; Przybycien, M; Przysiezniak, H; Psoroulas, S; Ptacek, E; Pueschel, E; Puldon, D; Purohit, M; Puzo, P; Pylypchenko, Y; Qian, J; Quadt, A; Quarrie, D R; Quayle, W B; Quilty, D; Raas, M; Radeka, V; Radescu, V; Radloff, P; Ragusa, F; Rahal, G; Rahimi, A M; Rajagopalan, S; Rammensee, M; Rammes, M; Randle-Conde, A S; Randrianarivony, K; Rangel-Smith, C; Rao, K; Rauscher, F; Rave, T C; Ravenscroft, T; Raymond, M; Read, A L; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reeves, K; Reinsch, A; Reisinger, I; Relich, M; Rembser, C; Ren, Z L; Renaud, A; Rescigno, M; Resconi, S; Resende, B; Reznicek, P; Rezvani, R; Richter, R; Richter-Was, E; Ridel, M; Rieck, P; Rijssenbeek, M; Rimoldi, A; Rinaldi, L; Rios, R R; Ritsch, E; Riu, I; Rivoltella, G; Rizatdinova, F; Rizvi, E; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Rocha de Lima, J G; Roda, C; Roda Dos Santos, D; Roe, A; Roe, S; Røhne, O; Rolli, S; Romaniouk, A; Romano, M; Romeo, G; Romero Adam, E; Rompotis, N; Roos, L; Ros, E; Rosati, S; Rosbach, K; Rose, A; Rose, M; Rosenbaum, G A; Rosendahl, P L; Rosenthal, O; Rosselet, L; Rossetti, V; Rossi, E; Rossi, L P; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Royon, C R; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rubinskiy, I; Ruckstuhl, N; Rud, V I; Rudolph, C; Rudolph, M S; Rühr, F; Ruiz-Martinez, A; Rumyantsev, L; Rurikova, Z; Rusakovich, N A; Ruschke, A; Rutherfoord, J P; Ruthmann, N; Ruzicka, P; Ryabov, Y F; Rybar, M; Rybkin, G; Ryder, N C; Saavedra, A F; Sadeh, I; Sadrozinski, H F-W; Sadykov, R; Safai Tehrani, F; Sakamoto, H; Salamanna, G; Salamon, A; Saleem, M; Salek, D; Salihagic, D; Salnikov, A; Salt, J; Salvachua Ferrando, B M; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sampsonidis, D; Sanchez, A; Sánchez, J; Sanchez Martinez, V; Sandaker, H; Sander, H G; Sanders, M P; Sandhoff, M; Sandoval, T; Sandoval, C; Sandstroem, R; Sankey, D P C; Sansoni, A; Santamarina Rios, C; Santoni, C; Santonico, R; Santos, H; Santoyo Castillo, I; Sapp, K; Saraiva, J G; Sarangi, T; Sarkisyan-Grinbaum, E; Sarrazin, B; Sarri, F; Sartisohn, G; Sasaki, O; Sasaki, Y; Sasao, N; Satsounkevitch, I; Sauvage, G; Sauvan, E; Sauvan, J B; Savard, P; Savinov, V; Savu, D O; Sawyer, L; Saxon, D H; Saxon, J; Sbarra, C; Sbrizzi, A; Scannicchio, D A; Scarcella, M; Schaarschmidt, J; Schacht, P; Schaefer, D; Schaelicke, A; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Scherzer, M I; Schiavi, C; Schieck, J; Schillo, C; Schioppa, M; Schlenker, S; Schmidt, E; Schmieden, K; Schmitt, C; Schmitt, C; Schmitt, S; Schneider, B; Schnellbach, Y J; Schnoor, U; Schoeffel, L; Schoening, A; Schorlemmer, A L S; Schott, M; Schouten, D; Schovancova, J; Schram, M; Schroeder, C; Schroer, N; Schultens, M J; Schultes, J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwartzman, A; Schwegler, Ph; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Schwindt, T; Schwoerer, M; Sciacca, F G; Scifo, E; Sciolla, G; Scott, W G; Searcy, J; Sedov, G; Sedykh, E; Seidel, S C; Seiden, A; Seifert, F; Seixas, J M; Sekhniaidze, G; Sekula, S J; Selbach, K E; Seliverstov, D M; Sellden, B; Sellers, G; Seman, M; Semprini-Cesari, N; Serfon, C; Serin, L; Serkin, L; Serre, T; Seuster, R; Severini, H; Sfyrla, A; Shabalina, E; Shamim, M; Shan, L Y; Shank, J T; Shao, Q T; Shapiro, M; Shatalov, P B; Shaw, K; Sherwood, P; Shimizu, S; Shimojima, M; Shin, T; Shiyakova, M; Shmeleva, A; Shochet, M J; Short, D; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sidoti, A; Siegert, F; Sijacki, Dj; Silbert, O; Silva, J; Silver, Y; Silverstein, D; Silverstein, S B; Simak, V; Simard, O; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simoniello, R; Simonyan, M; Sinervo, P; Sinev, N B; Sipica, V; Siragusa, G; Sircar, A; Sisakyan, A N; Sivoklokov, S Yu; Sjölin, J; Sjursen, T B; Skinnari, L A; Skottowe, H P; Skovpen, K; Skubic, P; Slater, M; Slavicek, T; Sliwa, K; Smakhtin, V; Smart, B H; Smestad, L; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, B C; Smith, K M; Smizanska, M; Smolek, K; Snesarev, A A; Snidero, G; Snow, S W; Snow, J; Snyder, S; Sobie, R; Sodomka, J; Soffer, A; Soh, D A; Solans, C A; Solar, M; Solc, J; Soldatov, E Yu; Soldevila, U; Solfaroli Camillocci, E; Solodkov, A A; Solovyanov, O V; Solovyev, V; Soni, N; Sood, A; Sopko, V; Sopko, B; Sosebee, M; Soualah, R; Soueid, P; Soukharev, A; South, D; Spagnolo, S; Spanò, F; Spighi, R; Spigo, G; Spiwoks, R; Spousta, M; Spreitzer, T; Spurlock, B; St Denis, R D; Stahlman, J; Stamen, R; Stanecka, E; Stanek, R W; Stanescu, C; Stanescu-Bellu, M; Stanitzki, M M; Stapnes, S; Starchenko, E A; Stark, J; Staroba, P; Starovoitov, P; Staszewski, R; Staude, A; Stavina, P; Steele, G; Steinbach, P; Steinberg, P; Stekl, I; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stern, S; Stewart, G A; Stillings, J A; Stockton, M C; Stoebe, M; Stoerig, K; Stoicea, G; Stonjek, S; Strachota, P; Stradling, A R; Straessner, A; Strandberg, J; Strandberg, S; Strandlie, A; Strang, M; Strauss, E; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Strong, J A; Stroynowski, R; Stugu, B; Stumer, I; Stupak, J; Sturm, P; Styles, N A; Su, D; Subramania, Hs; Subramaniam, R; Succurro, A; Sugaya, Y; Suhr, C; Suk, M; Sulin, V V; Sultansoy, S; Sumida, T; Sun, X; Sundermann, J E; Suruliz, K; Susinno, G; Sutton, M R; Suzuki, Y; Suzuki, Y; Svatos, M; Swedish, S; Swiatlowski, M; Sykora, I; Sykora, T; Ta, D; Tackmann, K; Taffard, A; Tafirout, R; Taiblum, N; Takahashi, Y; Takai, H; Takashima, R; Takeda, H; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A; Tam, J Y C; Tamsett, M C; Tan, K G; Tanaka, J; Tanaka, R; Tanaka, S; Tanaka, S; Tanasijczuk, A J; Tani, K; Tannoury, N; Tapprogge, S; Tardif, D; Tarem, S; Tarrade, F; Tartarelli, G F; Tas, P; Tasevsky, M; Tassi, E; Tayalati, Y; Taylor, C; Taylor, F E; Taylor, G N; Taylor, W; Teinturier, M; Teischinger, F A; Teixeira Dias Castanheira, M; Teixeira-Dias, P; Temming, K K; Ten Kate, H; Teng, P K; Terada, S; Terashi, K; Terron, J; Testa, M; Teuscher, R J; Therhaag, J; Theveneaux-Pelzer, T; Thoma, S; Thomas, J P; Thompson, E N; Thompson, P D; Thompson, P D; Thompson, A S; Thomsen, L A; Thomson, E; Thomson, M; Thong, W M; Thun, R P; Tian, F; Tibbetts, M J; Tic, T; Tikhomirov, V O; Tikhonov, Y A; Timoshenko, S; Tiouchichine, E; Tipton, P; Tisserant, S; Todorov, T; Todorova-Nova, S; Toggerson, B; Tojo, J; Tokár, S; Tokushuku, K; Tollefson, K; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Tonoyan, A; Topfel, C; Topilin, N D; Torrence, E; Torres, H; Torró Pastor, E; Toth, J; Touchard, F; Tovey, D R; Tran, H L; Trefzger, T; Tremblet, L; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Triplett, N; Trischuk, W; Trocmé, B; Troncon, C; Trottier-McDonald, M; Trovatelli, M; True, P; Trzebinski, M; Trzupek, A; Tsarouchas, C; Tseng, J C-L; Tsiakiris, M; Tsiareshka, P V; Tsionou, D; Tsipolitis, G; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsukerman, I I; Tsulaia, V; Tsung, J-W; Tsuno, S; Tsybychev, D; Tua, A; Tudorache, A; Tudorache, V; Tuggle, J M; Turala, M; Turecek, D; Turk Cakir, I; Turra, R; Tuts, P M; Tykhonov, A; Tylmad, M; Tyndel, M; Tzanakos, G; Uchida, K; Ueda, I; Ueno, R; Ughetto, M; Ugland, M; Uhlenbrock, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Urbaniec, D; Urquijo, P; Usai, G; Vacavant, L; Vacek, V; Vachon, B; Vahsen, S; Valencic, N; Valentinetti, S; Valero, A; Valery, L; Valkar, S; Valladolid Gallego, E; Vallecorsa, S; Valls Ferrer, J A; Van Berg, R; Van Der Deijl, P C; van der Geer, R; van der Graaf, H; Van Der Leeuw, R; van der Poel, E; van der Ster, D; van Eldik, N; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; Vanadia, M; Vandelli, W; Vaniachine, A; Vankov, P; Vannucci, F; Vari, R; Varnes, E W; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vassilakopoulos, V I; Vazeille, F; Vazquez Schroeder, T; Veloso, F; Veneziano, S; Ventura, A; Ventura, D; Venturi, M; Venturi, N; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, J C; Vest, A; Vetterli, M C; Vichou, I; Vickey, T; Vickey Boeriu, O E; Viehhauser, G H A; Viel, S; Villa, M; Villaplana Perez, M; Vilucchi, E; Vincter, M G; Vinek, E; Vinogradov, V B; Virzi, J; Vitells, O; Viti, M; Vivarelli, I; Vives Vaque, F; Vlachos, S; Vladoiu, D; Vlasak, M; Vogel, A; Vokac, P; Volpi, G; Volpi, M; Volpini, G; von der Schmitt, H; von Radziewski, H; von Toerne, E; Vorobel, V; Vorwerk, V; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Vranjes Milosavljevic, M; Vrba, V; Vreeswijk, M; Vu Anh, T; Vuillermet, R; Vukotic, I; Vykydal, Z; Wagner, W; Wagner, P; Wahlen, H; Wahrmund, S; Wakabayashi, J; Walch, S; Walder, J; Walker, R; Walkowiak, W; Wall, R; Waller, P; Walsh, B; Wang, C; Wang, H; Wang, H; Wang, J; Wang, J; Wang, K; Wang, R; Wang, S M; Wang, T; Wang, X; Warburton, A; Ward, C P; Wardrope, D R; Warsinsky, M; Washbrook, A; Wasicki, C; Watanabe, I; Watkins, P M; Watson, A T; Watson, I J; Watson, M F; Watts, G; Watts, S; Waugh, A T; Waugh, B M; Weber, M S; Webster, J S; Weidberg, A R; Weigell, P; Weingarten, J; Weiser, C; Wells, P S; Wenaus, T; Wendland, D; Weng, Z; Wengler, T; Wenig, S; Wermes, N; Werner, M; Werner, P; Werth, M; Wessels, M; Wetter, J; Weydert, C; Whalen, K; White, A; White, M J; White, S; Whitehead, S R; Whiteson, D; Whittington, D; Wicke, D; Wickens, F J; Wiedenmann, W; Wielers, M; Wienemann, P; Wiglesworth, C; Wiik-Fuchs, L A M; Wijeratne, P A; Wildauer, A; Wildt, M A; Wilhelm, I; Wilkens, H G; Will, J Z; Williams, E; Williams, H H; Williams, S; Willis, W; Willocq, S; Wilson, J A; Wilson, M G; Wilson, A; Wingerter-Seez, I; Winkelmann, S; Winklmeier, F; Wittgen, M; Wittig, T; Wittkowski, J; Wollstadt, S J; Wolter, M W; Wolters, H; Wong, W C; Wooden, G; Wosiek, B K; Wotschack, J; Woudstra, M J; Wozniak, K W; Wraight, K; Wright, M; Wrona, B; Wu, S L; Wu, X; Wu, Y; Wulf, E; Wynne, B M; Xella, S; Xiao, M; Xie, S; Xu, C; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yamada, M; Yamaguchi, H; Yamaguchi, Y; Yamamoto, A; Yamamoto, K; Yamamoto, S; Yamamura, T; Yamanaka, T; Yamauchi, K; Yamazaki, T; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, U K; Yang, Y; Yang, Z; Yanush, S; Yao, L; Yasu, Y; Yatsenko, E; Ye, J; Ye, S; Yen, A L; Yilmaz, M; Yoosoofmiya, R; Yorita, K; Yoshida, R; Yoshihara, K; Young, C; Young, C J S; Youssef, S; Yu, D; Yu, D R; Yu, J; Yu, J; Yuan, L; Yurkewicz, A; Zabinski, B; Zaidan, R; Zaitsev, A M; Zambito, S; Zanello, L; Zanzi, D; Zaytsev, A; Zeitnitz, C; Zeman, M; Zemla, A; Zenin, O; Ženiš, T; Zerwas, D; Zevi Della Porta, G; Zhang, D; Zhang, H; Zhang, J; Zhang, L; Zhang, X; Zhang, Z; Zhao, L; Zhao, Z; Zhemchugov, A; Zhong, J; Zhou, B; Zhou, N; Zhou, Y; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhuravlov, V; Zibell, A; Zieminska, D; Zimin, N I; Zimmermann, R; Zimmermann, S; Zimmermann, S; Zinonos, Z; Ziolkowski, M; Zitoun, R; Živković, L; Zmouchko, V V; Zobernig, G; Zoccoli, A; Zur Nedden, M; Zutshi, V; Zwalinski, L

    A measurement of splitting scales, as defined by the k T clustering algorithm, is presented for final states containing a W boson produced in proton-proton collisions at a centre-of-mass energy of 7 TeV. The measurement is based on the full 2010 data sample corresponding to an integrated luminosity of 36 pb -1 which was collected using the ATLAS detector at the CERN Large Hadron Collider. Cluster splitting scales are measured in events containing W bosons decaying to electrons or muons. The measurement comprises the four hardest splitting scales in a k T cluster sequence of the hadronic activity accompanying the W boson, and ratios of these splitting scales. Backgrounds such as multi-jet and top-quark-pair production are subtracted and the results are corrected for detector effects. Predictions from various Monte Carlo event generators at particle level are compared to the data. Overall, reasonable agreement is found with all generators, but larger deviations between the predictions and the data are evident in the soft regions of the splitting scales.

  9. Splitting: The Development of a Measure.

    Science.gov (United States)

    Gerson, Mary-Joan

    1984-01-01

    Described the development of a scale that measures splitting as a psychological structure. The construct validity of the splitting scale is suggested by the positive relationship between splitting scores and a diagnostic measure of the narcissistic personality disorder, as well as a negative relationship between splitting scores and levels of…

  10. Bad splits in bilateral sagittal split osteotomy: systematic review and meta-analysis of reported risk factors.

    Science.gov (United States)

    Steenen, S A; van Wijk, A J; Becking, A G

    2016-08-01

    An unfavourable and unanticipated pattern of the bilateral sagittal split osteotomy (BSSO) is generally referred to as a 'bad split'. Patient factors predictive of a bad split reported in the literature are controversial. Suggested risk factors are reviewed in this article. A systematic review was undertaken, yielding a total of 30 studies published between 1971 and 2015 reporting the incidence of bad split and patient age, and/or surgical technique employed, and/or the presence of third molars. These included 22 retrospective cohort studies, six prospective cohort studies, one matched-pair analysis, and one case series. Spearman's rank correlation showed a statistically significant but weak correlation between increasing average age and increasing occurrence of bad splits in 18 studies (ρ=0.229; Pbad split among the different splitting techniques. A meta-analysis pooling the effect sizes of seven cohort studies showed no significant difference in the incidence of bad split between cohorts of patients with third molars present and concomitantly removed during surgery, and patients in whom third molars were removed at least 6 months preoperatively (odds ratio 1.16, 95% confidence interval 0.73-1.85, Z=0.64, P=0.52). In summary, there is no robust evidence to date to show that any risk factor influences the incidence of bad split. Copyright © 2016 International Association of Oral and Maxillofacial Surgeons. Published by Elsevier Ltd. All rights reserved.

  11. Land Surface Temperature Retrieval from MODIS Data by Integrating Regression Models and the Genetic Algorithm in an Arid Region

    Directory of Open Access Journals (Sweden)

    Ji Zhou

    2014-06-01

    Full Text Available The land surface temperature (LST is one of the most important parameters of surface-atmosphere interactions. Methods for retrieving LSTs from satellite remote sensing data are beneficial for modeling hydrological, ecological, agricultural and meteorological processes on Earth’s surface. Many split-window (SW algorithms, which can be applied to satellite sensors with two adjacent thermal channels located in the atmospheric window between 10 μm and 12 μm, require auxiliary atmospheric parameters (e.g., water vapor content. In this research, the Heihe River basin, which is one of the most arid regions in China, is selected as the study area. The Moderate-resolution Imaging Spectroradiometer (MODIS is selected as a test case. The Global Data Assimilation System (GDAS atmospheric profiles of the study area are used to generate the training dataset through radiative transfer simulation. Significant correlations between the atmospheric upwelling radiance in MODIS channel 31 and the other three atmospheric parameters, including the transmittance in channel 31 and the transmittance and upwelling radiance in channel 32, are trained based on the simulation dataset and formulated with three regression models. Next, the genetic algorithm is used to estimate the LST. Validations of the RM-GA method are based on the simulation dataset generated from in situ measured radiosonde profiles and GDAS atmospheric profiles, the in situ measured LSTs, and a pair of daytime and nighttime MOD11A1 products in the study area. The results demonstrate that RM-GA has a good ability to estimate the LSTs directly from the MODIS data without any auxiliary atmospheric parameters. Although this research is for local application in the Heihe River basin, the findings and proposed method can easily be extended to other satellite sensors and regions with arid climates and high elevations.

  12. Lower HVAC Costs | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  13. Increased Light & View | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  14. Condensation Resistance (CR) | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  15. Fact Sheets & Publications | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  16. State Fact Sheets | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  17. State Code Guides | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  18. Low Conductance Spacers | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  19. Energy & Cost Savings | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  20. Provide Natural Light | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  1. Provide Fresh Air | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  2. Air Leakage (AL) | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  3. Research and Implementation of the Practical Texture Synthesis Algorithms

    Institute of Scientific and Technical Information of China (English)

    孙家广; 周毅

    1991-01-01

    How to generate pictures real and esthetic objects is an important subject of computer graphics.The techniques of mapping textures onto the surfaces of an object in the 3D space are efficient approaches for the purpose.We developed and implemented algorithms for generating objects with appearances stone,wood grain,ice lattice,brick,doors and windows on Apollo workstations.All the algorithms have been incorporated into the 3D grometry modelling system (GEMS) developed by the CAD Center of Tsinghua University.This paper emphasizes the wood grain and the ice lattice algorithms.

  4. Windows 95 Beslutningsguide

    DEFF Research Database (Denmark)

    Sørensen, Jens Otto

    1996-01-01

    Mange virksomheder der bruger pc'er står netop nu over for valget: Skal vi fortsætte med DOS/Windows 3.x som operativsystem, eller skal vi skifte til efterfølgeren Windows 95? Skal vi/kan vi skifte successivt, eller skal det være en "alt eller intet beslutning". Hvornår er det rigtige tidspunkt...... at skifte? Denne artikel vil forsøge at give en baggrundsviden om Windows 95, der kan hjælpe virksomhederne igennem denne beslutningsfase....

  5. Gabor windows supported on [-1,1] and compactly supported dual windows

    DEFF Research Database (Denmark)

    Christensen, Ole; Kim, H. O.; Rae Young, Kim

    2010-01-01

    window. More precisely, we show that if b window supported on [-N, N]. Under the additional assumption that g is continuous and only has a finite number of zeros on inverted left perpendicular-1, 1inverted right perpendicular, we...... characterize the frame property of {E(mb)T(n)g}(m,n is an element of Z). As a consequence we obtain easily verifiable criteria for a function g to generate a Gabor frame with a dual window having compact support of prescribed size....

  6. Designing for Windows 8 fundamentals of great design in Windows Store apps

    CERN Document Server

    Schooley, Brent

    2013-01-01

    Designing for Windows 8 is a fast-paced, 150-page primer on the key design concepts you need to create successful Windows 8 apps. This book will help you design a user interface that is both delightful and effective, feels 'right' to your users, and encapsulates a great Windows 8 experience. In this book, you will: Meet the building blocks of solid Windows 8 UI design in a well-designed sample app. Learn how to incorporate key design elements into your apps, such as the app bar, charms and subtle animations from the animation library. Find out how to deliver the core experience that your users

  7. A new fourth-order Fourier-Bessel split-step method for the extended nonlinear Schroedinger equation

    International Nuclear Information System (INIS)

    Nash, Patrick L.

    2008-01-01

    Fourier split-step techniques are often used to compute soliton-like numerical solutions of the nonlinear Schroedinger equation. Here, a new fourth-order implementation of the Fourier split-step algorithm is described for problems possessing azimuthal symmetry in 3 + 1-dimensions. This implementation is based, in part, on a finite difference approximation Δ perpendicular FDA of 1/r (∂)/(∂r) r(∂)/(∂r) that possesses an associated exact unitary representation of e i/2λΔ perpendicular FDA . The matrix elements of this unitary matrix are given by special functions known as the associated Bessel functions. Hence the attribute Fourier-Bessel for the method. The Fourier-Bessel algorithm is shown to be unitary and unconditionally stable. The Fourier-Bessel algorithm is employed to simulate the propagation of a periodic series of short laser pulses through a nonlinear medium. This numerical simulation calculates waveform intensity profiles in a sequence of planes that are transverse to the general propagation direction, and labeled by the cylindrical coordinate z. These profiles exhibit a series of isolated pulses that are offset from the time origin by characteristic times, and provide evidence for a physical effect that may be loosely termed normal mode condensation. Normal mode condensation is consistent with experimentally observed pulse filamentation into a packet of short bursts, which may occur as a result of short, intense irradiation of a medium

  8. KAM Tori Construction Algorithms

    Science.gov (United States)

    Wiesel, W.

    In this paper we evaluate and compare two algorithms for the calculation of KAM tori in Hamiltonian systems. The direct fitting of a torus Fourier series to a numerically integrated trajectory is the first method, while an accelerated finite Fourier transform is the second method. The finite Fourier transform, with Hanning window functions, is by far superior in both computational loading and numerical accuracy. Some thoughts on applications of KAM tori are offered.

  9. Split Malcev algebras

    Indian Academy of Sciences (India)

    project of the Spanish Ministerio de Educación y Ciencia MTM2007-60333. References. [1] Calderón A J, On split Lie algebras with symmetric root systems, Proc. Indian. Acad. Sci (Math. Sci.) 118(2008) 351–356. [2] Calderón A J, On split Lie triple systems, Proc. Indian. Acad. Sci (Math. Sci.) 119(2009). 165–177.

  10. Two-Loop Splitting Amplitudes

    International Nuclear Information System (INIS)

    Bern, Z.

    2004-01-01

    Splitting amplitudes govern the behavior of scattering amplitudes at the momenta of external legs become collinear. In this talk we outline the calculation of two-loop splitting amplitudes via the unitarity sewing method. This method retains the simple factorization properties of light-cone gauge, but avoids the need for prescriptions such as the principal value or Mandelstam-Leibbrandt ones. The encountered loop momentum integrals are then evaluated using integration-by-parts and Lorentz invariance identities. We outline a variety of applications for these splitting amplitudes

  11. Two-loop splitting amplitudes

    International Nuclear Information System (INIS)

    Bern, Z.; Dixon, L.J.; Kosower, D.A.

    2004-01-01

    Splitting amplitudes govern the behavior of scattering amplitudes at the momenta of external legs become collinear. In this talk we outline the calculation of two-loop splitting amplitudes via the unitarity sewing method. This method retains the simple factorization properties of light-cone gauge, but avoids the need for prescriptions such as the principal value or Mandelstam-Leibbrandt ones. The encountered loop momentum integrals are then evaluated using integration-by-parts and Lorentz invariance identities. We outline a variety of applications for these splitting amplitudes

  12. Extraction and Categorisation of User Activity from Windows Restore Points

    Directory of Open Access Journals (Sweden)

    Damir Kahvedzic

    2008-12-01

    Full Text Available The extraction of the user activity is one of the main goals in the analysis of digital evidence. In this paper we present a methodology for extracting this activity by comparing multiple Restore Points found in the Windows XP operating system. The registry copies represent a snapshot of the state of the system at a certain point in time. Differences between them can reveal user activity from one instant to another. The algorithms for comparing the hives and interpreting the results are of high complexity. We develop an approach that takes into account the nature of the investigation and the characteristics of the hives to reduce the complexity of the comparison and result interpretation processes. The approach concentrates on hives that present higher activity and highlights only those differences that are relevant to the investigation. The approach is implemented as a software tool that is able to compare any set of offline hives and categorise the results according to the user needs. The categorisation of the results, in terms of activity will help the investigator in interpreting the results. In this paper we present a general concept of result categorisation to prove its efficiency on Windows XP, but these can be adapted to any Windows versions including the latest versions.  

  13. Combining evolutionary algorithms with oblique decision trees to detect bent-double galaxies

    Science.gov (United States)

    Cantu-Paz, Erick; Kamath, Chandrika

    2000-10-01

    Decision tress have long been popular in classification as they use simple and easy-to-understand tests at each node. Most variants of decision trees test a single attribute at a node, leading to axis- parallel trees, where the test results in a hyperplane which is parallel to one of the dimensions in the attribute space. These trees can be rather large and inaccurate in cases where the concept to be learned is best approximated by oblique hyperplanes. In such cases, it may be more appropriate to use an oblique decision tree, where the decision at each node is a linear combination of the attributes. Oblique decision trees have not gained wide popularity in part due to the complexity of constructing good oblique splits and the tendency of existing splitting algorithms to get stuck in local minima. Several alternatives have been proposed to handle these problems including randomization in conjunction wiht deterministic hill-climbing and the use of simulated annealing. In this paper, we use evolutionary algorithms (EAs) to determine the split. EAs are well suited for this problem because of their global search properties, their tolerance to noisy fitness evaluations, and their scalability to large dimensional search spaces. We demonstrate our technique on a synthetic data set, and then we apply it to a practical problem from astronomy, namely, the classification of galaxies with a bent-double morphology. In addition, we describe our experiences with several split evaluation criteria. Our results suggest that, in some cases, the evolutionary approach is faster and more accurate than existing oblique decision tree algorithms. However, for our astronomical data, the accuracy is not significantly different than the axis-parallel trees.

  14. Kepler Planet Detection Metrics: Window and One-Sigma Depth Functions for Data Release 25

    Science.gov (United States)

    Burke, Christopher J.; Catanzarite, Joseph

    2017-01-01

    This document describes the window and one-sigma depth functions relevant to the Transiting Planet Search (TPS) algorithm in the Kepler pipeline (Jenkins 2002; Jenkins et al. 2017). The window function specifies the fraction of unique orbital ephemeris epochs over which three transits are observable as a function of orbital period. In this context, the epoch and orbital period, together, comprise the ephemeris of an orbiting companion, and ephemerides with the same period are considered equivalent if their epochs differ by an integer multiple of the period. The one-sigma depth function specifies the depth of a signal (in ppm) for a given light curve that results in a one-sigma detection of a transit signature as a function of orbital period when averaged over all unique orbital ephemerides. These planet detection metrics quantify the ability of TPS to detect a transiting planet signature on a star-by-star basis. They are uniquely applicable to a specific Kepler data release, since they are dependent on the details of the light curves searched and the functionality of the TPS algorithm used to perform the search. This document describes the window and one-sigma depth functions relevant to Kepler Data Release 25 (DR25), where the data were processed (Thompson et al. 2016) and searched (Twicken et al. 2016) with the SOC 9.3 pipeline. In Section 4, we describe significant differences from those reported in Kepler Data Release 24 (Burke Seader 2016) and document our verification method.

  15. Concentric Split Flow Filter

    Science.gov (United States)

    Stapleton, Thomas J. (Inventor)

    2015-01-01

    A concentric split flow filter may be configured to remove odor and/or bacteria from pumped air used to collect urine and fecal waste products. For instance, filter may be designed to effectively fill the volume that was previously considered wasted surrounding the transport tube of a waste management system. The concentric split flow filter may be configured to split the air flow, with substantially half of the air flow to be treated traveling through a first bed of filter media and substantially the other half of the air flow to be treated traveling through the second bed of filter media. This split flow design reduces the air velocity by 50%. In this way, the pressure drop of filter may be reduced by as much as a factor of 4 as compare to the conventional design.

  16. Windows with improved energy performances

    DEFF Research Database (Denmark)

    Laustsen, Jacob Birck; Svendsen, Svend

    2003-01-01

    Heat loss through windows represents a considerable part of the total heat loss from houses. However, apart from providing daylight access and view, windows offer a unique potential for solar gain to be exploited during the heating season. Until now valuation of the energy performance of windows...... has primary focused on the heat loss coefficient, U-value. However, as the U-value, especially for the glazing part, has improved considerably during the last years, the total solar energy transmittance, g-value, has become equally important to the total energy performance of windows. Improved energy...... resulted in a window with a positive net energy gain (in short the Net Gain Window), which means that it contributes to the space heating of the building. All improvements are based on existing technology and manufacturing methods. The results from this work show that the energy performances of windows can...

  17. Beginning Windows 8.1

    CERN Document Server

    Halsey, Mike

    2013-01-01

    Windows 8 has been described by Microsoft as its 'boldest' Windows release ever and the 8.1 update enhances the paradigm further. Beginning Windows 8.1 takes you through the new features and helps you get more out of the familiar to reveal the fullest possibilities for this amazing new operating system. You will learn, with non-technical language used throughout, how to get up and running in the new Windows interface, minimize downtime, maximize productivity, and harness the features you never knew existed to take control of your computer and enjoy the peace of mind and excitement that comes w

  18. Distributed Storage Algorithm for Geospatial Image Data Based on Data Access Patterns.

    Directory of Open Access Journals (Sweden)

    Shaoming Pan

    Full Text Available Declustering techniques are widely used in distributed environments to reduce query response time through parallel I/O by splitting large files into several small blocks and then distributing those blocks among multiple storage nodes. Unfortunately, however, many small geospatial image data files cannot be further split for distributed storage. In this paper, we propose a complete theoretical system for the distributed storage of small geospatial image data files based on mining the access patterns of geospatial image data using their historical access log information. First, an algorithm is developed to construct an access correlation matrix based on the analysis of the log information, which reveals the patterns of access to the geospatial image data. Then, a practical heuristic algorithm is developed to determine a reasonable solution based on the access correlation matrix. Finally, a number of comparative experiments are presented, demonstrating that our algorithm displays a higher total parallel access probability than those of other algorithms by approximately 10-15% and that the performance can be further improved by more than 20% by simultaneously applying a copy storage strategy. These experiments show that the algorithm can be applied in distributed environments to help realize parallel I/O and thereby improve system performance.

  19. Distributed Storage Algorithm for Geospatial Image Data Based on Data Access Patterns.

    Science.gov (United States)

    Pan, Shaoming; Li, Yongkai; Xu, Zhengquan; Chong, Yanwen

    2015-01-01

    Declustering techniques are widely used in distributed environments to reduce query response time through parallel I/O by splitting large files into several small blocks and then distributing those blocks among multiple storage nodes. Unfortunately, however, many small geospatial image data files cannot be further split for distributed storage. In this paper, we propose a complete theoretical system for the distributed storage of small geospatial image data files based on mining the access patterns of geospatial image data using their historical access log information. First, an algorithm is developed to construct an access correlation matrix based on the analysis of the log information, which reveals the patterns of access to the geospatial image data. Then, a practical heuristic algorithm is developed to determine a reasonable solution based on the access correlation matrix. Finally, a number of comparative experiments are presented, demonstrating that our algorithm displays a higher total parallel access probability than those of other algorithms by approximately 10-15% and that the performance can be further improved by more than 20% by simultaneously applying a copy storage strategy. These experiments show that the algorithm can be applied in distributed environments to help realize parallel I/O and thereby improve system performance.

  20. Visual merchandising window display

    Directory of Open Access Journals (Sweden)

    Opris (Cas. Stanila M.

    2013-12-01

    Full Text Available Window display plays a major part in the selling strategies; it does not only include the simple display of goods, nowadays it is a form of art, also having the purpose of sustaining the brand image. This article wants to reveal the tools that are essential in creating a fabulous window display. Being a window designer is not an easy job, you have to always think ahead trends, to have a sense of colour, to know how to use light to attract customers in the store after only one glance at the window. The big store window displays are theatre scenes: with expensive backgrounds, special effects and high fashion mannequins. The final role of the displays is to convince customers to enter the store and trigger the purchasing act which is the final goal of the retail activity.

  1. Windows 7 is supported at CERN

    CERN Multimedia

    IT Department

    2010-01-01

    The new version of the Windows operating system - Windows 7 - is now officially supported at CERN. Windows 7 32-bit is now the default operating system for the new computers at CERN. What’s new in Windows 7 Users of Windows XP will find many new features and options. Users of Windows Vista will feel very familiar with one major difference: higher performance and better responsiveness of the operating system. Other enhancements include: refined Aero desktop that makes it easier to navigate between your different application windows; new snapping windows that allows user to resize a window simply by dragging it to the edge of the screen and “pin” that allows grouping and arranging often accessed applications on the taskbar. Windows 7 introduces the new concept of libraries – containers for user files that have links to different local or network folders. By default, users can see four libraries: Documents, Music, Pictures and Videos. These libraries point to the cor...

  2. GA microwave window development

    International Nuclear Information System (INIS)

    Moeller, C.P.; Kasugai, A.; Sakamoto, K.; Takahashi, K.

    1994-10-01

    The GA prototype distributed window was tested in a 32 mm diam. waveguide system at a power density suitable for a MW gyrotron, using the JAERI/Toshiba 110 GHz long pulse internal converter gyrotron in the JAERI test stand. The presence of the untilted distributed window had no adverse effect on the gyrotron operation. A pulse length of 10 times the calculated thermal equilibrium time (1/e time) of 30 msec was reached, and the window passed at least 750 pulses greater than 30 msec and 343 pulses greater than 60 msec. Beyond 100 msec, the window calorimetry reached steady state, allowing the window dissipation to be measured in a single pulse. The measured loss of 4.0% agrees both with the estimated loss, on which the stress calculations are based, and with the attenuation measured at low power in the HE 11 mode. After the end of the tests, the window was examined; no evidence of arcing air coating was found in the part of the window directly illuminated by the microwaves, although there was discoloration in a recess containing an optical diagnostic which outgassed, causing a local discharge to occur in that recess. Finally, there was no failure of the metal-sapphire joints during a total operating time of 50 seconds consisting of pulses longer than 30 msec

  3. Music@Microsoft.Windows: Composing Ambience

    Science.gov (United States)

    Rickert, Thomas

    2010-01-01

    It is well known, of course, that all Windows versions except for 3.1 have a brief (four to six second) piece of music indicating that Windows is booted and ready for use. While the music may indicate Windows has booted, it bears no immediately discernable relation to the various uses we might actually put Windows to--working, gaming,…

  4. Segmentation of pomegranate MR images using spatial fuzzy c-means (SFCM) algorithm

    Science.gov (United States)

    Moradi, Ghobad; Shamsi, Mousa; Sedaaghi, M. H.; Alsharif, M. R.

    2011-10-01

    Segmentation is one of the fundamental issues of image processing and machine vision. It plays a prominent role in a variety of image processing applications. In this paper, one of the most important applications of image processing in MRI segmentation of pomegranate is explored. Pomegranate is a fruit with pharmacological properties such as being anti-viral and anti-cancer. Having a high quality product in hand would be critical factor in its marketing. The internal quality of the product is comprehensively important in the sorting process. The determination of qualitative features cannot be manually made. Therefore, the segmentation of the internal structures of the fruit needs to be performed as accurately as possible in presence of noise. Fuzzy c-means (FCM) algorithm is noise-sensitive and pixels with noise are classified inversely. As a solution, in this paper, the spatial FCM algorithm in pomegranate MR images' segmentation is proposed. The algorithm is performed with setting the spatial neighborhood information in FCM and modification of fuzzy membership function for each class. The segmentation algorithm results on the original and the corrupted Pomegranate MR images by Gaussian, Salt Pepper and Speckle noises show that the SFCM algorithm operates much more significantly than FCM algorithm. Also, after diverse steps of qualitative and quantitative analysis, we have concluded that the SFCM algorithm with 5×5 window size is better than the other windows.

  5. Windows 8 simplified

    CERN Document Server

    McFedries, Paul

    2012-01-01

    The easiest way for visual learners to get started with Windows 8 The popular Simplified series makes visual learning easier than ever, and with more than 360,000 copies sold, previous Windows editions are among the bestselling Visual books. This guide goes straight to the point with easy-to-follow, two-page tutorials for each task. With full-color screen shots and step-by-step directions, it gets beginners up and running on the newest version of Windows right away. Learn to work with the new interface and improved Internet Explorer, manage files, share your computer, and much more. Perfect fo

  6. Rails on Windows

    CERN Document Server

    Hibbs, Curt

    2007-01-01

    It's no secret that the entire Ruby onRails core team uses OS X as their preferreddevelopment environment. Becauseof this, it is very easy to findauthoritative information on the webabout using Rails on OS X. But the truthis that Windows developers using Railsprobably outnumber those using otherplatforms. A Windows development environmentcan be just as productive asany other platform. This is a guide to developing with Rubyon Rails under Windows. It won't teachyou how to write Ruby on Rails web applications,but it will show you what toolsto use and how to set them up to createa complete Rail

  7. Secondary Structure Prediction of Protein using Resilient Back Propagation Learning Algorithm

    Directory of Open Access Journals (Sweden)

    Jyotshna Dongardive

    2015-12-01

    Full Text Available The paper proposes a neural network based approach to predict secondary structure of protein. It uses Multilayer Feed Forward Network (MLFN with resilient back propagation as the learning algorithm. Point Accepted Mutation (PAM is adopted as the encoding scheme and CB396 data set is used for the training and testing of the network. Overall accuracy of the network has been experimentally calculated with different window sizes for the sliding window scheme and by varying the number of units in the hidden layer. The best results were obtained with eleven as the window size and seven as the number of units in the hidden layer.

  8. Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route

    Directory of Open Access Journals (Sweden)

    Mohammad Mirabi

    2016-11-01

    Full Text Available This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.

  9. Windows Home Server users guide

    CERN Document Server

    Edney, Andrew

    2008-01-01

    Windows Home Server brings the idea of centralized storage, backup and computer management out of the enterprise and into the home. Windows Home Server is built for people with multiple computers at home and helps to synchronize them, keep them updated, stream media between them, and back them up centrally. Built on a similar foundation as the Microsoft server operating products, it's essentially Small Business Server for the home.This book details how to install, configure, and use Windows Home Server and explains how to connect to and manage different clients such as Windows XP, Windows Vist

  10. Teach yourself visually Windows 10

    CERN Document Server

    McFedries, Paul

    2015-01-01

    Learn Windows 10 visually with step-by-step instructions Teach Yourself VISUALLY Windows 10 is the visual learner's guide to the latest Windows upgrade. Completely updated to cover all the latest features, this book walks you step-by-step through over 150 essential Windows tasks. Using full color screen shots and clear instruction, you'll learn your way around the interface, set up user accounts, play media files, download photos from your camera, go online, set up email, and much more. You'll even learn how to customize Windows 10 to suit the way you work best, troubleshoot and repair common

  11. No-Wait Flexible Flow Shop Scheduling with Due Windows

    Directory of Open Access Journals (Sweden)

    Rong-Hwa Huang

    2015-01-01

    Full Text Available To improve capacity and reduce processing time, the flow shop with multiprocessors (FSMP system is commonly used in glass, steel, and semiconductor production. No-wait FSMP is a modern production system that responds to periods when zero work is required in process production. The production process must be continuous and uninterrupted. Setup time must also be considered. Just-in-time (JIT production is very popular in industry, and timely delivery is important to customer satisfaction. Therefore, it is essential to consider the time window constraint, which is also very complex. This study focuses on a no-wait FSMP problem with time window constraint. An improved ant colony optimization (ACO, known as ant colony optimization with flexible update (ACOFU, is developed to solve the problem. The results demonstrate that ACOFU is more effective and robust than ACO when applied to small-scale problems. ACOFU has superior solution capacity and robustness when applied to large-scale problems. Therefore, this study concludes that the proposed algorithm ACOFU performs excellently when applied to the scheduling problem discussed in this study.

  12. Split-illumination electron holography

    Energy Technology Data Exchange (ETDEWEB)

    Tanigaki, Toshiaki; Aizawa, Shinji; Suzuki, Takahiro; Park, Hyun Soon [Advanced Science Institute, RIKEN, Hirosawa 2-1, Wako, Saitama 351-0198 (Japan); Inada, Yoshikatsu [Institute of Multidisciplinary Research for Advanced Materials, Tohoku University, Katahira 2-1-1, Sendai 980-8577 (Japan); Matsuda, Tsuyoshi [Japan Science and Technology Agency, Kawaguchi, Saitama 332-0012 (Japan); Taniyama, Akira [Corporate Research and Development Laboratories, Sumitomo Metal Industries, Ltd., Amagasaki, Hyogo 660-0891 (Japan); Shindo, Daisuke [Advanced Science Institute, RIKEN, Hirosawa 2-1, Wako, Saitama 351-0198 (Japan); Institute of Multidisciplinary Research for Advanced Materials, Tohoku University, Katahira 2-1-1, Sendai 980-8577 (Japan); Tonomura, Akira [Advanced Science Institute, RIKEN, Hirosawa 2-1, Wako, Saitama 351-0198 (Japan); Okinawa Institute of Science and Technology, Graduate University, Onna-son, Okinawa 904-0495 (Japan); Central Research Laboratory, Hitachi, Ltd., Hatoyama, Saitama 350-0395 (Japan)

    2012-07-23

    We developed a split-illumination electron holography that uses an electron biprism in the illuminating system and two biprisms (applicable to one biprism) in the imaging system, enabling holographic interference micrographs of regions far from the sample edge to be obtained. Using a condenser biprism, we split an electron wave into two coherent electron waves: one wave is to illuminate an observation area far from the sample edge in the sample plane and the other wave to pass through a vacuum space outside the sample. The split-illumination holography has the potential to greatly expand the breadth of applications of electron holography.

  13. Split-illumination electron holography

    International Nuclear Information System (INIS)

    Tanigaki, Toshiaki; Aizawa, Shinji; Suzuki, Takahiro; Park, Hyun Soon; Inada, Yoshikatsu; Matsuda, Tsuyoshi; Taniyama, Akira; Shindo, Daisuke; Tonomura, Akira

    2012-01-01

    We developed a split-illumination electron holography that uses an electron biprism in the illuminating system and two biprisms (applicable to one biprism) in the imaging system, enabling holographic interference micrographs of regions far from the sample edge to be obtained. Using a condenser biprism, we split an electron wave into two coherent electron waves: one wave is to illuminate an observation area far from the sample edge in the sample plane and the other wave to pass through a vacuum space outside the sample. The split-illumination holography has the potential to greatly expand the breadth of applications of electron holography.

  14. Windows registry forensics advanced digital forensic analysis of the Windows registry

    CERN Document Server

    Carvey, Harlan

    2011-01-01

    Harlan Carvey brings readers an advanced book on Windows Registry - the most difficult part of Windows to analyze in forensics! Windows Registry Forensics provides the background of the Registry to help develop an understanding of the binary structure of Registry hive files. Approaches to live response and analysis are included, and tools and techniques for postmortem analysis are discussed at length. Tools and techniques will be presented that take the analyst beyond the current use of viewers and into real analysis of data contained in the Registry. This book also has a DVD containing tools, instructions and videos.

  15. Joint Transmit Power Allocation and Splitting for SWIPT Aided OFDM-IDMA in Wireless Sensor Networks.

    Science.gov (United States)

    Li, Shanshan; Zhou, Xiaotian; Wang, Cheng-Xiang; Yuan, Dongfeng; Zhang, Wensheng

    2017-07-04

    In this paper, we propose to combine Orthogonal Frequency Division Multiplexing-Interleave Division Multiple Access (OFDM-IDMA) with Simultaneous Wireless Information and Power Transfer (SWIPT), resulting in SWIPT aided OFDM-IDMA scheme for power-limited sensor networks. In the proposed system, the Receive Node (RN) applies Power Splitting (PS) to coordinate the Energy Harvesting (EH) and Information Decoding (ID) process, where the harvested energy is utilized to guarantee the iterative Multi-User Detection (MUD) of IDMA to work under sufficient number of iterations. Our objective is to minimize the total transmit power of Source Node (SN), while satisfying the requirements of both minimum harvested energy and Bit Error Rate (BER) performance from individual receive nodes. We formulate such a problem as a joint power allocation and splitting one, where the iteration number of MUD is also taken into consideration as the key parameter to affect both EH and ID constraints. To solve it, a sub-optimal algorithm is proposed to determine the power profile, PS ratio and iteration number of MUD in an iterative manner. Simulation results verify that the proposed algorithm can provide significant performance improvement.

  16. Active Splitting in Longitudinal Power Systems based on a WAMPC

    Directory of Open Access Journals (Sweden)

    Felipe Arraño-Vargas

    2017-12-01

    Full Text Available This paper proposes an active splitting scheme especially suitable for longitudinal power systems (LPS. The proposed scheme is based on a modified out-of-step (OOS algorithm combined with an angle difference method using synchrophasor measurements. The remedial actions are based on the detection of possible loss of synchronism due to severe disturbances. The scheme was tested on a detailed dynamic model of the Central Interconnected System of Chile, a good example of extreme LPS. Obtained results show that remedial actions taken by the proposed protection scheme are able to avoid the total collapse of the system during critical contingencies.

  17. Medical X-ray Image Hierarchical Classification Using a Merging and Splitting Scheme in Feature Space.

    Science.gov (United States)

    Fesharaki, Nooshin Jafari; Pourghassem, Hossein

    2013-07-01

    Due to the daily mass production and the widespread variation of medical X-ray images, it is necessary to classify these for searching and retrieving proposes, especially for content-based medical image retrieval systems. In this paper, a medical X-ray image hierarchical classification structure based on a novel merging and splitting scheme and using shape and texture features is proposed. In the first level of the proposed structure, to improve the classification performance, similar classes with regard to shape contents are grouped based on merging measures and shape features into the general overlapped classes. In the next levels of this structure, the overlapped classes split in smaller classes based on the classification performance of combination of shape and texture features or texture features only. Ultimately, in the last levels, this procedure is also continued forming all the classes, separately. Moreover, to optimize the feature vector in the proposed structure, we use orthogonal forward selection algorithm according to Mahalanobis class separability measure as a feature selection and reduction algorithm. In other words, according to the complexity and inter-class distance of each class, a sub-space of the feature space is selected in each level and then a supervised merging and splitting scheme is applied to form the hierarchical classification. The proposed structure is evaluated on a database consisting of 2158 medical X-ray images of 18 classes (IMAGECLEF 2005 database) and accuracy rate of 93.6% in the last level of the hierarchical structure for an 18-class classification problem is obtained.

  18. Matching-pursuit/split-operator Fourier-transform simulations of nonadiabatic quantum dynamics

    Science.gov (United States)

    Wu, Yinghua; Herman, Michael F.; Batista, Victor S.

    2005-03-01

    A rigorous and practical approach for simulations of nonadiabatic quantum dynamics is introduced. The algorithm involves a natural extension of the matching-pursuit/split-operator Fourier-transform (MP/SOFT) method [Y. Wu and V. S. Batista, J. Chem. Phys. 121, 1676 (2004)] recently developed for simulations of adiabatic quantum dynamics in multidimensional systems. The MP/SOFT propagation scheme, extended to nonadiabatic dynamics, recursively applies the time-evolution operator as defined by the standard perturbation expansion to first-, or second-order, accuracy. The expansion is implemented in dynamically adaptive coherent-state representations, generated by an approach that combines the matching-pursuit algorithm with a gradient-based optimization method. The accuracy and efficiency of the resulting propagation method are demonstrated as applied to the canonical model systems introduced by Tully for testing simulations of dual curve-crossing nonadiabatic dynamics.

  19. Exact and Heuristic Algorithms for Runway Scheduling

    Science.gov (United States)

    Malik, Waqar A.; Jung, Yoon C.

    2016-01-01

    This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.

  20. Window observers for linear systems

    Directory of Open Access Journals (Sweden)

    Utkin Vadim

    2000-01-01

    Full Text Available Given a linear system x ˙ = A x + B u with output y = C x and a window function ω ( t , i.e., ∀ t , ω ( t ∈ {0,1 }, and assuming that the window function is Lebesgue measurable, we refer to the following observer, x ˆ = A x + B u + ω ( t L C ( x − x ˆ as a window observer. The stability issue is treated in this paper. It is proven that for linear time-invariant systems, the window observer can be stabilized by an appropriate design under a very mild condition on the window functions, albeit for linear time-varying system, some regularity of the window functions is required to achieve observer designs with the asymptotic stability. The corresponding design methods are developed. An example is included to illustrate the possible applications

  1. Lagrangian duality applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian; Larsen, Jesper; Madsen, Oli B.G.

    2006-01-01

    This paper considers the vehicle routing problem with time windows, where the service of each customer must start within a specified time interval. We consider the Lagrangian relaxation of the constraint set requiring that each customer must be served by exactly one vehicle yielding a constrained...... respectively, which to date are the largest problems ever solved to optimality. We have implemented the LBCP algorithm using the ABACUS open-source framework for solving mixed-integer linear-programs by branch, cut, and price....

  2. Window Selection Tool | Efficient Windows Collaborative

    Science.gov (United States)

    Louisville LA Lake Charles LA New Orleans LA Shreveport MA Boston MD Baltimore ME Portland MI Detroit MI Window Selection Tool will take you through a series of design conditions pertaining to your design and

  3. The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach - Technical Report

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

  4. Color Wheel Windows

    Science.gov (United States)

    Leonard, Stephanie

    2012-01-01

    In this article, the author describes a painting and drawing lesson which was inspired by the beautiful circular windows found in cathedrals and churches (also known as "rose windows"). This two-week lesson would reinforce both the concept of symmetry and students' understanding of the color wheel. (Contains 1 online resource.)

  5. VIDEO DENOISING USING SWITCHING ADAPTIVE DECISION BASED ALGORITHM WITH ROBUST MOTION ESTIMATION TECHNIQUE

    Directory of Open Access Journals (Sweden)

    V. Jayaraj

    2010-08-01

    Full Text Available A Non-linear adaptive decision based algorithm with robust motion estimation technique is proposed for removal of impulse noise, Gaussian noise and mixed noise (impulse and Gaussian with edge and fine detail preservation in images and videos. The algorithm includes detection of corrupted pixels and the estimation of values for replacing the corrupted pixels. The main advantage of the proposed algorithm is that an appropriate filter is used for replacing the corrupted pixel based on the estimation of the noise variance present in the filtering window. This leads to reduced blurring and better fine detail preservation even at the high mixed noise density. It performs both spatial and temporal filtering for removal of the noises in the filter window of the videos. The Improved Cross Diamond Search Motion Estimation technique uses Least Median Square as a cost function, which shows improved performance than other motion estimation techniques with existing cost functions. The results show that the proposed algorithm outperforms the other algorithms in the visual point of view and in Peak Signal to Noise Ratio, Mean Square Error and Image Enhancement Factor.

  6. Cool covered sky-splitting spectrum-splitting FK

    Energy Technology Data Exchange (ETDEWEB)

    Mohedano, Rubén; Chaves, Julio; Falicoff, Waqidi; Hernandez, Maikel; Sorgato, Simone [LPI, Altadena, CA, USA and Madrid (Spain); Miñano, Juan C.; Benitez, Pablo [LPI, Altadena, CA, USA and Madrid, Spain and Universidad Politécnica de Madrid (UPM), Madrid (Spain); Buljan, Marina [Universidad Politécnica de Madrid (UPM), Madrid (Spain)

    2014-09-26

    Placing a plane mirror between the primary lens and the receiver in a Fresnel Köhler (FK) concentrator gives birth to a quite different CPV system where all the high-tech components sit on a common plane, that of the primary lens panels. The idea enables not only a thinner device (a half of the original) but also a low cost 1-step manufacturing process for the optics, automatic alignment of primary and secondary lenses, and cell/wiring protection. The concept is also compatible with two different techniques to increase the module efficiency: spectrum splitting between a 3J and a BPC Silicon cell for better usage of Direct Normal Irradiance DNI, and sky splitting to harvest the energy of the diffuse radiation and higher energy production throughout the year. Simple calculations forecast the module would convert 45% of the DNI into electricity.

  7. Bad split during bilateral sagittal split osteotomy of the mandible with separators: a retrospective study of 427 patients.

    Science.gov (United States)

    Mensink, Gertjan; Verweij, Jop P; Frank, Michael D; Eelco Bergsma, J; Richard van Merkesteyn, J P

    2013-09-01

    An unfavourable fracture, known as a bad split, is a common operative complication in bilateral sagittal split osteotomy (BSSO). The reported incidence ranges from 0.5 to 5.5%/site. Since 1994 we have used sagittal splitters and separators instead of chisels for BSSO in our clinic in an attempt to prevent postoperative hypoaesthesia. Theoretically an increased percentage of bad splits could be expected with this technique. In this retrospective study we aimed to find out the incidence of bad splits associated with BSSO done with splitters and separators. We also assessed the risk factors for bad splits. The study group comprised 427 consecutive patients among whom the incidence of bad splits was 2.0%/site, which is well within the reported range. The only predictive factor for a bad split was the removal of third molars at the same time as BSSO. There was no significant association between bad splits and age, sex, class of occlusion, or the experience of the surgeon. We think that doing a BSSO with splitters and separators instead of chisels does not increase the risk of a bad split, and is therefore safe with predictable results. Copyright © 2012 The British Association of Oral and Maxillofacial Surgeons. Published by Elsevier Ltd. All rights reserved.

  8. A Novel Generic Ball Recognition Algorithm Based on Omnidirectional Vision for Soccer Robots

    Directory of Open Access Journals (Sweden)

    Hui Zhang

    2013-11-01

    Full Text Available It is significant for the final goal of RoboCup to realize the recognition of generic balls for soccer robots. In this paper, a novel generic ball recognition algorithm based on omnidirectional vision is proposed by combining the modified Haar-like features and AdaBoost learning algorithm. The algorithm is divided into offline training and online recognition. During the phase of offline training, numerous sub-images are acquired from various panoramic images, including generic balls, and then the modified Haar-like features are extracted from them and used as the input of the AdaBoost learning algorithm to obtain a classifier. During the phase of online recognition, and according to the imaging characteristics of our omnidirectional vision system, rectangular windows are defined to search for the generic ball along the rotary and radial directions in the panoramic image, and the learned classifier is used to judge whether a ball is included in the window. After the ball has been recognized globally, ball tracking is realized by integrating a ball velocity estimation algorithm to reduce the computational cost. The experimental results show that good performance can be achieved using our algorithm, and that the generic ball can be recognized and tracked effectively.

  9. Adaptive Liquid Crystal Windows

    Energy Technology Data Exchange (ETDEWEB)

    Taheri, Bahman; Bodnar, Volodymyr

    2011-12-31

    Energy consumption by private and commercial sectors in the U.S. has steadily grown over the last decade. The uncertainty in future availability of imported oil, on which the energy consumption relies strongly, resulted in a dramatic increase in the cost of energy. About 20% of this consumption are used to heat and cool houses and commercial buildings. To reduce dependence on the foreign oil and cut down emission of greenhouse gases, it is necessary to eliminate losses and reduce total energy consumption by buildings. To achieve this goal it is necessary to redefine the role of the conventional windows. At a minimum, windows should stop being a source for energy loss. Ideally, windows should become a source of energy, providing net gain to reduce energy used to heat and cool homes. It is possible to have a net energy gain from a window if its light transmission can be dynamically altered, ideally electronically without the need of operator assistance, providing optimal control of the solar gain that varies with season and climate in the U.S. In addition, the window must not require power from the building for operation. Resolution of this problem is a societal challenge and of national interest and will have a broad global impact. For this purpose, the year-round, allclimate window solution to provide an electronically variable solar heat gain coefficient (SHGC) with a wide dynamic range is needed. AlphaMicron, Inc. (AMI) developed and manufactured 1ft × 1ft prototype panels for the world’s first auto-adjusting Adaptive Liquid Crystal Windows (ALCWs) that can operate from sunlight without the need for external power source and demonstrate an electronically adjustable SHGC. This novel windows are based on AlphaMicron’s patented e-Tint® technology, a guesthost liquid crystal system implemented on flexible, optically clear plastic films. This technology is suitable both for OEM and aftermarket (retro-fitting) lamination to new and existing windows. Low level of

  10. Charge Transfer Mechanism in Titanium-Doped Microporous Silica for Photocatalytic Water-Splitting Applications

    Directory of Open Access Journals (Sweden)

    Wendi Sapp

    2016-02-01

    Full Text Available Solar energy conversion into chemical form is possible using artificial means. One example of a highly-efficient fuel is solar energy used to split water into oxygen and hydrogen. Efficient photocatalytic water-splitting remains an open challenge for researchers across the globe. Despite significant progress, several aspects of the reaction, including the charge transfer mechanism, are not fully clear. Density functional theory combined with density matrix equations of motion were used to identify and characterize the charge transfer mechanism involved in the dissociation of water. A simulated porous silica substrate, using periodic boundary conditions, with Ti4+ ions embedded on the inner pore wall was found to contain electron and hole trap states that could facilitate a chemical reaction. A trap state was located within the silica substrate that lengthened relaxation time, which may favor a chemical reaction. A chemical reaction would have to occur within the window of photoexcitation; therefore, the existence of a trapping state may encourage a chemical reaction. This provides evidence that the silica substrate plays an integral part in the electron/hole dynamics of the system, leading to the conclusion that both components (photoactive materials and support of heterogeneous catalytic systems are important in optimization of catalytic efficiency.

  11. A control-oriented simulation model of a power-split hybrid electric vehicle

    International Nuclear Information System (INIS)

    Cipek, Mihael; Pavković, Danijel; Petrić, Joško

    2013-01-01

    Highlights: ► A simulation model of a two mode power-split hybrid electric vehicle (HEV) is proposed. ► Modeling the energy losses in the HEV transmission components are presented. ► The control optimization model implementation aspects are discussed. -- Abstract: A simulation model of a two mode power-split hybrid electric vehicle (HEV) is proposed in this paper for the purpose of HEV dynamics analysis and control system design. The bond graph methodology is used to model dominant dynamic effects of the mechanical part of the HEV transmission. Simple quasi-static battery model, the environment model, the tire and the power losses model of a vehicle are included, as well. A low-level electric generator speed control loop is designed, which includes a PI controller tuned according to the symmetrical optimum tuning procedure. Finally, off-line optimization by conjugate gradient-based BPTT-like optimal control algorithm, which is based on the presented mathematical model, is also given in the paper.

  12. National Fenestration Rating Council (NFRC) | Efficient Windows

    Science.gov (United States)

    Collaborative Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring

  13. Experimental optimization of a direct injection homogeneous charge compression ignition gasoline engine using split injections with fully automated microgenetic algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Canakci, M. [Kocaeli Univ., Izmit (Turkey); Reitz, R.D. [Wisconsin Univ., Dept. of Mechanical Engineering, Madison, WI (United States)

    2003-03-01

    Homogeneous charge compression ignition (HCCI) is receiving attention as a new low-emission engine concept. Little is known about the optimal operating conditions for this engine operation mode. Combustion under homogeneous, low equivalence ratio conditions results in modest temperature combustion products, containing very low concentrations of NO{sub x} and particulate matter (PM) as well as providing high thermal efficiency. However, this combustion mode can produce higher HC and CO emissions than those of conventional engines. An electronically controlled Caterpillar single-cylinder oil test engine (SCOTE), originally designed for heavy-duty diesel applications, was converted to an HCCI direct injection (DI) gasoline engine. The engine features an electronically controlled low-pressure direct injection gasoline (DI-G) injector with a 60 deg spray angle that is capable of multiple injections. The use of double injection was explored for emission control and the engine was optimized using fully automated experiments and a microgenetic algorithm optimization code. The variables changed during the optimization include the intake air temperature, start of injection timing and the split injection parameters (per cent mass of fuel in each injection, dwell between the pulses). The engine performance and emissions were determined at 700 r/min with a constant fuel flowrate at 10 MPa fuel injection pressure. The results show that significant emissions reductions are possible with the use of optimal injection strategies. (Author)

  14. U-Factor (U-value) | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  15. Windowing of THz time-domain spectroscopy signals: A study based on lactose

    Science.gov (United States)

    Vázquez-Cabo, José; Chamorro-Posada, Pedro; Fraile-Peláez, Francisco Javier; Rubiños-López, Óscar; López-Santos, José María; Martín-Ramos, Pablo

    2016-05-01

    Time-domain spectroscopy has established itself as a reference method for determining material parameters in the terahertz spectral range. This procedure requires the processing of the measured time-domain signals in order to estimate the spectral data. In this work, we present a thorough study of the properties of the signal windowing, a step previous to the parameter extraction algorithm, that permits to improve the accuracy of the results. Lactose has been used as sample material in the study.

  16. Right-to-left-shunt detected by c-TCD using the orbital window in comparison with temporal bone windows.

    Science.gov (United States)

    Kobayashi, Kazuto; Kimura, Kazumi; Iguchi, Yasuyuki; Sakai, Kenichirou; Aoki, Junya; Iwanaga, Takeshi; Shibazaki, Kensaku

    2012-01-01

    There have been some reports on right-to-left shunt as a cause of cryptogenic stroke. Although contrast transcranial Doppler (c-TCD) can detect RLS, an insufficient temporal window has occasionally restricted its applicability. Thus, we compared the rates of detecting RLS among temporal windows for the middle cerebral arteries (MCAs) and the orbital window for the internal carotid artery (ICA) on c-TCD. We used c-TCD to detect RLS in patients with suspected ischemic stroke. We enrolled patients who had both sufficient bilateral temporal windows for MCAs and a right orbital window for ICA and performed c-TCD using all three windows simultaneously. We enrolled 106 consecutive patients and identified microembolic signals (MES) in 30 (28%) of them. Among these 30 patients, 15 had MES from all 3 windows. When these 30 patients were defined as being positive for RLS, the rates of detection were 67%, 73%, and 80% from the right temporal, left temporal, and right orbital windows, respectively (P= .795). The right orbital window as well as the temporal window for c-TCD could detect RLS. Insonation from the orbital window should be useful for patients who lack temporal windows. Copyright © 2010 by the American Society of Neuroimaging.

  17. Innovative wedge axe in making split firewood

    International Nuclear Information System (INIS)

    Mutikainen, A.

    1998-01-01

    Interteam Oy, a company located in Espoo, has developed a new method for making split firewood. The tools on which the patented System Logmatic are based are wedge axe and cylindrical splitting-carrying frame. The equipment costs about 495 FIM. The block of wood to be split is placed inside the upright carrying frame and split in a series of splitting actions using the innovative wedge axe. The finished split firewood remains in the carrying frame, which (as its name indicates) also serves as the means for carrying the firewood. This innovative wedge-axe method was compared with the conventional splitting of wood using an axe (Fiskars -handy 1400 splitting axe costing about 200 FIM) in a study conducted at TTS-Institute. There were eight test subjects involved in the study. In the case of the wedge-axe method, handling of the blocks to be split and of the finished firewood was a little quicker, but in actual splitting it was a little slower than the conventional axe method. The average productivity of splitting the wood and of the work stages related to it was about 0.4 m 3 per effective hour in both methods. The methods were also equivalent of one another in terms of the load imposed by the work when measured in terms of the heart rate. As regards work safety, the wedge-axe method was superior to the conventional method, but the continuous striking action and jolting transmitted to the arms were unpleasant (orig.)

  18. An Enhanced Satellite-Based Algorithm for Detecting and Tracking Dust Outbreaks by Means of SEVIRI Data

    Directory of Open Access Journals (Sweden)

    Francesco Marchese

    2017-05-01

    Full Text Available Dust outbreaks are meteorological phenomena of great interest for scientists and authorities (because of their impact on the climate, environment, and human activities, which may be detected, monitored, and characterized from space using different methods and procedures. Among the recent dust detection algorithms, the RSTDUST multi-temporal technique has provided good results in different geographic areas (e.g., Mediterranean basin; Arabian Peninsula, exhibiting a better performance than traditional split window methods, in spite of some limitations. In this study, we present an optimized configuration of this technique, which better exploits data provided by Spinning Enhanced Visible and Infrared Imager (SEVIRI aboard Meteosat Second Generation (MSG satellites to address those issues (e.g., sensitivity reduction over arid and semi-arid regions; dependence on some meteorological clouds. Three massive dust events affecting Europe and the Mediterranean basin in May 2008/2010 are analysed in this work, using information provided by some independent and well-established aerosol products to assess the achieved results. The study shows that the proposed algorithm, christened eRSTDUST (i.e., enhanced RSTDUST, which provides qualitative information about dust outbreaks, is capable of increasing the trade-off between reliability and sensitivity. The results encourage further experimentations of this method in other periods of the year, also exploiting data provided by different satellite sensors, for better evaluating the advantages arising from the use of this dust detection technique in operational scenarios.

  19. TMD splitting functions in kT factorization. The real contribution to the gluon-to-gluon splitting

    International Nuclear Information System (INIS)

    Hentschinski, M.; Kusina, A.; Kutak, K.; Serino, M.

    2018-01-01

    We calculate the transverse momentum dependent gluon-to-gluon splitting function within k T -factorization, generalizing the framework employed in the calculation of the quark splitting functions in Hautmann et al. (Nucl Phys B 865:54-66, arXiv:1205.1759, 2012), Gituliar et al. (JHEP 01:181, arXiv:1511.08439, 2016), Hentschinski et al. (Phys Rev D 94(11):114013, arXiv:1607.01507, 2016) and demonstrate at the same time the consistency of the extended formalism with previous results. While existing versions of k T factorized evolution equations contain already a gluon-to-gluon splitting function i.e. the leading order Balitsky-Fadin-Kuraev-Lipatov (BFKL) kernel or the Ciafaloni-Catani-Fiorani-Marchesini (CCFM) kernel, the obtained splitting function has the important property that it reduces both to the leading order BFKL kernel in the high energy limit, to the Dokshitzer-Gribov-Lipatov-Altarelli-Parisi (DGLAP) gluon-to-gluon splitting function in the collinear limit as well as to the CCFM kernel in the soft limit. At the same time we demonstrate that this splitting kernel can be obtained from a direct calculation of the QCD Feynman diagrams, based on a combined implementation of the Curci-Furmanski-Petronzio formalism for the calculation of the collinear splitting functions and the framework of high energy factorization. (orig.)

  20. Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2014-06-01

    Full Text Available This study aims to solve a Vehicle Routing Problem with Time Windows and Speed Limits (VRPTWSL, which has received considerable attention in recent years. The vehicle routing problem with time windows is an extension of the well-known Vehicle Routing Problem (VRP and involves a fleet of vehicles set of from a depot to serve a number of customers at different geographic locations with various demands within specific time and speed limits before returning to the depot eventually. To solve the problem, an efficient Saving Method-Max Min Ant System (Saving-MMAS with Local Search algorithm is applied. Using minimization of the total transportation costs as the objective of the extension VRPTWSL, a mathematic model is constructed. Finally, the Saving-MMAS algorithms indicated the good quality of the method in this problem.

  1. Linear segmentation algorithm for detecting layer boundary with lidar.

    Science.gov (United States)

    Mao, Feiyue; Gong, Wei; Logan, Timothy

    2013-11-04

    The automatic detection of aerosol- and cloud-layer boundary (base and top) is important in atmospheric lidar data processing, because the boundary information is not only useful for environment and climate studies, but can also be used as input for further data processing. Previous methods have demonstrated limitations in defining the base and top, window-size setting, and have neglected the in-layer attenuation. To overcome these limitations, we present a new layer detection scheme for up-looking lidars based on linear segmentation with a reasonable threshold setting, boundary selecting, and false positive removing strategies. Preliminary results from both real and simulated data show that this algorithm cannot only detect the layer-base as accurate as the simple multi-scale method, but can also detect the layer-top more accurately than that of the simple multi-scale method. Our algorithm can be directly applied to uncalibrated data without requiring any additional measurements or window size selections.

  2. Hybrid window layer for photovoltaic cells

    Science.gov (United States)

    Deng, Xunming

    2010-02-23

    A novel photovoltaic solar cell and method of making the same are disclosed. The solar cell includes: at least one absorber layer which could either be a lightly doped layer or an undoped layer, and at least a doped window-layers which comprise at least two sub-window-layers. The first sub-window-layer, which is next to the absorber-layer, is deposited to form desirable junction with the absorber-layer. The second sub-window-layer, which is next to the first sub-window-layer, but not in direct contact with the absorber-layer, is deposited in order to have transmission higher than the first-sub-window-layer.

  3. Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

    Directory of Open Access Journals (Sweden)

    Rafael Grosso

    2018-01-01

    Full Text Available The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

  4. ANALYSING THE EFFECTS OF DIFFERENT LAND COVER TYPES ON LAND SURFACE TEMPERATURE USING SATELLITE DATA

    Directory of Open Access Journals (Sweden)

    A. Şekertekin

    2015-12-01

    Full Text Available Monitoring Land Surface Temperature (LST via remote sensing images is one of the most important contributions to climatology. LST is an important parameter governing the energy balance on the Earth and it also helps us to understand the behavior of urban heat islands. There are lots of algorithms to obtain LST by remote sensing techniques. The most commonly used algorithms are split-window algorithm, temperature/emissivity separation method, mono-window algorithm and single channel method. In this research, mono window algorithm was implemented to Landsat 5 TM image acquired on 28.08.2011. Besides, meteorological data such as humidity and temperature are used in the algorithm. Moreover, high resolution Geoeye-1 and Worldview-2 images acquired on 29.08.2011 and 12.07.2013 respectively were used to investigate the relationships between LST and land cover type. As a result of the analyses, area with vegetation cover has approximately 5 ºC lower temperatures than the city center and arid land., LST values change about 10 ºC in the city center because of different surface properties such as reinforced concrete construction, green zones and sandbank. The temperature around some places in thermal power plant region (ÇATES and ZETES Çatalağzı, is about 5 ºC higher than city center. Sandbank and agricultural areas have highest temperature due to the land cover structure.

  5. Analysing the Effects of Different Land Cover Types on Land Surface Temperature Using Satellite Data

    Science.gov (United States)

    Şekertekin, A.; Kutoglu, Ş. H.; Kaya, S.; Marangoz, A. M.

    2015-12-01

    Monitoring Land Surface Temperature (LST) via remote sensing images is one of the most important contributions to climatology. LST is an important parameter governing the energy balance on the Earth and it also helps us to understand the behavior of urban heat islands. There are lots of algorithms to obtain LST by remote sensing techniques. The most commonly used algorithms are split-window algorithm, temperature/emissivity separation method, mono-window algorithm and single channel method. In this research, mono window algorithm was implemented to Landsat 5 TM image acquired on 28.08.2011. Besides, meteorological data such as humidity and temperature are used in the algorithm. Moreover, high resolution Geoeye-1 and Worldview-2 images acquired on 29.08.2011 and 12.07.2013 respectively were used to investigate the relationships between LST and land cover type. As a result of the analyses, area with vegetation cover has approximately 5 ºC lower temperatures than the city center and arid land., LST values change about 10 ºC in the city center because of different surface properties such as reinforced concrete construction, green zones and sandbank. The temperature around some places in thermal power plant region (ÇATES and ZETES) Çatalağzı, is about 5 ºC higher than city center. Sandbank and agricultural areas have highest temperature due to the land cover structure.

  6. Urban pattern: Layout design by hierarchical domain splitting

    KAUST Repository

    Yang, Yongliang; Wang, Jun; Vouga, Etienne; Wonka, Peter

    2013-01-01

    We present a framework for generating street networks and parcel layouts. Our goal is the generation of high-quality layouts that can be used for urban planning and virtual environments. We propose a solution based on hierarchical domain splitting using two splitting types: streamline-based splitting, which splits a region along one or multiple streamlines of a cross field, and template-based splitting, which warps pre-designed templates to a region and uses the interior geometry of the template as the splitting lines. We combine these two splitting approaches into a hierarchical framework, providing automatic and interactive tools to explore the design space.

  7. Urban pattern: Layout design by hierarchical domain splitting

    KAUST Repository

    Yang, Yongliang

    2013-11-06

    We present a framework for generating street networks and parcel layouts. Our goal is the generation of high-quality layouts that can be used for urban planning and virtual environments. We propose a solution based on hierarchical domain splitting using two splitting types: streamline-based splitting, which splits a region along one or multiple streamlines of a cross field, and template-based splitting, which warps pre-designed templates to a region and uses the interior geometry of the template as the splitting lines. We combine these two splitting approaches into a hierarchical framework, providing automatic and interactive tools to explore the design space.

  8. A homology sound-based algorithm for speech signal interference

    Science.gov (United States)

    Jiang, Yi-jiao; Chen, Hou-jin; Li, Ju-peng; Zhang, Zhan-song

    2015-12-01

    Aiming at secure analog speech communication, a homology sound-based algorithm for speech signal interference is proposed in this paper. We first split speech signal into phonetic fragments by a short-term energy method and establish an interference noise cache library with the phonetic fragments. Then we implement the homology sound interference by mixing the randomly selected interferential fragments and the original speech in real time. The computer simulation results indicated that the interference produced by this algorithm has advantages of real time, randomness, and high correlation with the original signal, comparing with the traditional noise interference methods such as white noise interference. After further studies, the proposed algorithm may be readily used in secure speech communication.

  9. Windows PowerShell 20 Bible

    CERN Document Server

    Lee, Thomas; Schill, Mark E; Tanasovski, Tome

    2011-01-01

    Here's the complete guide to Windows PowerShell 2.0 for administrators and developers Windows PowerShell is Microsoft's next-generation scripting and automation language. This comprehensive volume provides the background that IT administrators and developers need in order to start using PowerShell automation in exciting new ways. It explains what PowerShell is, how to use the language, and specific ways to apply PowerShell in various technologies. Windows PowerShell is Microsoft's standard automation tool and something that every Windows administrator will eventually have to understand; this b

  10. Mastering Microsoft Windows Server 2008 R2

    CERN Document Server

    Minasi, Mark; Finn, Aidan

    2010-01-01

    The one book you absolutely need to get up and running with Windows Server 2008 R2. One of the world's leading Windows authorities and top-selling author Mark Minasi explores every nook and cranny of the latest version of Microsoft's flagship network operating system, Windows Server 2008 R2, giving you the most in-depth coverage in any book on the market.: Focuses on Windows Windows Server 2008 R2, the newest version of Microsoft's Windows' server line of operating system, and the ideal server for new Windows 7 clients; Author Mark Minasi is one of the world's leading Windows authorities and h

  11. Schematic Window Methodology Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The aim of this IRAD is to produce a generic launch window analyzer (SWM) that allows for large-scale rapid analysis of a launch window and orbit design trade space....

  12. Windows 7 resource kit

    CERN Document Server

    Northrup, Tony; Honeycutt, Jerry; Wilson, Ed

    2009-01-01

    In-depth and comprehensive, this RESOURCE KIT delivers the information you need to administer your Windows 7 system. You get authoritative technical guidance from those who know the technology best-Microsoft Most Valuable Professionals (MVPs) and the Windows 7 product team-along with essential scripts and resources. In addition, "Direct from the Source" sidebars offer deep insights and troubleshooting tips from the Windows 7 team. Get expert guidance on how to: Use Microsoft Deployment Toolkit best practices and tools. Plan user-state migration and test application compatibility.

  13. The Efficient Windows Collaborative

    Energy Technology Data Exchange (ETDEWEB)

    Petermann, Nils

    2006-03-31

    The Efficient Windows Collaborative (EWC) is a coalition of manufacturers, component suppliers, government agencies, research institutions, and others who partner to expand the market for energy efficient window products. Funded through a cooperative agreement with the U.S. Department of Energy, the EWC provides education, communication and outreach in order to transform the residential window market to 70% energy efficient products by 2005. Implementation of the EWC is managed by the Alliance to Save Energy, with support from the University of Minnesota and Lawrence Berkeley National Laboratory.

  14. Autopiquer - a Robust and Reliable Peak Detection Algorithm for Mass Spectrometry.

    Science.gov (United States)

    Kilgour, David P A; Hughes, Sam; Kilgour, Samantha L; Mackay, C Logan; Palmblad, Magnus; Tran, Bao Quoc; Goo, Young Ah; Ernst, Robert K; Clarke, David J; Goodlett, David R

    2017-02-01

    We present a simple algorithm for robust and unsupervised peak detection by determining a noise threshold in isotopically resolved mass spectrometry data. Solving this problem will greatly reduce the subjective and time-consuming manual picking of mass spectral peaks and so will prove beneficial in many research applications. The Autopiquer approach uses autocorrelation to test for the presence of (isotopic) structure in overlapping windows across the spectrum. Within each window, a noise threshold is optimized to remove the most unstructured data, whilst keeping as much of the (isotopic) structure as possible. This algorithm has been successfully demonstrated for both peak detection and spectral compression on data from many different classes of mass spectrometer and for different sample types, and this approach should also be extendible to other types of data that contain regularly spaced discrete peaks. Graphical Abstract ᅟ.

  15. Relationship between mandibular anatomy and the occurrence of a bad split upon sagittal split osteotomy.

    Science.gov (United States)

    Aarabi, Mohammadali; Tabrizi, Reza; Hekmat, Mina; Shahidi, Shoaleh; Puzesh, Ayatollah

    2014-12-01

    A bad split is a troublesome complication of the sagittal split osteotomy (SSO). The aim of this study was to evaluate the relation between the occurrence of a bad split and mandibular anatomy in SSO using cone-beam computed tomography. The authors designed a cohort retrospective study. Forty-eight patients (96 SSO sites) were studied. The buccolingual thickness of the retromandibular area (BLR), the buccolingual thickness of the ramus at the level of the lingula (BLTR), the height of the mandible from the alveolar crest to the inferior border of the mandible, (ACIB), the distance between the sigmoid notch and the inferior border of the mandible (SIBM), and the anteroposterior width of the ramus (APWR) were measured. The independent t test was applied to compare anatomic measurements between the group with and the group without bad splits. The receiver operating characteristic (ROC) test was used to find a cutoff point in anatomic size for various parts of the mandible related to the occurrence of bad splits. The mean SIBM was 47.05±6.33 mm in group 1 (with bad splits) versus 40.66±2.44 mm in group 2 (without bad splits; P=.01). The mean BLTR was 5.74±1.11 mm in group 1 versus 3.19±0.55 mm in group 2 (P=.04). The mean BLR was 14.98±2.78 mm in group 1 versus 11.21±1.29 mm in group 2 (P=.001). No statistically significant difference was found for APWR and ACIB between the 2 groups. The ROC test showed cutoff points of 10.17 mm for BLR, 36.69 mm for SIBM, and 4.06 mm for BLTR. This study showed that certain mandibular anatomic differences can increase the risk of a bad split during SSO surgery. Copyright © 2014 American Association of Oral and Maxillofacial Surgeons. Published by Elsevier Inc. All rights reserved.

  16. Composition of 12-18th century window glass in Belgium: Non-figurative windows in secular buildings and stained-glass windows in religious buildings

    International Nuclear Information System (INIS)

    Schalm, Olivier; Janssens, Koen; Wouters, Hilde; Caluwe, Danielle

    2007-01-01

    A set of ca. 500 window glass fragments originating from different historical sites in Belgium and covering the period 12 th -18 th century was analyzed by means of electron probe microanalysis. Most samples are archaeological finds deriving from non-figurative windows in secular buildings. However, the analyzed set also contains glass sampled from still existing non-figurative windows in secular buildings and stained-glass windows in religious buildings. A sudden compositional change at the end of the 14 th century can be noticed among the series of glass compositions that were obtained. These changes could be related to the use of different glassmaker recipes and to the introduction of new raw materials for glass making

  17. Composition of 12-18 th century window glass in Belgium: Non-figurative windows in secular buildings and stained-glass windows in religious buildings

    Science.gov (United States)

    Schalm, Olivier; Janssens, Koen; Wouters, Hilde; Caluwé, Danielle

    2007-07-01

    A set of ca. 500 window glass fragments originating from different historical sites in Belgium and covering the period 12 th-18 th century was analyzed by means of electron probe microanalysis. Most samples are archaeological finds deriving from non-figurative windows in secular buildings. However, the analyzed set also contains glass sampled from still existing non-figurative windows in secular buildings and stained-glass windows in religious buildings. A sudden compositional change at the end of the 14 th century can be noticed among the series of glass compositions that were obtained. These changes could be related to the use of different glassmaker recipes and to the introduction of new raw materials for glass making.

  18. Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    He Luo

    2017-01-01

    Full Text Available Task allocation is the key factor in the spraying pesticides process using unmanned aerial vehicles (UAVs, and maximizing the effects of pesticide spraying is the goal of optimizing UAV pesticide spraying. In this study, we first introduce each UAV’s kinematic constraint and extend the Euclidean distance between fields to the Dubins path distance. We then analyze the two factors affecting the pesticide spraying effects, which are the type of pesticides and the temperature during the pesticide spraying. The time window of the pesticide spraying is dynamically generated according to the temperature and is introduced to the pesticide spraying efficacy function. Finally, according to the extensions, we propose a team orienteering problem with variable time windows and variable profits model. We propose the genetic algorithm to solve the above model and give the methods of encoding, crossover, and mutation in the algorithm. The experimental results show that this model and its solution method have clear advantages over the common manual allocation strategy and can provide the same results as those of the enumeration method in small-scale scenarios. In addition, the results also show that the algorithm parameter can affect the solution, and we provide the optimal parameters configuration for the algorithm.

  19. High performance sapphire windows

    Science.gov (United States)

    Bates, Stephen C.; Liou, Larry

    1993-02-01

    High-quality, wide-aperture optical access is usually required for the advanced laser diagnostics that can now make a wide variety of non-intrusive measurements of combustion processes. Specially processed and mounted sapphire windows are proposed to provide this optical access to extreme environment. Through surface treatments and proper thermal stress design, single crystal sapphire can be a mechanically equivalent replacement for high strength steel. A prototype sapphire window and mounting system have been developed in a successful NASA SBIR Phase 1 project. A large and reliable increase in sapphire design strength (as much as 10x) has been achieved, and the initial specifications necessary for these gains have been defined. Failure testing of small windows has conclusively demonstrated the increased sapphire strength, indicating that a nearly flawless surface polish is the primary cause of strengthening, while an unusual mounting arrangement also significantly contributes to a larger effective strength. Phase 2 work will complete specification and demonstration of these windows, and will fabricate a set for use at NASA. The enhanced capabilities of these high performance sapphire windows will lead to many diagnostic capabilities not previously possible, as well as new applications for sapphire.

  20. FEASIBILITY STUDY OF LANDSAT-8 IMAGERY FOR RETRIEVING SEA SURFACE TEMPERATURE (CASE STUDY PERSIAN GULF

    Directory of Open Access Journals (Sweden)

    F. Bayat

    2016-06-01

    Full Text Available Sea surface temperature (SST is one of the critical parameters in marine meteorology and oceanography. The SST datasets are incorporated as conditions for ocean and atmosphere models. The SST needs to be investigated for various scientific phenomenon such as salinity, potential fishing zone, sea level rise, upwelling, eddies, cyclone predictions. On the other hands, high spatial resolution SST maps can illustrate eddies and sea surface currents. Also, near real time producing of SST map is suitable for weather forecasting and fishery applications. Therefore satellite remote sensing with wide coverage of data acquisition capability can use as real time tools for producing SST dataset. Satellite sensor such as AVHRR, MODIS and SeaWIFS are capable of extracting brightness values at different thermal spectral bands. These brightness temperatures are the sole input for the SST retrieval algorithms. Recently, Landsat-8 successfully launched and accessible with two instruments on-board: (1 the Operational Land Imager (OLI with nine spectral bands in the visual, near infrared, and the shortwave infrared spectral regions; and (2 the Thermal Infrared Sensor (TIRS with two spectral bands in the long wavelength infrared. The two TIRS bands were selected to enable the atmospheric correction of the thermal data using a split window algorithm (SWA. The TIRS instrument is one of the major payloads aboard this satellite which can observe the sea surface by using the split-window thermal infrared channels (CH10: 10.6 μm to 11.2 μm; CH11: 11.5 μm to 12.5 μm at a resolution of 30 m. The TIRS sensors have three main advantages comparing with other previous sensors. First, the TIRS has two thermal bands in the atmospheric window that provide a new SST retrieval opportunity using the widely used split-window (SW algorithm rather than the single channel method. Second, the spectral filters of TIRS two bands present narrower bandwidth than that of the thermal band

  1. An Optimization Method of Time Window Based on Travel Time and Reliability

    OpenAIRE

    Fu, Fengjie; Ma, Dongfang; Wang, Dianhai; Qian, Wei

    2015-01-01

    The dynamic change of urban road travel time was analyzed using video image detector data, and it showed cyclic variation, so the signal cycle length at the upstream intersection was conducted as the basic unit of time window; there was some evidence of bimodality in the actual travel time distributions; therefore, the fitting parameters of the travel time bimodal distribution were estimated using the EM algorithm. Then the weighted average value of the two means was indicated as the travel t...

  2. Windows 7 The Missing Manual

    CERN Document Server

    Pogue, David

    2010-01-01

    In early reviews, geeks raved about Windows 7. But if you're an ordinary mortal, learning what this new system is all about will be challenging. Fear not: David Pogue's Windows 7: The Missing Manual comes to the rescue. Like its predecessors, this book illuminates its subject with reader-friendly insight, plenty of wit, and hardnosed objectivity for beginners as well as veteran PC users. Windows 7 fixes many of Vista's most painful shortcomings. It's speedier, has fewer intrusive and nagging screens, and is more compatible with peripherals. Plus, Windows 7 introduces a slew of new features,

  3. Microsoft Windows Operating System Essentials

    CERN Document Server

    Carpenter, Tom

    2012-01-01

    A full-color guide to key Windows 7 administration concepts and topics Windows 7 is the leading desktop software, yet it can be a difficult concept to grasp, especially for those new to the field of IT. Microsoft Windows Operating System Essentials is an ideal resource for anyone new to computer administration and looking for a career in computers. Delving into areas such as fundamental Windows 7 administration concepts and various desktop OS topics, this full-color book addresses the skills necessary for individuals looking to break into a career in IT. Each chapter begins with a list of topi

  4. Robust alignment of chromatograms by statistically analyzing the shifts matrix generated by moving window fast Fourier transform cross-correlation.

    Science.gov (United States)

    Zhang, Mingjing; Wen, Ming; Zhang, Zhi-Min; Lu, Hongmei; Liang, Yizeng; Zhan, Dejian

    2015-03-01

    Retention time shift is one of the most challenging problems during the preprocessing of massive chromatographic datasets. Here, an improved version of the moving window fast Fourier transform cross-correlation algorithm is presented to perform nonlinear and robust alignment of chromatograms by analyzing the shifts matrix generated by moving window procedure. The shifts matrix in retention time can be estimated by fast Fourier transform cross-correlation with a moving window procedure. The refined shift of each scan point can be obtained by calculating the mode of corresponding column of the shifts matrix. This version is simple, but more effective and robust than the previously published moving window fast Fourier transform cross-correlation method. It can handle nonlinear retention time shift robustly if proper window size has been selected. The window size is the only one parameter needed to adjust and optimize. The properties of the proposed method are investigated by comparison with the previous moving window fast Fourier transform cross-correlation and recursive alignment by fast Fourier transform using chromatographic datasets. The pattern recognition results of a gas chromatography mass spectrometry dataset of metabolic syndrome can be improved significantly after preprocessing by this method. Furthermore, the proposed method is available as an open source package at https://github.com/zmzhang/MWFFT2. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  5. An algorithm for variational data assimilation of contact concentration measurements for atmospheric chemistry models

    Science.gov (United States)

    Penenko, Alexey; Penenko, Vladimir

    2014-05-01

    Contact concentration measurement data assimilation problem is considered for convection-diffusion-reaction models originating from the atmospheric chemistry study. High dimensionality of models imposes strict requirements on the computational efficiency of the algorithms. Data assimilation is carried out within the variation approach on a single time step of the approximated model. A control function is introduced into the source term of the model to provide flexibility for data assimilation. This function is evaluated as the minimum of the target functional that connects its norm to a misfit between measured and model-simulated data. In the case mathematical model acts as a natural Tikhonov regularizer for the ill-posed measurement data inversion problem. This provides flow-dependent and physically-plausible structure of the resulting analysis and reduces a need to calculate model error covariance matrices that are sought within conventional approach to data assimilation. The advantage comes at the cost of the adjoint problem solution. This issue is solved within the frameworks of splitting-based realization of the basic convection-diffusion-reaction model. The model is split with respect to physical processes and spatial variables. A contact measurement data is assimilated on each one-dimensional convection-diffusion splitting stage. In this case a computationally-efficient direct scheme for both direct and adjoint problem solution can be constructed based on the matrix sweep method. Data assimilation (or regularization) parameter that regulates ratio between model and data in the resulting analysis is obtained with Morozov discrepancy principle. For the proper performance the algorithm takes measurement noise estimation. In the case of Gaussian errors the probability that the used Chi-squared-based estimate is the upper one acts as the assimilation parameter. A solution obtained can be used as the initial guess for data assimilation algorithms that assimilate

  6. Improved Windows for Cold Climates

    DEFF Research Database (Denmark)

    Laustsen, Jacob Birck; Svendsen, Svend

    2005-01-01

    considerably by reducing the frame width, which results in a larger transparent area causing a larger solar gain but still main-taining a low thermal transmittance. Using three layers of glass with large gaps, using very slim frame profiles, and omitting the edge constructions that normally causes thermal...... windows with improved energy performance. Traditionally evaluation of the energy performance of windows has focused on the thermal transmittance, but as windows differ from the rest of the building envelope by allowing solar energy to enter the building, the total solar energy transmittance is equally...... important. In the heating season in cold climates the solar gain through windows can be utilized for space heating which results in a corresponding reduction in the energy production that is often based on fossil fuels. A suitable quantity for evaluating the energy performance of windows in a simple...

  7. [Algorithms for treatment of complex hand injuries].

    Science.gov (United States)

    Pillukat, T; Prommersberger, K-J

    2011-07-01

    The primary treatment strongly influences the course and prognosis of hand injuries. Complex injuries which compromise functional recovery are especially challenging. Despite an apparently unlimited number of injury patterns it is possible to develop strategies which facilitate a standardized approach to operative treatment. In this situation algorithms can be important guidelines for a rational approach. The following algorithms have been proven in the treatment of complex injuries of the hand by our own experience. They were modified according to the current literature and refer to prehospital care, emergency room management, basic strategy in general and reconstruction of bone and joints, vessels, nerves, tendons and soft tissue coverage in detail. Algorithms facilitate the treatment of severe hand injuries. Applying simple yes/no decisions complex injury patterns are split into distinct partial problems which can be managed step by step.

  8. Large window median filtering on Clip7

    Energy Technology Data Exchange (ETDEWEB)

    Mathews, K N

    1983-07-01

    Median filtering has been found to be a useful operation to perform on images in order to reduce random noise while preserving edges of objects. However, in some cases, as the resolution of the image increases, so too does the required window size of the filter. For parallel array processors, this leads to problems when dealing with the large amount of data involved. That is to say that there tend to be problems over slow access of data from pixels over a large neighbourhood, lack of available storage of this data during the operation and long computational times for finding the median. An algorithm for finding the median, designed for use on byte wide architecture parallel array processors is presented together with its implementation on Clip7, a scanning array of such processors. 6 references.

  9. A Novel Feature Extraction Approach Using Window Function Capturing and QPSO-SVM for Enhancing Electronic Nose Performance

    Directory of Open Access Journals (Sweden)

    Xiuzhen Guo

    2015-06-01

    Full Text Available In this paper, a novel feature extraction approach which can be referred to as moving window function capturing (MWFC has been proposed to analyze signals of an electronic nose (E-nose used for detecting types of infectious pathogens in rat wounds. Meanwhile, a quantum-behaved particle swarm optimization (QPSO algorithm is implemented in conjunction with support vector machine (SVM for realizing a synchronization optimization of the sensor array and SVM model parameters. The results prove the efficacy of the proposed method for E-nose feature extraction, which can lead to a higher classification accuracy rate compared to other established techniques. Meanwhile it is interesting to note that different classification results can be obtained by changing the types, widths or positions of windows. By selecting the optimum window function for the sensor response, the performance of an E-nose can be enhanced.

  10. Generating Importance Map for Geometry Splitting using Discrete Ordinates Code in Deep Shielding Problem

    International Nuclear Information System (INIS)

    Kim, Jong Woon; Lee, Young Ouk

    2016-01-01

    When we use MCNP code for a deep shielding problem, we prefer to use variance reduction technique such as geometry splitting, or weight window, or source biasing to have relative error within reliable confidence interval. To generate importance map for geometry splitting in MCNP calculation, we should know the track entering number and previous importance on each cells since a new importance is calculated based on these information. If a problem is deep shielding problem such that we have zero tracks entering on a cell, we cannot generate new importance map. In this case, discrete ordinates code can provide information to generate importance map easily. In this paper, we use AETIUS code as a discrete ordinates code. Importance map for MCNP is generated based on a zone average flux of AETIUS calculation. The discretization of space, angle, and energy is not necessary for MCNP calculation. This is the big merit of MCNP code compared to the deterministic code. However, deterministic code (i.e., AETIUS) can provide a rough estimate of the flux throughout a problem relatively quickly. This can help MCNP by providing variance reduction parameters. Recently, ADVANTG code is released. This is an automated tool for generating variance reduction parameters for fixed-source continuous-energy Monte Carlo simulations with MCNP5 v1.60

  11. Efficient Algorithms for the Discrete Gabor Transform with a Long Fir Window

    DEFF Research Database (Denmark)

    Søndergaard, Peter Lempel

    2012-01-01

    The Discrete Gabor Transform (DGT) is the most commonly used signal transform for signal analysis and synthesis using a linear frequency scale. The development of the Linear Time-Frequency Analysis Toolbox (LTFAT) has been based on a detailed study of many variants of the relevant algorithms. As ...

  12. Rigid thin windows for vacuum applications

    Science.gov (United States)

    Meyer, Glenn Allyn; Ciarlo, Dino R.; Myers, Booth Richard; Chen, Hao-Lin; Wakalopulos, George

    1999-01-01

    A thin window that stands off atmospheric pressure is fabricated using photolithographic and wet chemical etching techniques and comprises at least two layers: an etch stop layer and a protective barrier layer. The window structure also comprises a series of support ribs running the width of the window. The windows are typically made of boron-doped silicon and silicon nitride and are useful in instruments such as electron beam guns and x-ray detectors. In an electron beam gun, the window does not impede the electrons and has demonstrated outstanding gun performance and survivability during the gun tube manufacturing process.

  13. Particulate photocatalysts for overall water splitting

    Science.gov (United States)

    Chen, Shanshan; Takata, Tsuyoshi; Domen, Kazunari

    2017-10-01

    The conversion of solar energy to chemical energy is a promising way of generating renewable energy. Hydrogen production by means of water splitting over semiconductor photocatalysts is a simple, cost-effective approach to large-scale solar hydrogen synthesis. Since the discovery of the Honda-Fujishima effect, considerable progress has been made in this field, and numerous photocatalytic materials and water-splitting systems have been developed. In this Review, we summarize existing water-splitting systems based on particulate photocatalysts, focusing on the main components: light-harvesting semiconductors and co-catalysts. The essential design principles of the materials employed for overall water-splitting systems based on one-step and two-step photoexcitation are also discussed, concentrating on three elementary processes: photoabsorption, charge transfer and surface catalytic reactions. Finally, we outline challenges and potential advances associated with solar water splitting by particulate photocatalysts for future commercial applications.

  14. Rouleaux red blood cells splitting in microscopic thin blood smear images via local maxima, circles drawing, and mapping with original RBCs.

    Science.gov (United States)

    Rehman, Amjad; Abbas, Naveed; Saba, Tanzila; Mahmood, Toqeer; Kolivand, Hoshang

    2018-04-10

    Splitting the rouleaux RBCs from single RBCs and its further subdivision is a challenging area in computer-assisted diagnosis of blood. This phenomenon is applied in complete blood count, anemia, leukemia, and malaria tests. Several automated techniques are reported in the state of art for this task but face either under or over splitting problems. The current research presents a novel approach to split Rouleaux red blood cells (chains of RBCs) precisely, which are frequently observed in the thin blood smear images. Accordingly, this research address the rouleaux splitting problem in a realistic, efficient and automated way by considering the distance transform and local maxima of the rouleaux RBCs. Rouleaux RBCs are splitted by taking their local maxima as the centres to draw circles by mid-point circle algorithm. The resulting circles are further mapped with single RBC in Rouleaux to preserve its original shape. The results of the proposed approach on standard data set are presented and analyzed statistically by achieving an average recall of 0.059, an average precision of 0.067 and F-measure 0.063 are achieved through ground truth with visual inspection. © 2018 Wiley Periodicals, Inc.

  15. An Adaptive Bacterial Foraging Optimization Algorithm with Lifecycle and Social Learning

    Directory of Open Access Journals (Sweden)

    Xiaohui Yan

    2012-01-01

    Full Text Available Bacterial Foraging Algorithm (BFO is a recently proposed swarm intelligence algorithm inspired by the foraging and chemotactic phenomenon of bacteria. However, its optimization ability is not so good compared with other classic algorithms as it has several shortages. This paper presents an improved BFO Algorithm. In the new algorithm, a lifecycle model of bacteria is founded. The bacteria could split, die, or migrate dynamically in the foraging processes, and population size varies as the algorithm runs. Social learning is also introduced so that the bacteria will tumble towards better directions in the chemotactic steps. Besides, adaptive step lengths are employed in chemotaxis. The new algorithm is named BFOLS and it is tested on a set of benchmark functions with dimensions of 2 and 20. Canonical BFO, PSO, and GA algorithms are employed for comparison. Experiment results and statistic analysis show that the BFOLS algorithm offers significant improvements than original BFO algorithm. Particulary with dimension of 20, it has the best performance among the four algorithms.

  16. (O)Mega split

    Energy Technology Data Exchange (ETDEWEB)

    Benakli, Karim; Darmé, Luc; Goodsell, Mark D. [Sorbonne Universités, UPMC Univ Paris 06, UMR 7589,LPTHE, F-75005, Paris (France); CNRS, UMR 7589,LPTHE, F-75005, Paris (France)

    2015-11-16

    We study two realisations of the Fake Split Supersymmetry Model (FSSM), the simplest model that can easily reproduce the experimental value of the Higgs mass for an arbitrarily high supersymmetry scale M{sub S}, as a consequence of swapping higgsinos for equivalent states, fake higgsinos, with suppressed Yukawa couplings. If the LSP is identified as the main Dark matter component, then a standard thermal history of the Universe implies upper bounds on M{sub S}, which we derive. On the other hand, we show that renormalisation group running of soft masses aboveM{sub S} barely constrains the model — in stark contrast to Split Supersymmetry — and hence we can have a “Mega Split” spectrum even with all of these assumptions and constraints, which include the requirements of a correct relic abundance, a gluino life-time compatible with Big Bang Nucleosynthesis and absence of signals in present direct detection experiments of inelastic dark matter. In an appendix we describe a related scenario, Fake Split Extended Supersymmetry, which enjoys similar properties.

  17. An implementation of signal processing algorithms for ultrasonic NDE

    International Nuclear Information System (INIS)

    Ericsson, L.; Stepinski, T.

    1994-01-01

    Probability of detection flaws during ultrasonic pulse-echo inspection is often limited by the presence of backscattered echoes from the material structure. A digital signal processing technique for removal of this material noise, referred to as split spectrum processing (SSP), has been developed and verified using laboratory experiments during the last decade. The authors have performed recently a limited scale evaluation of various SSP techniques for ultrasonic signals acquired during the inspection of welds in austenitic steel. They have obtained very encouraging results that indicate promising capabilities of the SSP for inspection of nuclear power plants. Thus, a more extensive investigation of the technique using large amounts of ultrasonic data is motivated. This analysis should employ different combinations of materials, flaws and transducers. Due to the considerable number of ultrasonic signals required to verify the technique for future practical use, a custom-made computer software is necessary. At the request of the Swedish nuclear power industry the authors have developed such a program package. The program provides a user-friendly graphical interface and is intended for processing of B-scan data in a flexible way. Assembled in the program are a number of signal processing algorithms including traditional Split Spectrum Processing and the more recent Cut Spectrum Processing algorithm developed by them. The program and some results obtained using the various algorithms are presented in the paper

  18. Windows 8.1 for dummies

    CERN Document Server

    Rathbone, Andy

    2013-01-01

    The bestselling book on Windows, now updated for the new 8.1 features Microsoft has fine-tuned Windows 8 with some important new features, and veteran author Andy Rathbone explains every one in this all-new edition of a long-time bestseller. Whether you're using Windows for the first time, upgrading from an older version, or just moving from Windows 8 to 8.1, here's what you need to know. Learn about the dual interfaces, the new Start button, how to customize the interface and boot operations, and how to work with programs and files, use the web and social media, manage music and photos, and

  19. Windows 7 the definitive guide

    CERN Document Server

    Stanek, William R

    2010-01-01

    This book provides everything you need to manage and maintain Windows 7. You'll learn all of the features and enhancements in complete detail, along with specifics for configuring the operating system to put you in full control. Bestselling author and Windows expert William Stanek doesn't just show you the steps you need to follow, he also tells you how features work, why they work, and how you can customize them to meet your needs. Learn how to squeeze every bit of power out of Windows 7 to take full advantage of its features and programs. Set up, customize, and tune Windows 7-Optimize its

  20. Live histograms in moving windows

    International Nuclear Information System (INIS)

    Zhil'tsov, V.E.

    1989-01-01

    Application of computer graphics for specific hardware testing is discussed. The hardware is position sensitive detector (multiwire proportional chamber) which is used in high energy physics experiments, and real-out electronics for it. Testing program is described (XPERT), which utilises multi-window user interface. Data are represented as histograms in windows. The windows on the screen may be moved, reordered, their sizes may be changed. Histograms may be put to any window, and hardcopy may be made. Some program internals are discussed. The computer environment is quite simple: MS-DOS IBM PC/XT, 256 KB RAM, CGA, 5.25'' FD, Epson MX. 4 refs.; 7 figs

  1. Foam: A general purpose Monte Carlo cellular algorithm

    International Nuclear Information System (INIS)

    Jadach, S.

    2002-01-01

    A general-purpose, self-adapting Monte Carlo (MC) algorithm implemented in the program Foam is described. The high efficiency of the MC, that is small maximum weight or variance of the MC weight is achieved by means of dividing the integration domain into small cells. The cells can be n-dimensional simplices, hyperrectangles or a Cartesian product of them. The grid of cells, called 'foam', is produced in the process of the binary split of the cells. The choice of the next cell to be divided and the position/direction of the division hyperplane is driven by the algorithm which optimizes the ratio of the maximum weight to the average weight or (optionally) the total variance. The algorithm is able to deal, in principle, with an arbitrary pattern of the singularities in the distribution. (author)

  2. Foam A General purpose Monte Carlo Cellular Algorithm

    CERN Document Server

    Jadach, Stanislaw

    2002-01-01

    A general-purpose, self-adapting Monte Carlo (MC) algorithm implemented in the program {\\tt Foam} is described. The high efficiency of the MC, that is small maximum weight or variance of the MC weight is achieved by means of dividing the integration domain into small cells. The cells can be $n$-dimensional simplices, hyperrectangles or a Cartesian product of them. The grid of cells, ``foam'', is produced in the process of the binary split of the cells. The next cell to be divided and the position/direction of the division hyperplane is chosen by the algorithm which optimizes the ratio of the maximum weight to the average weight or (optionally) the total variance. The algorithm is able to deal, in principle, with an arbitrary pattern of the singularities in the distribution.

  3. The tuning algorithms used by the Donner 600 crystal tomograph

    International Nuclear Information System (INIS)

    Moses, W.W.; Derenzo, S.E.; Geyer, A.B.; Huesman, R.H.; Uber, D.C.

    1989-01-01

    The authors describe the computer algorithms used to adjust the energy thresholds and timing delays in the Donner 600 Crystal Tomograph. These thresholds and delays are adjusted using 1890 computer controlled digital to analog converters (DAC's) and a orbiting positron source. The energy threshold for each crystal is adjusted by measuring the counting rate of each crystal-crystal coincidence as a function of the DAC settings that control a pulse height window for the crystal in question. The DAC settings that correspond to the 511 keV photopeak are noted, thus determining the conversion from DAC setting to energy, and allowing the DAC's to be set to any desired energy window. The DAC settings controlling the timing delay for each channel are systematically adjusted to maximize the overall event rate. As these 1890 adjustments are coupled, the authors discuss the convergence of the tuning algorithms, and also report on the photomultiplier tube gain and timing variations over a period of 18 months

  4. The tuning algorithms used by the Donner 600 Crystal Tomograph

    International Nuclear Information System (INIS)

    Moses, W.W.; Derenzo, S.E.; Geyer, A.B.; Huesman, R.H.; Uber, D.C.

    1988-11-01

    We describe the computer algorithms used to adjust the energy thresholds and timing delays in the Donner 600 Crystal Tomograph. These thresholds and delays are adjusted using 1890 computer controlled digital to analog converters (DAC's) and a orbiting positron source. The energy threshold for each crystal is adjusted by measuring the counting rate of each crystal-crystal coincidence as a function of the DAC settings that control a pulse height window for the crystal in question. The DAC settings that correspond to the 511 keV photopeak are noted, thus determining the conversion from DAC setting to energy, and allowing the DAC's to be set to any desired energy window. The DAC settings controlling the timing delay for each channel are systematically adjusted to maximize the overall event rate. As these 1890 adjustments are coupled, we discuss the convergence of the tuning algorithms, and also report on the photomultiplier tube gain and timing variations over a period of 18 months. 7 refs., 6 figs

  5. Working with Windows 7 at CERN (EN)

    CERN Multimedia

    CERN. Geneva

    2010-01-01

    Overview of new concepts and user interface changes in Windows 7 as compared with older versions of Windows: XP or Vista. Availability of Windows 7 at CERN and its integration with CERN Windows infrastructure will be discussed.

  6. [An improved algorithm for electrohysterogram envelope extraction].

    Science.gov (United States)

    Lu, Yaosheng; Pan, Jie; Chen, Zhaoxia; Chen, Zhaoxia

    2017-02-01

    Extraction uterine contraction signal from abdominal uterine electromyogram(EMG) signal is considered as the most promising method to replace the traditional tocodynamometer(TOCO) for detecting uterine contractions activity. The traditional root mean square(RMS) algorithm has only some limited values in canceling the impulsive noise. In our study, an improved algorithm for uterine EMG envelope extraction was proposed to overcome the problem. Firstly, in our experiment, zero-crossing detection method was used to separate the burst of uterine electrical activity from the raw uterine EMG signal. After processing the separated signals by employing two filtering windows which have different width, we used the traditional RMS algorithm to extract uterus EMG envelope. To assess the performance of the algorithm, the improved algorithm was compared with two existing intensity of uterine electromyogram(IEMG) extraction algorithms. The results showed that the improved algorithm was better than the traditional ones in eliminating impulsive noise present in the uterine EMG signal. The measurement sensitivity and positive predictive value(PPV) of the improved algorithm were 0.952 and 0.922, respectively, which were not only significantly higher than the corresponding values(0.859 and 0.847) of the first comparison algorithm, but also higher than the values(0.928 and 0.877) of the second comparison algorithm. Thus the new method is reliable and effective.

  7. A Hybrid Genetic Algorithm for the Multiple Crossdocks Problem

    Directory of Open Access Journals (Sweden)

    Zhaowei Miao

    2012-01-01

    Full Text Available We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be NP-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure, we propose a hybrid genetic algorithm (HGA integrating greedy technique and variable neighborhood search method to solve the problem. Extensive experiments under different scenarios were conducted, and results show that HGA outperforms CPLEX solver, providing solutions in realistic timescales.

  8. Mastering Windows Server 2012 R2

    CERN Document Server

    Minasi, Mark; Booth, Christian; Butler, Robert; McCabe, John; Panek, Robert; Rice, Michael; Roth, Stefan

    2013-01-01

    Check out the new Hyper-V, find new and easier ways to remotely connect back into the office, or learn all about Storage Spaces-these are just a few of the features in Windows Server 2012 R2 that are explained in this updated edition from Windows authority Mark Minasi and a team of Windows Server experts led by Kevin Greene. This book gets you up to speed on all of the new features and functions of Windows Server, and includes real-world scenarios to put them in perspective. If you're a system administrator upgrading to, migrating to, or managing Windows Server 2012 R2, find what you need to

  9. Microsoft Windows Intune 20 Quickstart Administration

    CERN Document Server

    Overton, David

    2012-01-01

    This book is a concise and practical tutorial that shows you how to plan, set up and maintain Windows Intune and manage a group of PCs. If you are an administrator or partner who wants to plan, set up and maintain Windows Intune and manage a group of PCs then this book is for you . You should have a basic understanding of Windows administration, however, knowledge of Windows Intune would not be required.

  10. Transforming the market for residential windows: design considerations for DOE's Efficient Window Collaborative

    Energy Technology Data Exchange (ETDEWEB)

    Eto, J.; Arasteh, D.; Selkowitz, S.

    1998-08-01

    Market adoption of recent, commercially available technological advances that improve the energy performance of windows will lead to immediate economic and energy savings benefits to the nation. This paper is a scoping study intended to inform the design of a major DOE initiative to accelerate market adoption of these windows in the residential sector. We describe the structure of the US residential window market and the interests of the various market players. We then briefly review five recent market transformation initiatives. Finally, we summarize our findings in a list of considerations we believe will be important for the DOE's initiative to transform the US residential window market.

  11. Partial path column generation for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Petersen, Bjørn; Jepsen, Mads Kehlet

    2009-01-01

    This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting...... and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large...... number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution...

  12. Dresselhaus spin-orbit coupling induced spin-polarization and resonance-split in n-well semiconductor superlattices

    International Nuclear Information System (INIS)

    Ye Chengzhi; Xue Rui; Nie, Y.-H.; Liang, J.-Q.

    2009-01-01

    Using the transfer matrix method, we investigate the electron transmission over multiple-well semiconductor superlattices with Dresselhaus spin-orbit coupling in the potential-well regions. The superlattice structure enhances the effect of spin polarization in the transmission spectrum. The minibands of multiple-well superlattices for electrons with different spin can be completely separated at the low incident energy, leading to the 100% spin polarization in a broad energy windows, which may be an effective scheme for realizing spin filtering. Moreover, for the transmission over n-quantum-well, it is observed that the resonance peaks in the minibands split into n-folds or (n-1)-folds depending on the well-width and barrier-thickness, which is different from the case of tunneling through n-barrier structure

  13. M-Split: A Graphical User Interface to Analyze Multilayered Anisotropy from Shear Wave Splitting

    Science.gov (United States)

    Abgarmi, Bizhan; Ozacar, A. Arda

    2017-04-01

    Shear wave splitting analysis are commonly used to infer deep anisotropic structure. For simple cases, obtained delay times and fast-axis orientations are averaged from reliable results to define anisotropy beneath recording seismic stations. However, splitting parameters show systematic variations with back azimuth in the presence of complex anisotropy and cannot be represented by average time delay and fast axis orientation. Previous researchers had identified anisotropic complexities at different tectonic settings and applied various approaches to model them. Most commonly, such complexities are modeled by using multiple anisotropic layers with priori constraints from geologic data. In this study, a graphical user interface called M-Split is developed to easily process and model multilayered anisotropy with capabilities to properly address the inherited non-uniqueness. M-Split program runs user defined grid searches through the model parameter space for two-layer anisotropy using formulation of Silver and Savage (1994) and creates sensitivity contour plots to locate local maximas and analyze all possible models with parameter tradeoffs. In order to minimize model ambiguity and identify the robust model parameters, various misfit calculation procedures are also developed and embedded to M-Split which can be used depending on the quality of the observations and their back-azimuthal coverage. Case studies carried out to evaluate the reliability of the program using real noisy data and for this purpose stations from two different networks are utilized. First seismic network is the Kandilli Observatory and Earthquake research institute (KOERI) which includes long term running permanent stations and second network comprises seismic stations deployed temporary as part of the "Continental Dynamics-Central Anatolian Tectonics (CD-CAT)" project funded by NSF. It is also worth to note that M-Split is designed as open source program which can be modified by users for

  14. Travailler avec Windows 7 au CERN

    CERN Multimedia

    CERN. Geneva

    2011-01-01

    Vue d'ensemble des nouveaux concepts et des changements dans l'interface utilisateur survenus dans Windows 7 depuis les versions antérieures de Windows (XP ou Vista). Le plan de migration à Windows 7 sera aussi débattu.

  15. Travailler avec Windows 7 au CERN

    CERN Multimedia

    CERN. Geneva

    2012-01-01

    Vue d'ensemble des nouveaux concepts et des changements dans l'interface utilisateur survenus dans Windows 7 depuis les versions antérieures de Windows (XP ou Vista). Le plan de migration à Windows 7 sera aussi débattu.

  16. Windows VPN Set Up | High-Performance Computing | NREL

    Science.gov (United States)

    Windows VPN Set Up Windows VPN Set Up To set up Windows for HPC VPN, here are the steps: Download your version of Windows. Note: We only support the the Endian Connect software when connecting to the a VPN connection to the HPC systems. Windows Version Connect App Windows 10

  17. The Nicest way to migrate your Windows computer ( The Windows 2000 Migration Task Force)

    CERN Document Server

    2001-01-01

    With Windows 2000, CERN users will discover a more stable and reliable working environment and will have access to all the latest applications. The Windows 2000 Migration Task Force - a representative from each division.

  18. Peliohjelmointi Windows Phone 8:lle

    OpenAIRE

    Bäckström, Toni

    2014-01-01

    Tässä insinöörityössä tutustutaan Windows Phone 8 -mobiilikäyttöjärjestelmään peliohjelmoijan näkökulmasta. Työn tavoitteena oli erityisesti esitellä Microsoftin itse kehittämiä XNA- ja DirectX-peliohjelmointikirjastoja teoriassa ja käytännössä. Työn aluksi käydään läpi hieman Windows Phonen historiaa ja yleisesti kehittämistä Windows Phone 8:lle. Tämän jälkeen luodaan katsaus Windows Phone 8:aan pelialustana. Työn suurin osuus on XNA:n ja DirectX:n esittely teoriassa; kummastakin men...

  19. Solar Heat Gain Coefficient (SHGC) | Efficient Windows Collaborative

    Science.gov (United States)

    Foundry Foundry New Construction Windows Window Selection Tool Selection Process Design Guidance Installation Replacement Windows Window Selection Tool Assessing Options Selection Process Design Guidance Installation Understanding Windows Benefits Design Considerations Measuring Performance Performance Standards

  20. Rudin-Osher-Fatemi Total Variation Denoising using Split Bregman

    Directory of Open Access Journals (Sweden)

    Pascal Getreuer

    2012-05-01

    Full Text Available Denoising is the problem of removing noise from an image. The most commonly studied case is with additive white Gaussian noise (AWGN, where the observed noisy image f is related to the underlying true image u by f=u+η and η is at each point in space independently and identically distributed as a zero-mean Gaussian random variable. Total variation (TV regularization is a technique that was originally developed for AWGN image denoising by Rudin, Osher, and Fatemi. The TV regularization technique has since been applied to a multitude of other imaging problems, see for example Chan and Shen's book. We focus here on the split Bregman algorithm of Goldstein and Osher for TV-regularized denoising.

  1. Thin Film & Deposition Systems (Windows)

    Data.gov (United States)

    Federal Laboratory Consortium — Coating Lab: Contains chambers for growing thin film window coatings. Plasma Applications Coating Lab: Contains chambers for growing thin film window coatings. Solar...

  2. Explicit symplectic algorithms based on generating functions for charged particle dynamics

    Science.gov (United States)

    Zhang, Ruili; Qin, Hong; Tang, Yifa; Liu, Jian; He, Yang; Xiao, Jianyuan

    2016-07-01

    Dynamics of a charged particle in the canonical coordinates is a Hamiltonian system, and the well-known symplectic algorithm has been regarded as the de facto method for numerical integration of Hamiltonian systems due to its long-term accuracy and fidelity. For long-term simulations with high efficiency, explicit symplectic algorithms are desirable. However, it is generally believed that explicit symplectic algorithms are only available for sum-separable Hamiltonians, and this restriction limits the application of explicit symplectic algorithms to charged particle dynamics. To overcome this difficulty, we combine the familiar sum-split method and a generating function method to construct second- and third-order explicit symplectic algorithms for dynamics of charged particle. The generating function method is designed to generate explicit symplectic algorithms for product-separable Hamiltonian with form of H (x ,p ) =pif (x ) or H (x ,p ) =xig (p ) . Applied to the simulations of charged particle dynamics, the explicit symplectic algorithms based on generating functions demonstrate superiorities in conservation and efficiency.

  3. Cubic scaling algorithms for RPA correlation using interpolative separable density fitting

    Science.gov (United States)

    Lu, Jianfeng; Thicke, Kyle

    2017-12-01

    We present a new cubic scaling algorithm for the calculation of the RPA correlation energy. Our scheme splits up the dependence between the occupied and virtual orbitals in χ0 by use of Cauchy's integral formula. This introduces an additional integral to be carried out, for which we provide a geometrically convergent quadrature rule. Our scheme also uses the newly developed Interpolative Separable Density Fitting algorithm to further reduce the computational cost in a way analogous to that of the Resolution of Identity method.

  4. Autonomous Time-Frequency Cropping and Feature-Extraction Algorithms for Classification of LPI Radar Modulations

    National Research Council Canada - National Science Library

    Zilberman, Eric R

    2006-01-01

    ...), uses the marginal frequency distribution and the adaptive threshold binarization algorithm to determine the start and stop frequencies of the modulation energy to locate and adapt the size of the cropping window...

  5. Exact parallel maximum clique algorithm for general and protein graphs.

    Science.gov (United States)

    Depolli, Matjaž; Konc, Janez; Rozman, Kati; Trobec, Roman; Janežič, Dušanka

    2013-09-23

    A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in two published state of the art sequential algorithms is implemented. The new sequential MaxCliqueSeq algorithm is faster than the reference algorithms on both DIMACS benchmark graphs as well as on protein-derived product graphs used for protein structural comparisons. Next, the MaxCliqueSeq algorithm is parallelized by splitting the branch-and-bound search tree to multiple cores, resulting in MaxCliquePara algorithm. The ability to exploit all cores efficiently makes the new parallel MaxCliquePara algorithm markedly superior to other tested algorithms. On a 12-core computer, the parallelization provides up to 2 orders of magnitude faster execution on the large DIMACS benchmark graphs and up to an order of magnitude faster execution on protein product graphs. The algorithms are freely accessible on http://commsys.ijs.si/~matjaz/maxclique.

  6. Imaging windows for long-term intravital imaging

    Science.gov (United States)

    Alieva, Maria; Ritsma, Laila; Giedt, Randy J; Weissleder, Ralph; van Rheenen, Jacco

    2014-01-01

    Intravital microscopy is increasingly used to visualize and quantitate dynamic biological processes at the (sub)cellular level in live animals. By visualizing tissues through imaging windows, individual cells (e.g., cancer, host, or stem cells) can be tracked and studied over a time-span of days to months. Several imaging windows have been developed to access tissues including the brain, superficial fascia, mammary glands, liver, kidney, pancreas, and small intestine among others. Here, we review the development of imaging windows and compare the most commonly used long-term imaging windows for cancer biology: the cranial imaging window, the dorsal skin fold chamber, the mammary imaging window, and the abdominal imaging window. Moreover, we provide technical details, considerations, and trouble-shooting tips on the surgical procedures and microscopy setups for each imaging window and explain different strategies to assure imaging of the same area over multiple imaging sessions. This review aims to be a useful resource for establishing the long-term intravital imaging procedure. PMID:28243510

  7. ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

    DEFF Research Database (Denmark)

    Aumüller, Martin; Bernhardsson, Erik; Faithfull, Alexander

    2017-01-01

    This paper describes ANN-Benchmarks, a tool for evaluating the performance of in-memory approximate nearest neighbor algorithms. It provides a standard interface for measuring the performance and quality achieved by nearest neighbor algorithms on different standard data sets. It supports several...... visualise these as images, Open image in new window plots, and websites with interactive plots. ANN-Benchmarks aims to provide a constantly updated overview of the current state of the art of k-NN algorithms. In the short term, this overview allows users to choose the correct k-NN algorithm and parameters...... for their similarity search task; in the longer term, algorithm designers will be able to use this overview to test and refine automatic parameter tuning. The paper gives an overview of the system, evaluates the results of the benchmark, and points out directions for future work. Interestingly, very different...

  8. Vacuum window glazings for energy-efficient buildings

    Energy Technology Data Exchange (ETDEWEB)

    Benson, D.K.; Smith, L.K.; Tracy, C.E.; Potter, T.; Christensen, C. (Solar Energy Research Inst., Golden, CO (USA)); Soule, D.E. (Western Illinois Univ., Macomb, IL (USA))

    1990-05-01

    The technical feasibility of a patented, laser-welded, evacuated insulating window was studied. The window has two edge-sealed sheets of glass separated by 0.5-mm glass spheres spaced 30 mm apart in a regular array. A highly insulating frame is required and several designs were analyzed. The vacuum window's combination of high solar transmittance and low thermal conductance makes it superior to many other windows in cold climates. In the US Pacific Northwest, the vacuum window could save about 6 MJ of heating energy annually per square meter of window in comparison to conventional, double-glazed windows. A large, vacuum laser-welding facility was designed and installed to conduct glass welding experiments and to fabricate full-sized vacuum windows. Experiments confirmed the feasibility of laser-sealing glass in vacuum but identified two difficulties. Under some circumstances, bubbles of dissolved gases form during welding and weaken the seal. Glass also vaporizes and contaminates the laser beam steering mirror. A novel moving metal foil mirror was developed to circumvent the contamination problem, but it has not yet been used to complete welding experiments and fabricate full-sized vacuum windows. 63 refs., 53 figs., 19 tabs.

  9. Convergence analysis of a class of massively parallel direction splitting algorithms for the Navier-Stokes equations in simple domains

    KAUST Repository

    Guermond, Jean-Luc; Minev, Peter D.; Salgado, Abner J.

    2012-01-01

    We provide a convergence analysis for a new fractional timestepping technique for the incompressible Navier-Stokes equations based on direction splitting. This new technique is of linear complexity, unconditionally stable and convergent, and suitable for massive parallelization. © 2012 American Mathematical Society.

  10. Additive operator-difference schemes splitting schemes

    CERN Document Server

    Vabishchevich, Petr N

    2013-01-01

    Applied mathematical modeling isconcerned with solving unsteady problems. This bookshows how toconstruct additive difference schemes to solve approximately unsteady multi-dimensional problems for PDEs. Two classes of schemes are highlighted: methods of splitting with respect to spatial variables (alternating direction methods) and schemes of splitting into physical processes. Also regionally additive schemes (domain decomposition methods)and unconditionally stable additive schemes of multi-component splitting are considered for evolutionary equations of first and second order as well as for sy

  11. Windows 7 A quick, hands-on introduction

    CERN Document Server

    Lee, Wei-Meng

    2009-01-01

    This compact book offers the quickest path for Windows users to get started with Microsoft's Windows 7 operating system. You get the essential information you need to upgrade or install the system and configure it to fit your activities, along with a tour of Windows 7's features and built-in applications. Microsoft has learned from the mistakes of Windows Vista, and Windows 7 shows it-this new OS is much faster and more stable. With Windows 7: Up and Running, you'll learn what's new and what's changed from XP and Vista, and get advice on ways to use this system for work, entertainment, inst

  12. Windows 8.1 for seniors for dummies

    CERN Document Server

    Weverka, Peter

    2013-01-01

    Seniors, here's what you need to get up and running on Windows 8.1 Microsoft, now a little older and wiser, is back with Windows 8.1, the revamped version that brings fresh changes and welcome improvements to the Windows 8 operating system. And now you savvy seniors can get the very most out of this easier-to-use Windows 8.1 with our friendly new guide. Using large print that makes the book easier to read plus magnified screen shots to help make Windows less intimidating, this book walks you through common tasks and show you how to get things done in fine style. Helps you get to know Windows

  13. Alteration of split renal function during Captopril treatment

    International Nuclear Information System (INIS)

    Aburano, Tamio; Takayama, Teruhiko; Nakajima, Kenichi; Tonami, Norihisa; Hisada, Kinichi; Yasuhara, Shuichirou; Miyamori, Isamu; Takeda, Ryoyu

    1987-01-01

    Two different methods to evaluate the alteration of split renal function following continued Captopril treatment were studied in a total of 21 patients with hypertension. Eight patients with renovascular hypertension (five with unilateral renal artery stenosis and three with bilateral renal artery stenoses), three patients with diabetic nephropathy, one patient with primary aldosteronism, and nine patients with essential hypertension were included. The studies were performed the day prior to receiving Captopril (baseline), and 6th or 7th day following continued Captopril treatment (37.5 mg or 75 mg/day). Split effective renal plasma flow (ERPF) and glomerular filtration rate (GFR) after injections of I-131 hippuran and Tc-99m DTPA were measured using kidney counting corrected for depth and dose, described by Schlegel and Gates. In the patients with renovascular hypertension, split GFR in the stenotic kidney was significantly decreased 6th or 7th day following continued Captopril treatment compared to a baseline value. And split ERPF in the stenotic kidney was slightly increased although significant increase of split ERPF was not shown. In the patients with diabetic nephropathy, primary aldosteronism or essential hypertension, on the other hand, split GFR was not changed and split ERPF was slightly increased. These findings suggest that the Captopril induced alterations of split renal function may be of importance for the diagnosis of renovascular hypertension. For this purpose, split GFR determination is more useful than split ERPF determination. (author)

  14. The geometry of entanglement and Grover's algorithm

    International Nuclear Information System (INIS)

    Iwai, Toshihiro; Hayashi, Naoki; Mizobe, Kimitake

    2008-01-01

    A measure of entanglement with respect to a bipartite partition of n-qubit has been defined and studied from the viewpoint of Riemannian geometry (Iwai 2007 J. Phys. A: Math. Theor. 40 12161). This paper has two aims. One is to study further the geometry of entanglement, and the other is to investigate Grover's search algorithms, both the original and the fixed-point ones, in reference with entanglement. As the distance between the maximally entangled states and the separable states is known already in the previous paper, this paper determines the set of maximally entangled states nearest to a typical separable state which is used as an initial state in Grover's search algorithms, and to find geodesic segments which realize the above-mentioned distance. As for Grover's algorithms, it is already known that while the initial and the target states are separable, the algorithms generate sequences of entangled states. This fact is confirmed also in the entanglement measure proposed in the previous paper, and then a split Grover algorithm is proposed which generates sequences of separable states only with respect to the bipartite partition

  15. Subset-row inequalities applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

    2008-01-01

    constraints as the pricing problem. We introduce the subset-row inequalities, which are Chvatal-Gomory rank-1 cuts based on a subset of the constraints in the master problem. Applying a subset-row inequality in the master problem increases the complexity of the label-setting algorithm used to solve......This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource...... the pricing problem because an additional resource is added for each inequality. We propose a modified dominance criterion that makes it possible to dominate more labels by exploiting the step-like structure of the objective function of the pricing problem. Computational experiments have been performed...

  16. Windows Server 2012 R2 administrator cookbook

    CERN Document Server

    Krause, Jordan

    2015-01-01

    This book is intended for system administrators and IT professionals with experience in Windows Server 2008 or Windows Server 2012 environments who are looking to acquire the skills and knowledge necessary to manage and maintain the core infrastructure required for a Windows Server 2012 and Windows Server 2012 R2 environment.

  17. A non-oscillatory energy-splitting method for the computation of compressible multi-fluid flows

    Science.gov (United States)

    Lei, Xin; Li, Jiequan

    2018-04-01

    This paper proposes a new non-oscillatory energy-splitting conservative algorithm for computing multi-fluid flows in the Eulerian framework. In comparison with existing multi-fluid algorithms in the literature, it is shown that the mass fraction model with isobaric hypothesis is a plausible choice for designing numerical methods for multi-fluid flows. Then we construct a conservative Godunov-based scheme with the high order accurate extension by using the generalized Riemann problem solver, through the detailed analysis of kinetic energy exchange when fluids are mixed under the hypothesis of isobaric equilibrium. Numerical experiments are carried out for the shock-interface interaction and shock-bubble interaction problems, which display the excellent performance of this type of schemes and demonstrate that nonphysical oscillations are suppressed around material interfaces substantially.

  18. Spin Splitting in Different Semiconductor Quantum Wells

    International Nuclear Information System (INIS)

    Hao Yafei

    2012-01-01

    We theoretically investigate the spin splitting in four undoped asymmetric quantum wells in the absence of external electric field and magnetic field. The quantum well geometry dependence of spin splitting is studied with the Rashba and the Dresselhaus spin-orbit coupling included. The results show that the structure of quantum well plays an important role in spin splitting. The Rashba and the Dresselhaus spin splitting in four asymmetric quantum wells are quite different. The origin of the distinction is discussed in this work. (condensed matter: electronic structure, electrical, magnetic, and optical properties)

  19. Splitting Ward identity

    Energy Technology Data Exchange (ETDEWEB)

    Safari, Mahmoud [Institute for Research in Fundamental Sciences (IPM), School of Particles and Accelerators, P.O. Box 19395-5531, Tehran (Iran, Islamic Republic of)

    2016-04-15

    Within the background-field framework we present a path integral derivation of the splitting Ward identity for the one-particle irreducible effective action in the presence of an infrared regulator, and make connection with earlier works on the subject. The approach is general in the sense that it does not rely on how the splitting is performed. This identity is then used to address the problem of background dependence of the effective action at an arbitrary energy scale. We next introduce the modified master equation and emphasize its role in constraining the effective action. Finally, application to general gauge theories within the geometric approach is discussed. (orig.)

  20. Splitting Ward identity

    International Nuclear Information System (INIS)

    Safari, Mahmoud

    2016-01-01

    Within the background-field framework we present a path integral derivation of the splitting Ward identity for the one-particle irreducible effective action in the presence of an infrared regulator, and make connection with earlier works on the subject. The approach is general in the sense that it does not rely on how the splitting is performed. This identity is then used to address the problem of background dependence of the effective action at an arbitrary energy scale. We next introduce the modified master equation and emphasize its role in constraining the effective action. Finally, application to general gauge theories within the geometric approach is discussed. (orig.)

  1. Robustness of the ATLAS pixel clustering neural network algorithm

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00407780; The ATLAS collaboration

    2016-01-01

    Proton-proton collisions at the energy frontier puts strong constraints on track reconstruction algorithms. The algorithms depend heavily on accurate estimation of the position of particles as they traverse the inner detector elements. An artificial neural network algorithm is utilised to identify and split clusters of neighbouring read-out elements in the ATLAS pixel detector created by multiple charged particles. The method recovers otherwise lost tracks in dense environments where particles are separated by distances comparable to the size of the detector read-out elements. Such environments are highly relevant for LHC run 2, e.g. in searches for heavy resonances. Within the scope of run 2 track reconstruction performance and upgrades, the robustness of the neural network algorithm will be presented. The robustness has been studied by evaluating the stability of the algorithm’s performance under a range of variations in the pixel detector conditions.

  2. Switchable Materials for Smart Windows.

    Science.gov (United States)

    Wang, Yang; Runnerstrom, Evan L; Milliron, Delia J

    2016-06-07

    This article reviews the basic principles of and recent developments in electrochromic, photochromic, and thermochromic materials for applications in smart windows. Compared with current static windows, smart windows can dynamically modulate the transmittance of solar irradiation based on weather conditions and personal preferences, thus simultaneously improving building energy efficiency and indoor human comfort. Although some smart windows are commercially available, their widespread implementation has not yet been realized. Recent advances in nanostructured materials provide new opportunities for next-generation smart window technology owing to their unique structure-property relations. Nanomaterials can provide enhanced coloration efficiency, faster switching kinetics, and longer lifetime. In addition, their compatibility with solution processing enables low-cost and high-throughput fabrication. This review also discusses the importance of dual-band modulation of visible and near-infrared (NIR) light, as nearly 50% of solar energy lies in the NIR region. Some latest results show that solution-processable nanostructured systems can selectively modulate the NIR light without affecting the visible transmittance, thus reducing energy consumption by air conditioning, heating, and artificial lighting.

  3. A window on urban sustainability

    International Nuclear Information System (INIS)

    Stigt, Rien van; Driessen, Peter P.J.; Spit, Tejo J.M.

    2013-01-01

    Sustainable urban development requires the integration of environmental interests in urban planning. Although various methods of environmental assessment have been developed, plan outcomes are often disappointing due to the complex nature of decision-making in urban planning, which takes place in multiple arenas within multiple policy networks involving diverse stakeholders. We argue that the concept of ‘decision windows’ can structure this seemingly chaotic chain of interrelated decisions. First, explicitly considering the dynamics of the decision-making process, we further conceptualized decision windows as moments in an intricate web of substantively connected deliberative processes where issues are reframed within a decision-making arena, and interests may be linked within and across arenas. Adopting this perspective in two case studies, we then explored how decision windows arise, which factors determine their effectiveness and how their occurrence can be influenced so as to arrive at more sustainable solutions. We conclude that the integration of environmental interests in urban planning is highly dependent on the ability of the professionals involved to recognize and manipulate decision windows. Finally, we explore how decision windows may be opened. -- Highlights: • Decision-making about sustainable urban development occurs in networks. • The concept of ‘decision windows’ was further elaborated. • Decision windows help understand how environmental interests enter decision-making. • Decision windows can, to some extent, be influenced

  4. A window on urban sustainability

    Energy Technology Data Exchange (ETDEWEB)

    Stigt, Rien van, E-mail: rien.vanstigt@hu.nl [Research Center for Technology and Innovation, Utrecht University of Applied Sciences, P.O. Box 182, 3500 AD Utrecht (Netherlands); Driessen, Peter P.J., E-mail: p.driessen@uu.nl [Copernicus Institute of Sustainable Development, Faculty of Geosciences, Utrecht University, P.O. Box 80.115, 3508 TC Utrecht (Netherlands); Spit, Tejo J.M., E-mail: T.J.M.Spit@uu.nl [Department of Human Geography and Spatial Planning, Faculty of Geosciences, Utrecht University, P.O. Box 80.115, 3508 TC Utrecht (Netherlands)

    2013-09-15

    Sustainable urban development requires the integration of environmental interests in urban planning. Although various methods of environmental assessment have been developed, plan outcomes are often disappointing due to the complex nature of decision-making in urban planning, which takes place in multiple arenas within multiple policy networks involving diverse stakeholders. We argue that the concept of ‘decision windows’ can structure this seemingly chaotic chain of interrelated decisions. First, explicitly considering the dynamics of the decision-making process, we further conceptualized decision windows as moments in an intricate web of substantively connected deliberative processes where issues are reframed within a decision-making arena, and interests may be linked within and across arenas. Adopting this perspective in two case studies, we then explored how decision windows arise, which factors determine their effectiveness and how their occurrence can be influenced so as to arrive at more sustainable solutions. We conclude that the integration of environmental interests in urban planning is highly dependent on the ability of the professionals involved to recognize and manipulate decision windows. Finally, we explore how decision windows may be opened. -- Highlights: • Decision-making about sustainable urban development occurs in networks. • The concept of ‘decision windows’ was further elaborated. • Decision windows help understand how environmental interests enter decision-making. • Decision windows can, to some extent, be influenced.

  5. Travailler avec Windows 7 au CERN (FR)

    CERN Multimedia

    CERN. Geneva

    2010-01-01

    Vue d'ensemble des nouveaux concepts et des changements dans l'interface utilisateur survenus dans Windows 7 depuis les versions antérieures de Windows (XP ou Vista). La mise à disposition de Windows 7 au CERN et son intégration dans l’infrastructure de Windows au CERN seront présentées.

  6. 30 CFR 18.30 - Windows and lenses.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Windows and lenses. 18.30 Section 18.30 Mineral... § 18.30 Windows and lenses. (a) MSHA may waive testing of materials for windows or lenses except headlight lenses. When tested, material for windows or lenses shall meet the test requirements prescribed in...

  7. 49 CFR 238.114 - Rescue access windows.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 4 2010-10-01 2010-10-01 false Rescue access windows. 238.114 Section 238.114... § 238.114 Rescue access windows. (a) Number and location. Except as provided in paragraph (a)(1)(ii) of... rescue access windows. At least one rescue access window shall be located in each side of the car...

  8. Pharmaceutical counselling about different types of tablet-splitting methods based on the results of weighing tests and mechanical development of splitting devices.

    Science.gov (United States)

    Somogyi, O; Meskó, A; Csorba, L; Szabó, P; Zelkó, R

    2017-08-30

    The division of tablets and adequate methods of splitting them are a complex problem in all sectors of health care. Although tablet-splitting is often required, this procedure can be difficult for patients. Four tablets were investigated with different external features (shape, score-line, film-coat and size). The influencing effect of these features and the splitting methods was investigated according to the precision and "weight loss" of splitting techniques. All four types of tablets were halved by four methods: by hand, with a kitchen knife, with an original manufactured splitting device and with a modified tablet splitter based on a self-developed mechanical model. The mechanical parameters (harness and friability) of the products were measured during the study. The "weight loss" and precision of splitting methods were determined and compared by statistical analysis. On the basis of the results, the external features (geometry), the mechanical parameters of tablets and the mechanical structure of splitting devices can influence the "weight loss" and precision of tablet-splitting. Accordingly, a new decision-making scheme was developed for the selection of splitting methods. In addition, the skills of patients and the specialties of therapy should be considered so that pharmaceutical counselling can be more effective regarding tablet-splitting. Copyright © 2017 Elsevier B.V. All rights reserved.

  9. Iterative Splitting Methods for Differential Equations

    CERN Document Server

    Geiser, Juergen

    2011-01-01

    Iterative Splitting Methods for Differential Equations explains how to solve evolution equations via novel iterative-based splitting methods that efficiently use computational and memory resources. It focuses on systems of parabolic and hyperbolic equations, including convection-diffusion-reaction equations, heat equations, and wave equations. In the theoretical part of the book, the author discusses the main theorems and results of the stability and consistency analysis for ordinary differential equations. He then presents extensions of the iterative splitting methods to partial differential

  10. Mastering Windows Server 2008 Networking Foundations

    CERN Document Server

    Minasi, Mark; Mueller, John Paul

    2011-01-01

    Find in-depth coverage of general networking concepts and basic instruction on Windows Server 2008 installation and management including active directory, DNS, Windows storage, and TCP/IP and IPv4 networking basics in Mastering Windows Server 2008 Networking Foundations. One of three new books by best-selling author Mark Minasi, this guide explains what servers do, how basic networking works (IP basics and DNS/WINS basics), and the fundamentals of the under-the-hood technologies that support staff must understand. Learn how to install Windows Server 2008 and build a simple network, security co

  11. Microsoft Windows 7 Administration Instant Reference

    CERN Document Server

    Panek, William

    2010-01-01

    An on-the-spot reference for Windows 7 administrators. Hundreds of thousands of IT administrators, network administrators, and IT support technicians work daily with Windows 7. This well-organized, portable reference covers every facet of Windows 7, providing no-nonsense instruction that is readily accessible when you need it. Designed for busy administrators, it features thumb tabs and chapter outlines to make answers easy to find.: Windows 7 administrative and support personnel need quick answers to situations they confront each day; this Instant Reference is designed to provide information,

  12. Production management of window handles

    Directory of Open Access Journals (Sweden)

    Manuela Ingaldi

    2014-12-01

    Full Text Available In the chapter a company involved in the production of aluminum window and door handles was presented. The main customers of the company are primarily companies which produce PCV joinery and wholesalers supplying these companies. One chosen product from the research company - a single-arm pin-lift window handle - was described and its production process depicted technologically. The chapter also includes SWOT analysis conducted in the research company and the value stream of the single-arm pin-lift window handle.

  13. Evaluation of Energy Efficiency Performance of Heated Windows

    Science.gov (United States)

    Jammulamadaka, Hari Swarup

    The study about the evaluation of the performance of the heated windows was funded by the WVU Research Office as a technical assistance award at the 2014 TransTech Energy Business Development Conference to the Green Heated Glass company/project owned by Frank Dlubak. The award supports a WVU researcher to conduct a project important for commercialization. This project was awarded to the WVU Industrial Assessment Center in 2015. The current study attempted to evaluate the performance of the heated windows by developing an experimental setup to test the window at various temperatures by varying the current input to the window. The heated double pane window was installed in an insulated box. A temperature gradient was developed across the window by cooling one side of the window using gel based ice packs. The other face of the window was heated by passing current at different wattages through the window. The temperature of the inside and outside panes, current and voltage input, room and box temperature were recorded, and used to calculate the apparent R-value of the window when not being heated vs when being heated. It has been concluded from the study that the heated double pane window is more effective in reducing heat losses by as much as 50% than a non-heated double pane window, if the window temperature is maintained close to the room temperature. If the temperature of the window is much higher than the room temperature, the losses through the window appear to increase beyond that of a non-heated counterpart. The issues encountered during the current round of experiments are noted, and recommendations provided for future studies.

  14. 2-Photon tandem device for water splitting

    DEFF Research Database (Denmark)

    Seger, Brian; Castelli, Ivano Eligio; Vesborg, Peter Christian Kjærgaard

    2014-01-01

    Within the field Of photocatalytic water splitting there are several strategies to achieve the goal of efficient and cheap photocatalytic water splitting. This work examines one particular strategy by focusing on monolithically stacked, two-photon photoelectrochemical cells. The overall aim...... for photocatalytic water splitting by using a large bandgap photocathode and a low bandgap photoanode with attached protection layers....

  15. A study on hybrid split-spectrum processing technique for enhanced reliability in ultrasonic signal analysis

    International Nuclear Information System (INIS)

    Huh, Hyung; Koo, Kil Mo; Cheong, Yong Moo; Kim, G. J.

    1995-01-01

    Many signal-processing techniques have been found to be useful in ultrasonic and nondestructive evaluation. Among the most popular techniques are signal averaging, spatial compounding, matched filters, and homomorphic processing. One of the significant new process is split-spectrum processing(SSP), which can be equally useful in signal-to-noise ratio(SNR) improvement and grain characterization in several engineering materials. The purpose of this paper is to explore the utility of SSP in ultrasonic NDE. A wide variety of engineering problems are reviewed and suggestions for implementation of the technique are provided. SSP uses the frequency-dependent response of the interfering coherent noise produced by unresolvable scatters in the resolution range cell of a transducer. It is implemented by splitting the Sequency spectrum of the received signal by using Gaussian bandpass filters. The theoretical basis for the potential of SSP for grain characterization in SUS 304 material is discussed, and some experimental-evidence for the feasibility of the approach is presented. Results of SNR enhancement in signals obtained from real four samples of SUS 304. The influence of various processing parameters on the performance of the processing technique is also discussed. The minimization algorithm. which provides an excellent SNR enhancement when used either in conjunction with other SSP algorithms like polarity-check or by itself, is also presented.

  16. A Study on Hybrid Split-Spectrum Processing Technique for Enhanced Reliability in Ultrasonic Signal Analysis

    International Nuclear Information System (INIS)

    Huh, H.; Koo, K. M.; Kim, G. J.

    1996-01-01

    Many signal-processing techniques have been found to be useful in ultrasonic and nondestructive evaluation. Among the most popular techniques are signal averaging, spatial compounding, matched filters and homomorphic processing. One of the significant new process is split-spectrum processing(SSP), which can be equally useful in signal-to-noise ratio(SNR) improvement and grain characterization in several specimens. The purpose of this paper is to explore the utility of SSP in ultrasonic NDE. A wide variety of engineering problems are reviewed, and suggestions for implementation of the technique are provided. SSP uses the frequency-dependent response of the interfering coherent noise produced by unresolvable scatters in the resolution range cell of a transducer. It is implemented by splitting the frequency spectrum of the received signal by using gaussian bandpass filter. The theoretical basis for the potential of SSP for grain characterization in SUS 304 material is discussed, and some experimental evidence for the feasibility of the approach is presented. Results of SNR enhancement in signals obtained from real four samples of SUS 304. The influence of various processing parameters on the performance of the processing technique is also discussed. The minimization algorithm, which provides an excellent SNR enhancement when used either in conjunction with other SSP algorithms like polarity-check or by itself, is also presented

  17. Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem.

    Science.gov (United States)

    Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

    2015-01-01

    Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA.

  18. Modified artificial bee colony for the vehicle routing problems with time windows.

    Science.gov (United States)

    Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana

    2016-01-01

    The natural behaviour of the honeybee has attracted the attention of researchers in recent years and several algorithms have been developed that mimic swarm behaviour to solve optimisation problems. This paper introduces an artificial bee colony (ABC) algorithm for the vehicle routing problem with time windows (VRPTW). A Modified ABC algorithm is proposed to improve the solution quality of the original ABC. The high exploration ability of the ABC slows-down its convergence speed, which may due to the mechanism used by scout bees in replacing abandoned (unimproved) solutions with new ones. In the Modified ABC a list of abandoned solutions is used by the scout bees to memorise the abandoned solutions, then the scout bees select a solution from the list based on roulette wheel selection and replace by a new solution with random routs selected from the best solution. The performance of the Modified ABC is evaluated on Solomon benchmark datasets and compared with the original ABC. The computational results demonstrate that the Modified ABC outperforms the original ABC also produce good solutions when compared with the best-known results in the literature. Computational investigations show that the proposed algorithm is a good and promising approach for the VRPTW.

  19. Exam 70-411 administering Windows Server 2012

    CERN Document Server

    Course, Microsoft Official Academic

    2014-01-01

    Microsoft Windows Server is a multi-purpose server designed to increase reliability and flexibility of  a network infrastructure. Windows Server is the paramount tool used by enterprises in their datacenter and desktop strategy. The most recent versions of Windows Server also provide both server and client virtualization. Its ubiquity in the enterprise results in the need for networking professionals who know how to plan, design, implement, operate, and troubleshoot networks relying on Windows Server. Microsoft Learning is preparing the next round of its Windows Server Certification program

  20. Strategies of statistical windows in PET image reconstruction to improve the user’s real time experience

    Science.gov (United States)

    Moliner, L.; Correcher, C.; Gimenez-Alventosa, V.; Ilisie, V.; Alvarez, J.; Sanchez, S.; Rodríguez-Alvarez, M. J.

    2017-11-01

    Nowadays, with the increase of the computational power of modern computers together with the state-of-the-art reconstruction algorithms, it is possible to obtain Positron Emission Tomography (PET) images in practically real time. These facts open the door to new applications such as radio-pharmaceuticals tracking inside the body or the use of PET for image-guided procedures, such as biopsy interventions, among others. This work is a proof of concept that aims to improve the user experience with real time PET images. Fixed, incremental, overlapping, sliding and hybrid windows are the different statistical combinations of data blocks used to generate intermediate images in order to follow the path of the activity in the Field Of View (FOV). To evaluate these different combinations, a point source is placed in a dedicated breast PET device and moved along the FOV. These acquisitions are reconstructed according to the different statistical windows, resulting in a smoother transition of positions for the image reconstructions that use the sliding and hybrid window.