WorldWideScience

Sample records for factors spin-parity assignments

  1. A confirmative spin-parity assignment for the key 6.15 MeV state in $^{18}$Ne of astrophysical importance

    CERN Document Server

    Hu, J; Xu, S W; Yamaguchi, H; David, K; Ma, P; Su, J; Wang, H W; Nakao, T; Wakabayashi, Y; Teranishi, T; Moon, J Y; Jung, H S; Hashimoto, T; Chen, A; Irvine, D; Kubono, S

    2013-01-01

    Proton resonant states in $^{18}$Ne have been investigated by the resonant elastic scattering of $^{17}$F+$p$. The $^{17}$F beam was separated by the CNS radioactive ion beam separator (CRIB), and bombarded a thick H$_2$ gas target at 3.6 MeV/nucleon. The recoiled light particles were measured by using three sets of ${\\Delta}$E-E Si telescope at scattering angles of $\\theta$$_{lab}$$\\approx 3^\\circ$, 10$^\\circ$ and 18$^\\circ$, respectively. Four resonances, {\\it i.e.}, at $E_{x}$=6.15, 6.30, 6.85, and 7.05 MeV, were observed clearly. By $R$-matrix analysis of the excitation functions, $J^{\\pi}$=1$^-$ was firmly assigned to the 6.15 MeV state which is a key state in calculating the reaction rate of $^{14}$O($\\alpha$,$p$)$^{17}$F reaction. This reaction was thought to be one of the most probable key reactions for the breakout from the hot-CNO cycle to the $rp$-process in type I x-ray bursts In addition, a new excited state observed at $E_{x}$=6.85 MeV was tentatively assigned as 0$^{-}$, which could be the anal...

  2. Probing the spin-parity of the pentaquark $\\Theta^+$ baryon

    CERN Document Server

    Barmin, V V; Curceanu, C; Davidenko, G V; Guaraldo, C; Kubantsev, M A; Larin, I F; Matveev, V A; Shebanov, V A; Shishov, N N; Sokolov, L I; Tarasov, V V

    2015-01-01

    Using the DIANA data on the charge-exchange reaction K^+n --> pK^0 on a bound neutron, in which the s-channel formation of the pentaquark baryon \\Theta^+(1538) has been observed,we analyze the dependence of the background-subtracted \\Theta^+ --> pK^0 signal on the K^0 emission angle in the pK^0 rest frame. The data are consistent with the angular dependence of a form dW/d\\cos\\Theta_cms ~ (\\cos\\Theta_cms + A)^2 with a positive offset A. This form of the \\cos\\Theta_cms distribution suggests an interference between the \\Theta-mediated p-wave contribution and the nonresonant s-wave contribution to the total amplitude of the charge-exchange reaction. The p-wave nature of the \\Theta-mediated amplitude is consistent with the spin-parity assignment of 1/2^+ for the \\Theta^+ baryon. The selection in \\cos\\Theta_cms based on the observed angular dependence of the \\Theta^+ --> pK^0 signal allows to boost the statistical significance of the signal up to 6.8 standard deviations. \\e

  3. Disentangling the Spin-Parity of a Resonance via the Gold-Plated Decay Mode

    CERN Document Server

    Modak, Tanmoy; Sinha, Rahul; Cheng, Hai-Yang; Yuan, Tzu-Chiang

    2014-01-01

    Searching for new resonances and finding out their properties is an essential part of any existing or future particle physics experiment. The nature of a new resonance is characterized by its spin, charge conjugation, parity, and its couplings with the existing particles of the Standard Model. If a new resonance is found in the four lepton final state produced via two intermediate $Z$ bosons, the resonance could be a new heavy scalar or a $Z'$ boson or even a higher spin particle. In such cases the step by step methodology as enunciated in this paper can be followed to determine the spin, parity and the coupling to two $Z$ bosons of the parent particles, in a fully model-independent way. In our approach we show how three uni-angular distributions and few experimentally measurable observables can conclusively tell us about the spin, parity as well as the couplings of the new resonance to two $Z$ bosons.

  4. A spin-parity analysis of γγ-->ϱ+ϱ-

    Science.gov (United States)

    Albrecht, H.; Ehrlichmann, H.; Hamacher, T.; Krüger, A.; Nau, A.; Nippe, A.; Reidenbach, M.; Schäfer, M.; Schröder, H.; Schulz, H. D.; Sefkow, F.; Wurth, R.; Appuhn, R. D.; Hast, C.; Herrera, G.; Kolanoski, H.; Lange, A.; Lindner, A.; Mankel, R.; Schieber, M.; Schweda, G.; Siegmund, T.; Spaan, B.; Thurn, H.; Walther, A.; Wegener, D.; Paulini, M.; Reim, K.; Volland, U.; Wegener, H.; Mundt, R.; Oest, T.; Schmidt-Parzefall, W.; Funk, W.; Stiewe, J.; Werner, S.; Ball, S.; Gabriel, J. C.; Geyer, C.; Hölscher, A.; Hofmann, W.; Holzer, B.; Khan, S.; Knöpfle, K. T.; Spengler, J.; Britton, D. I.; Charlesworth, C. E. K.; Edwards, K. W.; Kapitza, H.; Krieger, P.; Kutschke, R.; Macfarlane, D. B.; Orr, R. S.; Patel, P. M.; Prentice, J. D.; Seidel, S. C.; Tsipolitis, G.; Tzamariudaki, K.; van de Water, R. G.; Yoon, T.-S.; Ressing, D.; Schael, S.; Schubert, K. R.; Strahl, K.; Waldi, R.; Weseler, S.; Boštjančič, B.; Kernel, G.; Križan, P.; Križnič, P.; Živko, T.; Cronström, H. I.; Jönsson, L.; Babaev, A.; Balagura, V.; Danilov, M.; Droutskoy, A.; Fominykh, B.; Golutvin, A.; Gorelov, I.; Ratnikov, F.; Lubimov, V.; Rostovtsev, A.; Semenov, A.; Semenov, S.; Shevchenko, V.; Soloshenko, V.; Tichomirov, I.; Zaitsev, Yu.; Childers, R.; Darden, C. W.

    1991-09-01

    A spin-parity analysis of the ϱ+ϱ- system in the reaction γγ-->ϱ+ϱ--->Π+Π-Π0Π0 has been performed using the ARGUS detector at the e+e- storage ring DORIS II at DESY. The cross section is found to be dominated by the amplitudes JP = 0+ and JP = 2+ (Jz = 2). Supported by the US Department of Energy, under contract DE-AS09-80ER 10690.

  5. Disentangling the spin-parity of a resonance via the gold-plated decay mode

    Science.gov (United States)

    Modak, Tanmoy; Sahoo, Dibyakrupa; Sinha, Rahul; Cheng, Hai-Yang; Yuan, Tzu-Chiang

    2016-03-01

    Searching for new resonances and finding out their properties is an essential part of any existing or future particle physics experiment. The nature of a new resonance is characterized by its spin, charge conjugation, parity, and its couplings with the existing particles of the Standard Model. If a new resonance is found in the four lepton final state produced via two intermediate Z bosons, the resonance could be a new heavy scalar or a Z‧ boson or even a higher spin particle. In such cases a step by step methodology as enunciated in this paper can be followed to determine the spin, parity and the coupling to two Z bosons of the parent particles, in a fully model-independent way. In our approach we show how three uni-angular distributions and a few experimentally measurable observables can conclusively tell us about the spin, parity as well as the couplings of the new resonance to two Z bosons. We have performed a numerical analysis to validate our approach and showed how the uni-angular observables can be used to disentangle the spin parity as well as the coupling of the resonance. Supported in part by MOST (Taiwan)(103-2112-M-001-005 (HYC), 101-2112-M-001-005-MY3 (TCY))

  6. Spin-parity assignments and extension of the 02+ band in 158Er

    Directory of Open Access Journals (Sweden)

    Dinoko T S

    2013-12-01

    Full Text Available Low and medium spin collective structures in 158Er have been studied using the 150Sm(12C,4nγγ fusion-evaporation reaction at a beam energy of Elab = 65 MeV. A band built on the 02+ excitation has been established and extended to Jπ = 18+ from the analysis of γ-γ coincidence relationships, intensity arguments and DCO ratios. The 02+ band in 158Er presents a similar trend to the 02+ bands in the lighter N = 90 isotones but lies about 125 keV higher. This systematic trend supports a similar configuration for the 02+ bands in the N = 90 isotones.

  7. Backward production of a spin parity 1/sup +/ rho pi enhancement at 104 GeV

    CERN Document Server

    Gavillet, P; Blokzijl, R; De van de Walle, R; Engeler, J; Ferrando, A; Foster, B; Grossman, P; Hemingway, R J; Holmgren, S O; Jongejans, B; Kittel, E W; Kluyver, J C; Lamb, P; Losty, Michael J; Marin, J C; Massaro, G G G; McDowell, W L; Montanet, Lucien; Pagiola, E; Vergeest, J; Yamdagni, N

    1977-01-01

    A spin-parity 1/sup +/ rho pi enhancement is observed for the 3 pi mass spectrum in the reaction K/sup -/p to Sigma /sup -/ pi /sup +/ pi /sup +/ pi /sup -/ where events with a small (K/sup -/ to Sigma /sup - /) momentum transfer are selected. The mass (1040 MeV) and width (230 MeV) of this enhancement are reminiscent of the A/sub 1/ to rho pi bump which has mainly been observed in the diffractive-like processes. The cross section for this enhancement at 4.15 GeV/c incident K/sup -/ momentum is (3.6+or-0.5) mu b. (16 refs).

  8. Study of the Mass and Spin-Parity of the Higgs Boson Candidate via Its Decays to Z Boson Pairs

    CERN Document Server

    Chatrchyan, Serguei; Sirunyan, Albert M; Tumasyan, Armen; Adam, Wolfgang; Aguilo, Ernest; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Fabjan, Christian; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Knünz, Valentin; Krammer, Manfred; Krätschmer, Ilse; Liko, Dietrich; Mikulec, Ivan; Pernicka, Manfred; Rabady, Dinyar; Rahbaran, Babak; Rohringer, Christine; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Taurok, Anton; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Alderweireldt, Sara; Bansal, Monika; Bansal, Sunil; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Luyckx, Sten; Mucibello, Luca; Ochesanu, Silvia; Roland, Benoit; Rougny, Romain; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Gonzalez Suarez, Rebeca; Kalogeropoulos, Alexis; Maes, Michael; Olbrechts, Annik; Tavernier, Stefaan; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Clerbaux, Barbara; De Lentdecker, Gilles; Dero, Vincent; Gay, Arnaud; Hreus, Tomas; Léonard, Alexandre; Marage, Pierre Edouard; Mohammadi, Abdollah; Reis, Thomas; Thomas, Laurent; Vander Velde, Catherine; Vanlaer, Pascal; Wang, Jian; Adler, Volker; Beernaert, Kelly; Cimmino, Anna; Costantini, Silvia; Garcia, Guillaume; Grunewald, Martin; Klein, Benjamin; Lellouch, Jérémie; Marinov, Andrey; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Sigamani, Michael; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Walsh, Sinead; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Bruno, Giacomo; Castello, Roberto; Ceard, Ludivine; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Hollar, Jonathan; Lemaitre, Vincent; Liao, Junhui; Militaru, Otilia; Nuttens, Claude; Pagano, Davide; Pin, Arnaud; Piotrzkowski, Krzysztof; Selvaggi, Michele; Vizan Garcia, Jesus Manuel; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Hammad, Gregory Habib; Alves, Gilvan; Correa Martins Junior, Marcos; Martins, Thiago; Pol, Maria Elena; Henrique Gomes E Souza, Moacyr; Aldá Júnior, Walter Luiz; Carvalho, Wagner; Chinellato, Jose; Custódio, Analu; Melo Da Costa, Eliza; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Malbouisson, Helena; Malek, Magdalena; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Soares Jorge, Luana; Sznajder, Andre; Tonelli Manganote, Edmilson José; Vilela Pereira, Antonio; Souza Dos Anjos, Tiago; Bernardes, Cesar Augusto; De Almeida Dias, Flavia; Tomei, Thiago; De Moraes Gregores, Eduardo; Lagana, Caio; Da Cunha Marinho, Franciole; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Genchev, Vladimir; Iaydjiev, Plamen; Piperov, Stefan; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Tcholakov, Vanio; Trayanov, Rumen; Vutova, Mariana; Dimitrov, Anton; Hadjiiska, Roumyana; Kozhuharov, Venelin; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Jiang, Chun-Hua; Liang, Dong; Liang, Song; Meng, Xiangwei; Tao, Junquan; Wang, Jian; Wang, Xianyou; Wang, Zheng; Xiao, Hong; Xu, Ming; Zang, Jingjing; Zhang, Zhen; Asawatangtrakuldee, Chayanit; Ban, Yong; Guo, Yifei; Li, Wenbo; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Teng, Haiyun; Wang, Dayong; Zhang, Linlin; Zou, Wei; Avila, Carlos; Carrillo Montoya, Camilo Andres; Gomez, Juan Pablo; Gomez Moreno, Bernardo; Osorio Oliveros, Andres Felipe; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Plestina, Roko; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Duric, Senka; Kadija, Kreso; Luetic, Jelena; Mekterovic, Darko; Morovic, Srecko; Tikvica, Lucija; Attikis, Alexandros; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Elgammal, Sherif; Ellithi Kamel, Ali; Kuotb Awad, Alaa Metwaly; Mahmoud, Mohammed; Radi, Amr; Kadastik, Mario; Müntel, Mait; Murumaa, Marion; Raidal, Martti; Rebane, Liis; Tiko, Andres; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Härkönen, Jaakko; Heikkinen, Mika Aatos; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa

    2013-01-01

    A study is presented of the mass and spin-parity of the new boson recently observed at the LHC at a mass near 125 GeV. An integrated luminosity of 17.3 inverse femtobarns, collected by the CMS experiment in proton-proton collisions at center-of-mass energies of 7 and 8 TeV, is used. The measured mass in the ZZ channel, where both Z bosons decay to e or $\\mu$ pairs, is 126.2 $\\pm$ 0.6 (stat.) $\\pm$ 0.2 (syst.) GeV. The angular distributions of the lepton pairs in this channel are sensitive to the spin-parity of the boson. Under the assumption of spin 0, the present data are consistent with the pure scalar hypothesis, while disfavoring the pure pseudoscalar hypothesis.

  9. The preformation probability inside Alpha-emitters having different ground state spin-parity than daughters

    CERN Document Server

    Seif, W M; Refaie, A I

    2015-01-01

    The ground-state spin and parity of a formed daughter in the radioactive Alpha-emitter is expected to influence the preformation probability of the Alpha and daughter clusters inside it. We investigate the Alpha and daughter preformation probability inside odd-A and doubly-odd radioactive nuclei when the daughter and parent are of different spin and/or parity. We consider only the ground-state to ground-state unfavored decays. This is to extract precise information about the effect of the difference in the ground states spin-parity of the involved nuclei far away any influences from the excitation energy if the decays are coming from isomeric states. The calculations are done for 161 Alpha-emitters, with Z=65-112 and N=84-173, in the framework of the extended cluster model, with WKB penetrability and assault frequency. We used a Hamiltonian energy density scheme based on Skyrme-SLy4 interaction to compute the interaction potential. The Alpha plus cluster preformation probability is extracted from the calculat...

  10. Backward production of a spin-parity 1/sup +/ K rho resonance at 128 GeV

    CERN Document Server

    Gavillet, P; Díaz, J; Dionisi, C; Engelen, J J; Foster, B; Grossmann, P; Gurtu, A; Hemingway, R J; Jongejans, B; Kittel, E W; Losty, Michael J; Marin, J C; Massaro, G G G; Mazzucato, M; McDowell, W L; Montanet, Lucien; Pagiola, E; Van de Walle, R T; Vergeest, J S M; Voorthuis, H

    1978-01-01

    A (K pi pi )/sup +/ mass enhancement is observed in the reactions K /sup -/p to Xi /sup -/K/sup 0+//sub pi //sup +/ pi /sup 0-/ when events with a small (K/sup -/ to Xi /sup -/) four momentum transfer squared are selected. The signal is also visible in the reaction K/sup -/p to Xi /sup -/ pi /sup +/+neutrals. The enhancement, centered at 1.28 GeV, is seen to decay preferentially into K rho with spin-parity JP=1/sup +/. The cross section for K/sup -/p to Xi /sup -/C/sup + /(1.28) with C/sup +/ to K rho at 4.15 GeV/c incident K/sup -/ momentum is (6.2+or-0.6) mu b. (11 refs).

  11. Constraints on the spin-parity and anomalous $\\mathrm{HVV}$ couplings of the Higgs boson in proton collisions at 7 and 8 TeV

    CERN Document Server

    Khachatryan, Vardan; Tumasyan, Armen; Adam, Wolfgang; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hartl, Christian; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Knünz, Valentin; Krammer, Manfred; Krätschmer, Ilse; Liko, Dietrich; Mikulec, Ivan; Rabady, Dinyar; Rahbaran, Babak; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Treberer-Treberspurg, Wolfgang; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Alderweireldt, Sara; Bansal, Sunil; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Knutsson, Albert; Lauwers, Jasper; Luyckx, Sten; Ochesanu, Silvia; Rougny, Romain; Van De Klundert, Merijn; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Daci, Nadir; Heracleous, Natalie; Keaveney, James; Lowette, Steven; Maes, Michael; Olbrechts, Annik; Python, Quentin; Strom, Derek; Tavernier, Stefaan; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Caillol, Cécile; Clerbaux, Barbara; De Lentdecker, Gilles; Dobur, Didar; Favart, Laurent; Gay, Arnaud; Grebenyuk, Anastasia; Léonard, Alexandre; Mohammadi, Abdollah; Perniè, Luca; Randle-conde, Aidan; Reis, Thomas; Seva, Tomislav; Thomas, Laurent; Vander Velde, Catherine; Vanlaer, Pascal; Wang, Jian; Zenoni, Florian; Adler, Volker; Beernaert, Kelly; Benucci, Leonardo; Cimmino, Anna; Costantini, Silvia; Crucy, Shannon; Dildick, Sven; Fagot, Alexis; Garcia, Guillaume; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Salva Diblen, Sinem; Sigamani, Michael; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Beluffi, Camille; Bruno, Giacomo; Castello, Roberto; Caudron, Adrien; Ceard, Ludivine; Da Silveira, Gustavo Gil; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Hollar, Jonathan; Jafari, Abideh; Jez, Pavel; Komm, Matthias; Lemaitre, Vincent; Nuttens, Claude; Perrini, Lucia; Pin, Arnaud; Piotrzkowski, Krzysztof; Popov, Andrey; Quertenmont, Loic; Selvaggi, Michele; Vidal Marono, Miguel; Vizan Garcia, Jesus Manuel; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Hammad, Gregory Habib; Aldá Júnior, Walter Luiz; Alves, Gilvan; Brito, Lucas; Correa Martins Junior, Marcos; Dos Reis Martins, Thiago; Molina, Jorge; Mora Herrera, Clemencia; Pol, Maria Elena; Rebello Teles, Patricia; Carvalho, Wagner; Chinellato, Jose; Custódio, Analu; Da Costa, Eliza Melo; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Malbouisson, Helena; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santaolalla, Javier; Santoro, Alberto; Sznajder, Andre; Tonelli Manganote, Edmilson José; Vilela Pereira, Antonio; Bernardes, Cesar Augusto; Dogra, Sunil; Tomei, Thiago; De Moraes Gregores, Eduardo; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Aleksandrov, Aleksandar; Genchev, Vladimir; Hadjiiska, Roumyana; Iaydjiev, Plamen; Marinov, Andrey; Piperov, Stefan; Rodozov, Mircho; Sultanov, Georgi; Vutova, Mariana; Dimitrov, Anton; Glushkov, Ivan; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Chen, Mingshui; Cheng, Tongguang; Du, Ran; Jiang, Chun-Hua; Plestina, Roko; Romeo, Francesco; Tao, Junquan; Wang, Zheng; Asawatangtrakuldee, Chayanit; Ban, Yong; Li, Qiang; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Wang, Dayong; Xu, Zijun; Zou, Wei; Avila, Carlos; Cabrera, Andrés; Chaparro Sierra, Luisa Fernanda; Florez, Carlos; Gomez, Juan Pablo; Gomez Moreno, Bernardo; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Kadija, Kreso; Luetic, Jelena; Mekterovic, Darko; Sudic, Lucija; Attikis, Alexandros; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Bodlak, Martin; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Ellithi Kamel, Ali; Mahmoud, Mohammed; Radi, Amr; Kadastik, Mario; Murumaa, Marion; Raidal, Martti; Tiko, Andres; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Härkönen, Jaakko; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa; Wendland, Lauri; Talvitie, Joonas; Tuuva, Tuure; Besancon, Marc; Couderc, Fabrice; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Favaro, Carlotta; Ferri, Federico; Ganjour, Serguei; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Locci, Elizabeth; Malcles, Julie; Rander, John; Rosowsky, André; Titov, Maksym; Baffioni, Stephanie; Beaudette, Florian; Busson, Philippe; Charlot, Claude; Dahms, Torsten; Dalchenko, Mykhailo; Dobrzynski, Ludwik; Filipovic, Nicolas; Florent, Alice; Granier de Cassagnac, Raphael; Mastrolorenzo, Luca; Miné, Philippe; Naranjo, Ivo Nicolas; Nguyen, Matthew; Ochando, Christophe; Ortona, Giacomo; Paganini, Pascal; Regnard, Simon; Salerno, Roberto; Sauvan, Jean-Baptiste; Sirois, Yves; Veelken, Christian; Yilmaz, Yetkin; Zabi, Alexandre; Agram, Jean-Laurent; Andrea, Jeremy; Aubin, Alexandre; Bloch, Daniel; Brom, Jean-Marie; Chabert, Eric Christian; Collard, Caroline; Conte, Eric; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Goetzmann, Christophe; Le Bihan, Anne-Catherine; Skovpen, Kirill; Van Hove, Pierre; Gadrat, Sébastien; Beauceron, Stephanie; Beaupere, Nicolas; Bernet, Colin; Boudoul, Gaelle; Bouvier, Elvire; Brochet, Sébastien; Carrillo Montoya, Camilo Andres; Chasserat, Julien; Chierici, Roberto; Contardo, Didier; Depasse, Pierre; El Mamouni, Houmani; Fan, Jiawei; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Ille, Bernard; Kurca, Tibor; Lethuillier, Morgan; Mirabito, Laurent; Perries, Stephane; Ruiz Alvarez, José David; Sabes, David; Sgandurra, Louis; Sordini, Viola; Vander Donckt, Muriel; Verdier, Patrice; Viret, Sébastien; Xiao, Hong; Tsamalaidze, Zviad; Autermann, Christian; Beranek, Sarah; Bontenackels, Michael; Edelhoff, Matthias; Feld, Lutz; Heister, Arno; Hindrichs, Otto; Klein, Katja; Ostapchuk, Andrey; Preuten, Marius; Raupach, Frank; Sammet, Jan; Schael, Stefan; Schulte, Jan-Frederik; Weber, Hendrik; Wittmer, Bruno; Zhukov, Valery; Ata, Metin; Brodski, Michael; Dietz-Laursonn, Erik; Duchardt, Deborah; Erdmann, Martin; Fischer, Robert; Güth, Andreas; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Klingebiel, Dennis; Knutzen, Simon; Kreuzer, Peter; Merschmeyer, Markus; Meyer, Arnd; Millet, Philipp; Olschewski, Mark; Padeken, Klaas; Papacz, Paul; Reithler, Hans; Schmitz, Stefan Antonius; Sonnenschein, Lars; Teyssier, Daniel; Thüer, Sebastian; Weber, Martin; Cherepanov, Vladimir; Erdogan, Yusuf; Flügge, Günter; Geenen, Heiko; Geisler, Matthias; Haj Ahmad, Wael; Hoehle, Felix; Kargoll, Bastian; Kress, Thomas; Kuessel, Yvonne; Künsken, Andreas; Lingemann, Joschka; Nowack, Andreas; Nugent, Ian Michael; Pooth, Oliver; Stahl, Achim; Aldaya Martin, Maria; Asin, Ivan; Bartosik, Nazar; Behr, Joerg; Behrens, Ulf; Bell, Alan James; Bethani, Agni; Borras, Kerstin; Burgmeier, Armin; Cakir, Altan; Calligaris, Luigi; Campbell, Alan; Choudhury, Somnath; Costanza, Francesco; Diez Pardos, Carmen; Dolinska, Ganna; Dooling, Samantha; Dorland, Tyler; Eckerlin, Guenter; Eckstein, Doris; Eichhorn, Thomas; Flucke, Gero; Garay Garcia, Jasone; Geiser, Achim; Gunnellini, Paolo; Hauk, Johannes; Hempel, Maria; Jung, Hannes; Kalogeropoulos, Alexis; Kasemann, Matthias; Katsas, Panagiotis; Kieseler, Jan; Kleinwort, Claus; Korol, Ievgen; Krücker, Dirk; Lange, Wolfgang; Leonard, Jessica; Lipka, Katerina; Lobanov, Artur; Lohmann, Wolfgang; Lutz, Benjamin; Mankel, Rainer; Marfin, Ihar; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mittag, Gregor; Mnich, Joachim; Mussgiller, Andreas; Naumann-Emme, Sebastian; Nayak, Aruna; Ntomari, Eleni; Perrey, Hanno; Pitzl, Daniel; Placakyte, Ringaile; Raspereza, Alexei; Ribeiro Cipriano, Pedro M; Roland, Benoit; Ron, Elias; Sahin, Mehmet Özgür; Salfeld-Nebgen, Jakob; Saxena, Pooja; Schoerner-Sadenius, Thomas; Schröder, Matthias; Seitz, Claudia; Spannagel, Simon; Vargas Trevino, Andrea Del Rocio; Walsh, Roberval; Wissing, Christoph; Blobel, Volker; Centis Vignali, Matteo; Draeger, Arne-Rasmus; Erfle, Joachim; Garutti, Erika; Goebel, Kristin; Görner, Martin; Haller, Johannes; Hoffmann, Malte; Höing, Rebekka Sophie; Junkes, Alexandra; Kirschenmann, Henning; Klanner, Robert; Kogler, Roman; Lange, Jörn; Lapsien, Tobias; Lenz, Teresa; Marchesini, Ivan; Ott, Jochen; Peiffer, Thomas; Perieanu, Adrian; Pietsch, Niklas; Poehlsen, Jennifer; Pöhlsen, Thomas; Rathjens, Denis; Sander, Christian; Schettler, Hannes; Schleper, Peter; Schlieckau, Eike; Schmidt, Alexander; Seidel, Markus; Sola, Valentina; Stadie, Hartmut; Steinbrück, Georg; Troendle, Daniel; Usai, Emanuele; Vanelderen, Lukas; Vanhoefer, Annika; Barth, Christian; Baus, Colin; Berger, Joram; Böser, Christian; Butz, Erik; Chwalek, Thorsten; De Boer, Wim; Descroix, Alexis; Dierlamm, Alexander; Feindt, Michael; Frensch, Felix; Giffels, Manuel; Gilbert, Andrew; Hartmann, Frank; Hauth, Thomas; Husemann, Ulrich; Katkov, Igor; Kornmayer, Andreas; Kuznetsova, Ekaterina; Lobelle Pardo, Patricia; Mozer, Matthias Ulrich; Müller, Thomas; Müller, Thomas; Nürnberg, Andreas; Quast, Gunter; Rabbertz, Klaus; Röcker, Steffen; Simonis, Hans-Jürgen; Stober, Fred-Markus Helmut; Ulrich, Ralf; Wagner-Kuhr, Jeannine; Wayand, Stefan; Weiler, Thomas; Wolf, Roger; Anagnostou, Georgios; Daskalakis, Georgios; Geralis, Theodoros; Giakoumopoulou, Viktoria Athina; Kyriakis, Aristotelis; Loukas, Demetrios; Markou, Athanasios; Markou, Christos; Psallidas, Andreas; Topsis-Giotis, Iasonas; Agapitos, Antonis; Kesisoglou, Stilianos; Panagiotou, Apostolos; Saoulidou, Niki; Stiliaris, Efstathios; Aslanoglou, Xenofon; Evangelou, Ioannis; Flouris, Giannis; Foudas, Costas; Kokkas, Panagiotis; Manthos, Nikolaos; Papadopoulos, Ioannis; Paradas, Evangelos; Strologas, John; Bencze, Gyorgy; Hajdu, Csaba; Hidas, Pàl; Horvath, Dezso; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Zsigmond, Anna Julia; Beni, Noemi; Czellar, Sandor; Karancsi, János; Molnar, Jozsef; Palinkas, Jozsef; Szillasi, Zoltan; Makovec, Alajos; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Swain, Sanjay Kumar; Beri, Suman Bala; Bhatnagar, Vipin; Gupta, Ruchi; Bhawandeep, Bhawandeep; Kalsi, Amandeep Kaur; Kaur, Manjit; Kumar, Ramandeep; Mittal, Monika; Nishu, Nishu; Singh, Jasbir; Kumar, Ashok; Kumar, Arun; Ahuja, Sudha; Bhardwaj, Ashutosh; Choudhary, Brajesh C; Kumar, Ajay; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Varun; Banerjee, Sunanda; Bhattacharya, Satyaki; Chatterjee, Kalyanmoy; Dutta, Suchandra; Gomber, Bhawna; Jain, Sandhya; Jain, Shilpi; Khurana, Raman; Modak, Atanu; Mukherjee, Swagata; Roy, Debarati; Sarkar, Subir; Sharan, Manoj; Abdulsalam, Abdulla; Dutta, Dipanwita; Kumar, Vineet; Mohanty, Ajit Kumar; Pant, Lalit Mohan; Shukla, Prashant; Topkar, Anita; Aziz, Tariq; Banerjee, Sudeshna; Bhowmik, Sandeep; Chatterjee, Rajdeep Mohan; Dewanjee, Ram Krishna; Dugad, Shashikant; Ganguly, Sanmay; Ghosh, Saranya; Guchait, Monoranjan; Gurtu, Atul; Kole, Gouranga; Kumar, Sanjeev; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Mohanty, Gagan Bihari; Parida, Bibhuti; Sudhakar, Katta; Wickramage, Nadeesha; Bakhshiansohi, Hamed; Behnamian, Hadi; Etesami, Seyed Mohsen; Fahim, Ali; Goldouzian, Reza; Khakzad, Mohsen; Mohammadi Najafabadi, Mojtaba; Naseri, Mohsen; Paktinat Mehdiabadi, Saeid; Rezaei Hosseinabadi, Ferdos; Safarzadeh, Batool; Zeinali, Maryam; Felcini, Marta; Grunewald, Martin; Abbrescia, Marcello; Calabria, Cesare; Chhibra, Simranjit Singh; Colaleo, Anna; Creanza, Donato; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Maggi, Giorgio; Maggi, Marcello; My, Salvatore; Nuzzo, Salvatore; Pompili, Alexis; Pugliese, Gabriella; Radogna, Raffaella; Selvaggi, Giovanna; Sharma, Archana; Silvestris, Lucia; Venditti, Rosamaria; Verwilligen, Piet; Abbiendi, Giovanni; Benvenuti, Alberto; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Campanini, Renato; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Codispoti, Giuseppe; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Guiducci, Luigi; Marcellini, Stefano; Masetti, Gianni; Montanari, Alessandro; Navarria, Francesco; Perrotta, Andrea; Primavera, Federica; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gian Piero; Tosi, Nicolò; Travaglini, Riccardo; Albergo, Sebastiano; Cappello, Gigi; Chiorboli, Massimiliano; Costa, Salvatore; Giordano, Ferdinando; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Gallo, Elisabetta; Gonzi, Sandro; Gori, Valentina; Lenzi, Piergiulio; Meschini, Marco; Paoletti, Simone; Sguazzoni, Giacomo; Tropiano, Antonio; Benussi, Luigi; Bianco, Stefano; Fabbri, Franco; Piccolo, Davide; Ferretti, Roberta; Ferro, Fabrizio; Lo Vetere, Maurizio; Robutti, Enrico; Tosi, Silvano; Dinardo, Mauro Emanuele; Fiorendi, Sara; Gennai, Simone; Gerosa, Raffaele; Ghezzi, Alessio; Govoni, Pietro; Lucchini, Marco Toliman; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Martelli, Arabella; Marzocchi, Badder; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Ragazzi, Stefano; Redaelli, Nicola; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Cavallo, Nicola; Di Guida, Salvatore; Fabozzi, Francesco; Iorio, Alberto Orso Maria; Lista, Luca; Meola, Sabino; Merola, Mario; Paolucci, Pierluigi; Azzi, Patrizia; Bacchetta, Nicola; Bisello, Dario; Branca, Antonio; Carlin, Roberto; Checchia, Paolo; Dall'Osso, Martino; Dorigo, Tommaso; Dosselli, Umberto; Galanti, Mario; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Kanishchev, Konstantin; Lacaprara, Stefano; Margoni, Martino; Meneguzzo, Anna Teresa; Pazzini, Jacopo; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Tosi, Mia; Zotto, Pierluigi; Zucchetta, Alberto; Zumerle, Gianni; Gabusi, Michele; Ratti, Sergio P; Re, Valerio; Riccardi, Cristina; Salvini, Paola; Vitulo, Paolo; Biasini, Maurizio; Bilei, Gian Mario; Ciangottini, Diego; Fanò, Livio; Lariccia, Paolo; Mantovani, Giancarlo; Menichelli, Mauro; Saha, Anirban; Santocchia, Attilio; Spiezia, Aniello; Androsov, Konstantin; Azzurri, Paolo; Bagliesi, Giuseppe; Bernardini, Jacopo; Boccali, Tommaso; Broccolo, Giuseppe; Castaldi, Rino; Ciocci, Maria Agnese; Dell'Orso, Roberto; Donato, Silvio; Fiori, Francesco; Foà, Lorenzo; Giassi, Alessandro; Grippo, Maria Teresa; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Moon, Chang-Seong; Palla, Fabrizio; Rizzi, Andrea; Savoy-Navarro, Aurore; Serban, Alin Titus; Spagnolo, Paolo; Squillacioti, Paola; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Vernieri, Caterina; Barone, Luciano; Cavallari, Francesca; D'imperio, Giulia; Del Re, Daniele; Diemoz, Marcella; Jorda, Clara; Longo, Egidio; Margaroli, Fabrizio; Meridiani, Paolo; Micheli, Francesco; Organtini, Giovanni; Paramatti, Riccardo; Rahatlou, Shahram; Rovelli, Chiara; Santanastasio, Francesco; Soffi, Livia; Traczyk, Piotr; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Bellan, Riccardo; Biino, Cristina; Cartiglia, Nicolo; Casasso, Stefano; Costa, Marco; Degano, Alessandro; Demaria, Natale; Finco, Linda; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Musich, Marco; Obertino, Maria Margherita; Pacher, Luca; Pastrone, Nadia; Pelliccioni, Mario; Pinna Angioni, Gian Luca; Potenza, Alberto; Romero, Alessandra; Ruspa, Marta; Sacchi, Roberto; Solano, Ada; Staiano, Amedeo; Tamponi, Umberto; Belforte, Stefano; Candelise, Vieri; Casarsa, Massimo; Cossutti, Fabio; Della Ricca, Giuseppe; Gobbo, Benigno; La Licata, Chiara; Marone, Matteo; Schizzi, Andrea; Umer, Tomo; Zanetti, Anna; Chang, Sunghyun; Kropivnitskaya, Anna; Nam, Soon-Kwon; Kim, Dong Hee; Kim, Gui Nyun; Kim, Min Suk; Kong, Dae Jung; Lee, Sangeun; Oh, Young Do; Park, Hyangkyu; Sakharov, Alexandre; Son, Dong-Chul; Kim, Tae Jeong; Ryu, Min Sang; Kim, Jae Yool; Moon, Dong Ho; Song, Sanghyeon; Choi, Suyong; Gyun, Dooyeon; Hong, Byung-Sik; Jo, Mihee; Kim, Hyunchul; Kim, Yongsun; Lee, Byounghoon; Lee, Kyong Sei; Park, Sung Keun; Roh, Youn; Yoo, Hwi Dong; Choi, Minkyoo; Kim, Ji Hyun; Park, Inkyu; Ryu, Geonmo; Choi, Young-Il; Choi, Young Kyu; Goh, Junghwan; Kim, Donghyun; Kwon, Eunhyang; Lee, Jongseok; Yu, Intae; Juodagalvis, Andrius; Komaragiri, Jyothsna Rani; Md Ali, Mohd Adli Bin; Casimiro Linares, Edgar; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-de La Cruz, Ivan; Hernandez-Almada, Alberto; Lopez-Fernandez, Ricardo; Sánchez Hernández, Alberto; Carrillo Moreno, Salvador; Vazquez Valencia, Fabiola; Pedraza, Isabel; Salazar Ibarguen, Humberto Antonio; Morelos Pineda, Antonio; Krofcheck, David; Butler, Philip H; Reucroft, Steve; Ahmad, Ashfaq; Ahmad, Muhammad; Hassan, Qamar; Hoorani, Hafeez R; Khan, Wajid Ali; Khurshid, Taimoor; Shoaib, Muhammad; Bialkowska, Helena; Bluj, Michal; Boimska, Bożena; Frueboes, Tomasz; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Zalewski, Piotr; Brona, Grzegorz; Bunkowski, Karol; Cwiok, Mikolaj; Dominik, Wojciech; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Misiura, Maciej; Olszewski, Michał; Bargassa, Pedrame; Beirão Da Cruz E Silva, Cristóvão; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Lloret Iglesias, Lara; Nguyen, Federico; Rodrigues Antunes, Joao; Seixas, Joao; Varela, Joao; Vischia, Pietro; Afanasiev, Serguei; Bunin, Pavel; Gavrilenko, Mikhail; Golutvin, Igor; Gorbunov, Ilya; Kamenev, Alexey; Karjavin, Vladimir; Konoplyanikov, Viktor; Lanev, Alexander; Malakhov, Alexander; Matveev, Viktor; Moisenz, Petr; Palichik, Vladimir; Perelygin, Victor; Shmatov, Sergey; Skatchkov, Nikolai; Smirnov, Vitaly; Zarubin, Anatoli; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Levchenko, Petr; Murzin, Victor; Oreshkin, Vadim; Smirnov, Igor; Sulimov, Valentin; Uvarov, Lev; Vavilov, Sergey; Vorobyev, Alexey; Vorobyev, Andrey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Kirsanov, Mikhail; Krasnikov, Nikolai; Pashenkov, Anatoli; Tlisov, Danila; Toropin, Alexander; Epshteyn, Vladimir; Gavrilov, Vladimir; Lychkovskaya, Natalia; Popov, Vladimir; Pozdnyakov, Ivan; Safronov, Grigory; Semenov, Sergey; Spiridonov, Alexander; Stolin, Viatcheslav; Vlasov, Evgueni; Zhokin, Alexander; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Mesyats, Gennady; Rusakov, Sergey V; Vinogradov, Alexey; Belyaev, Andrey; Boos, Edouard; Bunichev, Viacheslav; Dubinin, Mikhail; Dudko, Lev; Gribushin, Andrey; Klyukhin, Vyacheslav; Kodolova, Olga; Lokhtin, Igor; Obraztsov, Stepan; Perfilov, Maxim; Petrushanko, Sergey; Savrin, Viktor; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Kachanov, Vassili; Kalinin, Alexey; Konstantinov, Dmitri; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Tourtchanovitch, Leonid; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Ekmedzic, Marko; Milosevic, Jovan; Rekovic, Vladimir; Alcaraz Maestre, Juan; Battilana, Carlo; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Domínguez Vázquez, Daniel; Escalante Del Valle, Alberto; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Navarro De Martino, Eduardo; Pérez-Calero Yzquierdo, Antonio María; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Soares, Mara Senghi; Albajar, Carmen; de Trocóniz, Jorge F; Missiroli, Marino; Moran, Dermot; Brun, Hugues; Cuevas, Javier; Fernandez Menendez, Javier; Folgueras, Santiago; Gonzalez Caballero, Isidro; Brochero Cifuentes, Javier Andres; Cabrillo, Iban Jose; Calderon, Alicia; Duarte Campderros, Jordi; Fernandez, Marcos; Gomez, Gervasio; Graziano, Alberto; Lopez Virto, Amparo; Marco, Jesus; Marco, Rafael; Martinez Rivero, Celso; Matorras, Francisco; Munoz Sanchez, Francisca Javiela; Piedra Gomez, Jonatan; Rodrigo, Teresa; Rodríguez-Marrero, Ana Yaiza; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Bachtis, Michail; Baillon, Paul; Ball, Austin; Barney, David; Benaglia, Andrea; Bendavid, Joshua; Benhabib, Lamia; Benitez, Jose F; Bloch, Philippe; Bocci, Andrea; Bonato, Alessio; Bondu, Olivier; Botta, Cristina; Breuker, Horst; Camporesi, Tiziano; Cerminara, Gianluca; Colafranceschi, Stefano; D'Alfonso, Mariarosaria; D'Enterria, David; Dabrowski, Anne; David Tinoco Mendes, Andre; De Guio, Federico; De Roeck, Albert; De Visscher, Simon; Di Marco, Emanuele; Dobson, Marc; Dordevic, Milos; Dorney, Brian; Dupont-Sagorin, Niels; Elliott-Peisert, Anna; Franzoni, Giovanni; Funk, Wolfgang; Gigi, Dominique; Gill, Karl; Giordano, Domenico; Girone, Maria; Glege, Frank; Guida, Roberto; Gundacker, Stefan; Guthoff, Moritz; Hammer, Josef; Hansen, Magnus; Harris, Philip; Hegeman, Jeroen; Innocente, Vincenzo; Janot, Patrick; Kousouris, Konstantinos; Krajczar, Krisztian; Lecoq, Paul; Lourenco, Carlos; Magini, Nicolo; Malgeri, Luca; Mannelli, Marcello; Marrouche, Jad; Masetti, Lorenzo; Meijers, Frans; Mersi, Stefano; Meschi, Emilio; Moortgat, Filip; Morovic, Srecko; Mulders, Martijn; Orsini, Luciano; Pape, Luc; Perez, Emmanuelle; Petrilli, Achille; Petrucciani, Giovanni; Pfeiffer, Andreas; Pimiä, Martti; Piparo, Danilo; Plagge, Michael; Racz, Attila; Rolandi, Gigi; Rovere, Marco; Sakulin, Hannes; Schäfer, Christoph; Schwick, Christoph; Sharma, Archana; Siegrist, Patrice; Silva, Pedro; Simon, Michal; Sphicas, Paraskevas; Spiga, Daniele; Steggemann, Jan; Stieger, Benjamin; Stoye, Markus; Takahashi, Yuta; Treille, Daniel; Tsirou, Andromachi; Veres, Gabor Istvan; Wardle, Nicholas; Wöhri, Hermine Katharina; Wollny, Heiner; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; Kotlinski, Danek; Langenegger, Urs; Renker, Dieter; Rohe, Tilman; Bachmair, Felix; Bäni, Lukas; Bianchini, Lorenzo; Buchmann, Marco-Andrea; Casal, Bruno; Chanon, Nicolas; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Dünser, Marc; Eller, Philipp; Grab, Christoph; Hits, Dmitry; Hoss, Jan; Lustermann, Werner; Mangano, Boris; Marini, Andrea Carlo; Marionneau, Matthieu; Martinez Ruiz del Arbol, Pablo; Masciovecchio, Mario; Meister, Daniel; Mohr, Niklas; Musella, Pasquale; Nägeli, Christoph; Nessi-Tedaldi, Francesca; Pandolfi, Francesco; Pauss, Felicitas; Perrozzi, Luca; Peruzzi, Marco; Quittnat, Milena; Rebane, Liis; Rossini, Marco; Starodumov, Andrei; Takahashi, Maiko; Theofilatos, Konstantinos; Wallny, Rainer; Weber, Hannsjoerg Artur; Amsler, Claude; Canelli, Maria Florencia; Chiochia, Vincenzo; De Cosa, Annapaola; Hinzmann, Andreas; Hreus, Tomas; Kilminster, Benjamin; Lange, Clemens; Millan Mejias, Barbara; Ngadiuba, Jennifer; Pinna, Deborah; Robmann, Peter; Ronga, Frederic Jean; Taroni, Silvia; Verzetti, Mauro; Yang, Yong; Cardaci, Marco; Chen, Kuan-Hsin; Ferro, Cristina; Kuo, Chia-Ming; Lin, Willis; Lu, Yun-Ju; Volpe, Roberta; Yu, Shin-Shan; Chang, Paoti; Chang, You-Hao; Chang, Yu-Wei; Chao, Yuan; Chen, Kai-Feng; Chen, Po-Hsun; Dietz, Charles; Grundler, Ulysses; Hou, George Wei-Shu; Kao, Kai-Yi; Liu, Yueh-Feng; Lu, Rong-Shyang; Petrakou, Eleni; Tzeng, Yeng-Ming; Wilken, Rachel; Asavapibhop, Burin; Singh, Gurpreet; Srimanobhas, Norraphat; Suwonjandee, Narumon; Adiguzel, Aytul; Bakirci, Mustafa Numan; Cerci, Salim; Dozen, Candan; Dumanoglu, Isa; Eskut, Eda; Girgis, Semiray; Gokbulut, Gul; Guler, Yalcin; Gurpinar, Emine; Hos, Ilknur; Kangal, Evrim Ersin; Kayis Topaksu, Aysel; Onengut, Gulsen; Ozdemir, Kadri; Ozturk, Sertac; Polatoz, Ayse; Sunar Cerci, Deniz; Tali, Bayram; Topakli, Huseyin; Vergili, Mehmet; Zorbilmez, Caglar; Akin, Ilina Vasileva; Bilin, Bugra; Bilmis, Selcuk; Gamsizkan, Halil; Isildak, Bora; Karapinar, Guler; Ocalan, Kadir; Sekmen, Sezen; Surat, Ugur Emrah; Yalvac, Metin; Zeyrek, Mehmet; Albayrak, Elif Asli; Gülmez, Erhan; Kaya, Mithat; Kaya, Ozlem; Yetkin, Taylan; Cankocak, Kerem; Vardarli, Fuat Ilkehan; Levchuk, Leonid; Sorokin, Pavel; Brooke, James John; Clement, Emyr; Cussans, David; Flacher, Henning; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Jacob, Jeson; Kreczko, Lukasz; Lucas, Chris; Meng, Zhaoxia; Newbold, Dave M; Paramesvaran, Sudarshan; Poll, Anthony; Sakuma, Tai; Seif El Nasr-storey, Sarah; Senkin, Sergey; Smith, Vincent J; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Olaiya, Emmanuel; Petyt, David; Shepherd-Themistocleous, Claire; Thea, Alessandro; Tomalin, Ian R; Williams, Thomas; Womersley, William John; Worm, Steven; Baber, Mark; Bainbridge, Robert; Buchmuller, Oliver; Burton, Darren; Colling, David; Cripps, Nicholas; Dauncey, Paul; Davies, Gavin; Della Negra, Michel; Dunne, Patrick; Ferguson, William; Fulcher, Jonathan; Futyan, David; Hall, Geoffrey; Iles, Gregory; Jarvis, Martyn; Karapostoli, Georgia; Kenzie, Matthew; Lane, Rebecca; Lucas, Robyn; Lyons, Louis; Magnan, Anne-Marie; Malik, Sarah; Mathias, Bryn; Nash, Jordan; Nikitenko, Alexander; Pela, Joao; Pesaresi, Mark; Petridis, Konstantinos; Raymond, David Mark; Rogerson, Samuel; Rose, Andrew; Seez, Christopher; Sharp, Peter; Tapper, Alexander; Vazquez Acosta, Monica; Virdee, Tejinder; Zenz, Seth Conrad; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Leggat, Duncan; Leslie, Dawn; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Dittmann, Jay; Hatakeyama, Kenichi; Kasmi, Azeddine; Liu, Hongxuan; Scarborough, Tara; Charaf, Otman; Cooper, Seth; Henderson, Conor; Rumerio, Paolo; Avetisyan, Aram; Bose, Tulika; Fantasia, Cory; Lawson, Philip; Richardson, Clint; Rohlf, James; St John, Jason; Sulak, Lawrence; Alimena, Juliette; Berry, Edmund; Bhattacharya, Saptaparna; Christopher, Grant; Cutts, David; Demiragli, Zeynep; Dhingra, Nitish; Ferapontov, Alexey; Garabedian, Alex; Heintz, Ulrich; Kukartsev, Gennadiy; Laird, Edward; Landsberg, Greg; Luk, Michael; Narain, Meenakshi; Segala, Michael; Sinthuprasith, Tutanon; Speer, Thomas; Swanson, Joshua; Breedon, Richard; Breto, Guillermo; Calderon De La Barca Sanchez, Manuel; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Erbacher, Robin; Gardner, Michael; Ko, Winston; Lander, Richard; Mulhearn, Michael; Pellett, Dave; Pilot, Justin; Ricci-Tam, Francesca; Shalhout, Shalhout; Smith, John; Squires, Michael; Stolp, Dustin; Tripathi, Mani; Wilbur, Scott; Yohay, Rachel; Cousins, Robert; Everaerts, Pieter; Farrell, Chris; Hauser, Jay; Ignatenko, Mikhail; Rakness, Gregory; Takasugi, Eric; Valuev, Vyacheslav; Weber, Matthias; Burt, Kira; Clare, Robert; Ellison, John Anthony; Gary, J William; Hanson, Gail; Heilman, Jesse; Ivova Rikova, Mirena; Jandir, Pawandeep; Kennedy, Elizabeth; Lacroix, Florent; Long, Owen Rosser; Luthra, Arun; Malberti, Martina; Olmedo Negrete, Manuel; Shrinivas, Amithabh; Sumowidagdo, Suharyo; Wimpenny, Stephen; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; D'Agnolo, Raffaele Tito; Holzner, André; Kelley, Ryan; Klein, Daniel; Letts, James; Macneill, Ian; Olivito, Dominick; Padhi, Sanjay; Palmer, Christopher; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Simon, Sean; Tadel, Matevz; Tu, Yanjun; Vartak, Adish; Welke, Charles; Würthwein, Frank; Yagil, Avraham; Barge, Derek; Bradmiller-Feld, John; Campagnari, Claudio; Danielson, Thomas; Dishaw, Adam; Dutta, Valentina; Flowers, Kristen; Franco Sevilla, Manuel; Geffert, Paul; George, Christopher; Golf, Frank; Gouskos, Loukas; Incandela, Joe; Justus, Christopher; Mccoll, Nickolas; Richman, Jeffrey; Stuart, David; To, Wing; West, Christopher; Yoo, Jaehyeok; Apresyan, Artur; Bornheim, Adolf; Bunn, Julian; Chen, Yi; Duarte, Javier; Mott, Alexander; Newman, Harvey B; Pena, Cristian; Pierini, Maurizio; Spiropulu, Maria; Vlimant, Jean-Roch; Wilkinson, Richard; Xie, Si; Zhu, Ren-Yuan; Azzolini, Virginia; Calamba, Aristotle; Carlson, Benjamin; Ferguson, Thomas; Iiyama, Yutaro; Paulini, Manfred; Russ, James; Vogel, Helmut; Vorobiev, Igor; Cumalat, John Perry; Ford, William T; Gaz, Alessandro; Krohn, Michael; Luiggi Lopez, Eduardo; Nauenberg, Uriel; Smith, James; Stenson, Kevin; Wagner, Stephen Robert; Alexander, James; Chatterjee, Avishek; Chaves, Jorge; Chu, Jennifer; Dittmer, Susan; Eggert, Nicholas; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Ryd, Anders; Salvati, Emmanuele; Skinnari, Louise; Sun, Werner; Teo, Wee Don; Thom, Julia; Thompson, Joshua; Tucker, Jordan; Weng, Yao; Winstrom, Lucas; Wittich, Peter; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Anderson, Jacob; Apollinari, Giorgio; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bolla, Gino; Burkett, Kevin; Butler, Joel Nathan; Cheung, Harry; Chlebana, Frank; Cihangir, Selcuk; Elvira, Victor Daniel; Fisk, Ian; Freeman, Jim; Gao, Yanyan; Gottschalk, Erik; Gray, Lindsey; Green, Dan; Grünendahl, Stefan; Gutsche, Oliver; Hanlon, Jim; Hare, Daryl; Harris, Robert M; Hirschauer, James; Hooberman, Benjamin; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kreis, Benjamin; Kwan, Simon; Linacre, Jacob; Lincoln, Don; Lipton, Ron; Liu, Tiehui; Lykken, Joseph; Maeshima, Kaori; Marraffino, John Michael; Martinez Outschoorn, Verena Ingrid; Maruyama, Sho; Mason, David; McBride, Patricia; Merkel, Petra; Mishra, Kalanand; Mrenna, Stephen; Nahn, Steve; Newman-Holmes, Catherine; O'Dell, Vivian; Prokofyev, Oleg; Sexton-Kennedy, Elizabeth; Sharma, Seema; Soha, Aron; Spalding, William J; Spiegel, Leonard; Taylor, Lucas; Tkaczyk, Slawek; Tran, Nhan Viet; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vega Morales, Roberto; Vidal, Richard; Whitbeck, Andrew; Whitmore, Juliana; Yang, Fan; Acosta, Darin; Avery, Paul; Bortignon, Pierluigi; Bourilkov, Dimitri; Carver, Matthew; Curry, David; Das, Souvik; De Gruttola, Michele; Di Giovanni, Gian Piero; Field, Richard D; Fisher, Matthew; Furic, Ivan-Kresimir; Hugon, Justin; Konigsberg, Jacobo; Korytov, Andrey; Kypreos, Theodore; Low, Jia Fu; Matchev, Konstantin; Mei, Hualin; Milenovic, Predrag; Mitselmakher, Guenakh; Muniz, Lana; Rinkevicius, Aurelijus; Shchutska, Lesya; Snowball, Matthew; Sperka, David; Yelton, John; Zakaria, Mohammed; Hewamanage, Samantha; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Adams, Todd; Askew, Andrew; Bochenek, Joseph; Diamond, Brendan; Haas, Jeff; Hagopian, Sharon; Hagopian, Vasken; Johnson, Kurtis F; Prosper, Harrison; Veeraraghavan, Venkatesh; Weinberg, Marc; Baarmand, Marc M; Hohlmann, Marcus; Kalakhety, Himali; Yumiceva, Francisco; Adams, Mark Raymond; Apanasevich, Leonard; Berry, Douglas; Betts, Russell Richard; Bucinskaite, Inga; Cavanaugh, Richard; Evdokimov, Olga; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Kurt, Pelin; O'Brien, Christine; Sandoval Gonzalez, Irving Daniel; Silkworth, Christopher; Turner, Paul; Varelas, Nikos; Bilki, Burak; Clarida, Warren; Dilsiz, Kamuran; Haytmyradov, Maksat; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Ogul, Hasan; Onel, Yasar; Ozok, Ferhat; Penzo, Aldo; Rahmat, Rahmat; Sen, Sercan; Tan, Ping; Tiras, Emrah; Wetzel, James; Yi, Kai; Anderson, Ian; Barnett, Bruce Arnold; Blumenfeld, Barry; Bolognesi, Sara; Fehling, David; Gritsan, Andrei; Maksimovic, Petar; Martin, Christopher; Roskes, Jeffrey; Sarica, Ulascan; Swartz, Morris; Xiao, Meng; You, Can; Baringer, Philip; Bean, Alice; Benelli, Gabriele; Bruner, Christopher; Gray, Julia; Kenny III, Raymond Patrick; Majumder, Devdatta; Malek, Magdalena; Murray, Michael; Noonan, Daniel; Sanders, Stephen; Sekaric, Jadranka; Stringer, Robert; Wang, Quan; Wood, Jeffrey Scott; Chakaberia, Irakli; Ivanov, Andrew; Kaadze, Ketino; Khalil, Sadia; Makouski, Mikhail; Maravin, Yurii; Saini, Lovedeep Kaur; Skhirtladze, Nikoloz; Svintradze, Irakli; Gronberg, Jeffrey; Lange, David; Rebassoo, Finn; Wright, Douglas; Baden, Drew; Belloni, Alberto; Calvert, Brian; Eno, Sarah Catherine; Gomez, Jaime; Hadley, Nicholas John; Kellogg, Richard G; Kolberg, Ted; Lu, Ying; Mignerey, Alice; Pedro, Kevin; Skuja, Andris; Tonjes, Marguerite; Tonwar, Suresh C; Apyan, Aram; Barbieri, Richard; Busza, Wit; Cali, Ivan Amos; Chan, Matthew; Di Matteo, Leonardo; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Gulhan, Doga; Klute, Markus; Lai, Yue Shi; Lee, Yen-Jie; Levin, Andrew; Luckey, Paul David; Paus, Christoph; Ralph, Duncan; Roland, Christof; Roland, Gunther; Stephans, George; Sumorok, Konstanty; Velicanu, Dragos; Veverka, Jan; Wyslouch, Bolek; Yang, Mingming; Zanetti, Marco; Zhukova, Victoria; Dahmes, Bryan; Gude, Alexander; Kao, Shih-Chuan; Klapoetke, Kevin; Kubota, Yuichi; Mans, Jeremy; Nourbakhsh, Shervin; Pastika, Nathaniel; Rusack, Roger; Singovsky, Alexander; Tambe, Norbert; Turkewitz, Jared; Acosta, John Gabriel; Oliveros, Sandra; Avdeeva, Ekaterina; Bloom, Kenneth; Bose, Suvadeep; Claes, Daniel R; Dominguez, Aaron; Gonzalez Suarez, Rebeca; Keller, Jason; Knowlton, Dan; Kravchenko, Ilya; Lazo-Flores, Jose; Meier, Frank; Ratnikov, Fedor; Snow, Gregory R; Zvada, Marian; Dolen, James; Godshalk, Andrew; Iashvili, Ia; Kharchilava, Avto; Kumar, Ashish; Rappoccio, Salvatore; Alverson, George; Barberis, Emanuela; Baumgartel, Darin; Chasco, Matthew; Massironi, Andrea; Morse, David Michael; Nash, David; Orimoto, Toyoko; Trocino, Daniele; Wang, Ren-Jie; Wood, Darien; Zhang, Jinzhong; Hahn, Kristan Allan; Kubik, Andrew; Mucia, Nicholas; Odell, Nathaniel; Pollack, Brian; Pozdnyakov, Andrey; Schmitt, Michael; Stoynev, Stoyan; Sung, Kevin; Velasco, Mayda; Won, Steven; Brinkerhoff, Andrew; Chan, Kwok Ming; Drozdetskiy, Alexey; Hildreth, Michael; Jessop, Colin; Karmgard, Daniel John; Kellams, Nathan; Lannon, Kevin; Lynch, Sean; Marinelli, Nancy; Musienko, Yuri; Pearson, Tessa; Planer, Michael; Ruchti, Randy; Smith, Geoffrey; Valls, Nil; Wayne, Mitchell; Wolf, Matthias; Woodard, Anna; Antonelli, Louis; Brinson, Jessica; Bylsma, Ben; Durkin, Lloyd Stanley; Flowers, Sean; Hart, Andrew; Hill, Christopher; Hughes, Richard; Kotov, Khristian; Ling, Ta-Yung; Luo, Wuming; Puigh, Darren; Rodenburg, Marissa; Winer, Brian L; Wolfe, Homer; Wulsin, Howard Wells; Driga, Olga; Elmer, Peter; Hardenbrook, Joshua; Hebda, Philip; Koay, Sue Ann; Lujan, Paul; Marlow, Daniel; Medvedeva, Tatiana; Mooney, Michael; Olsen, James; Piroué, Pierre; Quan, Xiaohang; Saka, Halil; Stickland, David; Tully, Christopher; Werner, Jeremy Scott; Zuranski, Andrzej; Brownson, Eric; Malik, Sudhir; Mendez, Hector; Ramirez Vargas, Juan Eduardo; Barnes, Virgil E; Benedetti, Daniele; Bortoletto, Daniela; De Mattia, Marco; Gutay, Laszlo; Hu, Zhen; Jha, Manoj; Jones, Matthew; Jung, Kurt; Kress, Matthew; Leonardo, Nuno; Miller, David Harry; Neumeister, Norbert; Radburn-Smith, Benjamin Charles; Shi, Xin; Shipsey, Ian; Silvers, David; Svyatkovskiy, Alexey; Wang, Fuqiang; Xie, Wei; Xu, Lingshan; Zablocki, Jakub; Parashar, Neeti; Stupak, John; Adair, Antony; Akgun, Bora; Ecklund, Karl Matthew; Geurts, Frank JM; Li, Wei; Michlin, Benjamin; Padley, Brian Paul; Redjimi, Radia; Roberts, Jay; Zabel, James; Betchart, Burton; Bodek, Arie; Covarelli, Roberto; de Barbaro, Pawel; Demina, Regina; Eshaq, Yossof; Ferbel, Thomas; Garcia-Bellido, Aran; Goldenzweig, Pablo; Han, Jiyeon; Harel, Amnon; Khukhunaishvili, Aleko; Korjenevski, Sergey; Petrillo, Gianluca; Vishnevskiy, Dmitry; Ciesielski, Robert; Demortier, Luc; Goulianos, Konstantin; Mesropian, Christina; Arora, Sanjay; Barker, Anthony; Chou, John Paul; Contreras-Campana, Christian; Contreras-Campana, Emmanuel; Duggan, Daniel; Ferencek, Dinko; Gershtein, Yuri; Gray, Richard; Halkiadakis, Eva; Hidas, Dean; Kaplan, Steven; Lath, Amitabh; Panwalkar, Shruti; Park, Michael; Patel, Rishi; Salur, Sevil; Schnetzer, Steve; Sheffield, David; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Thomassen, Peter; Walker, Matthew; Rose, Keith; Spanier, Stefan; York, Andrew; Bouhali, Othmane; Castaneda Hernandez, Alfredo; Eusebi, Ricardo; Flanagan, Will; Gilmore, Jason; Kamon, Teruki; Khotilovich, Vadim; Krutelyov, Vyacheslav; Montalvo, Roy; Osipenkov, Ilya; Pakhotin, Yuriy; Perloff, Alexx; Roe, Jeffrey; Rose, Anthony; Safonov, Alexei; Suarez, Indara; Tatarinov, Aysen; Ulmer, Keith; Akchurin, Nural; Cowden, Christopher; Damgov, Jordan; Dragoiu, Cosmin; Dudero, Phillip Russell; Faulkner, James; Kovitanggoon, Kittikul; Kunori, Shuichi; Lee, Sung Won; Libeiro, Terence; Volobouev, Igor; Appelt, Eric; Delannoy, Andrés G; Greene, Senta; Gurrola, Alfredo; Johns, Willard; Maguire, Charles; Mao, Yaxian; Melo, Andrew; Sharma, Monika; Sheldon, Paul; Snook, Benjamin; Tuo, Shengquan; Velkovska, Julia; Arenton, Michael Wayne; Boutle, Sarah; Cox, Bradley; Francis, Brian; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Li, Hengne; Lin, Chuanzhe; Neu, Christopher; Wood, John; Clarke, Christopher; Harr, Robert; Karchin, Paul Edmund; Kottachchi Kankanamge Don, Chamath; Lamichhane, Pramod; Sturdy, Jared; Belknap, Donald; Carlsmith, Duncan; Cepeda, Maria; Dasu, Sridhara; Dodd, Laura; Duric, Senka; Friis, Evan; Hall-Wilton, Richard; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Lanaro, Armando; Lazaridis, Christos; Levine, Aaron; Loveless, Richard; Mohapatra, Ajit; Ojalvo, Isabel; Perry, Thomas; Pierro, Giuseppe Antonio; Polese, Giovanni; Ross, Ian; Sarangi, Tapas; Savin, Alexander; Smith, Wesley H; Taylor, Devin; Vuosalo, Carl; Woods, Nathaniel

    2015-01-01

    The study of the spin-parity and tensor structure of the interactions of the recently discovered Higgs boson is performed using the $\\mathrm{H} \\rightarrow \\mathrm{Z} \\mathrm{Z}$, $\\mathrm{Z}\\gamma^*$, $\\gamma^*\\gamma^* \\rightarrow 4\\ell$, $\\mathrm{H} \\rightarrow \\mathrm{W} \\mathrm{W} \\rightarrow \\ell\

  12. Constraints on the spin-parity and anomalous $\\mathrm{HVV}$ couplings of the Higgs boson in proton collisions at 7 and 8 TeV

    CERN Document Server

    Khachatryan, Vardan; Tumasyan, Armen; Adam, Wolfgang; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hartl, Christian; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Knünz, Valentin; Krammer, Manfred; Krätschmer, Ilse; Liko, Dietrich; Mikulec, Ivan; Rabady, Dinyar; Rahbaran, Babak; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Treberer-Treberspurg, Wolfgang; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Alderweireldt, Sara; Bansal, Sunil; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Knutsson, Albert; Lauwers, Jasper; Luyckx, Sten; Ochesanu, Silvia; Rougny, Romain; Van De Klundert, Merijn; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Daci, Nadir; Heracleous, Natalie; Keaveney, James; Lowette, Steven; Maes, Michael; Olbrechts, Annik; Python, Quentin; Strom, Derek; Tavernier, Stefaan; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Caillol, Cécile; Clerbaux, Barbara; De Lentdecker, Gilles; Dobur, Didar; Favart, Laurent; Gay, Arnaud; Grebenyuk, Anastasia; Léonard, Alexandre; Mohammadi, Abdollah; Perniè, Luca; Randle-conde, Aidan; Reis, Thomas; Seva, Tomislav; Thomas, Laurent; Vander Velde, Catherine; Vanlaer, Pascal; Wang, Jian; Zenoni, Florian; Adler, Volker; Beernaert, Kelly; Benucci, Leonardo; Cimmino, Anna; Costantini, Silvia; Crucy, Shannon; Dildick, Sven; Fagot, Alexis; Garcia, Guillaume; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Salva Diblen, Sinem; Sigamani, Michael; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Beluffi, Camille; Bruno, Giacomo; Castello, Roberto; Caudron, Adrien; Ceard, Ludivine; Da Silveira, Gustavo Gil; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Hollar, Jonathan; Jafari, Abideh; Jez, Pavel; Komm, Matthias; Lemaitre, Vincent; Nuttens, Claude; Perrini, Lucia; Pin, Arnaud; Piotrzkowski, Krzysztof; Popov, Andrey; Quertenmont, Loic; Selvaggi, Michele; Vidal Marono, Miguel; Vizan Garcia, Jesus Manuel; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Hammad, Gregory Habib; Aldá Júnior, Walter Luiz; Alves, Gilvan; Brito, Lucas; Correa Martins Junior, Marcos; Dos Reis Martins, Thiago; Molina, Jorge; Mora Herrera, Clemencia; Pol, Maria Elena; Rebello Teles, Patricia; Carvalho, Wagner; Chinellato, Jose; Custódio, Analu; Melo Da Costa, Eliza; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Malbouisson, Helena; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santaolalla, Javier; Santoro, Alberto; Sznajder, Andre; Tonelli Manganote, Edmilson José; Vilela Pereira, Antonio; Bernardes, Cesar Augusto; Dogra, Sunil; Tomei, Thiago; De Moraes Gregores, Eduardo; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Aleksandrov, Aleksandar; Genchev, Vladimir; Hadjiiska, Roumyana; Iaydjiev, Plamen; Marinov, Andrey; Piperov, Stefan; Rodozov, Mircho; Sultanov, Georgi; Vutova, Mariana; Dimitrov, Anton; Glushkov, Ivan; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Chen, Mingshui; Cheng, Tongguang; Du, Ran; Jiang, Chun-Hua; Plestina, Roko; Romeo, Francesco; Tao, Junquan; Wang, Zheng; Asawatangtrakuldee, Chayanit; Ban, Yong; Li, Qiang; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Wang, Dayong; Xu, Zijun; Zou, Wei; Avila, Carlos; Cabrera, Andrés; Chaparro Sierra, Luisa Fernanda; Florez, Carlos; Gomez, Juan Pablo; Gomez Moreno, Bernardo; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Kadija, Kreso; Luetic, Jelena; Mekterovic, Darko; Sudic, Lucija; Attikis, Alexandros; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Bodlak, Martin; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Ellithi Kamel, Ali; Mahmoud, Mohammed; Radi, Amr; Kadastik, Mario; Murumaa, Marion; Raidal, Martti; Tiko, Andres; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Härkönen, Jaakko; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa; Wendland, Lauri; Talvitie, Joonas; Tuuva, Tuure; Besancon, Marc; Couderc, Fabrice; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Favaro, Carlotta; Ferri, Federico; Ganjour, Serguei; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Locci, Elizabeth; Malcles, Julie; Rander, John; Rosowsky, André; Titov, Maksym; Baffioni, Stephanie; Beaudette, Florian; Busson, Philippe; Charlot, Claude; Dahms, Torsten; Dalchenko, Mykhailo; Dobrzynski, Ludwik; Filipovic, Nicolas; Florent, Alice; Granier de Cassagnac, Raphael; Mastrolorenzo, Luca; Miné, Philippe; Naranjo, Ivo Nicolas; Nguyen, Matthew; Ochando, Christophe; Ortona, Giacomo; Paganini, Pascal; Regnard, Simon; Salerno, Roberto; Sauvan, Jean-Baptiste; Sirois, Yves; Veelken, Christian; Yilmaz, Yetkin; Zabi, Alexandre; Agram, Jean-Laurent; Andrea, Jeremy; Aubin, Alexandre; Bloch, Daniel; Brom, Jean-Marie; Chabert, Eric Christian; Collard, Caroline; Conte, Eric; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Goetzmann, Christophe; Le Bihan, Anne-Catherine; Skovpen, Kirill; Van Hove, Pierre; Gadrat, Sébastien; Beauceron, Stephanie; Beaupere, Nicolas; Bernet, Colin; Boudoul, Gaelle; Bouvier, Elvire; Brochet, Sébastien; Carrillo Montoya, Camilo Andres; Chasserat, Julien; Chierici, Roberto; Contardo, Didier; Depasse, Pierre; El Mamouni, Houmani; Fan, Jiawei; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Ille, Bernard; Kurca, Tibor; Lethuillier, Morgan; Mirabito, Laurent; Perries, Stephane; Ruiz Alvarez, José David; Sabes, David; Sgandurra, Louis; Sordini, Viola; Vander Donckt, Muriel; Verdier, Patrice; Viret, Sébastien; Xiao, Hong; Tsamalaidze, Zviad; Autermann, Christian; Beranek, Sarah; Bontenackels, Michael; Edelhoff, Matthias; Feld, Lutz; Heister, Arno; Hindrichs, Otto; Klein, Katja; Ostapchuk, Andrey; Preuten, Marius; Raupach, Frank; Sammet, Jan; Schael, Stefan; Schulte, Jan-Frederik; Weber, Hendrik; Wittmer, Bruno; Zhukov, Valery; Ata, Metin; Brodski, Michael; Dietz-Laursonn, Erik; Duchardt, Deborah; Erdmann, Martin; Fischer, Robert; Güth, Andreas; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Klingebiel, Dennis; Knutzen, Simon; Kreuzer, Peter; Merschmeyer, Markus; Meyer, Arnd; Millet, Philipp; Olschewski, Mark; Padeken, Klaas; Papacz, Paul; Reithler, Hans; Schmitz, Stefan Antonius; Sonnenschein, Lars; Teyssier, Daniel; Thüer, Sebastian; Weber, Martin; Cherepanov, Vladimir; Erdogan, Yusuf; Flügge, Günter; Geenen, Heiko; Geisler, Matthias; Haj Ahmad, Wael; Hoehle, Felix; Kargoll, Bastian; Kress, Thomas; Kuessel, Yvonne; Künsken, Andreas; Lingemann, Joschka; Nowack, Andreas; Nugent, Ian Michael; Pooth, Oliver; Stahl, Achim; Aldaya Martin, Maria; Asin, Ivan; Bartosik, Nazar; Behr, Joerg; Behrens, Ulf; Bell, Alan James; Bethani, Agni; Borras, Kerstin; Burgmeier, Armin; Cakir, Altan; Calligaris, Luigi; Campbell, Alan; Choudhury, Somnath; Costanza, Francesco; Diez Pardos, Carmen; Dolinska, Ganna; Dooling, Samantha; Dorland, Tyler; Eckerlin, Guenter; Eckstein, Doris; Eichhorn, Thomas; Flucke, Gero; Garay Garcia, Jasone; Geiser, Achim; Gunnellini, Paolo; Hauk, Johannes; Hempel, Maria; Jung, Hannes; Kalogeropoulos, Alexis; Kasemann, Matthias; Katsas, Panagiotis; Kieseler, Jan; Kleinwort, Claus; Korol, Ievgen; Krücker, Dirk; Lange, Wolfgang; Leonard, Jessica; Lipka, Katerina; Lobanov, Artur; Lohmann, Wolfgang; Lutz, Benjamin; Mankel, Rainer; Marfin, Ihar; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mittag, Gregor; Mnich, Joachim; Mussgiller, Andreas; Naumann-Emme, Sebastian; Nayak, Aruna; Ntomari, Eleni; Perrey, Hanno; Pitzl, Daniel; Placakyte, Ringaile; Raspereza, Alexei; Ribeiro Cipriano, Pedro M; Roland, Benoit; Ron, Elias; Sahin, Mehmet Özgür; Salfeld-Nebgen, Jakob; Saxena, Pooja; Schoerner-Sadenius, Thomas; Schröder, Matthias; Seitz, Claudia; Spannagel, Simon; Vargas Trevino, Andrea Del Rocio; Walsh, Roberval; Wissing, Christoph; Blobel, Volker; Centis Vignali, Matteo; Draeger, Arne-Rasmus; Erfle, Joachim; Garutti, Erika; Goebel, Kristin; Görner, Martin; Haller, Johannes; Hoffmann, Malte; Höing, Rebekka Sophie; Junkes, Alexandra; Kirschenmann, Henning; Klanner, Robert; Kogler, Roman; Lange, Jörn; Lapsien, Tobias; Lenz, Teresa; Marchesini, Ivan; Ott, Jochen; Peiffer, Thomas; Perieanu, Adrian; Pietsch, Niklas; Poehlsen, Jennifer; Pöhlsen, Thomas; Rathjens, Denis; Sander, Christian; Schettler, Hannes; Schleper, Peter; Schlieckau, Eike; Schmidt, Alexander; Seidel, Markus; Sola, Valentina; Stadie, Hartmut; Steinbrück, Georg; Troendle, Daniel; Usai, Emanuele; Vanelderen, Lukas; Vanhoefer, Annika; Barth, Christian; Baus, Colin; Berger, Joram; Böser, Christian; Butz, Erik; Chwalek, Thorsten; De Boer, Wim; Descroix, Alexis; Dierlamm, Alexander; Feindt, Michael; Frensch, Felix; Giffels, Manuel; Gilbert, Andrew; Hartmann, Frank; Hauth, Thomas; Husemann, Ulrich; Katkov, Igor; Kornmayer, Andreas; Kuznetsova, Ekaterina; Lobelle Pardo, Patricia; Mozer, Matthias Ulrich; Müller, Thomas; Müller, Thomas; Nürnberg, Andreas; Quast, Gunter; Rabbertz, Klaus; Röcker, Steffen; Simonis, Hans-Jürgen; Stober, Fred-Markus Helmut; Ulrich, Ralf; Wagner-Kuhr, Jeannine; Wayand, Stefan; Weiler, Thomas; Wolf, Roger; Anagnostou, Georgios; Daskalakis, Georgios; Geralis, Theodoros; Giakoumopoulou, Viktoria Athina; Kyriakis, Aristotelis; Loukas, Demetrios; Markou, Athanasios; Markou, Christos; Psallidas, Andreas; Topsis-Giotis, Iasonas; Agapitos, Antonis; Kesisoglou, Stilianos; Panagiotou, Apostolos; Saoulidou, Niki; Stiliaris, Efstathios; Aslanoglou, Xenofon; Evangelou, Ioannis; Flouris, Giannis; Foudas, Costas; Kokkas, Panagiotis; Manthos, Nikolaos; Papadopoulos, Ioannis; Paradas, Evangelos; Strologas, John; Bencze, Gyorgy; Hajdu, Csaba; Hidas, Pàl; Horvath, Dezso; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Zsigmond, Anna Julia; Beni, Noemi; Czellar, Sandor; Karancsi, János; Molnar, Jozsef; Palinkas, Jozsef; Szillasi, Zoltan; Makovec, Alajos; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Swain, Sanjay Kumar; Beri, Suman Bala; Bhatnagar, Vipin; Gupta, Ruchi; Bhawandeep, Bhawandeep; Kalsi, Amandeep Kaur; Kaur, Manjit; Kumar, Ramandeep; Mittal, Monika; Nishu, Nishu; Singh, Jasbir; Kumar, Ashok; Kumar, Arun; Ahuja, Sudha; Bhardwaj, Ashutosh; Choudhary, Brajesh C; Kumar, Ajay; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Varun; Banerjee, Sunanda; Bhattacharya, Satyaki; Chatterjee, Kalyanmoy; Dutta, Suchandra; Gomber, Bhawna; Jain, Sandhya; Jain, Shilpi; Khurana, Raman; Modak, Atanu; Mukherjee, Swagata; Roy, Debarati; Sarkar, Subir; Sharan, Manoj; Abdulsalam, Abdulla; Dutta, Dipanwita; Kumar, Vineet; Mohanty, Ajit Kumar; Pant, Lalit Mohan; Shukla, Prashant; Topkar, Anita; Aziz, Tariq; Banerjee, Sudeshna; Bhowmik, Sandeep; Chatterjee, Rajdeep Mohan; Dewanjee, Ram Krishna; Dugad, Shashikant; Ganguly, Sanmay; Ghosh, Saranya; Guchait, Monoranjan; Gurtu, Atul; Kole, Gouranga; Kumar, Sanjeev; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Mohanty, Gagan Bihari; Parida, Bibhuti; Sudhakar, Katta; Wickramage, Nadeesha; Bakhshiansohi, Hamed; Behnamian, Hadi; Etesami, Seyed Mohsen; Fahim, Ali; Goldouzian, Reza; Khakzad, Mohsen; Mohammadi Najafabadi, Mojtaba; Naseri, Mohsen; Paktinat Mehdiabadi, Saeid; Rezaei Hosseinabadi, Ferdos; Safarzadeh, Batool; Zeinali, Maryam; Felcini, Marta; Grunewald, Martin; Abbrescia, Marcello; Calabria, Cesare; Chhibra, Simranjit Singh; Colaleo, Anna; Creanza, Donato; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Maggi, Giorgio; Maggi, Marcello; My, Salvatore; Nuzzo, Salvatore; Pompili, Alexis; Pugliese, Gabriella; Radogna, Raffaella; Selvaggi, Giovanna; Sharma, Archana; Silvestris, Lucia; Venditti, Rosamaria; Verwilligen, Piet; Abbiendi, Giovanni; Benvenuti, Alberto; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Campanini, Renato; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Codispoti, Giuseppe; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Guiducci, Luigi; Marcellini, Stefano; Masetti, Gianni; Montanari, Alessandro; Navarria, Francesco; Perrotta, Andrea; Primavera, Federica; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gian Piero; Tosi, Nicolò; Travaglini, Riccardo; Albergo, Sebastiano; Cappello, Gigi; Chiorboli, Massimiliano; Costa, Salvatore; Giordano, Ferdinando; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Gallo, Elisabetta; Gonzi, Sandro; Gori, Valentina; Lenzi, Piergiulio; Meschini, Marco; Paoletti, Simone; Sguazzoni, Giacomo; Tropiano, Antonio; Benussi, Luigi; Bianco, Stefano; Fabbri, Franco; Piccolo, Davide; Ferretti, Roberta; Ferro, Fabrizio; Lo Vetere, Maurizio; Robutti, Enrico; Tosi, Silvano; Dinardo, Mauro Emanuele; Fiorendi, Sara; Gennai, Simone; Gerosa, Raffaele; Ghezzi, Alessio; Govoni, Pietro; Lucchini, Marco Toliman; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Martelli, Arabella; Marzocchi, Badder; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Ragazzi, Stefano; Redaelli, Nicola; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Cavallo, Nicola; Di Guida, Salvatore; Fabozzi, Francesco; Iorio, Alberto Orso Maria; Lista, Luca; Meola, Sabino; Merola, Mario; Paolucci, Pierluigi; Azzi, Patrizia; Bacchetta, Nicola; Bisello, Dario; Branca, Antonio; Carlin, Roberto; Checchia, Paolo; Dall'Osso, Martino; Dorigo, Tommaso; Dosselli, Umberto; Galanti, Mario; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Kanishchev, Konstantin; Lacaprara, Stefano; Margoni, Martino; Meneguzzo, Anna Teresa; Pazzini, Jacopo; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Tosi, Mia; Zotto, Pierluigi; Zucchetta, Alberto; Zumerle, Gianni; Gabusi, Michele; Ratti, Sergio P; Re, Valerio; Riccardi, Cristina; Salvini, Paola; Vitulo, Paolo; Biasini, Maurizio; Bilei, Gian Mario; Ciangottini, Diego; Fanò, Livio; Lariccia, Paolo; Mantovani, Giancarlo; Menichelli, Mauro; Saha, Anirban; Santocchia, Attilio; Spiezia, Aniello; Androsov, Konstantin; Azzurri, Paolo; Bagliesi, Giuseppe; Bernardini, Jacopo; Boccali, Tommaso; Broccolo, Giuseppe; Castaldi, Rino; Ciocci, Maria Agnese; Dell'Orso, Roberto; Donato, Silvio; Fiori, Francesco; Foà, Lorenzo; Giassi, Alessandro; Grippo, Maria Teresa; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Moon, Chang-Seong; Palla, Fabrizio; Rizzi, Andrea; Savoy-Navarro, Aurore; Serban, Alin Titus; Spagnolo, Paolo; Squillacioti, Paola; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Vernieri, Caterina; Barone, Luciano; Cavallari, Francesca; D'imperio, Giulia; Del Re, Daniele; Diemoz, Marcella; Jorda, Clara; Longo, Egidio; Margaroli, Fabrizio; Meridiani, Paolo; Micheli, Francesco; Organtini, Giovanni; Paramatti, Riccardo; Rahatlou, Shahram; Rovelli, Chiara; Santanastasio, Francesco; Soffi, Livia; Traczyk, Piotr; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Bellan, Riccardo; Biino, Cristina; Cartiglia, Nicolo; Casasso, Stefano; Costa, Marco; Degano, Alessandro; Demaria, Natale; Finco, Linda; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Musich, Marco; Obertino, Maria Margherita; Pacher, Luca; Pastrone, Nadia; Pelliccioni, Mario; Pinna Angioni, Gian Luca; Potenza, Alberto; Romero, Alessandra; Ruspa, Marta; Sacchi, Roberto; Solano, Ada; Staiano, Amedeo; Tamponi, Umberto; Belforte, Stefano; Candelise, Vieri; Casarsa, Massimo; Cossutti, Fabio; Della Ricca, Giuseppe; Gobbo, Benigno; La Licata, Chiara; Marone, Matteo; Schizzi, Andrea; Umer, Tomo; Zanetti, Anna; Chang, Sunghyun; Kropivnitskaya, Anna; Nam, Soon-Kwon; Kim, Dong Hee; Kim, Gui Nyun; Kim, Min Suk; Kong, Dae Jung; Lee, Sangeun; Oh, Young Do; Park, Hyangkyu; Sakharov, Alexandre; Son, Dong-Chul; Kim, Tae Jeong; Ryu, Min Sang; Kim, Jae Yool; Moon, Dong Ho; Song, Sanghyeon; Choi, Suyong; Gyun, Dooyeon; Hong, Byung-Sik; Jo, Mihee; Kim, Hyunchul; Kim, Yongsun; Lee, Byounghoon; Lee, Kyong Sei; Park, Sung Keun; Roh, Youn; Yoo, Hwi Dong; Choi, Minkyoo; Kim, Ji Hyun; Park, Inkyu; Ryu, Geonmo; Choi, Young-Il; Choi, Young Kyu; Goh, Junghwan; Kim, Donghyun; Kwon, Eunhyang; Lee, Jongseok; Yu, Intae; Juodagalvis, Andrius; Komaragiri, Jyothsna Rani; Md Ali, Mohd Adli Bin; Casimiro Linares, Edgar; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-de La Cruz, Ivan; Hernandez-Almada, Alberto; Lopez-Fernandez, Ricardo; Sánchez Hernández, Alberto; Carrillo Moreno, Salvador; Vazquez Valencia, Fabiola; Pedraza, Isabel; Salazar Ibarguen, Humberto Antonio; Morelos Pineda, Antonio; Krofcheck, David; Butler, Philip H; Reucroft, Steve; Ahmad, Ashfaq; Ahmad, Muhammad; Hassan, Qamar; Hoorani, Hafeez R; Khan, Wajid Ali; Khurshid, Taimoor; Shoaib, Muhammad; Bialkowska, Helena; Bluj, Michal; Boimska, Bożena; Frueboes, Tomasz; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Zalewski, Piotr; Brona, Grzegorz; Bunkowski, Karol; Cwiok, Mikolaj; Dominik, Wojciech; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Misiura, Maciej; Olszewski, Michał; Bargassa, Pedrame; Beirão Da Cruz E Silva, Cristóvão; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Lloret Iglesias, Lara; Nguyen, Federico; Rodrigues Antunes, Joao; Seixas, Joao; Varela, Joao; Vischia, Pietro; Afanasiev, Serguei; Bunin, Pavel; Gavrilenko, Mikhail; Golutvin, Igor; Gorbunov, Ilya; Kamenev, Alexey; Karjavin, Vladimir; Konoplyanikov, Viktor; Lanev, Alexander; Malakhov, Alexander; Matveev, Viktor; Moisenz, Petr; Palichik, Vladimir; Perelygin, Victor; Shmatov, Sergey; Skatchkov, Nikolai; Smirnov, Vitaly; Zarubin, Anatoli; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Levchenko, Petr; Murzin, Victor; Oreshkin, Vadim; Smirnov, Igor; Sulimov, Valentin; Uvarov, Lev; Vavilov, Sergey; Vorobyev, Alexey; Vorobyev, Andrey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Kirsanov, Mikhail; Krasnikov, Nikolai; Pashenkov, Anatoli; Tlisov, Danila; Toropin, Alexander; Epshteyn, Vladimir; Gavrilov, Vladimir; Lychkovskaya, Natalia; Popov, Vladimir; Pozdnyakov, Ivan; Safronov, Grigory; Semenov, Sergey; Spiridonov, Alexander; Stolin, Viatcheslav; Vlasov, Evgueni; Zhokin, Alexander; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Mesyats, Gennady; Rusakov, Sergey V; Vinogradov, Alexey; Belyaev, Andrey; Boos, Edouard; Bunichev, Viacheslav; Dubinin, Mikhail; Dudko, Lev; Gribushin, Andrey; Klyukhin, Vyacheslav; Kodolova, Olga; Lokhtin, Igor; Obraztsov, Stepan; Perfilov, Maxim; Petrushanko, Sergey; Savrin, Viktor; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Kachanov, Vassili; Kalinin, Alexey; Konstantinov, Dmitri; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Tourtchanovitch, Leonid; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Ekmedzic, Marko; Milosevic, Jovan; Rekovic, Vladimir; Alcaraz Maestre, Juan; Battilana, Carlo; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Domínguez Vázquez, Daniel; Escalante Del Valle, Alberto; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Navarro De Martino, Eduardo; Pérez-Calero Yzquierdo, Antonio María; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Senghi Soares, Mara; Albajar, Carmen; de Trocóniz, Jorge F; Missiroli, Marino; Moran, Dermot; Brun, Hugues; Cuevas, Javier; Fernandez Menendez, Javier; Folgueras, Santiago; Gonzalez Caballero, Isidro; Brochero Cifuentes, Javier Andres; Cabrillo, Iban Jose; Calderon, Alicia; Duarte Campderros, Jordi; Fernandez, Marcos; Gomez, Gervasio; Graziano, Alberto; Lopez Virto, Amparo; Marco, Jesus; Marco, Rafael; Martinez Rivero, Celso; Matorras, Francisco; Munoz Sanchez, Francisca Javiela; Piedra Gomez, Jonatan; Rodrigo, Teresa; Rodríguez-Marrero, Ana Yaiza; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Bachtis, Michail; Baillon, Paul; Ball, Austin; Barney, David; Benaglia, Andrea; Bendavid, Joshua; Benhabib, Lamia; Benitez, Jose F; Bloch, Philippe; Bocci, Andrea; Bonato, Alessio; Bondu, Olivier; Botta, Cristina; Breuker, Horst; Camporesi, Tiziano; Cerminara, Gianluca; Colafranceschi, Stefano; D'Alfonso, Mariarosaria; D'Enterria, David; Dabrowski, Anne; David Tinoco Mendes, Andre; De Guio, Federico; De Roeck, Albert; De Visscher, Simon; Di Marco, Emanuele; Dobson, Marc; Dordevic, Milos; Dorney, Brian; Dupont-Sagorin, Niels; Elliott-Peisert, Anna; Franzoni, Giovanni; Funk, Wolfgang; Gigi, Dominique; Gill, Karl; Giordano, Domenico; Girone, Maria; Glege, Frank; Guida, Roberto; Gundacker, Stefan; Guthoff, Moritz; Hammer, Josef; Hansen, Magnus; Harris, Philip; Hegeman, Jeroen; Innocente, Vincenzo; Janot, Patrick; Kousouris, Konstantinos; Krajczar, Krisztian; Lecoq, Paul; Lourenco, Carlos; Magini, Nicolo; Malgeri, Luca; Mannelli, Marcello; Marrouche, Jad; Masetti, Lorenzo; Meijers, Frans; Mersi, Stefano; Meschi, Emilio; Moortgat, Filip; Morovic, Srecko; Mulders, Martijn; Orsini, Luciano; Pape, Luc; Perez, Emmanuelle; Petrilli, Achille; Petrucciani, Giovanni; Pfeiffer, Andreas; Pimiä, Martti; Piparo, Danilo; Plagge, Michael; Racz, Attila; Rolandi, Gigi; Rovere, Marco; Sakulin, Hannes; Schäfer, Christoph; Schwick, Christoph; Sharma, Archana; Siegrist, Patrice; Silva, Pedro; Simon, Michal; Sphicas, Paraskevas; Spiga, Daniele; Steggemann, Jan; Stieger, Benjamin; Stoye, Markus; Takahashi, Yuta; Treille, Daniel; Tsirou, Andromachi; Veres, Gabor Istvan; Wardle, Nicholas; Wöhri, Hermine Katharina; Wollny, Heiner; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; Kotlinski, Danek; Langenegger, Urs; Renker, Dieter; Rohe, Tilman; Bachmair, Felix; Bäni, Lukas; Bianchini, Lorenzo; Buchmann, Marco-Andrea; Casal, Bruno; Chanon, Nicolas; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Dünser, Marc; Eller, Philipp; Grab, Christoph; Hits, Dmitry; Hoss, Jan; Lustermann, Werner; Mangano, Boris; Marini, Andrea Carlo; Marionneau, Matthieu; Martinez Ruiz del Arbol, Pablo; Masciovecchio, Mario; Meister, Daniel; Mohr, Niklas; Musella, Pasquale; Nägeli, Christoph; Nessi-Tedaldi, Francesca; Pandolfi, Francesco; Pauss, Felicitas; Perrozzi, Luca; Peruzzi, Marco; Quittnat, Milena; Rebane, Liis; Rossini, Marco; Starodumov, Andrei; Takahashi, Maiko; Theofilatos, Konstantinos; Wallny, Rainer; Weber, Hannsjoerg Artur; Amsler, Claude; Canelli, Maria Florencia; Chiochia, Vincenzo; De Cosa, Annapaola; Hinzmann, Andreas; Hreus, Tomas; Kilminster, Benjamin; Lange, Clemens; Millan Mejias, Barbara; Ngadiuba, Jennifer; Pinna, Deborah; Robmann, Peter; Ronga, Frederic Jean; Taroni, Silvia; Verzetti, Mauro; Yang, Yong; Cardaci, Marco; Chen, Kuan-Hsin; Ferro, Cristina; Kuo, Chia-Ming; Lin, Willis; Lu, Yun-Ju; Volpe, Roberta; Yu, Shin-Shan; Chang, Paoti; Chang, You-Hao; Chang, Yu-Wei; Chao, Yuan; Chen, Kai-Feng; Chen, Po-Hsun; Dietz, Charles; Grundler, Ulysses; Hou, George Wei-Shu; Kao, Kai-Yi; Liu, Yueh-Feng; Lu, Rong-Shyang; Petrakou, Eleni; Tzeng, Yeng-Ming; Wilken, Rachel; Asavapibhop, Burin; Singh, Gurpreet; Srimanobhas, Norraphat; Suwonjandee, Narumon; Adiguzel, Aytul; Bakirci, Mustafa Numan; Cerci, Salim; Dozen, Candan; Dumanoglu, Isa; Eskut, Eda; Girgis, Semiray; Gokbulut, Gul; Guler, Yalcin; Gurpinar, Emine; Hos, Ilknur; Kangal, Evrim Ersin; Kayis Topaksu, Aysel; Onengut, Gulsen; Ozdemir, Kadri; Ozturk, Sertac; Polatoz, Ayse; Sunar Cerci, Deniz; Tali, Bayram; Topakli, Huseyin; Vergili, Mehmet; Zorbilmez, Caglar; Akin, Ilina Vasileva; Bilin, Bugra; Bilmis, Selcuk; Gamsizkan, Halil; Isildak, Bora; Karapinar, Guler; Ocalan, Kadir; Sekmen, Sezen; Surat, Ugur Emrah; Yalvac, Metin; Zeyrek, Mehmet; Albayrak, Elif Asli; Gülmez, Erhan; Kaya, Mithat; Kaya, Ozlem; Yetkin, Taylan; Cankocak, Kerem; Vardarlı, Fuat Ilkehan; Levchuk, Leonid; Sorokin, Pavel; Brooke, James John; Clement, Emyr; Cussans, David; Flacher, Henning; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Jacob, Jeson; Kreczko, Lukasz; Lucas, Chris; Meng, Zhaoxia; Newbold, Dave M; Paramesvaran, Sudarshan; Poll, Anthony; Sakuma, Tai; Seif El Nasr-storey, Sarah; Senkin, Sergey; Smith, Vincent J; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Olaiya, Emmanuel; Petyt, David; Shepherd-Themistocleous, Claire; Thea, Alessandro; Tomalin, Ian R; Williams, Thomas; Womersley, William John; Worm, Steven; Baber, Mark; Bainbridge, Robert; Buchmuller, Oliver; Burton, Darren; Colling, David; Cripps, Nicholas; Dauncey, Paul; Davies, Gavin; Della Negra, Michel; Dunne, Patrick; Ferguson, William; Fulcher, Jonathan; Futyan, David; Hall, Geoffrey; Iles, Gregory; Jarvis, Martyn; Karapostoli, Georgia; Kenzie, Matthew; Lane, Rebecca; Lucas, Robyn; Lyons, Louis; Magnan, Anne-Marie; Malik, Sarah; Mathias, Bryn; Nash, Jordan; Nikitenko, Alexander; Pela, Joao; Pesaresi, Mark; Petridis, Konstantinos; Raymond, David Mark; Rogerson, Samuel; Rose, Andrew; Seez, Christopher; Sharp, Peter; Tapper, Alexander; Vazquez Acosta, Monica; Virdee, Tejinder; Zenz, Seth Conrad; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Leggat, Duncan; Leslie, Dawn; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Dittmann, Jay; Hatakeyama, Kenichi; Kasmi, Azeddine; Liu, Hongxuan; Scarborough, Tara; Charaf, Otman; Cooper, Seth; Henderson, Conor; Rumerio, Paolo; Avetisyan, Aram; Bose, Tulika; Fantasia, Cory; Lawson, Philip; Richardson, Clint; Rohlf, James; St John, Jason; Sulak, Lawrence; Alimena, Juliette; Berry, Edmund; Bhattacharya, Saptaparna; Christopher, Grant; Cutts, David; Demiragli, Zeynep; Dhingra, Nitish; Ferapontov, Alexey; Garabedian, Alex; Heintz, Ulrich; Kukartsev, Gennadiy; Laird, Edward; Landsberg, Greg; Luk, Michael; Narain, Meenakshi; Segala, Michael; Sinthuprasith, Tutanon; Speer, Thomas; Swanson, Joshua; Breedon, Richard; Breto, Guillermo; Calderon De La Barca Sanchez, Manuel; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Erbacher, Robin; Gardner, Michael; Ko, Winston; Lander, Richard; Mulhearn, Michael; Pellett, Dave; Pilot, Justin; Ricci-Tam, Francesca; Shalhout, Shalhout; Smith, John; Squires, Michael; Stolp, Dustin; Tripathi, Mani; Wilbur, Scott; Yohay, Rachel; Cousins, Robert; Everaerts, Pieter; Farrell, Chris; Hauser, Jay; Ignatenko, Mikhail; Rakness, Gregory; Takasugi, Eric; Valuev, Vyacheslav; Weber, Matthias; Burt, Kira; Clare, Robert; Ellison, John Anthony; Gary, J William; Hanson, Gail; Heilman, Jesse; Ivova Rikova, Mirena; Jandir, Pawandeep; Kennedy, Elizabeth; Lacroix, Florent; Long, Owen Rosser; Luthra, Arun; Malberti, Martina; Olmedo Negrete, Manuel; Shrinivas, Amithabh; Sumowidagdo, Suharyo; Wimpenny, Stephen; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; D'Agnolo, Raffaele Tito; Holzner, André; Kelley, Ryan; Klein, Daniel; Letts, James; Macneill, Ian; Olivito, Dominick; Padhi, Sanjay; Palmer, Christopher; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Simon, Sean; Tadel, Matevz; Tu, Yanjun; Vartak, Adish; Welke, Charles; Würthwein, Frank; Yagil, Avraham; Barge, Derek; Bradmiller-Feld, John; Campagnari, Claudio; Danielson, Thomas; Dishaw, Adam; Dutta, Valentina; Flowers, Kristen; Franco Sevilla, Manuel; Geffert, Paul; George, Christopher; Golf, Frank; Gouskos, Loukas; Incandela, Joe; Justus, Christopher; Mccoll, Nickolas; Richman, Jeffrey; Stuart, David; To, Wing; West, Christopher; Yoo, Jaehyeok; Apresyan, Artur; Bornheim, Adolf; Bunn, Julian; Chen, Yi; Duarte, Javier; Mott, Alexander; Newman, Harvey B; Pena, Cristian; Pierini, Maurizio; Spiropulu, Maria; Vlimant, Jean-Roch; Wilkinson, Richard; Xie, Si; Zhu, Ren-Yuan; Azzolini, Virginia; Calamba, Aristotle; Carlson, Benjamin; Ferguson, Thomas; Iiyama, Yutaro; Paulini, Manfred; Russ, James; Vogel, Helmut; Vorobiev, Igor; Cumalat, John Perry; Ford, William T; Gaz, Alessandro; Krohn, Michael; Luiggi Lopez, Eduardo; Nauenberg, Uriel; Smith, James; Stenson, Kevin; Wagner, Stephen Robert; Alexander, James; Chatterjee, Avishek; Chaves, Jorge; Chu, Jennifer; Dittmer, Susan; Eggert, Nicholas; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Ryd, Anders; Salvati, Emmanuele; Skinnari, Louise; Sun, Werner; Teo, Wee Don; Thom, Julia; Thompson, Joshua; Tucker, Jordan; Weng, Yao; Winstrom, Lucas; Wittich, Peter; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Anderson, Jacob; Apollinari, Giorgio; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bolla, Gino; Burkett, Kevin; Butler, Joel Nathan; Cheung, Harry; Chlebana, Frank; Cihangir, Selcuk; Elvira, Victor Daniel; Fisk, Ian; Freeman, Jim; Gao, Yanyan; Gottschalk, Erik; Gray, Lindsey; Green, Dan; Grünendahl, Stefan; Gutsche, Oliver; Hanlon, Jim; Hare, Daryl; Harris, Robert M; Hirschauer, James; Hooberman, Benjamin; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kreis, Benjamin; Kwan, Simon; Linacre, Jacob; Lincoln, Don; Lipton, Ron; Liu, Tiehui; Lykken, Joseph; Maeshima, Kaori; Marraffino, John Michael; Martinez Outschoorn, Verena Ingrid; Maruyama, Sho; Mason, David; McBride, Patricia; Merkel, Petra; Mishra, Kalanand; Mrenna, Stephen; Nahn, Steve; Newman-Holmes, Catherine; O'Dell, Vivian; Prokofyev, Oleg; Sexton-Kennedy, Elizabeth; Sharma, Seema; Soha, Aron; Spalding, William J; Spiegel, Leonard; Taylor, Lucas; Tkaczyk, Slawek; Tran, Nhan Viet; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vega Morales, Roberto; Vidal, Richard; Whitbeck, Andrew; Whitmore, Juliana; Yang, Fan; Acosta, Darin; Avery, Paul; Bortignon, Pierluigi; Bourilkov, Dimitri; Carver, Matthew; Curry, David; Das, Souvik; De Gruttola, Michele; Di Giovanni, Gian Piero; Field, Richard D; Fisher, Matthew; Furic, Ivan-Kresimir; Gainer, J.; Hugon, Justin; Konigsberg, Jacobo; Korytov, Andrey; Kypreos, Theodore; Low, Jia Fu; Matchev, Konstantin; Mei, Hualin; Milenovic, Predrag; Mitselmakher, Guenakh; Muniz, Lana; Rinkevicius, Aurelijus; Shchutska, Lesya; Snowball, Matthew; Sperka, David; Yelton, John; Zakaria, Mohammed; Hewamanage, Samantha; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Adams, Todd; Askew, Andrew; Bochenek, Joseph; Diamond, Brendan; Haas, Jeff; Hagopian, Sharon; Hagopian, Vasken; Johnson, Kurtis F; Prosper, Harrison; Veeraraghavan, Venkatesh; Weinberg, Marc; Baarmand, Marc M; Hohlmann, Marcus; Kalakhety, Himali; Yumiceva, Francisco; Adams, Mark Raymond; Apanasevich, Leonard; Berry, Douglas; Betts, Russell Richard; Bucinskaite, Inga; Cavanaugh, Richard; Evdokimov, Olga; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Kurt, Pelin; O'Brien, Christine; Sandoval Gonzalez, Irving Daniel; Silkworth, Christopher; Turner, Paul; Varelas, Nikos; Bilki, Burak; Clarida, Warren; Dilsiz, Kamuran; Haytmyradov, Maksat; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Ogul, Hasan; Onel, Yasar; Ozok, Ferhat; Penzo, Aldo; Rahmat, Rahmat; Sen, Sercan; Tan, Ping; Tiras, Emrah; Wetzel, James; Yi, Kai; Anderson, Ian; Barnett, Bruce Arnold; Blumenfeld, Barry; Bolognesi, Sara; Fehling, David; Gritsan, Andrei; Maksimovic, Petar; Martin, Christopher; Roskes, Jeffrey; Sarica, Ulascan; Swartz, Morris; Xiao, Meng; You, Can; Baringer, Philip; Bean, Alice; Benelli, Gabriele; Bruner, Christopher; Gray, Julia; Kenny III, Raymond Patrick; Majumder, Devdatta; Malek, Magdalena; Murray, Michael; Noonan, Daniel; Sanders, Stephen; Sekaric, Jadranka; Stringer, Robert; Wang, Quan; Wood, Jeffrey Scott; Chakaberia, Irakli; Ivanov, Andrew; Kaadze, Ketino; Khalil, Sadia; Makouski, Mikhail; Maravin, Yurii; Saini, Lovedeep Kaur; Skhirtladze, Nikoloz; Svintradze, Irakli; Gronberg, Jeffrey; Lange, David; Rebassoo, Finn; Wright, Douglas; Baden, Drew; Belloni, Alberto; Calvert, Brian; Eno, Sarah Catherine; Gomez, Jaime; Hadley, Nicholas John; Kellogg, Richard G; Kolberg, Ted; Lu, Ying; Mignerey, Alice; Pedro, Kevin; Skuja, Andris; Tonjes, Marguerite; Tonwar, Suresh C; Apyan, Aram; Barbieri, Richard; Busza, Wit; Cali, Ivan Amos; Chan, Matthew; Di Matteo, Leonardo; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Gulhan, Doga; Klute, Markus; Lai, Yue Shi; Lee, Yen-Jie; Levin, Andrew; Luckey, Paul David; Paus, Christoph; Ralph, Duncan; Roland, Christof; Roland, Gunther; Stephans, George; Sumorok, Konstanty; Velicanu, Dragos; Veverka, Jan; Wyslouch, Bolek; Yang, Mingming; Zanetti, Marco; Zhukova, Victoria; Dahmes, Bryan; Gude, Alexander; Kao, Shih-Chuan; Klapoetke, Kevin; Kubota, Yuichi; Mans, Jeremy; Nourbakhsh, Shervin; Pastika, Nathaniel; Rusack, Roger; Singovsky, Alexander; Tambe, Norbert; Turkewitz, Jared; Acosta, John Gabriel; Oliveros, Sandra; Avdeeva, Ekaterina; Bloom, Kenneth; Bose, Suvadeep; Claes, Daniel R; Dominguez, Aaron; Gonzalez Suarez, Rebeca; Keller, Jason; Knowlton, Dan; Kravchenko, Ilya; Lazo-Flores, Jose; Meier, Frank; Ratnikov, Fedor; Snow, Gregory R; Zvada, Marian; Dolen, James; Godshalk, Andrew; Iashvili, Ia; Kharchilava, Avto; Kumar, Ashish; Rappoccio, Salvatore; Alverson, George; Barberis, Emanuela; Baumgartel, Darin; Chasco, Matthew; Massironi, Andrea; Morse, David Michael; Nash, David; Orimoto, Toyoko; Trocino, Daniele; Wang, Ren-Jie; Wood, Darien; Zhang, Jinzhong; Hahn, Kristan Allan; Kubik, Andrew; Mucia, Nicholas; Odell, Nathaniel; Pollack, Brian; Pozdnyakov, Andrey; Schmitt, Michael Henry; Stoynev, Stoyan; Sung, Kevin; Velasco, Mayda; Won, Steven; Brinkerhoff, Andrew; Chan, Kwok Ming; Drozdetskiy, Alexey; Hildreth, Michael; Jessop, Colin; Karmgard, Daniel John; Kellams, Nathan; Lannon, Kevin; Lynch, Sean; Marinelli, Nancy; Musienko, Yuri; Pearson, Tessa; Planer, Michael; Ruchti, Randy; Smith, Geoffrey; Valls, Nil; Wayne, Mitchell; Wolf, Matthias; Woodard, Anna; Antonelli, Louis; Brinson, Jessica; Bylsma, Ben; Durkin, Lloyd Stanley; Flowers, Sean; Hart, Andrew; Hill, Christopher; Hughes, Richard; Kotov, Khristian; Ling, Ta-Yung; Luo, Wuming; Puigh, Darren; Rodenburg, Marissa; Winer, Brian L; Wolfe, Homer; Wulsin, Howard Wells; Driga, Olga; Elmer, Peter; Hardenbrook, Joshua; Hebda, Philip; Koay, Sue Ann; Lujan, Paul; Marlow, Daniel; Medvedeva, Tatiana; Mooney, Michael; Olsen, James; Piroué, Pierre; Quan, Xiaohang; Saka, Halil; Stickland, David; Tully, Christopher; Werner, Jeremy Scott; Zuranski, Andrzej; Brownson, Eric; Malik, Sudhir; Mendez, Hector; Ramirez Vargas, Juan Eduardo; Barnes, Virgil E; Benedetti, Daniele; Bortoletto, Daniela; De Mattia, Marco; Gutay, Laszlo; Hu, Zhen; Jha, Manoj; Jones, Matthew; Jung, Kurt; Kress, Matthew; Leonardo, Nuno; Miller, David Harry; Neumeister, Norbert; Radburn-Smith, Benjamin Charles; Shi, Xin; Shipsey, Ian; Silvers, David; Svyatkovskiy, Alexey; Wang, Fuqiang; Xie, Wei; Xu, Lingshan; Zablocki, Jakub; Parashar, Neeti; Stupak, John; Adair, Antony; Akgun, Bora; Ecklund, Karl Matthew; Geurts, Frank JM; Li, Wei; Michlin, Benjamin; Padley, Brian Paul; Redjimi, Radia; Roberts, Jay; Zabel, James; Betchart, Burton; Bodek, Arie; Covarelli, Roberto; de Barbaro, Pawel; Demina, Regina; Eshaq, Yossof; Ferbel, Thomas; Garcia-Bellido, Aran; Goldenzweig, Pablo; Han, Jiyeon; Harel, Amnon; Khukhunaishvili, Aleko; Korjenevski, Sergey; Petrillo, Gianluca; Vishnevskiy, Dmitry; Ciesielski, Robert; Demortier, Luc; Goulianos, Konstantin; Mesropian, Christina; Arora, Sanjay; Barker, Anthony; Chou, John Paul; Contreras-Campana, Christian; Contreras-Campana, Emmanuel; Duggan, Daniel; Ferencek, Dinko; Gershtein, Yuri; Gray, Richard; Halkiadakis, Eva; Hidas, Dean; Kaplan, Steven; Lath, Amitabh; Panwalkar, Shruti; Park, Michael; Patel, Rishi; Salur, Sevil; Schnetzer, Steve; Sheffield, David; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Thomassen, Peter; Walker, Matthew; Rose, Keith; Spanier, Stefan; York, Andrew; Bouhali, Othmane; Castaneda Hernandez, Alfredo; Eusebi, Ricardo; Flanagan, Will; Gilmore, Jason; Kamon, Teruki; Khotilovich, Vadim; Krutelyov, Vyacheslav; Montalvo, Roy; Osipenkov, Ilya; Pakhotin, Yuriy; Perloff, Alexx; Roe, Jeffrey; Rose, Anthony; Safonov, Alexei; Suarez, Indara; Tatarinov, Aysen; Ulmer, Keith; Akchurin, Nural; Cowden, Christopher; Damgov, Jordan; Dragoiu, Cosmin; Dudero, Phillip Russell; Faulkner, James; Kovitanggoon, Kittikul; Kunori, Shuichi; Lee, Sung Won; Libeiro, Terence; Volobouev, Igor; Appelt, Eric; Delannoy, Andrés G; Greene, Senta; Gurrola, Alfredo; Johns, Willard; Maguire, Charles; Mao, Yaxian; Melo, Andrew; Sharma, Monika; Sheldon, Paul; Snook, Benjamin; Tuo, Shengquan; Velkovska, Julia; Arenton, Michael Wayne; Boutle, Sarah; Cox, Bradley; Francis, Brian; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Li, Hengne; Lin, Chuanzhe; Neu, Christopher; Wood, John; Clarke, Christopher; Harr, Robert; Karchin, Paul Edmund; Kottachchi Kankanamge Don, Chamath; Lamichhane, Pramod; Sturdy, Jared; Belknap, Donald; Carlsmith, Duncan; Cepeda, Maria; Dasu, Sridhara; Dodd, Laura; Duric, Senka; Friis, Evan; Hall-Wilton, Richard; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Lanaro, Armando; Lazaridis, Christos; Levine, Aaron; Loveless, Richard; Mohapatra, Ajit; Ojalvo, Isabel; Perry, Thomas; Pierro, Giuseppe Antonio; Polese, Giovanni; Ross, Ian; Sarangi, Tapas; Savin, Alexander; Smith, Wesley H; Taylor, Devin; Vuosalo, Carl; Woods, Nathaniel

    2015-07-13

    The study of the spin-parity and tensor structure of the interactions of the recently discovered Higgs boson is performed using the $\\mathrm{H} \\rightarrow \\mathrm{Z} \\mathrm{Z}$, $\\mathrm{Z}\\gamma^*$, $\\gamma^*\\gamma^* \\rightarrow 4\\ell$, $\\mathrm{H} \\rightarrow \\mathrm{W} \\mathrm{W} \\rightarrow \\ell\

  13. 10 CFR Appendix A to Part 20 - Assigned Protection Factors for Respirators a

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 1 2010-01-01 2010-01-01 false Assigned Protection Factors for Respirators a A Appendix A..., App. A Appendix A to Part 20—Assigned Protection Factors for Respirators a Operating mode AssignedProtection Factors I. Air Purifying Respirators c: Filtering facepiece disposable d Negative Pressure...

  14. Study of natural spin-parity strange meson radial excitations in K/sup -/p. -->. K/sup -/. pi. /sup +/n at 11 GeV/c

    Energy Technology Data Exchange (ETDEWEB)

    Durkin, L.S.

    1980-12-01

    Results are presented from a high statistics study of the reaction K/sup -/p ..-->.. K/sup -/..pi../sup +/n at 11 GeV/c. This data was selected offline from an approx. 1000 event/..mu..b K/sup -/p experiment run on the Large Aperture Solenoid Spectrometer (LASS) at SLAC which triggered on essentially the total inelastic cross section. This K/sup -/..pi../sup +/n sample, after cuts, contained approx. 42,000 events in the K..pi.. invariant mass region from 0.65 GeV to 2.30 GeV, and absolute value t' < 0.2 GeV/sup 2/. A spherical harmonic angular moments analysis of this data is presented, as well as an energy independent partial wave analysis (PWA) of these angular moments. The nearly uniform acceptance characteristics of this data allowed a detailed analysis, which yielded information on natural spin-parity strange meson resonances in the K..pi.. invariant mass range from 0.65 GeV to 2.30 GeV. The well established K*(895), K*(1430), and K*(1780) are observed, and clear evidence is presented for a J/sup P/ = 4/sup +/ strange meson state at a mass of 2.08 GeV. The K/sup -/..pi../sup +/ elastic scattering partial waves extracted in this PWA show unambiguous evidence for a relatively narrow S wave resonance near 1.42 GeV in the K..pi.. invariant mass. This state is a confirmation of the 0/sup +/ K(1500) seen in previous PWA's. A new higher S wave resonance is clearly seen unambiguously near 1.90 GeV. Unambiguous evidence is presented for a relatively wide P wave resonance in the 1.70 GeV region.A second new P wave resonance also is seen in two of four ambiguous partial wave solutions in the 2.10 GeV region. These resonance states are discussed within the framework of a simple harmonic oscillator quark model. In particular three of the underlying resonances are discussed as possible natural spin-parity strange meson radial excitations.

  15. Observation and Spin-Parity Determination of the $X(1835)$ in $J/\\psi\\rightarrow\\gamma K^0_S K^0_S\\eta$

    CERN Document Server

    Ablikim, M; Ai, X C; Albayrak, O; Albrecht, M; Ambrose, D J; Amoroso, A; An, F F; An, Q; Bai, J Z; Ferroli, R Baldini; Ban, Y; Bennett, D W; Bennett, J V; Bertani, M; Bettoni, D; Bian, J M; Bianchi, F; Boger, E; Boyko, I; Briere, R A; Cai, H; Cai, X; Cakir, O; Calcaterra, A; Cao, G F; Cetin, S A; Chang, J F; Chelkov, G; Chen, G; Chen, H S; Chen, H Y; Chen, J C; Chen, M L; Chen, S J; Chen, X; Chen, X R; Chen, Y B; Cheng, H P; Chu, X K; Cibinetto, G; Dai, H L; Dai, J P; Dbeyssi, A; Dedovich, D; Deng, Z Y; Denig, A; Denysenko, I; Destefanis, M; De Mori, F; Ding, Y; Dong, C; Dong, J; Dong, L Y; Dong, M Y; Du, S X; Duan, P F; Eren, E E; Fan, J Z; Fang, J; Fang, S S; Fang, X; Fang, Y; Fava, L; Feldbauer, F; Felici, G; Feng, C Q; Fioravanti, E; Fritsch, M; Fu, C D; Gao, Q; Gao, X Y; Gao, Y; Gao, Z; Garzia, I; Geng, C; Goetzen, K; Gong, W X; Gradl, W; Greco, M; Gu, M H; Gu, Y T; Guan, Y H; Guo, A Q; Guo, L B; Guo, Y; Guo, Y P; Haddadi, Z; Hafner, A; Han, S; Han, Y L; Hao, X Q; Harris, F A; He, K L; He, Z Y; Held, T; Heng, Y K; Hou, Z L; Hu, C; Hu, H M; Hu, J F; Hu, T; Hu, Y; Huang, G M; Huang, G S; Huang, H P; Huang, J S; Huang, X T; Huang, Y; Hussain, T; Ji, Q; Ji, Q P; Ji, X B; Ji, X L; Jiang, L L; Jiang, L W; Jiang, X S; Jiang, X Y; Jiao, J B; Jiao, Z; Jin, D P; Jin, S; Johansson, T; Julin, A; Kalantar-Nayestanaki, N; Kang, X L; Kang, X S; Kavatsyuk, M; Ke, B C; Kiese, P; Kliemt, R; Kloss, B; Kolcu, O B; Kopf, B; Kornicer, M; Kühn, W; Kupsc, A; Lange, J S; Lara, M; Larin, P; Leng, C; Li, C; Li, C H; Li, Cheng; Li, D M; Li, F; Li, G; Li, H B; Li, J C; Li, Jin; Li, K; Li, Lei; Li, P R; Li, T; Li, W D; Li, W G; Li, X L; Li, X M; Li, X N; Li, X Q; Li, Z B; Liang, H; Liang, Y F; Liang, Y T; Liao, G R; Lin, D X; Liu, B J; Liu, C X; Liu, F H; Liu, Fang; Liu, Feng; Liu, H B; Liu, H H; Liu, H M; Liu, J; Liu, J B; Liu, J P; Liu, J Y; Liu, K; Liu, K Y; Liu, L D; Liu, P L; Liu, Q; Liu, S B; Liu, X; Liu, X X; Liu, Y B; Liu, Z A; Liu, Zhiqiang; Liu, Zhiqing; Loehner, H; Lou, X C; Lu, H J; Lu, J G; Lu, R Q; Lu, Y; Lu, Y P; Luo, C L; Luo, M X; Luo, T; Luo, X L; Lv, M; Lyu, X R; Ma, F C; Ma, H L; Ma, L L; Ma, Q M; Ma, T; Ma, X N; Ma, X Y; Maas, F E; Maggiora, M; Mao, Y J; Mao, Z P; Marcello, S; Messchendorp, J G; Min, J; Min, T J; Mitchell, R E; Mo, X H; Mo, Y J; Morales, C Morales; Moriya, K; Muchnoi, N Yu; Muramatsu, H; Nefedov, Y; Nerling, F; Nikolaev, I B; Ning, Z; Nisar, S; Niu, S L; Niu, X Y; Olsen, S L; Ouyang, Q; Pacetti, S; Patteri, P; Pelizaeus, M; Peng, H P; Peters, K; Pettersson, J; Ping, J L; Ping, R G; Poling, R; Prasad, V; Pu, Y N; Qi, M; Qian, S; Qiao, C F; Qin, L Q; Qin, N; Qin, X S; Qin, Y; Qin, Z H; Qiu, J F; Rashid, K H; Redmer, C F; Ren, H L; Ripka, M; Rong, G; Rosner, Ch; Ruan, X D; Santoro, V; Sarantsev, A; Savrié, M; Schoenning, K; Schumann, S; Shan, W; Shao, M; Shen, C P; Shen, P X; Shen, X Y; Sheng, H Y; Song, W M; Song, X Y; Sosio, S; Spataro, S; Sun, G X; Sun, J F; Sun, S S; Sun, Y J; Sun, Y Z; Sun, Z J; Sun, Z T; Tang, C J; Tang, X; Tapan, I; Thorndike, E H; Tiemens, M; Ullrich, M; Uman, I; Varner, G S; Wang, B; Wang, B L; Wang, D; Wang, D Y; Wang, K; Wang, L L; Wang, L S; Wang, M; Wang, P; Wang, P L; Wang, S G; Wang, W; Wang, X F; Wang, Y D; Wang, Y F; Wang, Y Q; Wang, Z; Wang, Z G; Wang, Z H; Wang, Z Y; Weber, T; Wei, D H; Wei, J B; Weidenkaff, P; Wen, S P; Wiedner, U; Wolke, M; Wu, L H; Wu, Z; Xia, L G; Xia, Y; Xiao, D; Xiao, Z J; Xie, Y G; Xiu, Q L; Xu, G F; Xu, L; Xu, Q J; Xu, Q N; Xu, X P; Yan, L; Yan, W B; Yan, W C; Yan, Y H; Yang, H J; Yang, H X; Yang, L; Yang, Y; Yang, Y X; Ye, H; Ye, M; Ye, M H; Yin, J H; Yu, B X; Yu, C X; Yu, H W; Yu, J S; Yuan, C Z; Yuan, W L; Yuan, Y; Yuncu, A; Zafar, A A; Zallo, A; Zeng, Y; Zhang, B X; Zhang, B Y; Zhang, C; Zhang, C C; Zhang, D H; Zhang, H H; Zhang, H Y; Zhang, J J; Zhang, J L; Zhang, J Q; Zhang, J W; Zhang, J Y; Zhang, J Z; Zhang, K; Zhang, L; Zhang, S H; Zhang, X Y; Zhang, Y; Zhang, Y N; Zhang, Y H; Zhang, Y T; Zhang, Yu; Zhang, Z H; Zhang, Z P; Zhang, Z Y; Zhao, G; Zhao, J W; Zhao, J Y; Zhao, J Z; Zhao, Lei; Zhao, Ling; Zhao, M G; Zhao, Q; Zhao, Q W; Zhao, S J; Zhao, T C; Zhao, Y B; Zhao, Z G; Zhemchugov, A; Zheng, B; Zheng, J P; Zheng, W J; Zheng, Y H; Zhong, B; Zhou, L; Zhou, Li; Zhou, X; Zhou, X K; Zhou, X R; Zhou, X Y; Zhu, K; Zhu, K J; Zhu, S; Zhu, X L; Zhu, Y C; Zhu, Y S; Zhu, Z A; Zhuang, J; Zotti, L; Zou, B S; Zou, J H

    2015-01-01

    We report an observation of the process $J/\\psi\\rightarrow\\gamma X(1835)\\rightarrow\\gamma K^0_S K^0_S\\eta$ at low $K^0_S K^0_S$ mass with a statistical significance larger than 12.9$\\sigma$ using a data sample of $1.31 \\times 10^{9}$ $J/\\psi$ events collected with the BESIII detector. In this region of phase space the $K^0_S K^0_S$ system is dominantly produced through the $f_0(980)$. By performing a partial wave analysis, we determine the spin-parity of the $X(1835)$ to be $J^{PC}=0^{-+}$. The mass and width of the observed $X(1835)$ are $1844\\pm9(\\text{stat})^{+16}_{-25}(\\text{syst})$~\\MeV~and $192^{+20}_{-17}(\\text{stat})^{+62}_{-43}(\\text{syst})$~MeV, respectively, which are consistent with the results obtained by BESIII in the channel $J/\\psi\\rightarrow\\gamma\\pi^+\\pi^-\\eta^{\\prime}$.

  16. Calculations of Compound Nucleus Spin-Parity Distributions Populated via the (p,t Reaction in Support of Surrogate Neutron Capture Measurements

    Directory of Open Access Journals (Sweden)

    Benstead J.

    2016-01-01

    Full Text Available The surrogate reaction method may be used to determine the cross section for neutron induced reactions not accessible through standard experimental techniques. This is achieved by creating the same compound nucleus as would be expected in the desired reaction, but through a different incident channel, generally a direct transfer reaction. So far, the surrogate technique has been applied with reasonable success to determine the fission cross section for a number of actinides, but has been less successful when applied to other reactions, e.g. neutron capture, due to a ‘spin-parity mismatch’. This mismatch, between the spin and parity distributions of the excited levels of the compound nucleus populated in the desired and surrogate channels, leads to differing decay probabilities and hence reduces the validity of using the surrogate method to infer the cross section in the desired channel. A greater theoretical understanding of the expected distribution of levels excited in both the desired and surrogate channels is therefore required in order to attempt to address this mismatch and allow the method to be utilised with greater confidence. Two neutron transfer reactions, e.g. (p,t, which allow the technique to be utilised for isotopes further removed from the line of stability, are the subject of this study. Results are presented for the calculated distribution of compound nucleus states populated in 90Zr, via the 90Zr(p,t90Zr reaction, and are compared against measured data at an incident proton energy of 28.56 MeV.

  17. An empirical study for ranking risk factors using linear assignment: A case study of road construction

    Directory of Open Access Journals (Sweden)

    Amin Foroughi

    2012-04-01

    Full Text Available Road construction projects are considered as the most important governmental issues since there are normally heavy investments required in such projects. There is also shortage of financial resources in governmental budget, which makes the asset allocation more challenging. One primary step in reducing the cost is to determine different risks associated with execution of such project activities. In this study, we present some important risk factors associated with road construction in two levels for a real-world case study of rail-road industry located between two cities of Esfahan and Deligan. The first group of risk factors includes the probability and the effects for various attributes including cost, time, quality and performance. The second group of risk factors includes socio-economical factors as well as political and managerial aspects. The study finds 21 main risk factors as well as 193 sub risk factors. The factors are ranked using groups decision-making method called linear assignment. The preliminary results indicate that the road construction projects could finish faster with better outcome should we carefully consider risk factors and attempt to reduce their impacts.

  18. An explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment

    Institute of Scientific and Technical Information of China (English)

    Bin ZHOU; Guangren DUAN

    2006-01-01

    In this paper, an explicit solution to polynomial matrix right coprime factorization of input-state transfer function is obtained in terms of the Krylov matrix and the Pseudo-controllability indices of the pair of coefficient matrices.The proposed approach only needs to solve a series of line ar equations. Applications of this solution to a type of generalized Sylvester matrix equations and the problem of parametric eigenstructure assignment by state feedback are investigated.These new solutions are simple, they possess better structural properties and are very convenient to use. An example shows the effect of the proposed results.

  19. New weighting factors assignment of evidence theory based on evidence distance

    Institute of Scientific and Technical Information of China (English)

    Chen Liangzhou; Shi Wenkang; Du Feng

    2005-01-01

    Evidence theory has been widely used in the information fusion for its effectiveness of the uncertainty reasoning. However, the classical DS evidence theory involves counter-intuitive behaviors when the high conflict information exists. Based on the analysis of some modified methods, Assigning the weighting factors according to the intrinsic characteristics of the existing evidence sources is proposed, which is determined on the evidence distance theory. From the numerical examples, the proposed method provides a reasonable result with good convergence efficiency. In addition, the new rule retrieves to the Yager's formula when all the evidence sources contradict to each other completely.

  20. An explicit solution to right factorization with application in eigenstructure assignment

    Institute of Scientific and Technical Information of China (English)

    Guangren DUAN; Bin ZHOU

    2005-01-01

    Based on the well-known Leverrier algorithm, a simple explicit solution to right factorization of a linear system is established.This solution is expressed by the controllability matrix of the given system and a symmetric operator matrix.Applications of this solution to a type of generalized Sylvester matrix equations and the problem of parametric eigenstructure assignment by state feedback are investigated,and general complete parametric solutions to these two problems are deduced. These new solutions are simple,and possess desirable structural properties which render the solutions readily implementable.An example demonstrates the effect of the proposed results.

  1. Structure of neutron-rich nuclei around the N = 126 closed shell; the yrast structure of {sup 205}Au{sub 126} up to spin-parity I{sup {pi}} = (19/2{sup +})

    Energy Technology Data Exchange (ETDEWEB)

    Podolyak, Zs.; Steer, S.J.; Pietri, S.; Regan, P.H.; Brandau, C.; Catford, W.N.; Cullen, I.J.; Gelletly, W.; Jones, G.A.; Liu, Z.; Walker, P.M. [University of Surrey, Department of Physics, Guildford (United Kingdom); Gorska, M.; Gerl, J.; Wollersheim, H.J.; Grawe, H.; Becker, F.; Geissel, H.; Kelic, A.; Kojouharov, I.; Kurz, N.; Montes, F.; Prokopowicz, W.; Saito, T.; Schaffner, H.; Tashenov, S.; Werner-Malento, E. [GSI, Darmstadt (Germany); Rudolph, D.; Hoischen, R. [Lund University, Department of Physics, Lund (Sweden); Garnsworthy, A.B. [University of Surrey, Department of Physics, Guildford (United Kingdom); Yale University, WNSL, New Haven, CT (United States); Maier, K.H. [Institute of Nuclear Physics, Krakow (Poland); University of the West of Scotland, Dept. of Physics, Paisley (United Kingdom); Bednarczyk, P.; Grebosz, J. [GSI, Darmstadt (Germany); Institute of Nuclear Physics, Krakow (Poland); Caceres, L. [GSI, Darmstadt (Germany); Universidad Autonoma de Madrid, Dept. de Fisica Teorica, Madrid (Spain); Doornenbal, P. [GSI, Darmstadt (Germany); Universitaet zu Koeln, IKP, Koeln (Germany); Heinz, A. [Yale University, WNSL, New Haven, CT (United States); Kurtukian-Nieto, T. [Universidad de Santiago de Compostela, Santiago de Campostela (Spain); Benzoni, G.; Wieland, O. [Universita degli Studi di Milano (Italy); INFN, Milano (Italy); Pfuetzner, M. [Warsaw University, IEP, Warsaw (Poland); Jungclaus, A. [Universidad Autonoma de Madrid, Dept. de Fisica Teorica, Madrid (Spain); Balabanski, D.L. [Bulgarian Academy of Sciences, INRNE, Sofia (Bulgaria); Brown, B.A. [Univ. of Surrey, Dept. of Physics, Guildford (United Kingdom); Michigan State Univ., NSCL, East Lansing, MI (United States); Bruce, A.M.; Lalkovski, S. [Univ. of Brighton, School of Environment and Technology, Brighton (United Kingdom); Dombradi, Zs. [Institute for Nuclear Research, Debrecen (Hungary); Estevez, M.E. [Instituto de Fisica Corpuscular, Valencia (Spain)] [and others

    2009-12-15

    Heavy neutron-rich nuclei have been populated through the relativistic fragmentation of a {sup 208}{sub 82} Pb beam at E/A = 1 GeV on a 2.5 g/cm{sup 2} thick Be target. The synthesised nuclei were selected and identified in-flight using the fragment separator at GSI. Approximately 300 ns after production, the selected nuclei were implanted in an {proportional_to}8 mm thick perspex stopper, positioned at the centre of the RISING {gamma} -ray detector spectrometer array. A previously unreported isomer with a half-life T{sub 1/2} = 163(5) ns has been observed in the N=126 closed-shell nucleus {sup 205}{sub 79} Au. Through {gamma}-ray singles and {gamma}-{gamma} coincidence analysis a level scheme was established. The comparison with a shell model calculation tentatively identifies the spin-parity of the excited states, including the isomer itself, which is found to be I{sup {pi}} = (19/2{sup +}). (orig.)

  2. Credit Assignment and the Problem of Competing Factors in Case-Based Reasoning

    Science.gov (United States)

    1988-01-01

    similar to the dropping of an antecedent condition to test its necessity as is done in mathematics and the use of the near miss in machine learning...U Potentially more-on-point - a case won by the opposing side that would be a most-on-point case if certain factors, currently " near - misses " in the...problem situation, were actually present. A factor is a near - miss if the problem situation contains all the information needed to tell if the factor

  3. NMR assignments of the peptidyl-prolyl cis-trans isomerase domain of trigger factor from E. coli.

    Science.gov (United States)

    Huang, Chih-Ting; Hsu, Shang-Te Danny

    2016-04-01

    Trigger factor (TF) is a highly conserved multi-domain molecular chaperone in bacteria. It binds via its ribosome binding domain (RBD) to the ribosomal tunnel exit and facilitates co-translational folding of a broad range of protein substrates primarily through interactions with the substrate binding domain (SBD) adjacent to the RBD. Within the SBD, a peptidyl-prolyl cis-trans isomerase (PPIase) domain is inserted leading to an unusual domain insertion, which may provide stabilizing effect to the highly plastic SBD. Here we report the near complete NMR assignments of TF PPIase providing the basis for subsequent structural and folding in the context of the chaperone activity of TF.

  4. Comparison of Methods for Adjusting Incorrect Assignments of Items to Subtests Oblique Multiple Group Method Versus Confirmatory Common Factor Method

    NARCIS (Netherlands)

    Stuive, Ilse; Kiers, Henk A.L.; Timmerman, Marieke E.

    2009-01-01

    A common question in test evaluation is whether an a priori assignment of items to subtests is supported by empirical data. If the analysis results indicate the assignment of items to subtests under study is not supported by data, the assignment is often adjusted. In this study the authors compare t

  5. Investigations of Spectroscopic Factors and Sum Rules from the Single Neutron Transfer Reaction 111Cd(d→$\\overrightarrow {\\rm{d}} $,p112Cd

    Directory of Open Access Journals (Sweden)

    Jamieson D.S.

    2014-03-01

    Full Text Available Cadmium isotopes have been presented for decades as excellent examples of vibrational nuclei, with low-lying levels interpreted as multi-phonon quadrupole, octupole, and mixed-symmetry states. A large amount of spectroscopic data has been obtained through various experimental studies of cadmiumisotopes. In the present work, the 111Cd(d→$\\overrightarrow {\\rm{d}} $,p112Cd reaction was used to investigate the single-particle structure of the 112Cd nucleus. A 22 MeV beam of polarized deuterons was obtained at the Maier-Leibnitz laboratory in Garching, Germany. The reaction ejectiles were momentum analyzed using a Q3D spectrograph, and 130 levels have been identified up to 4.2 MeV of excitation energy. Using DWBA analysis with optical model calculations, spin-parity assignments have been made for observed levels, and spectroscopic factors have been extracted from the experimental angular distributions of differential cross section and analyzing power. In this high energy resolution investigation, many additional levels have been observed compared with the previous (d,p study using 8 MeV deuterons [1]. There were a total of 44 new levels observed, and the parity assignments of 34 levels were improved.

  6. Organizational factors and mental health in community volunteers. The role of exposure, preparation, training, tasks assigned, and support.

    Science.gov (United States)

    Thormar, Sigridur Bjork; Gersons, Berthold P R; Juen, Barbara; Djakababa, Maria Nelden; Karlsson, Thorlakur; Olff, Miranda

    2013-01-01

    During disasters, aid organizations often respond using the resources of local volunteer members from the affected population who are not only inexperienced, but who additionally take on some of the more psychologically and physically difficult tasks in order to provide support for their community. Although not much empirical evidence exists to justify the claim, it is thought that preparation, training, and organizational support limit (or reduce) a volunteer's risk of developing later psychopathology. In this study, we examined the effects of preparation, training, and organizational support and assigned tasks on the mental health of 506 Indonesian Red Cross volunteers who participated in the response to a massive earthquake in Yogyakarta, Indonesia, in 2006. Controlling for exposure level, the volunteers were assessed for post-traumatic stress disorder (PTSD), anxiety, depression, and subjective health complaints (SHCs) 6, 12, and 18 months post-disaster. Results showed high levels of PTSD and SHCs up to 18 months post-disaster, while anxiety and depression levels remained in the normal range. Higher levels of exposure as well as certain tasks (e.g., provision of psychosocial support to beneficiaries, handling administration, or handing out food aid) made the volunteers more vulnerable. Sense of safety, expressed general need for support at 6 months, and a lack of perceived support from team leaders and the organization were also related to greater psychopathology at 18 months. The results highlight the importance of studying organizational factors. By incorporating these results into future volunteer management programs the negative effects of disaster work on volunteers can be ameliorated.

  7. 1H, 15N and 13C assignments of domain 5 of Dictyostelium discoideum gelation factor (ABP-120) in its native and 8M urea-denatured states.

    Science.gov (United States)

    Hsu, Shang-Te Danny; Cabrita, Lisa D; Christodoulou, John; Dobson, Christopher M

    2009-06-01

    The gelation factor from Dictyostelium discoideum (ABP-120) is an actin binding protein consisting of six immunoglobulin (Ig) domains in the C-terminal rod domain. We have recently used the pair of domains 5 and 6 of ABP-120 as a model system for studying multi-domain nascent chain folding on the ribosome. Here we present the NMR assignments of domain 5 in its native and 8M urea-denatured states.

  8. 40 CFR 86.1826-01 - Assigned deterioration factors for small volume manufacturers and small volume test groups.

    Science.gov (United States)

    2010-07-01

    ... Pollution From New and In-Use Light-Duty Vehicles, Light-Duty Trucks, and Complete Otto-Cycle Heavy-Duty... aggregated sales of less than 301 motor vehicles and motor vehicle engines per year (determined under the... deterioration factor. (2) Manufacturers with aggregated sales from and including 301 through 14,999...

  9. Spin Parity effects in STM single magnetic atom manipulation

    Science.gov (United States)

    Delgado, Fernando; Fernández-Rossier, Joaquín

    2012-02-01

    Recent experimental work shows that a spin polarized scanning tunneling microscopy tip can be used both to read and write the spin orientation of a single magnetic spin [1]. Inelastic electron tunneling spectroscopy (IETS) shows that spin of the magnetic atom is quantized [2], like the spin of a molecular magnet. Here we discuss two fundamental problems that arise when a bit of classical information is stored on a quantized spin: quantum spin tunneling and back-action of the readout process. Quantum tunneling is responsible of the loss of information due to the relaxation of the spin coupled to the environment, while the detection induced back-action leads to an unwanted modification of the spin state. We find that fundamental differences exist between integer and semi-integer spins when it comes to both, read and write classical information in a quantized spin.[4pt] [1] S. Loth et al, Nature Physics 6, 340 (2010).[0pt] [2] C. Hirjibehedin et al, Science 317, 1199 (2007).

  10. My Favorite Assignment.

    Science.gov (United States)

    Post, Robert E.; Johnson, Jack E.

    1982-01-01

    Presents two assignments that show (1) how George Orwell's "Politics and the English Language" can be applied to business writing and (2) how structured student-teacher conferences can generate enthusiasm for oral expression in a business communication course. (AEA)

  11. Historical WBAN ID Assignments

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — 4"x6" index cards represent the first written assignments of Weather Bureau Army Navy (WBAN) station identifier numbers by the National Climatic Data Center....

  12. 48 CFR 42.602 - Assignment and location.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Assignment and location... Assignment and location. (a) A CACO may be assigned only when (1) the contractor has at least two locations... discontinue a CACO assignment should be based on such factors as (1) the benefits of coordination and liaison...

  13. 42 CFR 433.146 - Rights assigned; assignment method.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN... Assignment of Rights to Benefits § 433.146 Rights assigned; assignment method. (a) Except as specified...

  14. FLEET ASSIGNMENT MODELLING

    Directory of Open Access Journals (Sweden)

    2016-01-01

    Full Text Available The article is devoted to the airline scheduling process and methods of its modeling. This article describes the main stages of airline scheduling process (scheduling, fleet assignment, revenue management, operations, their features and interactions. The main part of scheduling process is fleet assignment. The optimal solution of the fleet assignment problem enables airlines to increase their incomes up to 3 % due to quality improving of connections and execution of the planned number of flights operated by less number of aircraft than usual or planned earlier. Fleet assignment of scheduling process is examined and Conventional Leg-Based Fleet Assignment Model is analyzed. Finally strong and weak aspects of the model (SWOT are released and applied. The article gives a critical analysis of FAM model, with the purpose of identi- fying possible options and constraints of its use (for example, in cases of short-term and long-term planning, changing the schedule or replacing the aircraft, as well as possible ways to improve the model.

  15. NR 512 All Assignments

    OpenAIRE

    Laynebaril1

    2017-01-01

     NR 512 All Assignments Click Link Below To Buy: http://hwcampus.com/shop/nr-512-assignments/ Or Visit www.hwcampus.com   NR512 Week 4 Scavenger Hunt Latest 2017 W4_NR512 Second Life (SL) Scavenger Hunt Work Sheet Student Name: Dorinda Ezell Avatar Name: Dvezellnr512 INSTRUCTIONS Instructions: 1. As you complete the Scavenger Hunt, please write your answers to the questions on this worksheet. 2. Save it as a MS Word document in the following format: ...

  16. Random Cell Identifiers Assignment

    Directory of Open Access Journals (Sweden)

    Robert Bestak

    2012-01-01

    Full Text Available Despite integration of advanced functions that enable Femto Access Points (FAPs to be deployed in a plug-and-play manner, the femtocell concept still cause several opened issues to be resolved. One of them represents an assignment of Physical Cell Identifiers (PCIs to FAPs. This paper analyses a random based assignment algorithm in LTE systems operating in diverse femtocell scenarios. The performance of the algorithm is evaluated by comparing the number of confusions for various femtocell densities, PCI ranges and knowledge of vicinity. Simulation results show that better knowledge of vicinity can significantly reduce the number of confusions events.

  17. Task assignment and coaching

    NARCIS (Netherlands)

    Dominguez-Martinez, S.

    2009-01-01

    An important task of a manager is to motivate her subordinates. One way in which a manager can give incentives to junior employees is through the assignment of tasks. How a manager allocates tasks in an organization, provides information to the junior employees about his ability. Without coaching fr

  18. Zero Assignment in Multivariable System Using Pole Assignment Method

    OpenAIRE

    Smagina, Ye.

    2002-01-01

    In the paper we consider the invariant zero assignment problem in a linear multivariable system with several inputs/outputs by constructing a system output matrix. The problem is reduced to the pole assignment problem by a state feedback (modal control) in a descriptor system or a regular one. It is shown that the zero assignment and pole assignment are mathematically equivalent problems.

  19. Scaffolding students’ assignments

    DEFF Research Database (Denmark)

    Slot, Marie Falkesgaard

    2013-01-01

    This article discusses scaffolding in typical student assignments in mother tongue learning materials in upper secondary education in Denmark and the United Kingdom. It has been determined that assignments do not have sufficient scaffolding end features to help pupils understand concepts and build...... objects. The article presents the results of empirical research on tasks given in Danish and British learning materials. This work is based on a further development of my PhD thesis: “Learning materials in the subject of Danish” (Slot 2010). The main focus is how cognitive models (and subsidiary explicit...... learning goals) can help students structure their argumentative and communica-tive learning processes, and how various multimodal representations can give more open-ended learning possibilities for collaboration. The article presents a short introduction of the skills for 21st century learning and defines...

  20. Risk factors for colonization with extended-spectrum beta-lactamase producing Enterobacteriaceae in healthcare students on clinical assignment abroad: A prospective study.

    Science.gov (United States)

    Angelin, Martin; Forsell, Joakim; Granlund, Margareta; Evengård, Birgitta; Palmgren, Helena; Johansson, Anders

    2015-01-01

    The increase of antibiotic resistance in clinically important bacteria is a worldwide threat, especially in healthcare environments. International travel is a risk factor for gut colonization with extended-spectrum beta-lactamase-producing Enterobacteriaceae (ESBL-PE). The risk for healthcare students of being colonized with ESBL-PE when participating in patient-related work abroad has not been previously investigated. Swedish healthcare students travelling for pre-clinical and clinical courses outside Scandinavia submitted faecal samples and survey data before and after travel. The faecal samples were screened for ESBL-PE and carbapenemase-producing Enterobacteriaceae (CPE). Screening results and survey data were analysed to identify risk factors for colonization. In the 99 subjects who submitted a full set of samples, 35% were colonized with a new ESBL-PE strain during travel. No CPE was found. The most important risk factor for ESBL-PE colonization was travel destination, and the highest colonization rate was found in the South-East Asia region. Antibiotic treatment during travel was an independent risk factor for ESBL-PE colonization but patient-related work was not significantly associated with an increased risk. Patient-related work abroad was not a risk factor for ESBL-PE suggesting that transmission from patients is uncommon. Pre-travel advice on avoiding unnecessary antibiotic treatment during travel is recommended. Copyright © 2015 Elsevier Ltd. All rights reserved.

  1. The Dynamic Frequency Assignment Problem

    OpenAIRE

    Dupont, Audrey; Linhares, Andréa,; Artigues, Christian; Feillet, Dominique; Michelon, Philippe; Vasquez, Michel

    2008-01-01

    21 pages; International audience; In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring frequency assignments need to be established throughout a deployment. The problem decomposes in three phases: assignment of an initial kernel of communications, dynamic assignment of new communication links and reparation when no assignment is possible. Different solution...

  2. A Generalized Assignment Game

    OpenAIRE

    Camiña, Ester

    2002-01-01

    The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of both pairwise and group stable outcomes is proved. We study the structure of the group stable set and we finally prove that the set of group stable payoffs forms a complete lattice with one optimal gr...

  3. Grouping puts figure-ground assignment in context by constraining propagation of edge-assignment

    Science.gov (United States)

    Brooks, Joseph L.; Driver, Jon

    2010-01-01

    Figure-ground organization involves assignment of edges to a figural shape on one or the other side of each dividing edge. Established visual cues for edge-assignment primarily concern relatively local rather than contextual factors. Here we show that assignment for a locally-unbiased edge can be affected by assignment of a remote contextual edge that has its own locally-biased assignment. We find that such propagation of edge-assignment from the biased remote context occurs only when the biased and unbiased edges are grouped. This new principle, whereby grouping constrains propagation of figural edge-assignment, emerges from both subjective reports and from an objective short-term edge-matching task. It generalizes from moving displays involving grouping by common fate and collinearity, to static displays with grouping by similarity of edge-contrast polarity, or apparent occlusion. Our results identify a new contextual influence upon edge-assignment. They also identify a new mechanistic relation between grouping and figure-ground processes, whereby grouping between remote elements can constrain propagation of edge-assignment between those elements. PMID:20436200

  4. Job Assignments under Moral Hazard

    DEFF Research Database (Denmark)

    Koch, Alexander; Nafziger, Julia

    Inefficient job assignments are usually explained with incomplete information about employees' abilities or contractual imperfections. We show that inefficient assignments arise even without uncertainty about the employee's ability and with complete contracts. Building on this result we provide a...

  5. Interactive Assignments for Online Students

    Directory of Open Access Journals (Sweden)

    Pam Lowry

    2009-04-01

    Full Text Available Students can experience first hand through interactive assignments what is involved in teaching an online course. Most students develop a whole new appreciation for the student learning process. Faculty are beginning to realize that online instruction is more than a series of readings posted to a course management system. This paper summarizes the faculty member's instructional strategies involved when creating student interaction assignments. The paper also summarizes the assignments, discussion board, and trends in education from the student's perspective. In summary, it concludes with the faculty's overall perspective concerning these assignments and how the assignments could be more effective for the student.

  6. Explicit pattern matching assignment algorithm

    Science.gov (United States)

    Levedahl, Mark

    2002-08-01

    Sharing data between two tracking systems frequently involves use of an object map: the transmitting system sends a frame of data with multiple observations, and the receiving system uses an assignment algorithm to correlate the information with its local observation data base. The usual prescription for this problem is an optimal assignment algorithm (such as JVC or auction) using a cost matrix based upon chi-squared distances between the local and remote observation data. The optimal assignment algorithm does not actually perform pattern matching, so this approach is not robust to large registration errors between the two systems when there exist differences in the number of observations held by both systems. Performance of a new assignment algorithm that uses a cost function including terms for both registration errors and track to track random errors is presented: the cost function explicitly includes a bias between the two observation sets and thus provides a maximum likelihood solution to the assignment problem. In practice, this assignment approach provides near perfect assignment accuracy in cases where the bias errors exceed the dimension of the transmitted object map and there exist mismatches in the numbers of observations made by the two systems. This performance extends to many cases where the optimal assignment algorithm methodology produces errors nearly 100% of the time. The paper includes the theoretical foundation of the assignment problem solved and comparison of achieved accuracy with existing optimal assignment approaches.

  7. The bicriterion multimodal assignment problem

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan

    2008-01-01

    We consider the bicriterion multimodal assignment problem, which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points...... or an approximation. Extensive computational results are conducted on a large library of test instances to test the performance of the algorithm and to identify hard test instances. Also, test results of the algorithm applied to the bicriterion assignment problem are provided....

  8. Optimizing Marine Security Guard Assignments

    Science.gov (United States)

    2011-06-01

    Bangkok , Thailand East Asia and Pacific 18 4 Fort Lauderdale, Florida Western Hemisphere - South 13 5 Frankfurt, Germany Western Europe and Scandinavia 15...2008). Each 7 stationing plan satisfies a myriad of unit requirements, such as building and land availability. Similarly, each assignment solution...optimize the assignment of enlisted Marines to billets. EAM-GLOBAL seeks to assign the best Marine-billet fit while balancing staffing shortages

  9. Balanced input-output assignment

    Science.gov (United States)

    Gawronski, W.; Hadaegh, F. Y.

    1989-01-01

    Actuator/sensor locations and balanced representations of linear systems are considered for a given set of controllability and observability grammians. The case of equally controlled and observed states is given special attention. The assignability of grammians is examined, and the conditions for their existence are presented, along with several algorithms for their determination. Although an arbitrary positive semidefinite matrix is not always assignable, the identity grammian is shown to be always assignable. The results are extended to the case of flexible structures.

  10. Why the Rhetoric of CS Programming Assignments Matters

    Science.gov (United States)

    Wolfe, Joanna

    2004-06-01

    Despite the multiple potential benefits of asking students working on programming tasks to consider human factors, most programming assignments narrowly focus on technical details and requirements. Female students in particular may be attracted to assignments that emphasize human as well as technical factors. To assess how students respond to changes in the rhetorical presentation of programming instructions, 81 students completed questionnaires evaluating different assignment instructions. Students generally perceived assignments emphasizing real-world contexts and users as more motivating and enjoyable to program than those that did not emphasize human factors. Moreover, when asked what makes a "good" programming assignment, over half of the students volunteered that they looked for assignments stressing a real-world purpose, use or application.

  11. Assigning agents to a line

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Østerdal, Lars Peter Raahave

    2014-01-01

    We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and assigned...

  12. A new algorithm for reliable and general NMR resonance assignment.

    Science.gov (United States)

    Schmidt, Elena; Güntert, Peter

    2012-08-01

    The new FLYA automated resonance assignment algorithm determines NMR chemical shift assignments on the basis of peak lists from any combination of multidimensional through-bond or through-space NMR experiments for proteins. Backbone and side-chain assignments can be determined. All experimental data are used simultaneously, thereby exploiting optimally the redundancy present in the input peak lists and circumventing potential pitfalls of assignment strategies in which results obtained in a given step remain fixed input data for subsequent steps. Instead of prescribing a specific assignment strategy, the FLYA resonance assignment algorithm requires only experimental peak lists and the primary structure of the protein, from which the peaks expected in a given spectrum can be generated by applying a set of rules, defined in a straightforward way by specifying through-bond or through-space magnetization transfer pathways. The algorithm determines the resonance assignment by finding an optimal mapping between the set of expected peaks that are assigned by definition but have unknown positions and the set of measured peaks in the input peak lists that are initially unassigned but have a known position in the spectrum. Using peak lists obtained by purely automated peak picking from the experimental spectra of three proteins, FLYA assigned correctly 96-99% of the backbone and 90-91% of all resonances that could be assigned manually. Systematic studies quantified the impact of various factors on the assignment accuracy, namely the extent of missing real peaks and the amount of additional artifact peaks in the input peak lists, as well as the accuracy of the peak positions. Comparing the resonance assignments from FLYA with those obtained from two other existing algorithms showed that using identical experimental input data these other algorithms yielded significantly (40-142%) more erroneous assignments than FLYA. The FLYA resonance assignment algorithm thus has the

  13. A Statistical Programme Assignment Model

    DEFF Research Database (Denmark)

    Rosholm, Michael; Staghøj, Jonas; Svarer, Michael

    assignment  mechanism, which is based on the discretionary choice of case workers. This is done in a duration model context, using the timing-of-events framework to identify causal effects. We compare different assignment  mechanisms, and the results suggest that a significant reduction in the average...... duration of unemployment spells may result if a statistical programme assignment model is introduced. We discuss several issues regarding the  plementation of such a system, especially the interplay between the statistical model and  case workers....

  14. Assigning cause for sudden unexpected infant death.

    Science.gov (United States)

    Hunt, Carl E; Darnall, Robert A; McEntire, Betty L; Hyma, Bruce A

    2015-06-01

    We have reached a conundrum in assigning cause of death for sudden unexpected infant deaths. We summarize the discordant perspectives and approaches and how they have occurred, and recommend a pathway toward improved consistency. This lack of consistency affects pediatricians and other health care professionals, scientific investigators, medical examiners and coroners, law enforcement agencies, families, and support or advocacy groups. We recommend that an interdisciplinary international committee be organized to review current approaches for assigning cause of death, and to identify a consensus strategy for improving consistency. This effort will need to encompass intrinsic risk factors or infant vulnerability in addition to known environmental risk factors including unsafe sleep settings, and must be sufficiently flexible to accommodate a progressively expanding knowledge base.

  15. The Art of Probability Assignment

    CERN Document Server

    Dimitrov, Vesselin I

    2012-01-01

    The problem of assigning probabilities when little is known is analized in the case where the quanities of interest are physical observables, i.e. can be measured and their values expressed by numbers. It is pointed out that the assignment of probabilities based on observation is a process of inference, involving the use of Bayes' theorem and the choice of a probability prior. When a lot of data is available, the resulting probability are remarkable insensitive to the form of the prior. In the oposite case of scarse data, it is suggested that the probabilities are assigned such that they are the least sensitive to specific variations of the probability prior. In the continuous case this results in a probability assignment rule wich calls for minimizing the Fisher information subject to constraints reflecting all available information. In the discrete case, the corresponding quantity to be minimized turns out to be a Renyi distance between the original and the shifted distribution.

  16. Job assignment with multivariate skills

    OpenAIRE

    Brilon, Stefanie

    2010-01-01

    This paper analyzes the job assignment problem faced by a firm when workers’ skills are distributed along several dimensions and jobs require different skills to varying extent. I derive optimal assignment rules with and without slot constraints, and show that under certain circumstances workers may get promoted although in their new job they are expected to be less productive than in their old job. This can be interpreted as a version of the Peter Principle which states that workers get prom...

  17. Ant Colony Algorithm and Simulation for Robust Airport Gate Assignment

    Directory of Open Access Journals (Sweden)

    Hui Zhao

    2014-01-01

    Full Text Available Airport gate assignment is core task for airport ground operations. Due to the fact that the departure and arrival time of flights may be influenced by many random factors, the airport gate assignment scheme may encounter gate conflict and many other problems. This paper aims at finding a robust solution for airport gate assignment problem. A mixed integer model is proposed to formulate the problem, and colony algorithm is designed to solve this model. Simulation result shows that, in consideration of robustness, the ability of antidisturbance for airport gate assignment scheme has much improved.

  18. A Statistical Programme Assignment Model

    DEFF Research Database (Denmark)

    Rosholm, Michael; Staghøj, Jonas; Svarer, Michael

    When treatment effects of active labour market programmes are heterogeneous in an observable way  across the population, the allocation of the unemployed into different programmes becomes a particularly  important issue. In this paper, we present a statistical model designed to improve the present...... assignment  mechanism, which is based on the discretionary choice of case workers. This is done in a duration model context, using the timing-of-events framework to identify causal effects. We compare different assignment  mechanisms, and the results suggest that a significant reduction in the average...... duration of unemployment spells may result if a statistical programme assignment model is introduced. We discuss several issues regarding the  plementation of such a system, especially the interplay between the statistical model and  case workers....

  19. AC410 Unit 9 Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

     AC410 Unit 9 Assignment Click Link Below To Buy: http://hwcampus.com/shop/ac410-unit-9-assignment/   18–29. The CPA firm of Carson & Boggs LLP is performing an internal control audit in accordance with PCAOB Standard No. 5. The partner in charge of the engagement has asked you to explain the process of determining which controls to test. Describe the process, presenting each of the links in this process and a short summary of how the auditors approach each of them. v ...

  20. 7 CFR 760.31 - Assignment.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 7 2010-01-01 2010-01-01 false Assignment. 760.31 Section 760.31 Agriculture... Assignment. No assignment shall be made of any indemnity payment due or to come due under the regulations in this subpart. Any assignment or attempted assignment of any indemnity payment due or to come due under...

  1. Who Benefits from Homework Assignments?

    Science.gov (United States)

    Ronning, Marte

    2011-01-01

    Using Dutch data on pupils in elementary school this paper is the first empirical study to analyze whether assigning homework has a heterogeneous impact on pupil achievement. Addressing potential biases by using a difference-in-difference approach, I find that the test score gap is larger in classes where everybody gets homework than in classes…

  2. Assessing Contributions to Group Assignments

    Science.gov (United States)

    Johnston, Lucy; Miles, Lynden

    2004-01-01

    We report the use of a combination of self- and peer-assessment in an undergraduate social psychology laboratory course. Students worked in small groups on a self-directed empirical project that they each wrote up independently as a laboratory report. Marks for the written assignment were moderated by a contribution index measure based on the…

  3. File Assignment Policy in Network Storage System

    Institute of Scientific and Technical Information of China (English)

    CaoQiang; XieChang-sheng

    2003-01-01

    Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however,mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data place ment in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.

  4. File Assignment Policy in Network Storage System

    Institute of Scientific and Technical Information of China (English)

    Cao Qiang; Xie Chang-sheng

    2003-01-01

    Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however, mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data placement in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.

  5. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

  6. Colony location algorithm for assignment problems

    Institute of Scientific and Technical Information of China (English)

    Dingwei WANG

    2004-01-01

    A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic conmunity that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates, environment evaluation and fertilization strategy.CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.

  7. CONTRACT ASSIGNMENT – THEORETICAL ASPECTS

    Directory of Open Access Journals (Sweden)

    Bogdan NAZAT

    2016-12-01

    Full Text Available This project aims to study in detail the theoretical aspects concerning the contract assignment, as provided by the relevant regulation, and the doctrine corresponding to old and current regulations. In this respect, this project aims to give the reader a comprehensive look on the institution in question, the regulation offered by the current Civil Code is reviewed taking into account the national and international doctrine.

  8. 47 CFR 74.802 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.802 Section 74.802... Frequency assignment. (a) Frequencies within the following bands may be assigned for use by low power... exceed 200 kHz. (d) Low power auxiliary licensees will not be granted exclusive frequency assignments. (e...

  9. 47 CFR 74.602 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.602 Section 74.602... Stations § 74.602 Frequency assignment. (a) The following frequencies are available for assignment to... 2450 and 2500 MHz are also shared with other communication services and exclusive channel assignments...

  10. 5 CFR 351.705 - Administrative assignment.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Administrative assignment. 351.705... REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.705 Administrative assignment. (a) An agency... cannot make an equally reasonable assignment by displacing an employee in a lower subgroup; (2) Permit an...

  11. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan

    2008-01-01

    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...... technique. Computational results for the new algorithm are presented...

  12. A note on ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, L.R.; Andersen, K.A.

    2005-01-01

    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...

  13. Localized Algorithm for Channel Assignment in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Harpreet Kaur

    2015-12-01

    Full Text Available Cognitive Radio has been emerged as a revolutionary solution to migrate the current shortage of spectrum allocation in wireless networks. In this paper, an improved localized channel allocation algorithm based on channel weight is proposed. A factor of channel stability is introduced based on link environment, which efficiently assigns the best channels to the links. Based on the framework, a conflict resolution strategy is used to make the scheme adaptable to different network conditions. Calculations indicate that this algorithm can reduce the conflicts, increase the delivery rate and link assignment rate compared with the basic channel assignment algorithm.

  14. Analysis of transfer reactions: determination of spectroscopic factors

    Energy Technology Data Exchange (ETDEWEB)

    Keeley, N. [CEA Saclay, Dept. d' Astrophysique, de Physique des Particules de Physique Nucleaire et de l' Instrumentation Associee (DSM/DAPNIA/SPhN), 91- Gif sur Yvette (France); The Andrzej So an Institute for Nuclear Studies, Dept. of Nuclear Reactions, Warsaw (Poland)

    2007-07-01

    An overview of the most popular models used for the analysis of direct reaction data is given, concentrating on practical aspects. The 4 following models (in order of increasing sophistication): the distorted wave born approximation (DWBA), the adiabatic model, the coupled channels born approximation, and the coupled reaction channels are briefly described. As a concrete example, the C{sup 12}(d,p)C{sup 13} reaction at an incident deuteron energy of 30 MeV is analysed with progressively more physically sophisticated models. The effect of the choice of the reaction model on the spectroscopic information extracted from the data is investigated and other sources of uncertainty in the derived spectroscopic factors are discussed. We have showed that the choice of the reaction model can significantly influence the nuclear structure information, particularly the spectroscopic factors or amplitudes but occasionally also the spin-parity, that we wish to extract from direct reaction data. We have also demonstrated that the DWBA can fail to give a satisfactory description of transfer data but when the tenets of the theory are fulfilled DWBA can work very well and will yield the same results as most sophisticated models. The use of global rather than fitted optical potentials can also lead to important differences in the extracted spectroscopic factors.

  15. Gender Differences in the Determinants of the Willingness to Accept an International Assignment

    Science.gov (United States)

    van der Velde, Mandy E. G.; Bossink, Carin J. H.; Jansen, Paul G. W.

    2005-01-01

    Multinational organisations experience difficulties in finding managers willing to accept international assignments. This study has therefore focused on factors that can predict males' and females' willingness to accept international assignments, or to follow their partners on international assignments. Hypotheses were formulated based on the…

  16. The Random Quadratic Assignment Problem

    Science.gov (United States)

    Paul, Gerald; Shao, Jia; Stanley, H. Eugene

    2011-11-01

    The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P. Surprisingly, the QAP has not been studied before using the replica method despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for C min and C max , the costs of the minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for C min and C max and their dependence on P only through its mean and standard deviation, independent of the details of P.

  17. More General Optimal Offset Assignment

    Directory of Open Access Journals (Sweden)

    Sven Mallach

    2015-06-01

    Full Text Available This manuscript presents exact approaches to the general offset assignment problem arising in the address code generation phase of compilers for application-specific processors. First, integer programming models for architecture-dependent and theoretically motivated special cases of the problem are established. Then, these models are extended to provide the first widely applicable formulations for the most general problem setting, supporting processors with several address registers and complex addressing capabilities. Existing heuristics are similarly extended and practical applicability of the proposed methods is demonstrated by experimental evaluation using an established and large benchmark set. The experiments allow us to study the impact of exploiting more complex memory addressing capabilities on the address computation costs of real-world programs. We also show how to integrate operand reordering techniques for commutative instructions into existing solution approaches.

  18. Assignment Choice, Effort, and Assignment Completion: Does Work Ethic Predict Those Who Choose Higher-Effort Assignments?

    Science.gov (United States)

    Parkhurst, John T.; Fleisher, Matthew S.; Skinner, Christopher H.; Woehr, David J.; Hawthorn-Embree, Meredith L.

    2011-01-01

    After completing the Multidimensional Work-Ethic Profile (MWEP), 98 college students were given a 20-problem math computation assignment and instructed to stop working on the assignment after completing 10 problems. Next, they were allowed to choose to finish either the partially completed assignment that had 10 problems remaining or a new…

  19. Assignment Choice, Effort, and Assignment Completion: Does Work Ethic Predict Those Who Choose Higher-Effort Assignments?

    Science.gov (United States)

    Parkhurst, John T.; Fleisher, Matthew S.; Skinner, Christopher H.; Woehr, David J.; Hawthorn-Embree, Meredith L.

    2011-01-01

    After completing the Multidimensional Work-Ethic Profile (MWEP), 98 college students were given a 20-problem math computation assignment and instructed to stop working on the assignment after completing 10 problems. Next, they were allowed to choose to finish either the partially completed assignment that had 10 problems remaining or a new…

  20. Managing voluntary turnover through challenging assignments

    NARCIS (Netherlands)

    Preenen, P.T.Y.; Pater, I.E. de; Vianen, A.E.M. van; Keijzer, L.

    2011-01-01

    This study examines employees' challenging assignments as manageable means to reduce turnover intentions, job search behaviors, and voluntary turnover. Results indicate that challenging assignments are negatively related to turnover intentions and job search behaviors and that these relationships

  1. 24 CFR 221.255 - Assignment option.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment option. 221.255 Section... Assignment option. (a) A mortgagee holding a mortgage insured pursuant to a conditional or firm commitment..., directly to the Government National Mortgage Association (GNMA). Upon such assignment, transfer and...

  2. 47 CFR 74.502 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.502 Section 74.502... § 74.502 Frequency assignment. (a) Except as provided in NG30, broadcast auxiliary stations licensed as... Allocations. (b) The frequency band 944-952 MHz is available for assignment to aural STL and ICR stations. One...

  3. 7 CFR 1488.17 - Assignment.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Assignment. 1488.17 Section 1488.17 Agriculture Regulations of the Department of Agriculture (Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF...) Miscellaneous Provisions § 1488.17 Assignment. The exporter shall not assign any claim or rights or any amounts...

  4. 24 CFR 221.770 - Assignment option.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment option. 221.770 Section... § 221.770 Assignment option. A mortgagee holding a conditional or firm commitment issued on or before... securing it, directly to the Government National Mortgage Association (GNMA). Upon such assignment...

  5. 33 CFR 20.201 - Assignment.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Assignment. 20.201 Section 20.201 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY GENERAL RULES OF PRACTICE... § 20.201 Assignment. An ALJ, assigned by the Chief ALJ after receipt of the complaint, shall preside...

  6. 25 CFR 215.20 - Assignment.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Assignment. 215.20 Section 215.20 Indians BUREAU OF..., QUAPAW AGENCY § 215.20 Assignment. Leases granted or approved under the regulations in this part may be... Secretary of the Interior and subject to his approval as to the terms and conditions of such assignments...

  7. 42 CFR 414.918 - Assignment.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 3 2010-10-01 2010-10-01 false Assignment. 414.918 Section 414.918 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICARE... B § 414.918 Assignment. Payment for a CAP drug may be made only on an assignment-related basis. ...

  8. 7 CFR 247.21 - Caseload assignment.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 4 2010-01-01 2010-01-01 false Caseload assignment. 247.21 Section 247.21 Agriculture... CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.21 Caseload assignment. (a) How does... assignment of additional caseload are determined in the following manner: (i) A State agency entering its...

  9. 47 CFR 74.402 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.402 Section 74.402....402 Frequency assignment. Operation on all channels listed in this section (except: frequencies 26.07... channels are stacked in those sections stacking is permitted, channel assignments may be made for the...

  10. Competition Based Neural Networks for Assignment Problems

    Institute of Scientific and Technical Information of China (English)

    李涛; LuyuanFang

    1991-01-01

    Competition based neural networks have been used to solve the generalized assignment problem and the quadratic assignment problem.Both problems are very difficult and are ε approximation complete.The neural network approach has yielded highly competitive performance and good performance for the quadratic assignment problem.These neural networks are guaranteed to produce feasible solutions.

  11. A polyhedral approach to quadratic assignment problem

    OpenAIRE

    Köksaldı, Ahmet Sertaç Murat

    1994-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references. In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of solutions to Quadratic Assignment Problems has been limited to instances of small dimension. In...

  12. 7 CFR 1437.104 - Assigned production.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Assigned production. 1437.104 Section 1437.104... Determining Yield Coverage Using Actual Production History § 1437.104 Assigned production. (a) When determining losses under this section, assigned production will be used to offset the loss of production when...

  13. 5 CFR 870.901 - Assignments permitted.

    Science.gov (United States)

    2010-01-01

    ... (CONTINUED) FEDERAL EMPLOYEES' GROUP LIFE INSURANCE PROGRAM Assignments of Life Insurance § 870.901..., and compensationers. (2) An individual may assign ownership of all life insurance under this part... Benefit before assigning the remainder of his/her insurance, the amount of Basic insurance does...

  14. The Mechanism Design Approach to Student Assignment

    Science.gov (United States)

    Pathak, Parag A.

    2011-01-01

    The mechanism design approach to student assignment involves the theoretical, empirical, and experimental study of systems used to allocate students into schools around the world. Recent practical experience designing systems for student assignment has raised new theoretical questions for the theory of matching and assignment. This article reviews…

  15. Integrated assignment and path planning

    Science.gov (United States)

    Murphey, Robert A.

    2005-11-01

    A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact

  16. Automatic Assessment of Programming assignment

    Directory of Open Access Journals (Sweden)

    Surendra Gupta

    2012-01-01

    Full Text Available In today’s world study of computer’s language is more important. Effective and good programming skills are need full all computer science students. They can be master in programming, only through intensive exercise practices. Due to day by day increasing number of students in the class, the assessment of programming exercises leads to extensive workload for teacher/instructor, particularly if it has to be carried out manually. In this paper, we propose an automatic assessment system for programming assignments, using verification program with random inputs. One of the most important properties of a program is that, it carries out its intended function. The intended function of a program or part of a program can be verified by using inverse function’s verification program. For checking intended functionality and evaluation of a program, we have used verification program. This assessment system has been tested on basic C programming courses, and results shows that it can work well in basic programming exercises, with some initial promising results

  17. Discovery of a 6/sup -/, T=1 resonance in /sup 24/Mg via high-resolution inelastic electron scattering

    Energy Technology Data Exchange (ETDEWEB)

    Zarek, H.; Pich, B.O.; Drake, T.E.; Rowe, D.J.; Bertozzi, W.; Creswell, C.; Hirsch, A.; Hynes, M.V.; Kowalski, S.; Norum, B.; Rad, F.N.; Sargent, C.P.; Williamson, C.F.; Lindgren, R.A.

    1977-04-04

    The unique high-resolution and high-energy features of the electron-scattering facility at the MIT-Bates Accelerator were used to locate a dominant narrow resonance at 15.045 +- 0.035 MeV in /sup 24/Mg. A spin-parity assignment of 6/sup -/ and an isospin T=1 assignment were made. The M6 form factor was measured and compared to the prediction of a theoretical calculation which uses the open-shell random-phase approximation on a shell-model ground state for /sup 24/Mg.

  18. Stereospecific assignments in proteins using exact NOEs

    Energy Technology Data Exchange (ETDEWEB)

    Orts, Julien; Vögeli, Beat; Riek, Roland, E-mail: roland.riek@phys.chem.ethz.ch [Swiss Federal Institute of Technology, Laboratory of Physical Chemistry (Switzerland); Güntert, Peter, E-mail: guentert@em.uni-frankfurt.de [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany)

    2013-10-18

    Recently developed methods to measure distances in proteins with high accuracy by “exact” nuclear Overhauser effects (eNOEs) make it possible to determine stereospecific assignments, which are particularly important to fully exploit the accuracy of the eNOE distance measurements. Stereospecific assignments are determined by comparing the eNOE-derived distances to protein structure bundles calculated without stereospecific assignments, or an independently determined crystal structure. The absolute and relative CYANA target function difference upon swapping the stereospecific assignment of a diastereotopic group yields the respective stereospecific assignment. We applied the method to the eNOE data set that has recently been obtained for the third immunoglobulin-binding domain of protein G (GB3). The 884 eNOEs provide relevant data for 47 of the total of 75 diastereotopic groups. Stereospecific assignments could be established for 45 diastereotopic groups (96 %) using the X-ray structure, or for 27 diastereotopic groups (57 %) using structures calculated with the eNOE data set without stereospecific assignments, all of which are in agreement with those determined previously. The latter case is relevant for structure determinations based on eNOEs. The accuracy of the eNOE distance measurements is crucial for making stereospecific assignments because applying the same method to the traditional NOE data set for GB3 with imprecise upper distance bounds yields only 13 correct stereospecific assignments using the X-ray structure or 2 correct stereospecific assignments using NMR structures calculated without stereospecific assignments.

  19. An Investigation of the Partial-Assignment Completion Effect on Students' Assignment Choice Behavior

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; Conley, Elisha

    2011-01-01

    This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment…

  20. An Investigation of the Partial-Assignment Completion Effect on Students' Assignment Choice Behavior

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; Conley, Elisha

    2011-01-01

    This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment…

  1. Organisational Socialisation Facilitates Overseas Assignment

    Directory of Open Access Journals (Sweden)

    Pei-Chen (Chiu-Yi/Joy Lee

    2014-09-01

    Full Text Available Cross-cultural adjustment is the biggest challenge that derails expatriate success. In responding to the importance of Taiwanese expatriates’ adjustment in Mainland China, this study tests, as a critical factor, Socialisation affecting the adjustment of Taiwanese expatriates in Mainland China. As a result, this study critically reviews previous studies on expatriate success, shedding light on key factors in the area of expatriate adjustment and providing multiple guidelines for human resource supervisors and senior executives hoping to ensure expatriate success. The definitions of success and methodological approaches are discussed, and suggestions for improving empirical research in this area are presented. Academic researchers and international enterprises can perhaps clarify whether all international expatriates are affected by the factor as organisational socialisation, and also whether the proposed model can be utilised in studying expatriates in different professional areas from those of this study. Finally, the results and their implications for research and the business world are discussed. This may assist not only Taiwanese MNCs but also global enterprises to perform their international business more efficiently in Mainland China.

  2. Job assignments, intrinsic motivation and explicit incentives

    OpenAIRE

    Nafziger, Julia

    2008-01-01

    This paper considers the interplay of job assignments with the intrinsic and extrinsic motivation of an agent. Job assignments influence the self confidence of the agent, and thereby his intrinsic motivation. Monetary reward allow the principal to complement intrinsic motivation with extrinsic incentives. The main result is that the principal chooses an inefficient job assignment rule to enhance the agent's intrinsic motivation even though she can motivate him with monetary rewards. This show...

  3. NASN position statement: caseload assignments.

    Science.gov (United States)

    Durant, Bonnie V; Gibbons, Linda J; Poole, Cynthia; Suessmanm, Mary; Wyckoff, Leah

    2011-01-01

    It is the position of the National Association of School Nurses (NASN) that schools should employ professionally prepared Registered Nurses, to conduct and supervise school health programs which address the variety of health problems experienced by school children. NASN recommends a formula-based approach with minimum ratios of nurses-to-students depending on the needs of the student populations as follows: 1:750 for students in the general population, 1:225 in the student populations requiring daily professional school nursing services or interventions, 1:125 in student populations with complex health care needs, and 1:1 may be necessary for individual students who require daily and continuous professional nursing services. Other factors that should be considered in the formula-based approach are number of students on free or reduced lunch, number of students with a medical home, and average number of emergency services per year.

  4. 47 CFR 74.103 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.103 Section 74.103 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO....103 Frequency assignment. (a) Frequencies allocated to broadcasting and the various categories of...

  5. 10 CFR 725.26 - Assignment.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 4 2010-01-01 2010-01-01 false Assignment. 725.26 Section 725.26 Energy DEPARTMENT OF ENERGY PERMITS FOR ACCESS TO RESTRICTED DATA Permits § 725.26 Assignment. An access permit is nontransferable and nonassignable. ...

  6. 47 CFR 80.509 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Frequency assignment. 80.509 Section 80.509 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.509 Frequency assignment...

  7. Assignment procedure biases in randomized policy experiments

    DEFF Research Database (Denmark)

    Aldashev, Gani; Kirchsteiger, Georg; Sebald, Alexander Christopher

    2017-01-01

    ’s propensity to act reciprocally. When people are motivated by reciprocity, the choice of assignment procedure influences the RCTs’ findings. We show that even credible and explicit randomization procedures do not guarantee an unbiased prediction of the impact of policy interventions; however, they minimize...... any bias relative to other less transparent assignment procedures....

  8. 47 CFR 80.511 - Assignment limitations.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Assignment limitations. 80.511 Section 80.511 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.511 Assignment limitations. (a...

  9. 47 CFR 74.1202 - Frequency assignment.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.1202 Section 74.1202 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast...

  10. 48 CFR 208.7002 - Assignment authority.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignment authority. 208..., DEPARTMENT OF DEFENSE ACQUISITION PLANNING REQUIRED SOURCES OF SUPPLIES AND SERVICES Coordinated Acquisition 208.7002 Assignment authority. (a) Under the DoD Coordinated Acquisition Program,...

  11. On the Bicriterion Multi Modal Assignment Problem

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, L.R.; Andersen, K.A.

    2005-01-01

    We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points...

  12. Detecting Plagiarism in MS Access Assignments

    Science.gov (United States)

    Singh, Anil

    2013-01-01

    Assurance of individual effort from students in computer-based assignments is a challenge. Due to digitization, students can easily use a copy of their friend's work and submit it as their own. Plagiarism in assignments puts students who cheat at par with those who work honestly and this compromises the learning evaluation process. Using a…

  13. 7 CFR 601.1 - Functions assigned.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Functions assigned. 601.1 Section 601.1 Agriculture... AGRICULTURE GENERAL FUNCTIONS § 601.1 Functions assigned. The Natural Resources Conservation Service (NRCS) is... conserve, improve, and sustain natural resources. The following functions support the mission. (a)...

  14. Stress Assignment in Reading Italian Polysyllabic Pseudowords

    Science.gov (United States)

    Sulpizio, Simone; Arduino, Lisa S.; Paizi, Despina; Burani, Cristina

    2013-01-01

    In 4 naming experiments we investigated how Italian readers assign stress to pseudowords. We assessed whether participants assign stress following distributional information such as stress neighborhood (the proportion and number of existent words sharing orthographic ending and stress pattern) and whether such distributional information affects…

  15. Maximizing Completion and Comprehension of Reading Assignments

    Science.gov (United States)

    Owen, Leanne R.

    The author presents self-report data from students in three upper-level undergraduate courses to illustrate the comparative effectiveness of different out-of-class assessment approaches in promoting completion and comprehension of reading assignments. Students reported agreeing or strongly agreeing that all three assignments motivated them to…

  16. Effects of Individualized Assignments on Biology Achievement.

    Science.gov (United States)

    Kremer, Philip L.

    1983-01-01

    Compared detailed (favoring field dependence and induction) and nondetailed (favoring field dependence and deduction) assignments on biology achievement of grade 10 male students (N=95) over a seven-month period. Detailed assignments, employing pictorial and verbal block diagrams and high structure, significantly enhanced learning among some…

  17. A Role-Based Fuzzy Assignment Model

    Institute of Scientific and Technical Information of China (English)

    ZUO Bao-he; FENG Shan

    2002-01-01

    It's very important to dynamically assign the tasks to corresponding actors in workflow management system, especially in complex applications. This improves the flexibility of workflow systems.In this paper, a role-based workflow model with fuzzy optimized intelligent assignment is proposed and applied in the investment management system. A groupware-based software model is also proposed.

  18. 33 CFR 401.61 - Assigned frequencies.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel...

  19. Optimization of Rated Officer Staff Assignments

    Science.gov (United States)

    2007-06-01

    determinant +1, -1 or 0, which holds for the assignment problem ( Bazaraa et al., 1990). The Unimodularity Theorem states for an integer matrix A with...Prentice-Hall, 1993. 2. Air Force Instruction 36-2110, Assignments, 20 April 2005. 3. Bazaraa , Mokhtar S., Jarvis, John J. and Sherali, Hanif D

  20. Online Discussion Assignments Improve Students' Class Preparation

    Science.gov (United States)

    Lineweaver, Tara T.

    2010-01-01

    To increase the number of students who read the text before class and to promote student interaction centering on text material, I developed an online discussion assignment as a required component of a cognitive psychology course. Across 2 studies, this assignment had a limited effect on examination performance, but students completing online…

  1. Stress Assignment in Reading Italian Polysyllabic Pseudowords

    Science.gov (United States)

    Sulpizio, Simone; Arduino, Lisa S.; Paizi, Despina; Burani, Cristina

    2013-01-01

    In 4 naming experiments we investigated how Italian readers assign stress to pseudowords. We assessed whether participants assign stress following distributional information such as stress neighborhood (the proportion and number of existent words sharing orthographic ending and stress pattern) and whether such distributional information affects…

  2. A Model of Hierarchical Key Assignment Scheme

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhigang; ZHAO Jing; XU Maozhi

    2006-01-01

    A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.

  3. Detecting Plagiarism in MS Access Assignments

    Science.gov (United States)

    Singh, Anil

    2013-01-01

    Assurance of individual effort from students in computer-based assignments is a challenge. Due to digitization, students can easily use a copy of their friend's work and submit it as their own. Plagiarism in assignments puts students who cheat at par with those who work honestly and this compromises the learning evaluation process. Using a…

  4. Discriminant Kernel Assignment for Image Coding.

    Science.gov (United States)

    Deng, Yue; Zhao, Yanyu; Ren, Zhiquan; Kong, Youyong; Bao, Feng; Dai, Qionghai

    2017-06-01

    This paper proposes discriminant kernel assignment (DKA) in the bag-of-features framework for image representation. DKA slightly modifies existing kernel assignment to learn width-variant Gaussian kernel functions to perform discriminant local feature assignment. When directly applying gradient-descent method to solve DKA, the optimization may contain multiple time-consuming reassignment implementations in iterations. Accordingly, we introduce a more practical way to locally linearize the DKA objective and the difficult task is cast as a sequence of easier ones. Since DKA only focuses on the feature assignment part, it seamlessly collaborates with other discriminative learning approaches, e.g., discriminant dictionary learning or multiple kernel learning, for even better performances. Experimental evaluations on multiple benchmark datasets verify that DKA outperforms other image assignment approaches and exhibits significant efficiency in feature coding.

  5. Airport Gate Assignment: New Model and Implementation

    CERN Document Server

    Li, Chendong

    2008-01-01

    Airport gate assignment is of great importance in airport operations. In this paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model and implement the model with Optimization Programming language (OPL). With the objective to minimize the number of conflicts of any two adjacent aircrafts assigned to the same gate, we build a mathematical model with logical constraints and the binary constraints, which can provide an efficient evaluation criterion for the Airlines to estimate the current gate assignment. To illustrate the feasibility of the model we construct experiments with the data obtained from Continental Airlines, Houston Gorge Bush Intercontinental Airport IAH, which indicate that our model is both energetic and effective. Moreover, we interpret experimental results, which further demonstrate that our proposed model can provide a powerful tool for airline companies to estimate the efficiency of their current work of gate assignment.

  6. Socially-assigned race, healthcare discrimination and preventive healthcare services.

    Directory of Open Access Journals (Sweden)

    Tracy Macintosh

    Full Text Available BACKGROUND: Race and ethnicity, typically defined as how individuals self-identify, are complex social constructs. Self-identified racial/ethnic minorities are less likely to receive preventive care and more likely to report healthcare discrimination than self-identified non-Hispanic whites. However, beyond self-identification, these outcomes may vary depending on whether racial/ethnic minorities are perceived by others as being minority or white; this perception is referred to as socially-assigned race. PURPOSE: To examine the associations between socially-assigned race and healthcare discrimination and receipt of selected preventive services. METHODS: Cross-sectional analysis of the 2004 Behavioral Risk Factor Surveillance System "Reactions to Race" module. Respondents from seven states and the District of Columbia were categorized into 3 groups, defined by a composite of self-identified race/socially-assigned race: Minority/Minority (M/M, n = 6,837, Minority/White (M/W, n = 929, and White/White (W/W, n = 25,913. Respondents were 18 years or older, with 61.7% under age 60; 51.8% of respondents were female. Measures included reported healthcare discrimination and receipt of vaccinations and cancer screenings. RESULTS: Racial/ethnic minorities who reported being socially-assigned as minority (M/M were more likely to report healthcare discrimination compared with those who reported being socially-assigned as white (M/W (8.9% vs. 5.0%, p = 0.002. Those reporting being socially-assigned as white (M/W and W/W had similar rates for past-year influenza (73.1% vs. 74.3% and pneumococcal (69.3% vs. 58.6% vaccinations; however, rates were significantly lower among M/M respondents (56.2% and 47.6%, respectively, p-values<0.05. There were no significant differences between the M/M and M/W groups in the receipt of cancer screenings. CONCLUSIONS: Racial/ethnic minorities who reported being socially-assigned as white are more likely to receive

  7. Work Term Assignment Spring 2017

    Science.gov (United States)

    Sico, Mallory

    2017-01-01

    My tour in the Engineering Robotics directorate exceeded my expectations. I learned lessons about Creo, manufacturing and assembly, collaboration, and troubleshooting. During my first tour, last spring, I used Creo on a smaller project, but had limited experience with it before starting in the Dynamic Systems Test branch this spring. I gained valuable experience learning assembly design, sheet metal design and designing with intent for manufacturing and assembly. These skills came from working both on the hatch and the floor. I also learned to understand the intent of other designers on models I worked with. While redesigning the floor, I was modifying an existing part and worked to understand what the previous designer had done to make it fit with the new model. Through working with the machine shop and in the mock-up, I learned much more about manufacturing and assembly. I used a Dremel, rivet gun, belt sander, and countersink for the first time. Through taking multiple safety training for different machine shops, I learned new machine shop safety skills specific to each one. This semester also gave me new collaborative opportunities. I collaborated with engineers within my branch as well as with Human Factors and the building 10 machine shop. This experience helped me learn how to design for functionality and assembly, not only for what would be easiest in my designs. In addition to these experiences, I learned many lessons in troubleshooting. I was the first person in my office to use a Windows 10 computer. This caused unexpected issues with NASA services and programs, such as the Digital Data Management Server (DDMS). Because of this, I gained experience finding solutions to lockout and freeze issues as well as Creo specific settings. These will be useful skills to have in the future and will be implemented in future rotations. This co-op tour has motivated me more to finish my degree and pursue my academic goals. I intend to take a machining Career Gateway

  8. Comparative Analysis of Existing Methods and Algorithms for Automatic Assignment of Reviewers to Papers

    CERN Document Server

    Kalmukov, Yordan

    2010-01-01

    The article focuses on the importance of the automatic assignment of reviewers to papers for increasing the assignment accuracy therefore the quality of the scientific event itself. It discusses the main aspects that influence the assignment accuracy, performs a detailed analysis of the methods of describing papers and reviewers' competences used by the existing conference management systems and suggests some improvements in the way the similarity factors are calculated.

  9. On the Bicriterion Multi Modal Assignment Problem

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, L.R.; Andersen, K.A.

    2005-01-01

    We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all nondominated criterion points...... or an approximation. Extensive computational results are conducted on a large library of test instances to test the performance of the algorithm and to identify hard test instances. Also, test results of the algorithm applied to the bicriterion assignment problem is given. Here our algorithm outperforms all...

  10. Protein secondary structure: category assignment and predictability

    DEFF Research Database (Denmark)

    Andersen, Claus A.; Bohr, Henrik; Brunak, Søren

    2001-01-01

    In the last decade, the prediction of protein secondary structure has been optimized using essentially one and the same assignment scheme known as DSSP. We present here a different scheme, which is more predictable. This scheme predicts directly the hydrogen bonds, which stabilize the secondary...... structures. Single sequence prediction of the new three category assignment gives an overall prediction improvement of 3.1% and 5.1%, compared to the DSSP assignment and schemes where the helix category consists of a-helix and 3(10)-helix, respectively. These results were achieved using a standard feed...

  11. Dynamic Assignment in Microsimulations of Pedestrians

    CERN Document Server

    Kretz, Tobias; Hofsäß, Ingmar; Leonhardt, Axel

    2014-01-01

    A generic method for dynamic assignment used with microsimulation of pedestrian dynamics is introduced. As pedestrians - unlike vehicles - do not move on a network, but on areas they in principle can choose among an infinite number of routes. To apply assignment algorithms one has to select for each OD pair a finite (realistically a small) number of relevant representatives from these routes. This geometric task is the main focus of this contribution. The main task is to find for an OD pair the relevant routes to be used with common assignment methods. The method is demonstrated for one single OD pair and exemplified with an example.

  12. The Assignment Game : The Reduced Game

    OpenAIRE

    Owen, Guillermo

    1992-01-01

    Let v be an assignment game. For a given reference payoff vector (x; y), and a coalition S, bargaining within the coalition can be represented by either the reduced game or the derived game. It is known that the reduced game need not be an assignment game (in fact, it need not be super additive) while the derived game is another assignment game, with modified reservation prices. We prove that, when the reference vector is in the core of the game, the derived game is the super additive cover o...

  13. The Assignment Game : The Reduced Game

    OpenAIRE

    Owen, Guillermo

    1992-01-01

    Let v be an assignment game. For a given reference payoff vector (x; y), and a coalition S, bargaining within the coalition can be represented by either the reduced game or the derived game. It is known that the reduced game need not be an assignment game (in fact, it need not be super additive) while the derived game is another assignment game, with modified reservation prices. We prove that, when the reference vector is in the core of the game, the derived game is the super additive cover o...

  14. Gender assignment for newborns with 46XY cloacal exstrophy: a 6-year followup survey of pediatric urologists.

    Science.gov (United States)

    Diamond, David A; Burns, Jeffrey P; Huang, Lin; Rosoklija, Ilina; Retik, Alan B

    2011-10-01

    Gender assignment for newborns with ambiguous genitalia remains a challenge. An initial survey of colleagues on this subject was performed in 2004. Our objective was to understand the basis for the attitudes and practices of pediatric urologists in regard to gender assignment for 46XY cloacal exstrophy in a 6-year followup survey. A survey on a case of 46XY cloacal exstrophy was completed by 191 of the 263 fellows (73%) in the Urology Section, American Academy of Pediatrics. Questions referred to gender assignment, surgery timing, clinical outcomes and respondent demographics. Of the fellows 79% favored male gender assignment. The most important factor in male assignment remained androgen brain imprinting (97%) while in female assignment it was surgical success in creating functional genitalia (96%). Respondent characteristics associated with assigning female gender were longer practice duration (greater than 15 years) (p assigned (p assignment earlier in the career to male assignment currently (p assignment for 46XY cloacal exstrophy, which is a significant increase in 6 years. This change represents an evolution from female to male gender assignment and virtual unanimity among fellowship directors to gender assign male. Longer practicing clinicians perceived better outcomes for female gender assignment. If this reflects true clinical outcomes, the trend toward the eventual disappearance of female gender assignment for 46XY cloacal exstrophy is concerning. Copyright © 2011 American Urological Association Education and Research, Inc. Published by Elsevier Inc. All rights reserved.

  15. 5 CFR 870.902 - Making an assignment.

    Science.gov (United States)

    2010-01-01

    ... assignment. (a) To assign insurance, an insured individual must complete an approved assignment form. Only the insured individual can make an assignment; no one can assign on behalf of an insured individual... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Making an assignment. 870.902 Section...

  16. [Characteristics of forensic patients assigned to forensic outpatient treatment].

    Science.gov (United States)

    Bulla, Jan; Ross, T; Hoffmann, K; Querengässer, J

    2015-01-01

    In the Federal State of Baden-Württemberg an administrative regulation specifies which patients should be assigned to forensic outpatient treatment. Empirically, little is known about the clinical and criminological factors supporting these decisions. A complete survey of forensic inpatients in Baden-Württemberg was undertaken. From 476 patients released from unlimited detention (§ 63 StGB) 235 (45.6 %) received a court order for forensic aftercare between 2009 and 2012. Social, forensic, and psychiatric history differed only slightly compared with patients not assigned. Schizophrenia as diagnosis was overrepresented, personality disorder and paraphilia underrepresented. Both groups differed most with respect to the duration of detention. The decision for forensic outpatient treatment seems to be determined by process variables of inpatient treatment but not by criminological risk factors. This contradicts the R-N-R principles by Andrews and Bonta. © Georg Thieme Verlag KG Stuttgart · New York.

  17. Crosstalk-Aware Routing Resource Assignment

    Institute of Scientific and Technical Information of China (English)

    Hai-Long Yao; Yi-Ci Cai; Qiang Zhou; Xian-Long Hong

    2005-01-01

    Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.

  18. A new routing assignment model for Internet

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper builds a new traffic assignment model for Internet. The routing policy based on this model can realize load splitting in a network automatically, which overcomes the shortcoming of OSPF and satisfies the load balancing requirement of IETF.

  19. Competitive Traffic Assignment in Road Networks

    Directory of Open Access Journals (Sweden)

    Krylatov Alexander Y.

    2016-09-01

    Full Text Available Recently in-vehicle route guidance and information systems are rapidly developing. Such systems are expected to reduce congestion in an urban traffic area. This social benefit is believed to be reached by imposing the route choices on the network users that lead to the system optimum traffic assignment. However, guidance service could be offered by different competitive business companies. Then route choices of different mutually independent groups of users may reject traffic assignment from the system optimum state. In this paper, a game theoretic approach is shown to be very efficient to formalize competitive traffic assignment problem with various groups of users in the form of non-cooperative network game with the Nash equilibrium search. The relationships between the Wardrop’s system optimum associated with the traffic assignment problem and the Nash equilibrium associated with the competitive traffic assignment problem are investigated. Moreover, some related aspects of the Nash equilibrium and the Wardrop’s user equilibrium assignments are also discussed.

  20. An efficient and impartial online algorithm for kidney assignment network

    Institute of Scientific and Technical Information of China (English)

    Yu-jue Wang; Jia-yin Wang; Pei-jia Tang; Yi-tuo Ye

    2009-01-01

    An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation- immunity spending caused by the possible post-operation immunity rejection and patient's mental depression due to the HLA mismatch. The equity principle is concerned with three other factors, namely the treatment spending incurred starting from the day of registering with the kidney assignment network, the post-operation immunity spending and the negative effects of waiting for kidney resources on the clinical efficiency. The competitive analysis conducted through computer simulation indicates that the efficiency competitive ratio is between 6. 29 and 10. 43 and the equity competitive ratio is between 1. 31 and 5. 21, demonstrating that the online algorithm is of great significance in application.

  1. Flexible taxonomic assignment of ambiguous sequencing reads

    Directory of Open Access Journals (Sweden)

    Jansson Jesper

    2011-01-01

    Full Text Available Abstract Background To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference taxonomy. Reads that cannot be reliably assigned to a unique leaf in the taxonomy (ambiguous reads are typically assigned to the lowest common ancestor of the set of species that match it. This introduces a potentially severe error in the estimation of bacteria present in the sample due to false positives, since all species in the subtree rooted at the ancestor are implicitly assigned to the read even though many of them may not match it. Results We present a method that maps each read to a node in the taxonomy that minimizes a penalty score while balancing the relevance of precision and recall in the assignment through a parameter q. This mapping can be obtained in time linear in the number of matching sequences, because LCA queries to the reference taxonomy take constant time. When applied to six different metagenomic datasets, our algorithm produces different taxonomic distributions depending on whether coverage or precision is maximized. Including information on the quality of the reads reduces the number of unassigned reads but increases the number of ambiguous reads, stressing the relevance of our method. Finally, two measures of performance are described and results with a set of artificially generated datasets are discussed. Conclusions The assignment strategy of sequencing reads introduced in this paper is a versatile and a quick method to study bacterial communities. The bacterial composition of the analyzed samples can vary significantly depending on how ambiguous reads are assigned depending on the value of the q parameter. Validation of our results in an artificial dataset confirm that a combination of values of q produces the most accurate results.

  2. Improving active eigenvector assignment through passive modifications

    Science.gov (United States)

    Belotti, R.; Richiedei, D.

    2016-09-01

    Specifications on the dynamic behavior of feedback-controlled vibrating systems are often expressed in terms of its eigenstructure, i.e. eigenvalues and eigenvectors. The notion of controllability establishes the possibility to assign eigenvalues through state feedback, but it is not adequate to assure the assignment of arbitrary eigenvectors. Indeed, assignable eigenvectors are just those belonging to the allowable vector subspace, which depends on the physical properties of the vibrating system (mass, damping and stiffness matrices) and of the actuators. To overcome this limitation, this paper proposes a hybrid approach that exploits passive modification of the system physical parameters to modify the allowable subspace in such a way that it spans (or closely approximates) the desired eigenvectors. Then, once that the system modifications have been computed, standard techniques for control synthesis can be employed to compute the gains assigning the desired poles and the eigenvectors. The modification of the allowable subspace is cast in this work as a rank minimization problem, which can be efficiently tackled through semi-definite programming. The proposed method is numerically validated on a lumped parameter system, by proving that the assignment of eigenvectors by hybrid control is significantly enhanced compared with sole active control.

  3. Protein secondary structure assignment revisited: a detailed analysis of different assignment methods

    Directory of Open Access Journals (Sweden)

    de Brevern Alexandre G

    2005-09-01

    Full Text Available Abstract Background A number of methods are now available to perform automatic assignment of periodic secondary structures from atomic coordinates, based on different characteristics of the secondary structures. In general these methods exhibit a broad consensus as to the location of most helix and strand core segments in protein structures. However the termini of the segments are often ill-defined and it is difficult to decide unambiguously which residues at the edge of the segments have to be included. In addition, there is a "twilight zone" where secondary structure segments depart significantly from the idealized models of Pauling and Corey. For these segments, one has to decide whether the observed structural variations are merely distorsions or whether they constitute a break in the secondary structure. Methods To address these problems, we have developed a method for secondary structure assignment, called KAKSI. Assignments made by KAKSI are compared with assignments given by DSSP, STRIDE, XTLSSTR, PSEA and SECSTR, as well as secondary structures found in PDB files, on 4 datasets (X-ray structures with different resolution range, NMR structures. Results A detailed comparison of KAKSI assignments with those of STRIDE and PSEA reveals that KAKSI assigns slightly longer helices and strands than STRIDE in case of one-to-one correspondence between the segments. However, KAKSI tends also to favor the assignment of several short helices when STRIDE and PSEA assign longer, kinked, helices. Helices assigned by KAKSI have geometrical characteristics close to those described in the PDB. They are more linear than helices assigned by other methods. The same tendency to split long segments is observed for strands, although less systematically. We present a number of cases of secondary structure assignments that illustrate this behavior. Conclusion Our method provides valuable assignments which favor the regularity of secondary structure segments.

  4. argosy B6029 full course latest 2015 winters [all assignments and Assignment discussion

    OpenAIRE

    Laynebaril

    2017-01-01

     argosy B6029 full course latest 2015 winters [all assignments and Assignment discussion ] Click Link Below To Buy:   http://hwcampus.com/shop/b6029-full-course/   Assignment 2: Discussion—Competitive Advantage and Globalization Competitive advantage implies the creation of a system that has a unique advantage over competitors. With the advent of globalization, the competition has become stronger and can be located anywhere in the world. The idea behind competitive adv...

  5. Assignment of PolyProline II conformation and analysis of sequence--structure relationship.

    Science.gov (United States)

    Mansiaux, Yohann; Joseph, Agnel Praveen; Gelly, Jean-Christophe; de Brevern, Alexandre G

    2011-03-31

    Secondary structures are elements of great importance in structural biology, biochemistry and bioinformatics. They are broadly composed of two repetitive structures namely α-helices and β-sheets, apart from turns, and the rest is associated to coil. These repetitive secondary structures have specific and conserved biophysical and geometric properties. PolyProline II (PPII) helix is yet another interesting repetitive structure which is less frequent and not usually associated with stabilizing interactions. Recent studies have shown that PPII frequency is higher than expected, and they could have an important role in protein-protein interactions. A major factor that limits the study of PPII is that its assignment cannot be carried out with the most commonly used secondary structure assignment methods (SSAMs). The purpose of this work is to propose a PPII assignment methodology that can be defined in the frame of DSSP secondary structure assignment. Considering the ambiguity in PPII assignments by different methods, a consensus assignment strategy was utilized. To define the most consensual rule of PPII assignment, three SSAMs that can assign PPII, were compared and analyzed. The assignment rule was defined to have a maximum coverage of all assignments made by these SSAMs. Not many constraints were added to the assignment and only PPII helices of at least 2 residues length are defined. The simple rules designed in this study for characterizing PPII conformation, lead to the assignment of 5% of all amino as PPII. Sequence-structure relationships associated with PPII, defined by the different SSAMs, underline few striking differences. A specific study of amino acid preferences in their N and C-cap regions was carried out as their solvent accessibility and contact patterns. Thus the assignment of PPII can be coupled with DSSP and thus opens a simple way for further analysis in this field.

  6. Assignment of PolyProline II Conformation and Analysis of Sequence – Structure Relationship

    Science.gov (United States)

    Gelly, Jean-Christophe; de Brevern, Alexandre G.

    2011-01-01

    Background Secondary structures are elements of great importance in structural biology, biochemistry and bioinformatics. They are broadly composed of two repetitive structures namely α-helices and β-sheets, apart from turns, and the rest is associated to coil. These repetitive secondary structures have specific and conserved biophysical and geometric properties. PolyProline II (PPII) helix is yet another interesting repetitive structure which is less frequent and not usually associated with stabilizing interactions. Recent studies have shown that PPII frequency is higher than expected, and they could have an important role in protein – protein interactions. Methodology/Principal Findings A major factor that limits the study of PPII is that its assignment cannot be carried out with the most commonly used secondary structure assignment methods (SSAMs). The purpose of this work is to propose a PPII assignment methodology that can be defined in the frame of DSSP secondary structure assignment. Considering the ambiguity in PPII assignments by different methods, a consensus assignment strategy was utilized. To define the most consensual rule of PPII assignment, three SSAMs that can assign PPII, were compared and analyzed. The assignment rule was defined to have a maximum coverage of all assignments made by these SSAMs. Not many constraints were added to the assignment and only PPII helices of at least 2 residues length are defined. Conclusions/Significance The simple rules designed in this study for characterizing PPII conformation, lead to the assignment of 5% of all amino as PPII. Sequence – structure relationships associated with PPII, defined by the different SSAMs, underline few striking differences. A specific study of amino acid preferences in their N and C-cap regions was carried out as their solvent accessibility and contact patterns. Thus the assignment of PPII can be coupled with DSSP and thus opens a simple way for further analysis in this field. PMID

  7. Assignment of fields from particles to mesh

    CERN Document Server

    Duque, Daniel

    2016-01-01

    In Computational Fluid Dynamics there have been many attempts to combine the power of a fixed mesh on which to carry out spatial calculations with that of a set of particles that moves following the velocity field. These ideas indeed go back to Particle-in-Cell methods, proposed about 60 years ago. Of course, some procedure is needed to transfer field information between particles and mesh. There are many possible choices for this "assignment", or "projection". Several requirements may guide this choice. Two well-known ones are conservativity and stability, which apply to volume integrals of the fields. An additional one is here considered: preservation of information. This means that mesh interpolation, followed by mesh assignment, should leave the field values invariant. The resulting methods are termed "mass" assignments due to their strong similarities with the Finite Element Method. We test several procedures, including the well-known FLIP, on three scenarios: simple 1D convection, 2D convection of Zales...

  8. Reasoning about Assignments in Recursive Data Structures

    Science.gov (United States)

    Tamalet, Alejandro; Madlener, Ken

    This paper presents a framework to reason about the effects of assignments in recursive data structures. We define an operational semantics for a core language based on Meyer's ideas for a semantics for the object-oriented language Eiffel. A series of field accesses, e.g. f1 • f2 • ··· • fn , can be seen as a path on the heap. We provide rules that describe how these multidot expressions are affected by an assignment. Using multidot expressions to construct an abstraction of a list, we show the correctness of a list reversal algorithm. This approach does not require induction and the reasoning about the assignments is encapsulated in the mentioned rules. We also discuss how to use this approach when working with other data structures and how it compares to the inductive approach. The framework, rules and examples have been formalised and proven correct using the PVS proof assistant.

  9. Demand assignment in the ACTS LBR system

    Science.gov (United States)

    Palmer, Larry C.; White, Lawrence W.

    1990-05-01

    On the Advanced Communications Technology Satellite (ACTS) being developed at NASA Lewis, low-burst-rate (LBR) traffic stations will access the ACTS multibeam package via two hopping beams that can be directed at certain areas in the continental U.S. An onboard baseband processor (BBP) demodulates uplink traffic, switches it between uplink and downlink beams at baseband, and then remodulates it for retransmission at 20 GHz. This study describes the demand-assigned operation of the ACTS LBR system, where the onboard switch is remote from both traffic stations and master control station (MCS). Network control uses inbound and outbound orderwire channels and a BBP control channel, allowing the MCS to coordinate assignment of individual 64-kb/s spacecraft channels. Models are developed to simulate the dynamics of the assignment process and verify the call blocking behavior, to predict control channel loads, and to evaluate algorithms for burst time plan rearrangement.

  10. Writing Assignments that Promote Active Learning

    Science.gov (United States)

    Narayanan, M.

    2014-12-01

    Encourage students to write a detailed, analytical report correlating classroom discussions to an important historical event or a current event. Motivate students interview an expert from industry on a topic that was discussed in class. Ask the students to submit a report with supporting sketches, drawings, circuit diagrams and graphs. Propose that the students generate a complete a set of reading responses pertaining to an assigned topic. Require each student to bring in one comment or one question about an assigned reading. The assignment should be a recent publication in an appropriate journal. Have the students conduct a web search on an assigned topic. Ask them to generate a set of ideas that can relate to classroom discussions. Provide the students with a study guide. The study guide should provide about 10 or 15 short topics. Quiz the students on one or two of the topics. Encourage the students to design or develop some creative real-world examples based on a chapter discussed or a topic of interest. Require that students originate, develop, support and defend a viewpoint using a specifically assigned material. Make the students practice using or utilizing a set of new technical terms they have encountered in an assigned chapter. Have students develop original examples explaining the different terms. Ask the students to select one important terminology from the previous classroom discussions. Encourage the students to explain why they selected that particular word. Ask them to talk about the importance of the terminology from the point of view of their educational objectives and future career. Angelo, T. A. (1991). Ten easy pieces: Assessing higher learning in four dimensions. In T. A. Angelo (Ed.), Classroom research: Early lessons from success (pp. 17-31). New Directions for Teaching and Learning, No. 46. San Francisco: Jossey-Bass.

  11. The Wiener maximum quadratic assignment problem

    CERN Document Server

    Cela, Eranda; Woeginger, Gerhard J

    2011-01-01

    We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time solution for the following problem from chemical graph theory: Find a tree that maximizes the Wiener index among all trees with a prescribed degree sequence. This settles an open problem from the literature.

  12. Evolving Networks with Nonlinear Assignment of Weight

    Institute of Scientific and Technical Information of China (English)

    TANG Chao; TANG Yi

    2006-01-01

    We propose a weighted evolving network model in which the underlying topological structure is still driven by the degree according to the preferential attachment rule while the weight assigned to the newly established edges is dependent on the degree in a nonlinear form. By varying the parameter α that controls the function determining the assignment of weight, a wide variety of power-law behaviours of the total weight distributions as well as the diversity of the weight distributions of edges are displayed. Variation of correlation and heterogeneity in the network is illustrated as well.

  13. AC410 Unit 2 Homework Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

      AC410 Unit 2 Homework Assignment Click Link Below To Buy: http://hwcampus.com/shop/ac410-unit-2-homework-assignment/   3-31 Ron Barber, CPA, is auditing the financial statements of DGF, Inc., a publicly held company. During the course of the audit, Barber discovered that DGF has been making illegal bribes to foreign government officials to obtain business, and he reported the matter to senior management and the board of directors of DGF. Required: If management a...

  14. Storage assignment problem in flexible manufacturing

    Energy Technology Data Exchange (ETDEWEB)

    Abdel-Hamid, A.

    1994-12-31

    In this talk some results of a joint project with industry that had the aim to speed up the operation of an automatic storage device of a flexible manufacturing system is presented. One of the aspects that influence this speed is the technique used to solve the problem of assigning containers with different sizes to storage locations of an automatic storage system (storage assignment problem, shortly, SAP). Both off-line and on line computational studies of various solution techniques (heuristics, a cutting plane algorithm) to solve SAP are reported. These studies show that under heavy load conditions a considerable speed up of the system can be achieved.

  15. Manganese Oxidation State Assignment for Manganese Catalase.

    Science.gov (United States)

    Beal, Nathan J; O'Malley, Patrick J

    2016-04-06

    The oxidation state assignment of the manganese ions present in the superoxidized manganese (III/IV) catalase active site is determined by comparing experimental and broken symmetry density functional theory calculated (14)N, (17)O, and (1)H hyperfine couplings. Experimental results have been interpreted to indicate that the substrate water is coordinated to the Mn(III) ion. However, by calculating hyperfine couplings for both scenarios we show that water is coordinated to the Mn(IV) ion and that the assigned oxidation states of the two manganese ions present in the site are the opposite of that previously proposed based on experimental measurements alone.

  16. Experimenting with Request Assignment Simulator (RAS

    Directory of Open Access Journals (Sweden)

    R. Arokia Paul Rajan

    2014-11-01

    Full Text Available There is no existence of dedicated simulators on the Internet that studies the impact of load balancing principles of the cloud architectures. Request Assignment Simulator (RAS is a customizable, visual tool that helps to understand the request assignment to the resources based on the load balancing principles. We have designed this simulator to fit into Infrastructure as a Service (IaaS cloud model. In this paper, we present a working manual useful for the conduct of experiment with RAS. The objective of this paper is to instill the user to understand the pertinent parameters in the cloud, their metrics, load balancing principles, and their impact on the performance.

  17. Method for assigning sites to projected generic nuclear power plants

    Energy Technology Data Exchange (ETDEWEB)

    Holter, G.M.; Purcell, W.L.; Shutz, M.E.; Young, J.R.

    1986-07-01

    Pacific Northwest Laboratory developed a method for forecasting potential locations and startup sequences of nuclear power plants that will be required in the future but have not yet been specifically identified by electric utilities. Use of the method results in numerical ratings for potential nuclear power plant sites located in each of the 10 federal energy regions. The rating for each potential site is obtained from numerical factors assigned to each of 5 primary siting characteristics: (1) cooling water availability, (2) site land area, (3) power transmission land area, (4) proximity to metropolitan areas, and (5) utility plans for the site. The sequence of plant startups in each federal energy region is obtained by use of the numerical ratings and the forecasts of generic nuclear power plant startups obtained from the EIA Middle Case electricity forecast. Sites are assigned to generic plants in chronological order according to startup date.

  18. Equilibrium Assignment Model with Uncertainties in Traffic Demands

    Directory of Open Access Journals (Sweden)

    Aiwu Kuang

    2013-01-01

    Full Text Available In this study, we present an equilibrium traffic assignment model considering uncertainties in traffic demands. The link and route travel time distributions are derived based on the assumption that OD traffic demand follows a log-normal distribution. We postulate that travelers can acquire the variability of route travel times from past experiences and factor such variability into their route choice considerations in the form of mean route travel time. Furthermore, all travelers want to minimize their mean route travel times. We formulate the assignment problem as a variational inequality, which can be solved by a route-based heuristic solution algorithm. Some numerical studies on a small test road network are carried out to validate the proposed model and algorithm, at the same time, some reasonable results are obtained.

  19. Competition assignment problem algorithm based on Hungarian method

    Institute of Scientific and Technical Information of China (English)

    KONG Chao; REN Yongtai; GE Huiling; DENG Hualing

    2007-01-01

    Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.

  20. 48 CFR 211.274-5 - Policy for assignment of Government-assigned serial numbers.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Policy for assignment of... DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE ACQUISITION PLANNING DESCRIBING AGENCY NEEDS Using and Maintaining Requirements Documents 211.274-5 Policy for assignment of...

  1. Structural Encoding of Static Single Assignment Form

    DEFF Research Database (Denmark)

    Gal, Andreas; Probst, Christian; Franz, Michael

    2005-01-01

    Static Single Assignment (SSA) form is often used as an intermediate representation during code optimization in Java Virtual Machines. Recently, SSA has successfully been used for bytecode verification. However, constructing SSA at the code consumer is costly. SSAbased mobile code transport formats...

  2. Tabu search for target-radar assignment

    DEFF Research Database (Denmark)

    Hindsberger, Magnus; Vidal, Rene Victor Valqui

    2000-01-01

    In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued...

  3. Strategy-Proof Assignment Of Multiple Resources

    DEFF Research Database (Denmark)

    Erlanson, Albin; Szwagrzak, Karol

    2015-01-01

    We examine the strategy-proof allocation of multiple resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. In the domain of multidimensional single-peaked preferences, we find that any allocation mechanism obtained...

  4. Dynamic traffic assignment on parallel computers

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K.; Frye, R.; Jakob, R.; Rickert, M.; Stretz, P.

    1998-12-01

    The authors describe part of the current framework of the TRANSIMS traffic research project at the Los Alamos National Laboratory. It includes parallel implementations of a route planner and a microscopic traffic simulation model. They present performance figures and results of an offline load-balancing scheme used in one of the iterative re-planning runs required for dynamic route assignment.

  5. Test-assignment: a quadratic coloring problem

    NARCIS (Netherlands)

    Duives, Jelle; Lodi, Andrea; Malaguti, Enrico

    2013-01-01

    We consider the problem of assigning the test variants of a written exam to the desks of a classroom in such a way that desks that are close-by receive different variants. The problem is a generalization of the Vertex Coloring and we model it as a binary quadratic problem. Exact solution methods bas

  6. Experimental results on quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    N.P. Nikolov

    1999-08-01

    Full Text Available The paper presents experimental results on quadratic assignment problem. The "scanning area" method formulated for radioelectronic equipment design is applied. For all more complex tests ours results are better or coincident with the ones known in literature. Conclusion concerning the effectiveness of method are given.

  7. School Assignment, School Choice and Social Mobility

    Science.gov (United States)

    Burgess, Simon; Briggs, Adam

    2010-01-01

    We estimate the chances of poor and non-poor children getting places in good schools, analysing the relationship between poverty, location and school assignment. Our dataset allows us to measure location and distance very precisely. The simple unconditional difference in probabilities of attending a good school is substantial. We run an analysis…

  8. Assessing the Assignment Policy for Army Women

    Science.gov (United States)

    2007-01-01

    General surgeon 61K Thoracic surgeon 61L Plastic surgeon 61M Orthopedic surgeon 61N Flight surgeon 61P Physiatrist 61Q Radiation oncologist 61R Diagnostic... veterinarian (immaterial) Branch 65, Army Medical Specialist Corps 65A Occupational therapy Table C.3—Continued 100 Assessing the Assignment Policy for Army

  9. On Online Assignments in a Calculus Class

    Science.gov (United States)

    Jungic, Veselin; Kent, Deborah; Menz, Petra

    2012-01-01

    In this paper, we describe our experience with the creation and utilization of online assignments for several calculus classes at Simon Fraser University (SFU). We present our findings regarding available software by considering the needs and perspectives of the instructors, students, and administrators. We provide a list of questions that guide…

  10. Radio labeling with pre-assigned frequencies

    NARCIS (Netherlands)

    Bodlaender, H.L.; Broersma, H.J.; Fomin, F.V.; Pyatkin, A.V.; Woeginer, G.J.

    2007-01-01

    A radio labeling of a graph G is an assignment of pairwise distinct, positive integer labels to the vertices of G such that labels of adjacent vertices differ by at least 2. The radio labeling problem (RL) consists in determining a radio labeling that minimizes the maximum label that is used (the so

  11. Improving Marine Corps Assignment of SDAP Levels

    Science.gov (United States)

    2013-03-01

    Advisor William R. Gates, Dean Graduate School of Business and Public Policy iv THIS PAGE INTENTIONALLY LEFT BLANK v ABSTRACT The...normally covered through TAD funds, COLA, BAH, and BAS, but not SDAP. 9 Information Paper, SDAP...Lien, and Dave Gregory. Evaluation of the Assignment Incentive Pay (AIP) System. Alexandria: CNA, June 2004. Greene, William . Econometric Analysis

  12. Incentivized optimal advert assignment via utility decomposition

    NARCIS (Netherlands)

    Kelly, F.; Key, P.; Walton, N.

    2014-01-01

    We consider a large-scale Ad-auction where adverts are assigned over a potentially infinite number of searches. We capture the intrinsic asymmetries in information between advertisers, the advert platform and the space of searches: advertisers know and can optimize the average performance of their a

  13. Accounting for Sustainability: An Active Learning Assignment

    Science.gov (United States)

    Gusc, Joanna; van Veen-Dirks, Paula

    2017-01-01

    Purpose: Sustainability is one of the newer topics in the accounting courses taught in university teaching programs. The active learning assignment as described in this paper was developed for use in an accounting course in an undergraduate program. The aim was to enhance teaching about sustainability within such a course. The purpose of this…

  14. A Literature Assignment with a Civic Emphasis.

    Science.gov (United States)

    Brough, Barbara L.

    1989-01-01

    Describes how students wrestled with an assignment that asked them to name their heroes or heroines, compare them to "Beowulf," and defend their choices in writing and class discussion. Tells how students gained insight into their community and the ways in which people make it better. (MG)

  15. Writing Assignments Based on Literary Works.

    Science.gov (United States)

    Matthews, Dorothy, Ed.

    1985-01-01

    The literature selections serving as the basis for writing assignments in the articles in this journal issue range from time-honored English classics ("Beowulf,""Sir Gawain and the Green Knight") and American standards ("A Farewell to Arms,""The Scarlet Letter") to contemporary fiction. The articles deal with works by women writers (Shirley…

  16. Credit assignment during movement reinforcement learning.

    Science.gov (United States)

    Dam, Gregory; Kording, Konrad; Wei, Kunlin

    2013-01-01

    We often need to learn how to move based on a single performance measure that reflects the overall success of our movements. However, movements have many properties, such as their trajectories, speeds and timing of end-points, thus the brain needs to decide which properties of movements should be improved; it needs to solve the credit assignment problem. Currently, little is known about how humans solve credit assignment problems in the context of reinforcement learning. Here we tested how human participants solve such problems during a trajectory-learning task. Without an explicitly-defined target movement, participants made hand reaches and received monetary rewards as feedback on a trial-by-trial basis. The curvature and direction of the attempted reach trajectories determined the monetary rewards received in a manner that can be manipulated experimentally. Based on the history of action-reward pairs, participants quickly solved the credit assignment problem and learned the implicit payoff function. A Bayesian credit-assignment model with built-in forgetting accurately predicts their trial-by-trial learning.

  17. Incentivized optimal advert assignment via utility decomposition

    NARCIS (Netherlands)

    Kelly, F.; Key, P.; Walton, N.

    2014-01-01

    We consider a large-scale Ad-auction where adverts are assigned over a potentially infinite number of searches. We capture the intrinsic asymmetries in information between advertisers, the advert platform and the space of searches: advertisers know and can optimize the average performance of their a

  18. Tabu search for target-radar assignment

    DEFF Research Database (Denmark)

    Hindsberger, Magnus; Vidal, Rene Victor Valqui

    2000-01-01

    In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued...... that tabu search could be used in near real-time decision making systems...

  19. Accounting for Sustainability: An Active Learning Assignment

    Science.gov (United States)

    Gusc, Joanna; van Veen-Dirks, Paula

    2017-01-01

    Purpose: Sustainability is one of the newer topics in the accounting courses taught in university teaching programs. The active learning assignment as described in this paper was developed for use in an accounting course in an undergraduate program. The aim was to enhance teaching about sustainability within such a course. The purpose of this…

  20. Politics, Internet Assignments, and Civic Knowledge.

    Science.gov (United States)

    May, Vaughn

    2000-01-01

    Describes how one professor of American government fights the apathy and cynicism of college students toward politics by using the Internet to help students more fairly appraise the workings of the American political system. One assignment has students research and manage a particular public policy initiative through visits to Web sites…

  1. Feedback for Web-based Assignments.

    Science.gov (United States)

    Collis, Betty; De Boer, W.; Slotman, K.

    2001-01-01

    Discusses a concept used at the University of Twente based on increased flexibility in learning options and the active student in which there are assignments submitted and monitored via a Web-based course management system. Outlines conceptual aspects of feedback as part of the assessment process, particularly feedback supported by a Web-based…

  2. Locomotive Assignment Optimization Including Train Delays

    Directory of Open Access Journals (Sweden)

    Sandra Kasalica

    2013-10-01

    Full Text Available Intention– Cyclic locomotive assignment planning is a specific type of organization of locomotive usage, and in fact, it means putting the complete workload to a closed chain, which is repeated periodically. The concept of cyclic locomotive assignment planning type organization in the area of train traction has proven in practice as the best one, but as it is made for in-advance defined timetable and without considering the stochastic nature of the timetable realization process, it leads to incompatibility in using locomotives. Methodology – Methodology defined in this paper contains: research of train delays on the Serbian Railways and Montenegrin Railways networks, analysis of the real system organization of locomotive usage in conditions of train delays, theoretical thesis of solving the problem of optimal cyclic locomotive assignment planning in conditions of train delays, designing of a model with algorithms, preparing the software package, testing the model and program with results, as well as the conclusions drawn from the complete research project. Results– The optimization model of cyclic locomotive assignment planning during the process of making timetable including train delays has been defined. Conclusion –The obtained results have shown as expected, that the larger delays of trains required a larger number of locomotives. However, by using this model it is possible to optimize the required number of locomotives, taking into account the real time delays of trains.

  3. 12 CFR 25.28 - Assigned ratings.

    Science.gov (United States)

    2010-01-01

    ... on the bank's performance under the lending, investment and service tests, the community development..., investment, and service tests. The OCC assigns a rating for a bank assessed under the lending, investment, and service tests in accordance with the following principles: (1) A bank that receives...

  4. Semi-infinite assignment and transportation games

    NARCIS (Netherlands)

    Sánchez-Soriano, Joaqu´ın; Llorca, Navidad; Tijs, Stef; Timmer, Judith; Goberna, Miguel A.; López, Marco A.

    2001-01-01

    Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An assignm

  5. Teaching Historical Analysis through Creative Writing Assignments

    Science.gov (United States)

    Peterson, Janine Larmon; Graham, Lea

    2015-01-01

    Incorporating creative writing exercises in history courses can heighten students' critical reading and analytical skills in an active learning model. We identify and define two types of possible assignments that use model texts as their locus: centripetal, which focuses on specific context and disciplinary terms, and centrifugal, which address…

  6. Democratization of Learning through Thematic Assignment

    Science.gov (United States)

    Medellu, Christophil S.; Lumingkewas, S.; Walangitan, J. F.

    2015-01-01

    This article describes the results of research on learning democratization in Sangihe. This study is the first year of a five-year plan. Long-term goal of this research is to create the democratic science learning in schools. Democratic learning model was developed through thematic assignment, involving the participation of parents and…

  7. Generalised Assignment Matrix Methodology in Linear Programming

    Science.gov (United States)

    Jerome, Lawrence

    2012-01-01

    Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…

  8. Radio labeling with pre-assigned frequencies

    NARCIS (Netherlands)

    Bodlaender, H.L.; Broersma, H.J.; Fomin, F.V.; Pyatkin, A.V.; Woeginer, G.J.

    2002-01-01

    A radio labeling of a graph G is an assignment of pairwise distinct, positive integer labels to the vertices of G such that labels of adjacent vertices differ by at least 2. The radio labeling problem (RL) consists in determining a radio labeling that minimizes the maximum label that is used (the

  9. Radio labeling with pre-assigned frequencies

    NARCIS (Netherlands)

    Bodlaender, H.L.; Broersma, Haitze J.; Fomin, F.V.; Pyatkin, A.V.; Woeginger, Gerhard

    2002-01-01

    A radio labeling of a graph $G$ is an assignment of pairwise distinct, positive integer labels to the vertices of $G$ such that labels of adjacent vertices differ by at least $2$. The radio labeling problem (\\mbox{\\sc RL}) consists in determining a radio labeling that minimizes the maximum label

  10. Pole Assignment for Second-Order Systems

    Science.gov (United States)

    CHU, E. K.

    2002-01-01

    This paper contains some results for pole assignment problems for the second-order system M ẍ(t)+D ẋ(t)+K x (t)=B u (t) . Specifically, Algorithm 0 constructs feedback matrices F1 and F2 such that the closed-loop quadratic pencil Pc( λ)= λ2M+ λ ( D+ BF2)+( K+ BF1) has a desired set of eigenvalues and the associated eigenvectors are well-conditioned. The method is a modification of the SVD-based method proposed by Juang and Maghami [1, 2] which is a second-order adaptation of the well-known robust eigenvalue assignment method by Kautsky et al. [3] for first-order systems. Robustness is achieved by minimising some not-so-well-known condition numbers of the eigenvalues of the closed-loop second-order pencil. We next consider the partial pole assignment problem. In 1997, Datta, Elhay and Ram proposed three biorthogonality relations for eigenvectors of symmetric definite quadratic pencils [4]. One of these relations was used to derive an explicit solution to the partial pole assignment problem by state feedback for the related single-input symmetric definite second-order control system. The solution shed new light on the stabilisation and control of large flexible space structures, for which only one small subset of the spectrum needs to be reassigned while retaining the complementary part of the spectrum. In this paper, the method has been generalised for multi-input and non-symmetric quadratic pencils. Finally, we discuss briefly the output feedback pole assignment problem.

  11. Assignment and Correspondence Tracking System - Tactical / Operational Reporting

    Data.gov (United States)

    Social Security Administration — Reporting data store for the Assignment and Correspondence Tracking System (ACT). ACT automates the assignment and tracking of correspondence processing within the...

  12. Correction of spin diffusion during iterative automated NOE assignment.

    Science.gov (United States)

    Linge, Jens P; Habeck, Michael; Rieping, Wolfgang; Nilges, Michael

    2004-04-01

    Indirect magnetization transfer increases the observed nuclear Overhauser enhancement (NOE) between two protons in many cases, leading to an underestimation of target distances. Wider distance bounds are necessary to account for this error. However, this leads to a loss of information and may reduce the quality of the structures generated from the inter-proton distances. Although several methods for spin diffusion correction have been published, they are often not employed to derive distance restraints. This prompted us to write a user-friendly and CPU-efficient method to correct for spin diffusion that is fully integrated in our program ambiguous restraints for iterative assignment (ARIA). ARIA thus allows automated iterative NOE assignment and structure calculation with spin diffusion corrected distances. The method relies on numerical integration of the coupled differential equations which govern relaxation by matrix squaring and sparse matrix techniques. We derive a correction factor for the distance restraints from calculated NOE volumes and inter-proton distances. To evaluate the impact of our spin diffusion correction, we tested the new calibration process extensively with data from the Pleckstrin homology (PH) domain of Mus musculus beta-spectrin. By comparing structures refined with and without spin diffusion correction, we show that spin diffusion corrected distance restraints give rise to structures of higher quality (notably fewer NOE violations and a more regular Ramachandran map). Furthermore, spin diffusion correction permits the use of tighter error bounds which improves the distinction between signal and noise in an automated NOE assignment scheme.

  13. Online Assignment Algorithms for Dynamic Bipartite Graphs

    CERN Document Server

    Sahai, Ankur

    2011-01-01

    This paper analyzes the problem of assigning weights to edges incrementally in a dynamic complete bipartite graph consisting of producer and consumer nodes. The objective is to minimize the overall cost while satisfying certain constraints. The cost and constraints are functions of attributes of the edges, nodes and online service requests. Novelty of this work is that it models real-time distributed resource allocation using an approach to solve this theoretical problem. This paper studies variants of this assignment problem where the edges, producers and consumers can disappear and reappear or their attributes can change over time. Primal-Dual algorithms are used for solving these problems and their competitive ratios are evaluated.

  14. Pole assignment in descriptor periodic systems

    Institute of Scientific and Technical Information of China (English)

    FAN; Hung-Yuan; LIN; Wen-Wei; XU; Shufang

    2005-01-01

    In this paper a pole assignment problem is considered for the descriptor linear discrete-time periodic systems, which is using the periodic proportional-derivative feedback to modify a given system such that the closed loop system has a specified selfconjugate set of eigenvalues. It is shown that the complete reachability of an open loop periodic system is equivalent to the possibility of assigning an arbitrary set of the eigenvalues to the system by choosing the suitable periodic proportional-derivative feedback.A computational approach is also proposed to solve the problem, which uses the reliable numerical techniques based on the orthogonal transformations. Numerical examples are presented to illustrate the effectiveness of the proposed approach.

  15. Weekly Fleet Assignment Model and Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHU Xing-hui; ZHU Jin-fu; GONG Zai-wu

    2007-01-01

    A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.

  16. Speeding up sequence specific assignment of IDPs

    Energy Technology Data Exchange (ETDEWEB)

    Bermel, Wolfgang [Bruker BioSpin GmbH (Germany); Bertini, Ivano, E-mail: ivanobertini@cerm.unifi.it; Felli, Isabella C.; Gonnelli, Leonardo [CERM, University of Florence (Italy); Kozminski, Wiktor [University of Warsaw, Faculty of Chemistry (Poland); Piai, Alessandro; Pierattelli, Roberta [CERM, University of Florence (Italy); Stanek, Jan [University of Warsaw, Faculty of Chemistry (Poland)

    2012-08-15

    The characterization of intrinsically disordered proteins (IDPs) by NMR spectroscopy is made difficult by the extensive spectral overlaps. To overcome the intrinsic low-resolution of the spectra the introduction of high-dimensionality experiments is essential. We present here a set of high-resolution experiments based on direct {sup 13}C-detection which proved useful in the assignment of {alpha}-synuclein, a paradigmatic IDP. In particular, we describe the implementation of 4D HCBCACON, HCCCON, HCBCANCO, 4/5D HNCACON and HNCANCO and 3/4D HCANCACO experiments, specifically tailored for spin system identification and backbone resonances sequential assignment. The use of non-uniform-sampling in the indirect dimension and of the H-flip approach to achieve longitudinal relaxation enhancement rendered the experiments very practical.

  17. Assignation of limited resources in pediatrics

    Directory of Open Access Journals (Sweden)

    Garduño Espinosa Armando

    2014-07-01

    Full Text Available Limited resources assignation is fundamental in the development of health services and since they will never be enough, justice is- sues arise. Many distributive justice theories are discussed: liberal, equilable and utilitarian, as well as ethic principles and cost-benefit relation, that is, the consequences. Palliative medicine is suggested as a strategy to reduce the cost of hospitable care and to enhance its designation.

  18. Protein secondary structure: category assignment and predictability

    DEFF Research Database (Denmark)

    Andersen, Claus A.; Bohr, Henrik; Brunak, Søren

    2001-01-01

    In the last decade, the prediction of protein secondary structure has been optimized using essentially one and the same assignment scheme known as DSSP. We present here a different scheme, which is more predictable. This scheme predicts directly the hydrogen bonds, which stabilize the secondary......-forward neural network with one hidden layer on a data set identical to the one used in earlier work....

  19. Elementary Components of the Quadratic Assignment Problem

    CERN Document Server

    Chicano, Francisco; Alba, Enrique

    2011-01-01

    The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP can be written as the sum of three elementary landscapes when the swap neighborhood is used. We present a closed formula for each of the three elementary components and we compute bounds for the autocorrelation coefficient.

  20. Online Assignment Algorithms for Dynamic Bipartite Graphs

    OpenAIRE

    Sahai, Ankur

    2011-01-01

    This paper analyzes the problem of assigning weights to edges incrementally in a dynamic complete bipartite graph consisting of producer and consumer nodes. The objective is to minimize the overall cost while satisfying certain constraints. The cost and constraints are functions of attributes of the edges, nodes and online service requests. Novelty of this work is that it models real-time distributed resource allocation using an approach to solve this theoretical problem. This paper studies v...

  1. Capacity constrained assignment in spatial databases

    DEFF Research Database (Denmark)

    U, Leong Hou; Yiu, Man Lung; Mouratidis, Kyriakos;

    2008-01-01

    Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most...

  2. Online Ad Assignment with an Ad Exchange

    OpenAIRE

    Dvořák, Wolfgang; Henzinger, Monika

    2016-01-01

    Ad exchanges are becoming an increasingly popular way to sell advertisement slots on the internet. An ad exchange is basically a spot market for ad impressions. A publisher who has already signed contracts reserving advertisement impressions on his pages can choose between assigning a new ad impression for a new page view to a contracted advertiser or to sell it at an ad exchange. This leads to an online revenue maximization problem for the publisher. Given a new impression to sell decide whe...

  3. Students' Achievement and Homework Assignment Strategies

    Science.gov (United States)

    Fernández-Alonso, Rubén; Álvarez-Díaz, Marcos; Suárez-Álvarez, Javier; Muñiz, José

    2017-01-01

    The optimum time students should spend on homework has been widely researched although the results are far from unanimous. The main objective of this research is to analyze how homework assignment strategies in schools affect students' academic performance and the differences in students' time spent on homework. Participants were a representative sample of Spanish adolescents (N = 26,543) with a mean age of 14.4 (±0.75), 49.7% girls. A test battery was used to measure academic performance in four subjects: Spanish, Mathematics, Science, and Citizenship. A questionnaire allowed the measurement of the indicators used for the description of homework and control variables. Two three-level hierarchical-linear models (student, school, autonomous community) were produced for each subject being evaluated. The relationship between academic results and homework time is negative at the individual level but positive at school level. An increase in the amount of homework a school assigns is associated with an increase in the differences in student time spent on homework. An optimum amount of homework is proposed which schools should assign to maximize gains in achievement for students overall.

  4. Accurate taxonomic assignment of short pyrosequencing reads.

    Science.gov (United States)

    Clemente, José C; Jansson, Jesper; Valiente, Gabriel

    2010-01-01

    Ambiguities in the taxonomy dependent assignment of pyrosequencing reads are usually resolved by mapping each read to the lowest common ancestor in a reference taxonomy of all those sequences that match the read. This conservative approach has the drawback of mapping a read to a possibly large clade that may also contain many sequences not matching the read. A more accurate taxonomic assignment of short reads can be made by mapping each read to the node in the reference taxonomy that provides the best precision and recall. We show that given a suffix array for the sequences in the reference taxonomy, a short read can be mapped to the node of the reference taxonomy with the best combined value of precision and recall in time linear in the size of the taxonomy subtree rooted at the lowest common ancestor of the matching sequences. An accurate taxonomic assignment of short reads can thus be made with about the same efficiency as when mapping each read to the lowest common ancestor of all matching sequences in a reference taxonomy. We demonstrate the effectiveness of our approach on several metagenomic datasets of marine and gut microbiota.

  5. Spin Parity Measurement of Centrally Produced $\\pi^{+}\\pi^{-}$ in Proton Proton Collisions at 800 GeV/c

    Energy Technology Data Exchange (ETDEWEB)

    Markianos, Kyriacos [Univ. of Massachusetts, Amherst, MA (United States)

    1998-02-01

    Experiment E690 at Fermilab recorded billion $p^+ p \\to p + X$ events using an 800 GeV/c proton beam and a liquid hydrogen target, during the 1991 fixed target run. We use a 0.5 billion subset of this sample, to study the reaction $p^+ p \\to p_s$ ($\\pi^+ \\pi^-)p_f$ for dipion invariant mass between threshold and 2.3 GeV/$c^2$. We perform a partial wave analysis for dipion invariant mass between threshold and 1.5 GeV/$c^2$. The assumption of S-wave dominance near threshold is sufficient to determine a single, continuous solution throughout the considered mass spectrum. Precision measurement of the production amplitude aids the mapping the low lying meson spectrum. Other possible studies using this data sample and analysis technique are: ( l) the extension of the amplitude analysis above the $1.5 GeV/c^2$ mass region using a the full event sample, and (2) the study of the produced amplitudes as a function of the relative angle between the two proton planes.

  6. Spin Parity Measurement of Centrally Produced $\\pi^{+}\\pi^{-}$ in Proton Proton Collisions at 800 GeV/c

    Energy Technology Data Exchange (ETDEWEB)

    Markianos, Kyriacos [Univ. of Massachusetts, Amherst, MA (United States)

    1998-02-01

    Experiment E690 at Fennilab recorded 5.5 billion p + p → p + X events using an 800 GeV/c proton beam and a liquid hydrogen target, during the 1991 fixed target run. We use a 0.5 billion subset of this sample, to study the reaction p + p → Ps + π-)p f for dipion invariant mass between threshold and 2.3 GeV/c2. We perform a partial wave analysis for dipion invariant mass between threshold and 1.5 GeV/c2. The assumption of S-wave dominance near threshold is sufficient to determine a single, continuous solution throughout the considered mass spectrum. Precision measurement of the production amplitude aids the mapping the low lying meson spectrum. Other possible studies using this data sample and analysis technique are: ( l) the extension of the amplitude analysis above the 1.5 Ge V tc2 mass region using a the full event sample, and (2) the study of the produced amplitudes as a function of the relative angle between the two proton planes.

  7. Azimuthal angular distributions in EDDE as a spin-parity analyser and glueball filter for the LHC

    Energy Technology Data Exchange (ETDEWEB)

    Petrov, Vladimir Alexeevich [Institute for High Energy Physics, 142 281, Protvino (Russian Federation); Ryutin, Roman Anatolievich [Institute for High Energy Physics, 142 281, Protvino (Russian Federation); Sobol, Andrei E. [Institute for High Energy Physics, 142 281, Protvino (Russian Federation); Guillaud, Jean-Paul [LAPP, Annecy (France)

    2005-06-01

    Exclusive Double Diffractive Events (EDDE) are analysed as the source of the information about the central system. The experimental possibilities for the exotic particles searches are considered. From the reggeized tensor current picture some azimuthal angle dependences were obtained to fit the data from the WA102 experiment and to make predictions for the LHC collider.

  8. The double-assignment method for the exponential chaotic tabu search in quadratic assignment problems

    Science.gov (United States)

    Shibata, Kazuaki; Horio, Yoshihiko; Aihara, Kazuyuki

    The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts features of the Lin-Kernighan algorithm. We then introduce chaotic neuro-dynamics into the double-assignment method to propose a novel exponential chaotic tabu search. We further improve the proposed exponential chaotic tabu search with the double-assignment method by enhancing the effect of chaotic neuro-dynamics.

  9. 24 CFR 203.350 - Assignment of mortgage.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment of mortgage. 203.350... SINGLE FAMILY MORTGAGE INSURANCE Contract Rights and Obligations Assignment of Mortgage § 203.350 Assignment of mortgage. (a) Assignment of modified mortgages pursuant to section 230, National Housing Act...

  10. 47 CFR 22.537 - Technical channel assignment criteria.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 2 2010-10-01 2010-10-01 false Technical channel assignment criteria. 22.537... assignment criteria. The rules in this section establish technical assignment criteria for the channels listed in § 22.531. These criteria permit channel assignments to be made in a manner such that reception...

  11. 47 CFR 22.567 - Technical channel assignment criteria.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 2 2010-10-01 2010-10-01 false Technical channel assignment criteria. 22.567... Technical channel assignment criteria. The rules in this section establish technical assignment criteria for... channel assignments to be made in a manner such that reception by public mobile receivers of signals from...

  12. The core and related solution concepts for infinite assignment games

    NARCIS (Netherlands)

    Llorca, Natividad; Sanchez-Soriano, Joaquin; Tijs, Stef; Timmer, Judith B.

    2004-01-01

    Assignment problems where both sets of agents that have to be matched are countably infinite, the so-called infinite assignment problems, are studied as well as the related cooperative assignment games. Further, several solution concepts for these assignment games are studied. The first one is the

  13. 48 CFR 52.232-23 - Assignment of Claims.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 2 2010-10-01 2010-10-01 false Assignment of Claims. 52....232-23 Assignment of Claims. As prescribed in 32.806(a)(1), insert the following clause: Assignment of Claims (JAN 1986) (a) The Contractor, under the Assignment of Claims Act, as amended, 31 U.S.C. 3727, 41...

  14. 7 CFR 1404.4 - Execution of assignment form.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Execution of assignment form. 1404.4 Section 1404.4... OF AGRICULTURE GENERAL REGULATIONS AND POLICIES ASSIGNMENT OF PAYMENTS § 1404.4 Execution of assignment form. (a)(1) The assignment of any FSA or CCC payment must be made by the execution of Form CCC-36...

  15. 28 CFR 524.72 - CIM assignment categories.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false CIM assignment categories. 524.72 Section... assignment categories. CIM cases are classified according to the following assignments: (a) Witness Security... or federal penal (which includes correctional and detention facilities) institutions. This assignment...

  16. 38 CFR 19.3 - Assignment of proceedings.

    Science.gov (United States)

    2010-07-01

    ... 38 Pensions, Bonuses, and Veterans' Relief 2 2010-07-01 2010-07-01 false Assignment of proceedings... Assignment of proceedings. (a) Assignment. The Chairman may assign a proceeding instituted before the Board, including any motion, to an individual Member or to a panel of three or more Members for adjudication...

  17. Constrained neural approaches to quadratic assignment problems.

    Science.gov (United States)

    Ishii, S; Sato, M

    1998-08-01

    In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.

  18. An Aggregation Approach for Group Multicriteria Assignment

    Directory of Open Access Journals (Sweden)

    George Rigopoulos

    2008-01-01

    Full Text Available We presented an aggregation approach for group multicriteria assignment decisions, where group members express their preferences on problem parameters in numeric format. Individual preferences are aggregated by WOWA operator following the majority concept and a group parameter set is derived that is used as input for the classification algorithm. In addition, we present a numeric example of the approach, demonstrating its applicability. The methodology has been applied to classification problems in business environment, with sufficient results depicting its validity for such problems.

  19. Strategy-Proof Assignment Of Multiple Resources

    DEFF Research Database (Denmark)

    Erlanson, Albin; Szwagrzak, Karol

    2015-01-01

    We examine the strategy-proof allocation of multiple resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. In the domain of multidimensional single-peaked preferences, we find that any allocation mechanism obtained...... by maximizing a separably concave function over a polyhedral extension of the set of Pareto-efficient allocations is strategy-proof. Moreover, these are the only strategy-proof, unanimous, consistent, and resource-monotonic mechanisms. These mechanisms generalize the parametric rationing mechanisms (Young, 1987...

  20. A Generalized Assignment Heuristic for Vehicle Routing

    Science.gov (United States)

    1979-08-01

    1977), 517-524. 20. Shuster, K. A. and D. A. Schur.- "A Heuristic Approach to Routing Solid Waste Collection Vehicles," U.S. Environmental Protection...this problem by ( VRP ). L. . . . .. i -3- Formulation of the Vehicle Routing Problem ( VRP ) min Z c X. (1)ijk 1) i jk S.t. Z aiYik < bk , k ,...,K (2) 1...developing a sophisticated solution theory for the traveling salesman and generalized assignment models embedded within ( VRP ). By con- trast

  1. Assignments, Details, and Transfers: Overseas Service

    Science.gov (United States)

    2001-08-30

    exception, soldiers stationed on Johnston Atoll , Enewetak Atoll , or Sinai, Egypt, will not be involuntarily extended. Soldiers assigned to these loca...OF THE PACIFIC IS- LANDS Micronesia (as indicated), Northern Marianas as indicated), Saipan 24 12 Marshall Islands (as indicated) Enewetak Atoll NA 12...5 and note 5 Johnston Atoll , Enewetak Atoll , Sinai, Egypt, note 6, table 6–1 Reasons for, table 6–1 180 day rule, 6–1c 30 day rule, 6–1b 60 day rule

  2. Replicating and Extending Research on the Partial Assignment Completion Effect: Is Sunk Cost Related to Partial Assignment Completion Strength?

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Taylor, Emily P.; Skinner, Christopher H.; Parkhurst, John; Nalls, Meagan L.

    2014-01-01

    After students acquire a skill, mastery often requires them to choose to engage in assigned academic activities (e.g., independent seatwork, and homework). Although students may be more likely to choose to work on partially completed assignments than on new assignments, the partial assignment completion (PAC) effect may not be very powerful. The…

  3. Dynamic assignment: there is an equilibrium !

    CERN Document Server

    Meunier, Frédéric

    2008-01-01

    Given a network with a continuum of users at some origins, suppose that the users wish to reach specific destinations, but that they are not indifferent to the time needed to reach their destination. They may have several possibilities (of routes or deparure time), but their choices modify the travel times on the network. Hence, each user faces the following problem: given a pattern of travel times for the different possible routes that reach the destination, find a shortest path. The situation in a context of perfect information is a so-called Nash equilibrium, and the question whether there is such an equilibrium and of finding it if it exists is the so-called equilibrium assignment problem. It arises for various kind of networks, such as computers, communication or transportation network. When each user occupies permanently the whole route from the origin to its destination, we call it the static assignment problem, which has been extensively studied with pioneers works by Wardrop or Beckmann. A less studi...

  4. Equitable traffic assignment with environmental cost functions

    Energy Technology Data Exchange (ETDEWEB)

    Benedek, C.M. [Univ. of Alberta, Edmonton, Alberta (Canada). Dept. of Civil and Environmental Engineering; Rilett, L.R. [Texas A and M Univ., College Station, TX (United States). Dept. of Civil Engineering

    1998-01-01

    In the past 10 years increased importance has been placed on public participation and environmental concerns in transportation system decision-making. While there are numerous societal objectives to consider when planning and operating a transportation system, it is not clear whether the optimal strategy with respect to one objective is also the optimal strategy with respect to the other objectives. This paper examines how new objectives and environmental considerations can be modeled within the traditional, macroscopic traffic assignment methodology. In addition, a new methodology for modeling the assignment of vehicles in realistic networks is developed based on equitable, rather than user-equilibrium or system-optimal, principles. The basic premise is that with the advent of intelligent transportation systems (ITS) the operation of the transportation system based on the objectives of the general public, rather than the traveling public and system operators, is feasible. A methodology for modeling these situations is required. All of the approaches discussed here were tested on a calibrated network from Edmonton, Alberta, Canada.

  5. Genetic spectrum assignment model with constraints in cognitive radio networks

    Directory of Open Access Journals (Sweden)

    Fang Ye

    2011-06-01

    Full Text Available The interference constraints of genetic spectrum assignment model in cognitive radio networks are analyzed in this paper. An improved genetic spectrum assignment model is proposed. The population of genetic algorithm is divided into two sets, the feasible spectrum assignment strategies and the randomly updated spectrum assignment strategies. The penalty function is added to the utility function to achieve the spectrum assignment strategy that satisfies the interference constraints and has better fitness. The proposed method is applicable in both the genetic spectrum assignment model and the quantum genetic spectrum assignment mode. It can ensure the randomness of partial chromosomes in the population to some extent, and reduce the computational complexity caused by the constraints-free procedure after the update of population. Simulation results show that the proposed method can achieve better performance than the conventional genetic spectrum assignment model and quantum genetic spectrum assignment model

  6. [Rapid assessment of critical quality attributes of Chinese materia medica (II): strategy of NIR assignment].

    Science.gov (United States)

    Pei, Yan-Ling; Wu, Zhi-Sheng; Shi, Xin-Yuan; Zhou, Lu-Wei; Qiao, Yan-Jiang

    2014-09-01

    The present paper firstly reviewed the research progress and main methods of NIR spectral assignment coupled with our research results. Principal component analysis was focused on characteristic signal extraction to reflect spectral differences. Partial least squares method was concerned with variable selection to discover characteristic absorption band. Two-dimensional correlation spectroscopy was mainly adopted for spectral assignment. Autocorrelation peaks were obtained from spectral changes, which were disturbed by external factors, such as concentration, temperature and pressure. Density functional theory was used to calculate energy from substance structure to establish the relationship between molecular energy and spectra change. Based on the above reviewed method, taking a NIR spectral assignment of chlorogenic acid as example, a reliable spectral assignment for critical quality attributes of Chinese materia medica (CMM) was established using deuterium technology and spectral variable selection. The result demonstrated the assignment consistency according to spectral features of different concentrations of chlorogenic acid and variable selection region of online NIR model in extract process. Although spectral assignment was initial using an active pharmaceutical ingredient, it is meaningful to look forward to the futurity of the complex components in CMM. Therefore, it provided methodology for NIR spectral assignment of critical quality attributes in CMM.

  7. Rationalization of some genetic anticodonic assignments

    Science.gov (United States)

    Lacey, J. C., Jr.; Hall, L. M.; Mullins, D. W., Jr.

    1985-01-01

    The hydrophobicity of most amino acids correlates well with that of their anticodon nucleotides, with Trp, Tyr, Ile, and Ser being the exceptions to this rule. Using previous data on hydrophobicity and binding constants, and new data on rates of esterification of polyadenylic acid with several N-acetylaminoacyl imidazolides, several of the anticodon assignments are rationalized. Chemical reasons are shown supporting the idea of the inclusion of the Ile in the catalog of biological amino acids late in the evolution, through a mutation of the existing tRNA and its aminoacyl-tRNA-synthetase. It was found that an addition of hexane increases the incorporation of hydrophobic Ac-Phe into poly-A, in support of the Fox (1965) and Oparin (1965) emphasis on the biogenetic importance of phase-separated systems.

  8. INDEXING WORKSHOP: HOW TO ASSIGN KEYWORDS

    Energy Technology Data Exchange (ETDEWEB)

    Sternberg, Virginia

    1979-09-01

    You have heard about issues surrounding indexing and retrieval of nuclear records and automation and micrographics of these records. Now we are going to get each of you involved in indexing and assigning keywords. The first part of this hands-on workshop will be a very basic, elementary step-by-step introduction, concentrating on how to assign keywords. It is a workshop for beginners, People who have never done it before. It is planned to demonstrate what an analyst has to do to index and assign keywords to a document. Then I will take some pages of a report and demonstrate how I choose keywords for it. Then each of you will have a chance to do the same thing with similar pages from another report. Then we will discuss the variations ln the keywords you individually assigned. There are many systems that can be used. In this particular workshop we will cover only a system of building your own keyword listing as you index your documents. We will be discussing keywords or descriptors or subject words, but first I want to point out a few other critical points about indexing. When developing an indexing project the most important thing to do first lS decide what elements you want to retrieve by. Whether you go into a large computer retrieval system or a small three-by-five card system, you have to decide in advance what you want to retrieve. Then you can go on from there. If you only need to search by equipment number or by purchase order or by contract number, then you can use a very simple retrieval system. But if you want to be able to retrieve a record by any combination of elements, then you have to consistently input these into your system. For example, if you want to be able to ask for the drawings of the piping in the secondary cooling system, level 3, manufactured by a certain vendor, then you must have put the information into the index by a retrieval file point, in advance. I want to stress that the time spent in deciding what has to be retrievable is never

  9. Classifier Assignment by Corpus-based Approach

    CERN Document Server

    Sornlertlamvanich, V; Meknavin, S; Sornlertlamvanich, Virach; Pantachat, Wantanee; Meknavin, Surapant

    1994-01-01

    This paper presents an algorithm for selecting an appropriate classifier word for a noun. In Thai language, it frequently happens that there is fluctuation in the choice of classifier for a given concrete noun, both from the point of view of the whole spe ech community and individual speakers. Basically, there is no exect rule for classifier selection. As far as we can do in the rule-based approach is to give a default rule to pick up a corresponding classifier of each noun. Registration of classifier for each noun is limited to the type of unit classifier because other types are open due to the meaning of representation. We propose a corpus-based method (Biber, 1993; Nagao, 1993; Smadja, 1993) which generates Noun Classifier Associations (NCA) to overcome the problems in classifier assignment and semantic construction of noun phrase. The NCA is created statistically from a large corpus and recomposed under concept hierarchy constraints and frequency of occurrences.

  10. Improving load balance with flexibly assignable tasks

    Energy Technology Data Exchange (ETDEWEB)

    Pinar, Ali; Hendrickson, Bruce

    2003-09-09

    In many applications of parallel computing, distribution ofthe data unambiguously implies distribution of work among processors. Butthere are exceptions where some tasks can be assigned to one of severalprocessors without altering the total volume of communication. In thispaper, we study the problem of exploiting this flexibility in assignmentof tasks to improve load balance. We first model the problem in terms ofnetwork flow and use combinatorial techniques for its solution. Ourparametric search algorithms use maximum flow algorithms for probing on acandidate optimal solution value. We describe two algorithms to solve theassignment problem with \\logW_T and vbar P vbar probe calls, w here W_Tand vbar P vbar, respectively, denote the total workload and number ofproce ssors. We also define augmenting paths and cuts for this problem,and show that anyalgorithm based on augmenting paths can be used to findan optimal solution for the task assignment problem. We then consideracontinuous version of the problem, and formulate it as a linearlyconstrained optimization problem, i.e., \\min\\|Ax\\|_\\infty,\\; {\\rms.t.}\\;Bx=d. To avoid solving an intractable \\infty-norm optimization problem,we show that in this case minimizing the 2-norm is sufficient to minimizethe \\infty-norm, which reduces the problem to the well-studiedlinearly-constrained least squares problem. The continuous version of theproblem has the advantage of being easily amenable to parallelization.Our experiments with molecular dynamics and overlapped domaindecomposition applications proved the effectiveness of our methods withsignificant improvements in load balance. We also discuss how ourtechniques can be enhanced for heterogeneous systems.

  11. Protein side-chain resonance assignment and NOE assignment using RDC-defined backbones without TOCSY data.

    Science.gov (United States)

    Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall

    2011-08-01

    One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA: (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA: extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA: assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA: have backbone

  12. Assignment Choice: Do Students Choose Briefer Assignments or Finishing What They Started?

    Science.gov (United States)

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; O'Neil, Michael; Conley, Elisha

    2010-01-01

    Academic skill development requires engagement in effortful academic behaviors. Although students may be more likely to choose to engage in behaviors that require less effort, they also may be motivated to complete assignments that they have already begun. Seventh-grade students (N = 88) began a mathematics computation worksheet, but were stopped…

  13. Performance comparison of 2D assignment algorithms for assigning truth objects to measured tracks

    Science.gov (United States)

    Levedahl, Mark

    2000-07-01

    The processing time requirements of several algorithms for solving the 2-d (also called single frame) linear assignment problem are compared, along with their accuracy given either random or biased measurement errors. The specific problem considered is that of assigning measurements to truth objects using costs that are the chi-squared distances between them. Performance comparisons are provided for the algorithms implemented both in a compiled language C or FORTRAN) as well as the interpretive MatLab language. Accuracy considerations show optimal assignment algorithm is preferred if biased measurement errors are present. The Jonker-Volgenant-Castanon (JVC) algorithm is the preferred approach considering both average and maximum solution time. The Auction algorithm finds favor due to being both efficient as well as easy to understand, but is never faster and often much slower than the JVC algorithm. Both algorithms are dramatically faster than the Munkres algorithm. The greedy nearest neighbor algorithm is an ad hoc solution to provide a sub-optimal but unique solution more cheaply than the optimal assignment algorithms. However, the JVC algorithm is as fast as the greedy for simple problems, marginally slower at hard problems, and is vastly more accurate in the presence of measurement biases.

  14. An addendum on sensitivity analysis of the optimal assignment

    NARCIS (Netherlands)

    Volgenant, A.

    2006-01-01

    We point out that sensitivity results for the linear assignment problem can be produced by a shortest path based approach in a straightforward manner and as efficient as finding an optimal solution. Keywords: Assignment; Sensitivity analysis

  15. 7 CFR 1404.3 - Payments which may be assigned.

    Science.gov (United States)

    2010-01-01

    ... OF AGRICULTURE GENERAL REGULATIONS AND POLICIES ASSIGNMENT OF PAYMENTS § 1404.3 Payments which may be assigned. Except as otherwise provided in this part or in individual program regulations, contracts...

  16. Evolution of Various Library Instruction Strategies: Using Student Feedback to Create and Enhance Online Active Learning Assignments

    Directory of Open Access Journals (Sweden)

    Marcie Lynne Jacklin

    2013-06-01

    Full Text Available This case study traces the evolution of library assignments for biological science students from paper-based workbooks in a blended (hands-on workshop to blended learning workshops using online assignments to online active learning modules which are stand-alone without any face-to-face instruction. As the assignments evolved to adapt to online learning supporting materials in the form of PDFs (portable document format, screen captures and screencasting were embedded into the questions as teaching moments to replace face-to-face instruction. Many aspects of the evolution of the assignment were based on student feedback from evaluations, input from senior lab demonstrators and teaching assistants, and statistical analysis of the students’ performance on the assignment. Advantages and disadvantages of paper-based and online assignments are discussed. An important factor for successful online learning may be the ability to get assistance.

  17. Tank Fire Control Systems Accuracy Assignment Based on Fuzzy Comprehensive Judgment Method

    Institute of Scientific and Technical Information of China (English)

    刘文果; 陈杰; 窦丽华

    2003-01-01

    A method of accuracy assignment based on fuzzy comprehensive judgment method (FCJM) in tank fire control system is proposed. From the flowing route of the error sources and their respective correlative signals, the transfer functions of several sources are analysed by means of mathematic simulation, and FCJM is applied to obtain the cost comprehensive factor for each part of system, combining its error sensitivity factor the mathematical model is built to solve the accuracy assignment problem. Simulation result shows the proposed method can help designer of tank fire control system work out an optimal system more efficiently and more economically.

  18. Assignment Procedures in the Air Force Procurement Management Information System.

    Science.gov (United States)

    Ward, Joe H., Jr.; And Others

    An overview is presented of the procedure for offering jobs in the Air Force Procurement Management Information System (PROMIS), an assignment system which makes possible the use of human resources research findings to improve individual personnel assignments. A general framework for viewing personnel assignment systems is presented; then job…

  19. 18 CFR 349.7 - Assignment for oral hearing.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Assignment for oral... FINDINGS AND PROPOSED REMEDIES § 349.7 Assignment for oral hearing. Except when there are no material facts... giving consent to the shortened procedure, and instead seeking assignment for hearing as provided for by...

  20. 78 FR 32710 - Proposed Collection of Information: Assignment Form

    Science.gov (United States)

    2013-05-31

    ... Fiscal Service Bureau of Fiscal Service Proposed Collection of Information: Assignment Form AGENCY... information collection. By this notice, the Fiscal Service solicits comments concerning the form ``Assignment...: Assignment Form. OMB Number: 1510-0035. Form Number: FMS 6314. Abstract: This form is used when an...

  1. Solving the k-cardinality assignment problem by transformation

    NARCIS (Netherlands)

    Volgenant, A.

    2004-01-01

    The k-cardinality Linear Assignment Problem (k-LAP) with k a given integer is a generalization of the linear assignment problem: one wants to assign k rows (a free choice out of more rows) to k columns (a free choice out of more columns) minimizing the sum of the corresponding costs. For this

  2. 48 CFR 32.1105 - Assignment of claims.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Assignment of claims. 32... CONTRACTING REQUIREMENTS CONTRACT FINANCING Electronic Funds Transfer 32.1105 Assignment of claims. The use of EFT payment methods is not a substitute for a properly executed assignment of claims in accordance...

  3. 26 CFR 26.2651-1 - Generation assignment.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 14 2010-04-01 2010-04-01 false Generation assignment. 26.2651-1 Section 26... Generation assignment. (a) Special rule for persons with a deceased parent—(1) In general. This paragraph (a... (ii) The generation assignment of the individual's youngest living lineal ancestor who is also a...

  4. 32 CFR 700.305 - Assignment of functions.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 5 2010-07-01 2010-07-01 false Assignment of functions. 700.305 Section 700.305 National Defense Department of Defense (Continued) DEPARTMENT OF THE NAVY UNITED STATES NAVY REGULATIONS... Secretary of the Navy § 700.305 Assignment of functions. The Secretary of the Navy may assign such functions...

  5. 28 CFR 545.23 - Inmate work/program assignment.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Inmate work/program assignment. 545.23... WORK AND COMPENSATION Inmate Work and Performance Pay Program § 545.23 Inmate work/program assignment... work in any assignment or area other than housekeeping tasks in the inmate's own cell and in the...

  6. 18 CFR 286.109 - Assignment for oral hearing.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Assignment for oral... Disposition of Contested Audit Findings and Proposed Remedies § 286.109 Assignment for oral hearing. Except... assignment for hearing as provided for by subpart E of part 385 of this chapter, the Commission will not...

  7. 5 CFR 9701.362 - Special assignment payments.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Special assignment payments. 9701.362... assignment payments. DHS will issue implementing directives regarding additional payments for employees serving on special assignments in positions placing significantly greater demands on the employee than...

  8. 48 CFR 42.1105 - Assignment of criticality designator.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Assignment of criticality designator. 42.1105 Section 42.1105 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION....1105 Assignment of criticality designator. Contracting officers shall assign a criticality designator...

  9. 18 CFR 41.7 - Assignment for oral hearing.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Assignment for oral... § 41.7 Assignment for oral hearing. Except when there are no material facts in dispute, when a person... shortened procedure, and instead seeking assignment for hearing as provided for by subpart E of part 385 of...

  10. 44 CFR 323.5 - Assignment of resources.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Assignment of resources. 323... PERIOD (DMO-4) § 323.5 Assignment of resources. Resources required for essential uses, including manpower... to: (a) Protect and to prevent waste or dissipation of resources prior to their assignment to...

  11. Optimal assignment of incoming flights to baggage carousels at airports

    DEFF Research Database (Denmark)

    Barth, Torben C.

    The problem considered in this report is an assignment problem occurring at airports. This problem concerns the assignment of baggage carousels in baggage claim halls to arriving aircraft (baggage carousel assignment problem). This is a highly dynamic problem since disruptions frequently occur...

  12. 4 CFR 3.1 - Appointment, promotion, and assignment.

    Science.gov (United States)

    2010-01-01

    ... 4 Accounts 1 2010-01-01 2010-01-01 false Appointment, promotion, and assignment. 3.1 Section 3.1 Accounts GOVERNMENT ACCOUNTABILITY OFFICE PERSONNEL SYSTEM EMPLOYMENT § 3.1 Appointment, promotion, and assignment. Employees of GAO shall be appointed, promoted and assigned solely on the basis of merit and...

  13. Assessment of a Diversity Assignment in a PR Principles Course

    Science.gov (United States)

    Gallicano, Tiffany Derville; Stansberry, Kathleen

    2012-01-01

    This study assesses an assignment for incorporating diversity into the principles of public relations course. The assignment is tailored to the challenges of using an active learning approach in a large lecture class. For the assignment, students write a goal, objectives, strategies, an identification of tactics, and evaluation plans for either…

  14. 7 CFR 762.160 - Assignment of guarantee.

    Science.gov (United States)

    2010-01-01

    ... of the loan. The holder must assign the guaranteed portion back to the original lender if requested... AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.160 Assignment of guarantee. (a) The following general requirements apply to assigning guaranteed loans: (1) Subject to Agency concurrence, the...

  15. 46 CFR 387.5 - Surplus property assignment recommendation.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 8 2010-10-01 2010-10-01 false Surplus property assignment recommendation. 387.5 Section 387.5 Shipping MARITIME ADMINISTRATION, DEPARTMENT OF TRANSPORTATION MISCELLANEOUS UTILIZATION AND... property assignment recommendation. Before any assignment recommendation is submitted to the...

  16. Solving the k-cardinality assignment problem by transformation

    NARCIS (Netherlands)

    Volgenant, A.

    2004-01-01

    The k-cardinality Linear Assignment Problem (k-LAP) with k a given integer is a generalization of the linear assignment problem: one wants to assign k rows (a free choice out of more rows) to k columns (a free choice out of more columns) minimizing the sum of the corresponding costs. For this polyno

  17. Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments

    Science.gov (United States)

    Cavdar, Gamze; Doe, Sue

    2012-01-01

    Traditional writing assignments often fall short in addressing problems in college students' writing as too often these assignments fail to help students develop critical thinking skills and comprehension of course content. This article reports the use of a two-part (staged) writing assignment with postscript as a strategy for improving critical…

  18. Evolutionary algorithm based index assignment algorithm for noisy channel

    Institute of Scientific and Technical Information of China (English)

    李天昊; 余松煜

    2004-01-01

    A globally optimal solution to vector quantization (VQ) index assignment on noisy channel, the evolutionary algorithm based index assignment algorithm (EAIAA), is presented. The algorithm yields a significant reduction in average distortion due to channel errors, over conventional arbitrary index assignment, as confirmed by experimental results over the memoryless binary symmetric channel (BSC) for any bit error.

  19. Application of a Dynamic Programming Algorithm for Weapon Target Assignment

    Science.gov (United States)

    2016-02-01

    UNCLASSIFIED UNCLASSIFIED Application of a Dynamic Programming Algorithm for Weapon Target Assignment Lloyd Hammond Weapons and...Combat Systems Division Defence Science and Technology Group DST Group-TR-3221 ABSTRACT Threat evaluation and weapon assignment...dynamic programming algorithm for Weapon Target Assignment which, after more rigorous testing, could be used as a concept demonstrator and as an auxiliary

  20. The Presentation Assignment: Creating Learning Opportunities for Diverse Student Populations.

    Science.gov (United States)

    Spencer, Brenda H.; Bartle-Angus, Kathryn

    2000-01-01

    Finds the presentation assignment to be an effective method of providing students with the opportunity to apply the literacy skills they are learning in ways that are personally meaningful. Describes the presentation assignment framework and provides an example of an assignment that required students to analyze and interpret works of literature…

  1. Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments

    Science.gov (United States)

    Cavdar, Gamze; Doe, Sue

    2012-01-01

    Traditional writing assignments often fall short in addressing problems in college students' writing as too often these assignments fail to help students develop critical thinking skills and comprehension of course content. This article reports the use of a two-part (staged) writing assignment with postscript as a strategy for improving critical…

  2. Commentary: prognosis revisited: a system for assigning periodontal prognosis.

    Science.gov (United States)

    Kwok, Vivien; Caton, Jack G

    2007-11-01

    Prognosis is an integral part of the periodontal practice because it directly influences treatment planning. However, there is limited direct evidence in the literature regarding the assignment of periodontal prognosis. There are several important concepts to consider in developing a system of periodontal prognosis. Traditional systems are based on tooth loss and may have limited use for patient management. On the other hand, prognosis can be based on stability of the periodontal supporting apparatus, which is influenced by more evidence-based factors and may be more useful for patient management. Other important concepts include the timing of the projection (short and long term) and the consideration of individual teeth versus the overall dentition. Historically, several authors have formulated and investigated their own prognostication systems. Results were variable, but they generally showed that systems based on tooth loss were unpredictable over the long term. Therefore, the purpose of this report is to review relevant literature and propose a new periodontal prognostication system.

  3. Predicting Assignment Submissions in a Multiclass Classification Problem

    Directory of Open Access Journals (Sweden)

    Bogdan Drăgulescu

    2015-08-01

    Full Text Available Predicting student failure is an important task that can empower educators to counteract the factors that affect student performance. In this paper, a part of the bigger problem of predicting student failure is addressed: predicting the students that do not complete their assignment tasks. For solving this problem, real data collected by our university’s educational platform was used. Because the problem consisted of predicting one of three possible classes (multi-class classification, the appropriate algorithms and methods were selected. Several experiments were carried out to find the best approach for this prediction problem and the used data set. An approach of time segmentation is proposed in order to facilitate the prediction from early on. Methods that address the problems of high dimensionality and imbalanced data were also evaluated. The outcome of each approach is shown and compared in order to select the best performing classification algorithm for the problem at hand.

  4. Regulatory focus and the assignment of punishment

    Directory of Open Access Journals (Sweden)

    Chloe Carmichael

    2007-06-01

    Full Text Available Regulatory Focus has been demonstrated to influence human behavior in a number of domains, such as object valuation and readiness to commit time or money to social projects. It has also been demonstrated to influence an individual’s approach to mistakes; and a person’s preference for global or local processing of information. The present work seeks to consider how regulatory focus might interact with punitive behaviors, specifically, the assignment of legal punishment. In this study, 240 undergraduates completed a series of written instruments that assessed their regulatory focus. They read a vignette that described a target that commits a crime, is detected by the police, and is arrested due to a careless mistake. Participants were asked what level of legal punishment they deemed appropriate. Participants’ punitive evaluations show that there are significant interactions a between the regulatory focus of the participant and the regulatory focus of the target and b between the regulatory focus of the participant and the level of detail used to describe the target and her behavior. In each case, when the regulatory foci matched, causing ‘fit,’ the participant was more lenient than in the non-fit condition.

  5. Reference databases for taxonomic assignment in metagenomics.

    Science.gov (United States)

    Santamaria, Monica; Fosso, Bruno; Consiglio, Arianna; De Caro, Giorgio; Grillo, Giorgio; Licciulli, Flavio; Liuni, Sabino; Marzano, Marinella; Alonso-Alemany, Daniel; Valiente, Gabriel; Pesole, Graziano

    2012-11-01

    Metagenomics is providing an unprecedented access to the environmental microbial diversity. The amplicon-based metagenomics approach involves the PCR-targeted sequencing of a genetic locus fitting different features. Namely, it must be ubiquitous in the taxonomic range of interest, variable enough to discriminate between different species but flanked by highly conserved sequences, and of suitable size to be sequenced through next-generation platforms. The internal transcribed spacers 1 and 2 (ITS1 and ITS2) of the ribosomal DNA operon and one or more hyper-variable regions of 16S ribosomal RNA gene are typically used to identify fungal and bacterial species, respectively. In this context, reliable reference databases and taxonomies are crucial to assign amplicon sequence reads to the correct phylogenetic ranks. Several resources provide consistent phylogenetic classification of publicly available 16S ribosomal DNA sequences, whereas the state of ribosomal internal transcribed spacers reference databases is notably less advanced. In this review, we aim to give an overview of existing reference resources for both types of markers, highlighting strengths and possible shortcomings of their use for metagenomics purposes. Moreover, we present a new database, ITSoneDB, of well annotated and phylogenetically classified ITS1 sequences to be used as a reference collection in metagenomic studies of environmental fungal communities. ITSoneDB is available for download and browsing at http://itsonedb.ba.itb.cnr.it/.

  6. A multicast dynamic wavelength assignment algorithm based on matching degree

    Institute of Scientific and Technical Information of China (English)

    WU Qi-wu; ZHOU Xian-wei; WANG Jian-ping; YIN Zhi-hong; ZHANG Long

    2009-01-01

    The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied. A new multicast dynamic wavelength assignment algorithm is presented based on matching degree. First, the wavelength matching degree between available wavelengths and multicast routing trees is introduced into the algorithm. Then, the wavelength assign-ment is translated into the maximum weight matching in bipartite graph, and this matching problem is solved by using an extended Kuhn-Munkres algorithm. The simulation results prove that the overall optimal wavelength assignment scheme is obtained in polynomial time. At the same time, the proposed algorithm can reduce the connecting blocking probability and improve the system resource utilization.

  7. A Bayesian approach to simultaneously quantify assignments and linguistic uncertainty

    Energy Technology Data Exchange (ETDEWEB)

    Chavez, Gregory M [Los Alamos National Laboratory; Booker, Jane M [BOOKER SCIENTIFIC FREDERICKSBURG; Ross, Timothy J [UNM

    2010-10-07

    Subject matter expert assessments can include both assignment and linguistic uncertainty. This paper examines assessments containing linguistic uncertainty associated with a qualitative description of a specific state of interest and the assignment uncertainty associated with assigning a qualitative value to that state. A Bayesian approach is examined to simultaneously quantify both assignment and linguistic uncertainty in the posterior probability. The approach is applied to a simplified damage assessment model involving both assignment and linguistic uncertainty. The utility of the approach and the conditions under which the approach is feasible are examined and identified.

  8. 31 CFR 306.56 - Assignment of securities registered in the names of or assigned to two or more persons.

    Science.gov (United States)

    2010-07-01

    ... PUBLIC DEBT GENERAL REGULATIONS GOVERNING U.S. SECURITIES Assignments by or in Behalf of Individuals... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Assignment of securities registered in the names of or assigned to two or more persons. 306.56 Section 306.56 Money and Finance:...

  9. Computational Aspects of Assigning Agents to a Line

    DEFF Research Database (Denmark)

    Aziz, Haris; Hougaard, Jens Leth; Moreno-Ternero, Juan D.

    2017-01-01

    We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. We introduce a general approach to compute aggregate gap-minimizing assignments, as well as gap-egalitarian assignme......We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. We introduce a general approach to compute aggregate gap-minimizing assignments, as well as gap......-egalitarian assignments. The approach relies on an algorithm which is shown to be faster than general purpose algorithms for the assignment problem. We also extend the approach to probabilistic assignments and explore the computational features of existing, as well as new, methods for this setting....

  10. Traffic-Aware Channel Assignment in Wireless Sensor Networks

    Science.gov (United States)

    Wu, Yafeng; Keally, Matthew; Zhou, Gang; Mao, Weizhen

    Existing frequency assignment efforts in wireless sensor network research focus on balancing available physical frequencies among neighboring nodes, without paying attention to the fact that different nodes have different traffic volumes. Ignoring the different traffic requirements in different nodes in frequency assignment design leads to poor MAC performance. Therefore, in this paper, we are motivated to propose traffic-aware frequency assignment, which considers nodes’ traffic volumes when making frequency decisions. We incorporate our traffic-aware frequency assignment design into an existing multi-channel MAC, and compare the performance with two conventional frequency assignment schemes. Our performance evaluation demonstrates that traffic-aware channel assignment can greatly improve multi-channel MAC performance. Our traffic-aware assignment scheme greatly enhances the packet delivery ratio and system throughput, while reducing channel access delay and energy consumption.

  11. assignFAST: An Autosuggest based tool for FAST Subject Assignment

    Directory of Open Access Journals (Sweden)

    Rick Bennett

    2014-03-01

    Full Text Available Subject assignment is really a three-phase task. The first phase is intellectual—reviewing the material and determining its topic. The second phase is more mechanical, identifying the correct subject heading(s.  The final phase is retyping or cutting and pasting the heading(s into the cataloging interface along with any diacritics, and potentially correcting formatting and subfield coding. If authority control is available in the interface, some of these tasks may be automated or partially automated. A cataloger with a reasonable knowledge of FAST[i],[ii] or even LCSH[iii] can quickly get to the proper heading, but usually needs to confirm the final details—was it plural? Am I thinking of an alternate form? Is it inverted? Etc. This often requires consulting the full authority file interface. assignFAST is a Web service that consolidates the entire second phase of the manual process of subject assignment for FAST subjects into a single step based on autosuggest technology. [i] Chan, Lois Mai and Edward T. O'Neill.  FAST: Faceted Application of Subject Terminology, Prnciples and Applications Libraries Unlimited, Santa Barbara, 2010. http://lu.com/showbook.cfm?isbn=9781591587224. [ii] OCLC Research Activities associated with FAST are summarized at  http://www.oclc.org/research/activities/fast/ [iii] Chan, Lois M. Library of Congress Subject Headings : Principles and Application: Principles and Application. Westport, Conn: Libraries Unlimited, 2005.

  12. Equilibrium model and algorithm of urban transit assignment based on augmented network

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    The passenger flow assignment problem for the urban transit network is relatively complicated due to the complexity of the network structure and many factors influencing the passengers’ route and line choices. In the past three decades, many models have been proposed to solve the passenger flow assignment problem. However, the common-line problem remains challenging in transit flow assignment. In this paper, the characteristics of the urban transit network is analysed and a new technique of augmented network is proposed to represent the urban transit system. The purpose is to eliminate the complex common-line problem when modeling transit passenger flow assignment. Through this augmentation technique, the urban transit system can be represented by an augmented network-it then behaves like a simple network and can be used as a generalized network for traffic assignment or network analysis. This paper presents a user equilibrium model for the urban transit assignment problem based on such a technique. A numerical example is also provided to illustrate the approach.

  13. Bag-of-features based medical image retrieval via multiple assignment and visual words weighting

    KAUST Repository

    Wang, Jingyan

    2011-11-01

    Bag-of-features based approaches have become prominent for image retrieval and image classification tasks in the past decade. Such methods represent an image as a collection of local features, such as image patches and key points with scale invariant feature transform (SIFT) descriptors. To improve the bag-of-features methods, we first model the assignments of local descriptors as contribution functions, and then propose a novel multiple assignment strategy. Assuming the local features can be reconstructed by their neighboring visual words in a vocabulary, reconstruction weights can be solved by quadratic programming. The weights are then used to build contribution functions, resulting in a novel assignment method, called quadratic programming (QP) assignment. We further propose a novel visual word weighting method. The discriminative power of each visual word is analyzed by the sub-similarity function in the bin that corresponds to the visual word. Each sub-similarity function is then treated as a weak classifier. A strong classifier is learned by boosting methods that combine those weak classifiers. The weighting factors of the visual words are learned accordingly. We evaluate the proposed methods on medical image retrieval tasks. The methods are tested on three well-known data sets, i.e., the ImageCLEFmed data set, the 304 CT Set, and the basal-cell carcinoma image set. Experimental results demonstrate that the proposed QP assignment outperforms the traditional nearest neighbor assignment, the multiple assignment, and the soft assignment, whereas the proposed boosting based weighting strategy outperforms the state-of-the-art weighting methods, such as the term frequency weights and the term frequency-inverse document frequency weights. © 2011 IEEE.

  14. Predicting Satisfaction with Group Work Assignments

    Science.gov (United States)

    Burdett, Jane; Hastie, Brianne

    2009-01-01

    Universities are increasingly using group based assessment tasks; however, as with work-place teams, such tasks often elicit mixed feelings from participants. This study investigated factors that may predict student satisfaction with group work at university. Final-year business students completed a questionnaire addressing experiences of group…

  15. Optimality aspects with assigning of Magistrates to Sessions and Teams of the Amsterdam Criminal Court

    NARCIS (Netherlands)

    Schreuder, Jan; Burke, E.K.; Rudova, H.

    2006-01-01

    In the criminal court (Arrondissements rechtbank, sector strafrecht) of Amsterdam the assignment of magistrates (judges, officers, etc) to sessions needed to handle the cases presented, has become a problem last years mainly caused by the increase of so called mega-sessions. One complicating factor

  16. Does Empathy Predict Instructional Assignment-Related Stress? A Study in Special and General Education Teachers

    Science.gov (United States)

    Platsidou, Maria; Agaliotis, Ioannis

    2017-01-01

    The role of empathy in the teaching profession has been vastly investigated in relation to its effect on students, but research on how teachers' empathy affects their own well-being at work is limited. This study investigated empathy and instructional assignment-related stress factors of primary school teachers serving in general or special…

  17. Does Empathy Predict Instructional Assignment-Related Stress? A Study in Special and General Education Teachers

    Science.gov (United States)

    Platsidou, Maria; Agaliotis, Ioannis

    2017-01-01

    The role of empathy in the teaching profession has been vastly investigated in relation to its effect on students, but research on how teachers' empathy affects their own well-being at work is limited. This study investigated empathy and instructional assignment-related stress factors of primary school teachers serving in general or special…

  18. Protein Side-Chain Resonance Assignment and NOE Assignment Using RDC-Defined Backbones without TOCSY Data3

    Science.gov (United States)

    Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall

    2011-01-01

    One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA have backbone RMSD 0

  19. Impact of reflective writing assignments on dental students' views of cultural competence and diversity.

    Science.gov (United States)

    Isaac, Carol; Behar-Horenstein, Linda; Lee, Barbara; Catalanotto, Frank

    2015-03-01

    To respond to widespread disparities in access to oral health care, the Institute of Medicine, the Commission on Dental Accreditation (CODA), and the U.S. surgeon general have stressed that prospective dentists should become culturally competent, socially responsible practitioners. The aim of this study was to examine linguistic differences in dental students' reflective writing assignments before and after interviewing an individual who was culturally different from themselves. The authors analyzed 160 documents from 80 first-year dental students at the University of Florida in 2012. This cohort consisted of 36 male (45%) and 44 female (55%) students; 26 (32%) were from underrepresented minority (URM) groups and 54 (68%) were identified as white non-minority. Text analysis software identified word counts, categories, frequencies, and contexts. Significantly positive differences occurred for interviews between assignments 1 and 2 (p=0.005 to pcultural diversity. Differences were observed for Factor 1 ("important others' influence") between assignments (p<0.001), assignments by interview categories (p=0.033), and URM/majority participants by assignments by interview category (p=0.018). Factor 4 ("my social world in relation to others") was statistically different between assignments for URM/majority participants (p=0.019). Factor 5 ("wrong because") was statistically different for gender (p=0.041), suggesting that males may have experienced a rebound effect from stereotype suppression. The findings suggest that the use of reflective writing and interviews affected the students' awareness of how important others had influenced their lives and attitudes and facilitated their questioning preconceived assumptions. Reactions to coursework focusing on social and personal domains warrant further investigation.

  20. CYCLE TIMES ASSIGNMENT OF NONLINEAR DISCRETE EVENT DYNAMIC SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    CHEN Wende

    2000-01-01

    In this paper, nonautonomous models of Discrete Event Dynamic Systems (DEDS) are established by min-max function, reachability and observability are defined,the problem on cycle times assignment of DEDS, which corresponds with the important problem on poles assignment of linear systems, is studied. By Gunawardena et al.'Duality Theorem following results are obtained: Cycle times of system can be assigned under state feedback(or output feedback) if and only if system is reachable (or reachable and obserbable).

  1. Toll modeling in context of road network assignment

    OpenAIRE

    2008-01-01

    Traffic network assignment is the last phase in the classical 4-phase traffic forecasting model. There are different methods of traffic assignment ranging from the most simple »all or nothing« method to the complex iterative methods such as Tribute method, however, only some of them are suitable for network assignment distribution modeling considering toll collection influence. For toll collection influence modeling we must consider the so called value of time. Value of time is indicated in t...

  2. Assignment of Cooperating UAVs to Simultaneous Tasks using Genetic Algorithms

    Science.gov (United States)

    2005-08-18

    multiple task assignment problem TSP travelling salesman problem UAV unmanned aerial vehicle VRP vehicle routing problem I. Introduction Many...assignment problem (GAP),3 and the vehicle routing problem (VRP).4 In all of these classical problems the minimum cost assignment is sought, where: in...17–23. 16Baker, B. M. and Ayechew, M. A., “A Genetic Algorithm for the Vehicle Routing Problem ,” Computers and Operations Research, Vol. 30, 2003, pp

  3. An efficient and impartial online algorithm for kidney assignment network

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation immunity spending caused by the possible post-operation immunity rejection and patient’...

  4. Working in groups for coursework assignments: The tertiary students’ perspective

    OpenAIRE

    Pung Wun Chiew; Rosnah Bt. Hj. Mustafa; Shirley Michael Slee

    2013-01-01

    The study examined undergraduates’ perception of group work in doing coursework assignments. It specifically investigated students’ perceptions of the usefulness of group work in doing assignments; identified reasons which influence students’ preference or non-preference for group work in doing assignments; determined students’ expectations of instructor’s roles in group work; and compared students’ perceptions of group work across ethnic groups. A 39-item questionnaire was distributed to 200...

  5. A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem

    CERN Document Server

    Paul, Gerald

    2009-01-01

    We develop a variable depth search heuristic for the quadratic assignment problem. The heuristic is based on sequential changes in assignments analogous to the Lin-Kernighan sequential edge moves for the traveling salesman problem. We treat unstructured problem instances of sizes 60 to 400. When the heuristic is used in conjunction with robust tabu search, we measure performance improvements of up to a factor of 15 compared to the use of robust tabu alone. The performance improvement increases as the problem size increases.

  6. Improving reimbursement with nursing case manager status assignment.

    Science.gov (United States)

    Bledsoe, Marlyn K; Marshall, Michele L

    2013-01-01

    Historically, physicians completed status assignment during the admission process. Incorrect status assignment of patients can result in reimbursement problems and denial of payment by Medicare, Medicaid, and private insurance companies. The purpose of this study was to evaluate the impact of case manager's role with status assignment during the admission process by looking at the denial of payment for services rendered. Denial rates were evaluated for two 15-month time periods: preintervention group (status assignment completed by physicians) and intervention group (status assignment recommended by case managers with physician signature). Denial data for all diagnosis-related groups possessing a more than 2% denial rate related to status assignment were further examined to identify the rationale for denial of payment. FINDINGS/OUTCOMES: The greatest denial rates for payment occurred during the Preintervention Period, when physicians assigned status for patients independently. There was a significant reduction in denial of payment for most diagnosis-related groups during the Intervention time period when case managers were recommending status assignment. Evaluation of denial data provides an opportunity to target creative performance improvement solutions to reduce denial of payment related to incorrect status assignment.

  7. How to Apply Assignment Methods that were Developed for Vehicular Traffic to Pedestrian Microsimulations

    CERN Document Server

    Roca, Vidal; Kretz, Tobias; Lehmann, Karsten; Hofsäß, Ingmar

    2014-01-01

    Applying assignment methods to compute user-equilibrium route choice is very common in traffic planning. It is common sense that vehicular traffic arranges in a user-equilibrium based on generalized costs in which travel time is a major factor. Surprisingly travel time has not received much attention for the route choice of pedestrians. In microscopic simulations of pedestrians the vastly dominating paradigm for the computation of the preferred walking direction is set into the direction of the (spatially) shortest path. For situations where pedestrians have travel time as primary determinant for their walking behavior it would be desirable to also have an assignment method in pedestrian simulations. To apply existing (road traffic) assignment methods with simulations of pedestrians one has to reduce the nondenumerably many possible pedestrian trajectories to a small subset of routes which represent the main, relevant, and significantly distinguished routing alternatives. All except one of these routes will m...

  8. Active learning in pre-class assignments: Exploring the use of interactive simulations to enhance reading assignments

    CERN Document Server

    Stang, Jared B; Perez, Sarah; Ives, Joss; Roll, Ido

    2016-01-01

    Pre-class reading assignments help prepare students for active classes by providing a first exposure to the terms and concepts to be used during class. We investigate if the use of inquiry-oriented PhET-based activities in conjunction with pre-class reading assignments can improve both the preparation of students for in-class learning and student attitudes towards and engagement with pre-class assignments. Over three course modules covering different topics, students were assigned randomly to complete either a textbook-only pre-class assignment or both a textbook pre-class assignment and a PhET-based activity. The assignments helped prepare students for class, as measured by performance on the pre-class quiz relative to a beginning-of-semester pre-test, but no evidence for increased learning due the PhET activity was observed. Students rated the assignments which included PhET as more enjoyable and, for the topic latest in the semester, reported engaging more with the assignments when PhET was included.

  9. Acceleration of protein backbone NMR assignment by combinatorial labeling: Application to a small molecule binding study.

    Science.gov (United States)

    Hein, Christopher; Löhr, Frank; Schwarz, Daniel; Dötsch, Volker

    2017-05-01

    Selective labeling with stable isotopes has long been recognized as a valuable tool in protein NMR to alleviate signal overlap and sensitivity limitations. In this study, combinatorial (15) N-, (13) C(α) -, and (13) C'-selective labeling has been used during the backbone assignment of human cyclophilin D to explore binding of an inhibitor molecule. Using a cell-free expression system, a scheme that involves (15) N, 1-(13) C, 2-(13) C, fully (15) N/(13) C, and unlabeled amino acids was optimized to gain a maximum of assignment information from three samples. This scheme was combined with time-shared triple-resonance NMR experiments, which allows a fast and efficient backbone assignment by giving the unambiguous assignment of unique amino acid pairs in the protein, the identity of ambiguous pairs and information about all 19 non-proline amino acid types. It is therefore well suited for binding studies where de novo assignments of amide (1) H and (15) N resonances need to be obtained, even in cases where sensitivity is the limiting factor. © 2016 Wiley Periodicals, Inc.

  10. Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network.

    Science.gov (United States)

    Choi, Sangil; Park, Jong Hyuk

    2016-12-02

    Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.

  11. A note on parametric analysis in linear assignment

    NARCIS (Netherlands)

    Volgenant, A.

    2008-01-01

    A classic application of the linear assignment problem is the assignment of people to jobs (or jobs to people). In this context, it is interesting to measure competition for jobs and to generate a suitable list of jobs from which a person can choose; the length of the list is a parameter. A known

  12. 33 CFR 5.27 - Assignment to specific duties.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Assignment to specific duties. 5.27 Section 5.27 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY GENERAL COAST GUARD AUXILIARY § 5.27 Assignment to specific duties. Members of the Auxiliary shall not be...

  13. 48 CFR 1342.202 - Assignment of contract administration.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Assignment of contract administration. 1342.202 Section 1342.202 Federal Acquisition Regulations System DEPARTMENT OF COMMERCE CONTRACT MANAGEMENT CONTRACT ADMINISTRATION Contract Administration Services 1342.202 Assignment of contract...

  14. 18 CFR 158.7 - Assignment for oral hearing.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Assignment for oral hearing. 158.7 Section 158.7 Conservation of Power and Water Resources FEDERAL ENERGY REGULATORY... Proposed Remedies § 158.7 Assignment for oral hearing. In case consent to the shortened procedure is not...

  15. Genetics of traffic assignment models for strategic transport planning

    NARCIS (Netherlands)

    Bliemer, M.C.J.; Raadsen, M.P.H.; Brederode, L.J.N.; Bell, M.G.H.; Wismans, Luc Johannes Josephus; Smith, M.J.

    2016-01-01

    This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic

  16. 48 CFR 42.202 - Assignment of contract administration.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Assignment of contract administration. 42.202 Section 42.202 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION... Assignment of contract administration. (a) Delegating functions. As provided in agency procedures...

  17. The Eco-Sculpture Assignment: Using Art to Scaffold Metacognition

    Science.gov (United States)

    Polegato, Rosemary

    2014-01-01

    The Eco-Sculpture Assignment demonstrates that art may be used as a conduit to scaffold metacognition in marketing courses. Theoretical underpinnings are drawn from the literature on pedagogy used in general, marketing, and art education contexts. The assignment is described in detail, followed by examples of learner response that illustrate…

  18. 48 CFR 18.122 - Assignment of claims.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Assignment of claims. 18.122 Section 18.122 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION CONTRACTING METHODS AND CONTRACT TYPES EMERGENCY ACQUISITIONS Available Acquisition Flexibilities 18.122 Assignment of...

  19. A Poster Assignment Connects Information Literacy and Writing Skills

    Science.gov (United States)

    Waters, Natalie

    2015-01-01

    This paper describes the implementation of a poster assignment in a writing and information literacy course required for undergraduate Life Sciences and Environmental Biology majors with the Faculty of Agricultural and Environmental Sciences at McGill University. The assignment was introduced in response to weaknesses identified through course…

  20. Assignment Situations with Multiple Ownership and their Games

    NARCIS (Netherlands)

    Miquel, S.; van Velzen, S.; Hamers, H.J.M.; Norde, H.W.

    2005-01-01

    An assignment situation can be considered as a two-sided market consisting of two disjoint sets of objects.A non-negative reward matrix describes the profit if an object of one group is assigned to an object of the other group. Assuming that each object is owned by a different agent, Shapley and

  1. 33 CFR 5.33 - Training, examination, and assignment.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Training, examination, and assignment. 5.33 Section 5.33 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY GENERAL COAST GUARD AUXILIARY § 5.33 Training, examination, and assignment. The Commandant will prescribe...

  2. 22 CFR Exhibit B to Part 204 - Assignment

    Science.gov (United States)

    2010-04-01

    ... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Assignment B Exhibit B to Part 204 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT HOUSING GUARANTY STANDARD TERMS AND CONDITIONS Pt. 204, Exh. B Exhibit B to Part 204—Assignment The undersigned, being the registered owner of a Note in the...

  3. 33 CFR 181.31 - Manufacturer identification code assignment.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 2 2010-07-01 2010-07-01 false Manufacturer identification code assignment. 181.31 Section 181.31 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND... identification code assignment. (a) Each person required by § 181.23 to affix hull identifications numbers must...

  4. 47 CFR 22.351 - Channel assignment policy.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 2 2010-10-01 2010-10-01 false Channel assignment policy. 22.351 Section 22.351 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES PUBLIC MOBILE SERVICES Operational and Technical Requirements Technical Requirements § 22.351 Channel assignment...

  5. Focus on Assignments: Keep Directions Clear and Simple.

    Science.gov (United States)

    Katz, Bruce; Klink, William

    1994-01-01

    At a Maryland middle school, teachers and students were asked how teachers routinely give medium-term and long-term assignments. Results showed that students, teachers, and parents would benefit from clearly written performance standards. The school's science fair assignment sheet specifies student and parent responsibilities, project completion…

  6. Genetics of traffic assignment models for strategic transport planning

    NARCIS (Netherlands)

    Bliemer, M.C.J.; Raadsen, M.; Brederode, L.; Bell, M.; Wismans, L.J.J.; Smith, M.

    2016-01-01

    This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic

  7. Dynamic Equilibrium Assignment Convergence by En-route Flow Smoothing

    NARCIS (Netherlands)

    Pel, A.J.; Bliemer, M.C.J.; Hoogendoorn, S.P.

    2010-01-01

    An essential feature in many dynamic traffic assignment (DTA) models used for planning purposes is to compute the (dynamic) equilibrium assignment, where travellers follow user-optimal routes, leading to minimal experienced route travel times. To compute these time-varying route flows in the equilib

  8. New Heuristic Rounding Approaches to the Quadratic Assignment Problem

    CERN Document Server

    Gharibi, Wajeb

    2011-01-01

    Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency.

  9. Online Assignments in Economics: A Test of Their Effectiveness

    Science.gov (United States)

    Kennelly, Brendan; Considine, John; Flannery, Darragh

    2011-01-01

    This article compares the effectiveness of online and paper-based assignments and tutorials using summative assessment results. All of the students in a large managerial economics course at National University of Ireland, Galway were asked to do six assignments online using Aplia and to do two on paper. The authors examined whether a student's…

  10. Nonrandom Assignment in ANCOVA: The Alternate Ranks Design

    Science.gov (United States)

    Dalton, Starrett; Overall, John E.

    1977-01-01

    A specific form of nonrandom assignment to treatment groups, the "alternate ranks" design, was investigated. This design eliminates the possibility of a correlation between the covariate and the treatment, and rules out experimenter bias in assignment of subjects to groups. (Editor)

  11. Individual Assignments and Academic Dishonesty--Exploring the Learning Conundrum

    Science.gov (United States)

    Leonard, Valorie; LeBrasseur, Rolland

    2008-01-01

    A survey of university business professors focused on their use of individual assignments in courses and their views on cheating and its impact on student learning. Based on responses from 456 professors (37% response rate) from Ontario, Canada, it was concluded that most faculty believe that individual assignments are effective learning tools and…

  12. 42 CFR 435.610 - Assignment of rights to benefits.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits. 435.610 Section....610 Assignment of rights to benefits. (a) As a condition of eligibility, the agency must require... paternity and in obtaining medical support and payments, unless the individual establishes good cause...

  13. 42 CFR 436.610 - Assignment of rights to benefits.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits. 436.610 Section... General Financial Eligibility Requirements and Options § 436.610 Assignment of rights to benefits. (a) As... payments, unless the individual establishes good cause for not cooperating, and except for...

  14. 48 CFR 1442.202 - Assignment of contract administration.

    Science.gov (United States)

    2010-10-01

    ... Assignment of contract administration. (a) The decision to withhold normal individual contract administration... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Assignment of contract administration. 1442.202 Section 1442.202 Federal Acquisition Regulations System DEPARTMENT OF THE...

  15. 33 CFR 3.01-5 - Assignment of functions.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Assignment of functions. 3.01-5... Provisions § 3.01-5 Assignment of functions. Section 888 of Pub. L. 107-296, 116 Stat. 2135, authorizes the Commandant of the Coast Guard to exercise certain functions, powers, and duties vested in the Secretary...

  16. Graduate Writing Assignments across Faculties in a Canadian University

    Science.gov (United States)

    Shi, Ling; Dong, Yanning

    2015-01-01

    This study examines 143 graduate assignments across 12 faculties or schools in a Canadian university in order to identify types of writing tasks. Based on the descriptions provided by the instructors, we identified nine types of assignments, with scholarly essay being the most common, followed by summary and response, literature review, project,…

  17. 45 CFR 302.50 - Assignment of rights to support.

    Science.gov (United States)

    2010-10-01

    ... process; or (2) Except for obligations assigned under 42 CFR 433.146, other legal process as established... competent jurisdiction or administrative process which covers the assigned support rights. (2) If there is no court or administrative order, an amount determined in writing by the IV-D agency as part of...

  18. On the Use of Writing Assignments in Intermediate Microeconomic Theory

    Science.gov (United States)

    O'Neill, Patrick B.

    2009-01-01

    A typical writing assignment in upper level required courses is a term paper. However many economics majors, particularly those in business schools, need to develop skill at writing shorter pieces. In this paper I describe numerous examples of shorter writing assignments that I have incorporated into an Intermediate Microeconomic Theory course.…

  19. The Transformative Potential of Creative Assignments in Higher Education

    Science.gov (United States)

    Duenkel, Nicky

    2013-01-01

    This paper encourages shifts in praxis to promote the thoughtful inclusion of creativity into higher education assignments in order to broaden and deepen student experience, and offer greater integration between required assignments and the complexity of students' lives. Obstacles to integrating creativity into academia are also briefly explored.…

  20. Assignment Book in Print Reading for Machine Shop.

    Science.gov (United States)

    Texas A and M Univ., College Station. Vocational Instructional Services.

    This student assignment book is designed for use in a course on print reading as applied to the machine shop course. Introductory materials include a student progress record, a list of references, and a pretest. For each of eight lessons, information sheets with one or more assignment sheets and a test are provided. The lessons cover the role of…

  1. Graphical interpretation of Boolean operators for protein NMR assignments

    NARCIS (Netherlands)

    Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy

    We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical

  2. 14 CFR 1245.109 - Assignment of title to NASA.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Assignment of title to NASA. 1245.109... INTELLECTUAL PROPERTY RIGHTS Patent Waiver Regulations § 1245.109 Assignment of title to NASA. (a) The instrument of waiver set forth in § 1245.115(c) shall be voided by NASA with respect to the domestic title...

  3. 25 CFR 212.34 - Individual tribal assignments excluded.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Individual tribal assignments excluded. 212.34 Section... ALLOTTED LANDS FOR MINERAL DEVELOPMENT How To Acquire Leases § 212.34 Individual tribal assignments... made pursuant to tribal constitutions or ordinances for the use of individual Indians and assignees...

  4. 45 CFR 12.8 - Assignment of surplus real property.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 1 2010-10-01 2010-10-01 false Assignment of surplus real property. 12.8 Section 12.8 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION DISPOSAL AND UTILIZATION OF SURPLUS REAL PROPERTY FOR PUBLIC HEALTH PURPOSES § 12.8 Assignment of surplus real property. (a) Notice of interest in a specific...

  5. A Poster Assignment Connects Information Literacy and Writing Skills

    Science.gov (United States)

    Waters, Natalie

    2015-01-01

    This paper describes the implementation of a poster assignment in a writing and information literacy course required for undergraduate Life Sciences and Environmental Biology majors with the Faculty of Agricultural and Environmental Sciences at McGill University. The assignment was introduced in response to weaknesses identified through course…

  6. The Eco-Sculpture Assignment: Using Art to Scaffold Metacognition

    Science.gov (United States)

    Polegato, Rosemary

    2014-01-01

    The Eco-Sculpture Assignment demonstrates that art may be used as a conduit to scaffold metacognition in marketing courses. Theoretical underpinnings are drawn from the literature on pedagogy used in general, marketing, and art education contexts. The assignment is described in detail, followed by examples of learner response that illustrate…

  7. Evaluation of Automatically Assigned Job-Specific Interview Modules

    NARCIS (Netherlands)

    Friesen, Melissa C; Lan, Qing; Ge, Calvin; Locke, Sarah J; Hosgood, Dean; Fritschi, Lin; Sadkowsky, Troy; Chen, Yu-Cheng; Wei, Hu; Xu, Jun; Lam, Tai Hing; Kwong, Yok Lam; Chen, Kexin; Xu, Caigang; Su, Yu-Chieh; Chiu, Brian C H; Ip, Kai Ming Dennis; Purdue, Mark P; Bassig, Bryan A; Rothman, Nat; Vermeulen, Roel

    OBJECTIVE: In community-based epidemiological studies, job- and industry-specific 'modules' are often used to systematically obtain details about the subject's work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the

  8. Assigning Grammatical Relations with a Back-off Model

    CERN Document Server

    De Lima, E F

    1997-01-01

    This paper presents a corpus-based method to assign grammatical subject/object relations to ambiguous German constructs. It makes use of an unsupervised learning procedure to collect training and test data, and the back-off model to make assignment decisions.

  9. Students' Evaluation of Writing Assignments in an Abnormal Psychology Course.

    Science.gov (United States)

    Procidano, Mary E.

    1991-01-01

    Presents a study in which students in an abnormal psychology class rated the usefulness of drafts for two writing assignments. Reports that a research proposal was more effective than a case study in generating interest in psychology and opportunity for creativity. Concludes that writing assignments should reflect important aspects of a…

  10. 7 CFR 12.34 - Paperwork Reduction Act assigned number.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 1 2010-01-01 2010-01-01 false Paperwork Reduction Act assigned number. 12.34 Section 12.34 Agriculture Office of the Secretary of Agriculture HIGHLY ERODIBLE LAND AND WETLAND CONSERVATION Wetland Conservation § 12.34 Paperwork Reduction Act assigned number. The information...

  11. Negotiating Languages and Cultures: Enacting Translingualism through a Translation Assignment

    Science.gov (United States)

    Kiernan, Julia; Meier, Joyce; Wang, Xiqiao

    2016-01-01

    This collaborative project explores the affordances of a translation assignment in the context of a learner-centered pedagogy that places composition students' movement among languages and cultures as both a site for inquiry and subject of analysis. The translation assignment asks students to translate scholarly articles or culture stories from…

  12. A Novel Method for Assigning R, S Labels to Enantiomers.

    Science.gov (United States)

    Huheey, James E.

    1986-01-01

    Discusses ways of teaching students about how to assign R (rectus) and S (sinister) labels to enantiomers by using their hands as models. The chirality of the human hands follows the Cahn-Ingold-Prelog Rules for assigning enantiomers and infers the correct chirality of molecules shown in two-dimensional drawings. (TW)

  13. Case Assignment in the Inalienable Possession Construction in Korean.

    Science.gov (United States)

    Maling, Joan; Kim, Soowon

    1992-01-01

    Investigates principles for assigning case to the Noun Phrases (NP) in the Part-Whole Construction in Korean. It is shown that the case marking on the part-NP is a function of the case-assigning properties of the matrix verb, even when this is lexically governed. (41 references) (Author/LB)

  14. Personnel shift assignment: Existence conditions and network models

    NARCIS (Netherlands)

    Berg, van den Jeroen P.; Panton, David M.

    1994-01-01

    The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule. This paper discusses the existence conditions for both continuous and forward rotating shift assignments and heuristic network algorithm

  15. Automating Formative and Summative Feedback for Individualised Assignments

    Science.gov (United States)

    Hamilton, Ian Robert

    2009-01-01

    Purpose: The purpose of this paper is to report on the rationale behind the use of a unique paper-based individualised accounting assignment, which automated the provision to students of immediate formative and timely summative feedback. Design/methodology/approach: As students worked towards completing their assignment, the package provided…

  16. Computational aspects of assigning agents to a line

    DEFF Research Database (Denmark)

    Aziz, Haris; Hougaard, Jens Leth; Moreno-Ternero, Juan D.

    2017-01-01

    We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. We introduce a general approach to compute aggregate gap-minimizing assignments, as well as gap-egalitarian assignme...

  17. 47 CFR 74.786 - Digital channel assignments.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Digital channel assignments. 74.786 Section 74... Translator, and TV Booster Stations § 74.786 Digital channel assignments. (a) An applicant for a new low... authorized digital station shall endeavor to select a channel on which its operation is not likely to cause...

  18. Multiobjective Gate Assignment Based on Passenger Walking Distance and Fairness

    Directory of Open Access Journals (Sweden)

    Yu Jiang

    2013-01-01

    Full Text Available Passenger walking distance is an important index of the airport service quality. How to shorten the walking distance and balance the airlines' service quality is the focus of much research on airport gate assignment problems. According to the problems of airport passenger service quality, an optimization gate assignment model is established. The gate assignment model is based on minimizing the total walking distance of all passengers and balancing the average walking distance of passengers among different airlines. Lingo is used in the simulation of a large airport gate assignment. Test results show that the optimization model can reduce the average walking distance of passenger effectively, improve the number of flights assigned to gate, balance airline service quality, and enhance the overall service level of airports and airlines. The model provides reference for the airport gate preassignment.

  19. Evaluation of a UMLS Auditing Process of Semantic Type Assignments.

    Science.gov (United States)

    Gu, Huanying Helen; Hripcsak, George; Chen, Yan; Morrey, C Paul; Elhanan, Gai; Cimino, James; Geller, James; Perl, Yehoshua

    2007-10-11

    The UMLS is a terminological system that integrates many source terminologies. Each concept in the UMLS is assigned one or more semantic types from the Semantic Network, an upper level ontology for biomedicine. Due to the complexity of the UMLS, errors exist in the semantic type assignments. Finding assignment errors may unearth modeling errors. Even with sophisticated tools, discovering assignment errors requires manual review. In this paper we describe the evaluation of an auditing project of UMLS semantic type assignments. We studied the performance of the auditors who reviewed potential errors. We found that four auditors, interacting according to a multi-step protocol, identified a high rate of errors (one or more errors in 81% of concepts studied) and that results were sufficiently reliable (0.67 to 0.70) for the two most common types of errors. However, reliability was low for each individual auditor, suggesting that review of potential errors is resource-intensive.

  20. Fast assignment reduction in inconsistent incomplete decision systems

    Institute of Scientific and Technical Information of China (English)

    Min Li; Shaobo Deng; Shengzhong Feng; Jianping Fan

    2014-01-01

    This paper focuses on fast algorithm for computing the assignment reduct in inconsistent incomplete decision systems. It is quite inconvenient to judge the assignment reduct directly ac-cording to its definition. We propose the judgment theorem for the assignment reduct in the inconsistent incomplete decision system, which greatly simplifies judging this type reduct. On such basis, we derive a novel attribute significance measure and construct the fast assignment reduction algorithm (F-ARA), intended for com-puting the assignment reduct in inconsistent incomplete decision systems. Final y, we make a comparison between F-ARA and the discernibility matrix-based method by experiments on 13 Univer-sity of California at Irvine (UCI) datasets, and the experimental results prove that F-ARA is efficient and feasible.

  1. Multiobjective controller synthesis via eigenstructure assignment with state feedback

    Science.gov (United States)

    Li, Zhao; Lam, James

    2016-10-01

    A general parameter scheme for multiobjective controller synthesis via eigenstructure assignment with state feedback is proposed. The scheme provides total pole configurability, that is, pole assignment constraints, partial pole assignment constraints, generalised regional pole assignment constraints can be dealt with simultaneously without introducing essential conservatism. The scheme is derived from the pole assignment approach using Sylvester equations, and the parameter space is the Cartesian product of some subspaces characterising the free parameters. Under the scheme, the controller design problems are formulated as nonlinear optimisation problems with both objectives and constraints being differentiable and can be solved by derivative-based nonlinear programming technique. Numerical examples are given to illustrate the efficiency of the proposed method.

  2. The Principal Assignment of Philosophy in Culture

    Directory of Open Access Journals (Sweden)

    Pawel Tarasiewicz

    2012-12-01

    Full Text Available The following article is focused on the question of the primary task of philosophy in culture. The problem of philosophy itself is the starting point here. The author observes a chronic discord among philosophers on what philosophy is that undermines the identity of the afore-mentioned as well as disables it from determining its tasks in the culture. Thus, he attempts to determine the nature of philosophy indirectly. The author indicates what philosophy is not and has never been from its beginning, and can not be if it be itself. According to the author, myth is an effective negative criterion with which to determine the true character of philosophy. Philosophy’s aspiration to emancipate itself from myth’s influence justifies the effort to search the foundation of philosophy in contradistinction from myth, and enabling a determination of philosophy directly by indicating its constitutive factors. To philosophize is to know things as they are in the real world, or as they are related to the real world. A reflection on philosophy is not only possible, but also necessary. Since philosophy is part of human culture, the author concludes that the primary task of philosophy in culture consists in justifying the identity of philosophy as such.

  3. THE PRINCIPAL ASSIGNMENT OF PHILOSOPHY IN CULTURE

    Directory of Open Access Journals (Sweden)

    Pawel Tarasiewicz

    2012-12-01

    Full Text Available The following article is focused on the question of the primary task of philosophy in culture. The problem of philosophy itself is the starting point here. The author observes a chronic discord among philosophers on what philosophy is that undermines the identity of the afore-mentioned as well as disables it from determining its tasks in the culture. Thus, he attempts to determine the nature of philosophy indirectly. The author indicates what philosophy is not and has never been from its beginning, and can not be if it be itself. According to the author, myth is an effective negative criterion with which to determine the true character of philosophy. Philosophy’s aspiration to emancipate itself from myth’s influence justifies the effort to search the foundation of philosophy in contradistinction from myth, and enabling a determination of philosophy directly by indicating its constitutive factors. To philosophize is to know things as they are in the real world, or as they are related to the real world. A reflection on philosophy is not only possible, but also necessary. Since philosophy is part of human culture, the author concludes that the primary task of philosophy in culture consists in justifying the identity of philosophy as such.

  4. Exploring Variation in Certified Nursing Assistant Assignments From the Perspective of Nursing Home Residents: A Comparison of Adopters and Nonadopters of Consistent Assignment.

    Science.gov (United States)

    Roberts, Tonya J; Nolet, Kimberly; Bowers, Barbara

    2017-06-01

    To describe and compare certified nursing assistant (CNA) staffing between adopter and nonadopters of consistent assignment. One month of preexisting CNA assignment and scheduling sheets from a purposive sample of 30 homes. A descriptive comparative study was conducted to calculate and compare numbers of CNAs assigned per resident across homes. Resident names and CNA assignments were abstracted from assignment records and entered into the Advancing Excellence consistent assignment tool to calculate numbers of CNAs assigned per resident. Both variation and overlap existed in the number of CNAs per resident within and between homes. Adopters assigned significantly fewer CNAs per resident. Research is needed to determine how assignment variations affect resident perceptions of quality.

  5. Information on co-morbidities collected by history is useful for assigning Otitis Media risk to children.

    Science.gov (United States)

    Casselbrant, Margaretha L; Mandel, Ellen M; Doyle, William J

    2016-06-01

    Determine if a 2-Step multivariate analysis of historical symptom/sign data for comorbid diseases can abstract high-level constructs useful in assigning a child's "risk" for different Otitis Media expressions. Seventeen items related to the symptom/sign expression of hypothesized Otitis Media comorbidities were collected by history on 141 3-year-old children. Using established criteria, the children were assigned to 1 of 3 groups: Control (no significant past Otitis Media, n=45), Chronic Otitis Media with Effusion (n=45) and Recurrent Acute Otitis Media (n=51). Principal Component Analysis was used to identify factors representing the non-redundant shared information among related items and Discriminant Analysis operating on those factors was used to estimate the best predictor equation for pairwise group assignments. Six multivariate factors representing the assignable comorbidities of frequent colds, nasal allergy, gastroesophageal disease (specific and general), nasal congestion and asthma were identified and explained 81% of the variance in the 17 items. Discriminant Analysis showed that, for the Control-Chronic Otitis Media with Effusion comparison, a combination of 3 factors and, for the Control-Recurrent Acute Otitis Media comparison, a combination of 2 factors had assignment accuracies of 74% and 68%, respectively. For the contrast between the two disease expressions, a 2-factor combination had an assignment accuracy of 61%. These results show that this analytic methodology can abstract high-level constructs, comorbidities, from low-level data, symptom/sign scores, support a linkage between certain comorbidities and Otitis Media risk and suggest that specific comorbidity combinations contain information relevant to assigning the risk for different Otitis Media expressions. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  6. Evaluation of Automatically Assigned Job-Specific Interview Modules.

    Science.gov (United States)

    Friesen, Melissa C; Lan, Qing; Ge, Calvin; Locke, Sarah J; Hosgood, Dean; Fritschi, Lin; Sadkowsky, Troy; Chen, Yu-Cheng; Wei, Hu; Xu, Jun; Lam, Tai Hing; Kwong, Yok Lam; Chen, Kexin; Xu, Caigang; Su, Yu-Chieh; Chiu, Brian C H; Ip, Kai Ming Dennis; Purdue, Mark P; Bassig, Bryan A; Rothman, Nat; Vermeulen, Roel

    2016-08-01

    In community-based epidemiological studies, job- and industry-specific 'modules' are often used to systematically obtain details about the subject's work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the correct module. We evaluated, in the context of a case-control study of lymphoid neoplasms in Asia ('AsiaLymph'), the performance of an algorithm that provided automatic, real-time module assignment during a computer-assisted personal interview. AsiaLymph's occupational component began with a lifetime occupational history questionnaire with free-text responses and three solvent exposure screening questions. To assign each job to one of 23 study-specific modules, an algorithm automatically searched the free-text responses to the questions 'job title' and 'product made or services provided by employer' using a list of module-specific keywords, comprising over 5800 keywords in English, Traditional and Simplified Chinese. Hierarchical decision rules were used when the keyword match triggered multiple modules. If no keyword match was identified, a generic solvent module was assigned if the subject responded 'yes' to any of the three solvent screening questions. If these question responses were all 'no', a work location module was assigned, which redirected the subject to the farming, teaching, health professional, solvent, or industry solvent modules or ended the questions for that job, depending on the location response. We conducted a reliability assessment that compared the algorithm-assigned modules to consensus module assignments made by two industrial hygienists for a subset of 1251 (of 11409) jobs selected using a stratified random selection procedure using module-specific strata. Discordant assignments between the algorithm and consensus assignments (483 jobs) were qualitatively reviewed by the hygienists to evaluate the potential information lost from missed questions with using

  7. Consistent assignment of nurse aides: association with turnover and absenteeism.

    Science.gov (United States)

    Castle, Nicholas G

    2013-01-01

    Consistent assignment refers to the same caregivers consistently caring for the same residents almost every time caregivers are on duty. This article examines the association of consistent assignment of nurse aides with turnover and absenteeism. Data came from a survey of nursing home administrators, the Online Survey Certification and Reporting data, and the Area Resource File. The measures were from 2007 and came from 3,941 nursing homes. Multivariate logistic regression models were used to examine turnover and absenteeism. An average of 68% of nursing homes reported using consistent assignment, with 28% of nursing homes using nurse aides consistent assignment at the often recommended level of 85% (or more). Nursing homes using recommended levels of consistent assignment had significantly lower rates of turnover and of absenteeism. In the multivariate analyses, consistent assignment was significantly associated with both lower turnover and lower absenteeism (p assignment is a practice recommended by many policy makers, government agencies, and industry advocates. The findings presented here provide some evidence that the use of this staffing practice can be beneficial.

  8. A New Approach to Pointer Analysis for Assignments

    Institute of Scientific and Technical Information of China (English)

    HUANG Bo; ZANG Binyu; LI Jing; ZHU Chuanqi

    2001-01-01

    Pointer analysis is a technique to identify at compile-time the po tential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are clas sified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by Institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.

  9. Heuristic for Task-Worker Assignment with Varying Learning Slopes

    Directory of Open Access Journals (Sweden)

    Wipawee Tharmmaphornphilas

    2010-04-01

    Full Text Available Fashion industry has variety products, so the multi-skilled workers are required to improve flexibility in production and assignment. Generally the supervisor will assign task to the workers based on skill and skill levels of worker. Since in fashion industry new product styles are launched more frequently and the order size tends to be smaller, the workers always learn when the raw material and the production process changes. Consequently they require less time to produce the succeeding units of a task based on their learning ability. Since the workers have both experience and inexperience workers, so each worker has different skill level and learning ability. Consequently, the assignment which assumed constant skill level is not proper to use. This paper proposes a task-worker assignment considering worker skill levels and learning abilities. Processing time of each worker changes along production period due to a worker learning ability. We focus on a task-worker assignment in a fashion industry where tasks are ordered in series; the number of tasks is greater than the number of workers. Therefore, workers can perform multiple assignments followed the precedence restriction as an assembly line balancing problem. The problem is formulated in an integer linear programming model with objective to minimize makespan. A heuristic is proposed to determine the lower bound (LB and the upper bound (UB of the problem and the best assignment is determined. The performance of the heuristic method is tested by comparing quality of solution and computational time to optimal solutions.

  10. Linear assignment maps for correlated system-environment states

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez-Rosario, Cesar A.; Modi, Kavan; Aspuru-Guzik, Alan

    2010-01-20

    Assignment maps are mathematical operators that describe initial system-environment states for open quantum systems. We re-examine the notion of assignments that account for correlations between the system and the environment and show that these maps can be made linear at the expense of giving up positivity or consistency of the map. We study the role of positivity and consistency of the map and show the effects of relaxing these. Finally, we establish a connection between the violation of the positivity of linear assignments and the no-broadcasting theorem.

  11. Feeder assignment optimization algorithm for multi-head mounter

    Institute of Scientific and Technical Information of China (English)

    Peng YUAN; Yueming HU; Haiming LIU; Hongxia GAO

    2006-01-01

    This paper analyzes optimization algorithms of assembly time for a multi-head mounter. The algorithm in this paper is composed of four steps. First, it assigns the components to feeders based on the "one-to-many mapping".Secondly, it assigns nozzles to heads by making full use of the "on-the-fly nozzle change" heads. Thirdly, it organizes the feeder groups so that the heads can pick and place components group by group. Finally, it assigns feeder groups to slots.The result demonstrates that the algorithm has good performance in practice.

  12. Assignments of autoionization states of O2-asterisk

    Science.gov (United States)

    Wu, C. Y. Robert

    1987-01-01

    Attention is given to the uncertainties that remain concerning the autoionization states of O2 leading to the a 4Pi(u) and A 2Pi(u) states of O2(+), as well as some of the assignments of the autoionization states and the determinations of effective quantum numbers and quantum defects. The former problems of vibrational assignments are unambiguously established in view of a study of isotopic oxygen molecules. A systematic examination of the known Rydberg series is conducted, and new assignments and interpretations for several autoionization states leading to the various states of O2(+) are suggested.

  13. Computational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations

    CERN Document Server

    Jiménez, Andrea

    2011-01-01

    Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this work we show that it is NP-complete to decide whether or not a surface triangulation admits a satisfying spin-assignment, and that it is #P-complete to determine the number of such assignments. Both results are derived via an elaborate (and atypical) reduction that maps a Boolean formula in 3-conjunctive normal form into a triangulation of an orientable closed surface.

  14. A note on the assignments of Rydberg states of COS

    Science.gov (United States)

    Wu, C. Y. R.

    1982-01-01

    Assignments of the Rydberg states which converge to the respective X-tilde and B-tilde ion states of the COS(+) ion are reported. The assignments were made based on previously established orderings for the quantum defects of isoelectronic molecules. The Rydberg series I and II, which converge to the X-tilde 2 Pi state of COS(+), and the series III, IV, V, VI and VII, which converge to the B-tilde 2 Sigma + state, are assigned to molecular orbitals characterized by predominant sulfur orbitals, in contrast to those converging to the C-tilde states, which are characterized by oxygen atomic orbitals.

  15. Optimization of Fleet Assignment: A Case Study in Turkey

    Directory of Open Access Journals (Sweden)

    Yavuz OZDEMIR

    2012-01-01

    Full Text Available Since poor fleet assignment can cause a great increase in costs for airline companies, asolution of the type ‘right fleet for the right flight’ would be very useful. In this paper, a fleetassignment model is set up using the data of the largest Airline Company in Turkey, TurkishAirlines. The aim of this model is to assign the most appropriate fleet type to flights whileminimizing the cost and determining the optimal number of aircraft grounded overnight at eachairport. We set up a model with constraints with thinking all airline operations and solve ourproblem using integer linear programming. Finally, we get an optimum solution which minimizesthe total cost while assigning the fleet type to the flight leg. Using optimization software (Lindo6.1, the solution to this problem generates a minimum daily cost of fleet assignment.

  16. The Robust Pole Assignment Problem for Second-Order Systems

    Directory of Open Access Journals (Sweden)

    Hao Liu

    2010-01-01

    the discussion into two cases and propose two algorithms for solving this problem. Numerical examples show that the problem of the robust eigenvalue assignment for the quadratic pencil can be solved effectively.

  17. Task Assignment Problem Solved by Continuous Hopfield Network

    Directory of Open Access Journals (Sweden)

    Ettaouil Mohamed

    2012-03-01

    Full Text Available The task assignment problem with non uniform communication costs (TAP consists in finding an assignment of the tasks to the processors such that the total execution and communication costs is minimized. This problem is naturally formulated as 0-1 quadratic programming subject to linear constraints (QP. In this paper, we propose a new approach to solve the task assignment problem with non uniform communication costs using the continuous Hopfield network (CHN. This approach is based on some energy or Lyapunov function, which diminishes as the system develops until a local minimum value is obtained. We show that this approach is able to determine a good solution for this problem. Finally, some computational experiments solving the task assignment problem with non-uniform communication costs are shown.

  18. Recommender Systems for the Conference Paper Assignment Problem

    CERN Document Server

    Conry, Don; Ramakrishnan, Naren

    2009-01-01

    Conference paper assignment, i.e., the task of assigning paper submissions to reviewers, presents multi-faceted issues for recommender systems research. Besides the traditional goal of predicting `who likes what?', a conference management system must take into account aspects such as: reviewer capacity constraints, adequate numbers of reviews for papers, expertise modeling, conflicts of interest, and an overall distribution of assignments that balances reviewer preferences with conference objectives. Among these, issues of modeling preferences and tastes in reviewing have traditionally been studied separately from the optimization of paper-reviewer assignment. In this paper, we present an integrated study of both these aspects. First, due to the paucity of data per reviewer or per paper (relative to other recommender systems applications) we show how we can integrate multiple sources of information to learn paper-reviewer preference models. Second, our models are evaluated not just in terms of prediction accu...

  19. Interagency Reform: Changing Organizational Culture through Education and Assignment

    Science.gov (United States)

    2007-03-30

    to focus on the people operating inside the interagency community. That takes changing basic organizational culture using an in-stride method that...capitalizes on two momentous influencers of organizational culture - education and interagency assignments.

  20. The redesign of the medical intern assignment mechanism in Israel

    National Research Council Canada - National Science Library

    Roth, Alvin E; Shorrer, Ran I

    2015-01-01

    A collaboration of medical professionals with economists and computer scientists involved in "market design" had led to the redesign of the clearinghouse assigning medical students to internships in Israel...

  1. ZAP: a distributed channel assignment algorithm for cognitive radio networks

    Directory of Open Access Journals (Sweden)

    Munaretto Anelise

    2011-01-01

    Full Text Available Abstract We propose ZAP, an algorithm for the distributed channel assignment in cognitive radio (CR networks. CRs are capable of identifying underutilized licensed bands of the spectrum, allowing their reuse by secondary users without interfering with primary users. In this context, efficient channel assignment is challenging as ideally it must be simple, incur acceptable communication overhead, provide timely response, and be adaptive to accommodate frequent changes in the network. Another challenge is the optimization of network capacity through interference minimization. In contrast to related work, ZAP addresses these challenges with a fully distributed approach based only on local (neighborhood knowledge, while significantly reducing computational costs and the number of messages required for channel assignment. Simulations confirm the efficiency of ZAP in terms of (i the performance tradeoff between different metrics and (ii the fast achievement of a suitable assignment solution regardless of network size and density.

  2. Calibrated peer review assignments for the earth sciences

    Science.gov (United States)

    Rudd, J.A.; Wang, V.Z.; Cervato, C.; Ridky, R.W.

    2009-01-01

    Calibrated Peer Review ??? (CPR), a web-based instructional tool developed as part of the National Science Foundation reform initiatives in undergraduate science education, allows instructors to incorporate multiple writing assignments in large courses without overwhelming the instructor. This study reports successful implementation of CPR in a large, introductory geology course and student learning of geoscience content. For each CPR assignment in this study, students studied web-based and paper resources, wrote an essay, and reviewed seven essays (three from the instructor, three from peers, and their own) on the topic. Although many students expressed negative attitudes and concerns, particularly about the peer review process of this innovative instructional approach, they also recognized the learning potential of completing CPR assignments. Comparing instruction on earthquakes and plate boundaries using a CPR assignment vs. an instructional video lecture and homework essay with extensive instructor feedback, students mastered more content via CPR instruction.

  3. A singular value sensitivity approach to robust eigenstructure assignment

    DEFF Research Database (Denmark)

    Søgaard-Andersen, Per; Trostmann, Erik; Conrad, Finn

    1986-01-01

    A design technique for improving the feedback properties of multivariable state feedback systems designed using eigenstructure assignment is presented. Based on a singular value analysis of the feedback properties a design parameter adjustment procedure is outlined. This procedure allows for the ......A design technique for improving the feedback properties of multivariable state feedback systems designed using eigenstructure assignment is presented. Based on a singular value analysis of the feedback properties a design parameter adjustment procedure is outlined. This procedure allows...

  4. Locomotive assignment problem with train precedence using genetic algorithm

    OpenAIRE

    Noori, Siamak; Ghannadpour, Seyed

    2012-01-01

    This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should...

  5. The challenge of expenditure-assignment reform in Russia

    OpenAIRE

    1994-01-01

    This paper is an examination of the critical role the assignment of expenditure responsibilities must play in building the Russian Federation. The fiscal federalism system and the expenditure assignments inherited from the Soviet Union were not truly decentralized. All the real decisions were made back in Moscow. Although subnational governments now have authority to create their own budgets, past processes and institutions still undermine local autonomy. How ever, the most serious threat to ...

  6. The use of meta-heuristics for airport gate assignment

    DEFF Research Database (Denmark)

    Cheng, Chun-Hung; Ho, Sin C.; Kwan, Cheuk-Lam

    2012-01-01

    Improper assignment of gates may result in flight delays, inefficient use of the resource, customer’s dissatisfaction. A typical metropolitan airport handles hundreds of flights a day. Solving the gate assignment problem (GAP) to optimality is often impractical. Meta-heuristics have recently been...... are collected to carry out the computational comparison. Although the literature has documented these algorithms, this work may be a first attempt to evaluate their performance using a set of realistic flight data....

  7. Chemical shift assignments of two oleanane triterpenes from Euonymus hederaceus

    Institute of Scientific and Technical Information of China (English)

    HU He-jiao; WANG Kui-wu; WU Bin; SUN Cui-rong; PAN Yuan-jiang

    2005-01-01

    1H-NMR and 13C-NMR assignments of 12-oleanene-3,11-dione (compound 1) were completely described for the first time through conventional 1D NMR and 2D shift-correlated NMR experiments using 1H-1HCOSY, HMQC, HMBC techniques.Based on its NMR data, the assignments of 28-hydroxyolean-12-ene-3,11-dione (compound 2) were partially revised.

  8. Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.

    Directory of Open Access Journals (Sweden)

    Lei Li

    Full Text Available Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT, which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are.

  9. A parametric visualization software for the assignment problem

    Directory of Open Access Journals (Sweden)

    Papamanthou Charalampos

    2005-01-01

    Full Text Available In this paper we present a parametric visualization software used to assist the teaching of the Network Primal Simplex Algorithm for the assignment problem (AP. The assignment problem is a special case of the balanced transportation problem. The main functions of the algorithm and design techniques are also presented. Through this process, we aim to underline the importance and necessity of using such educational methods in order to improve the teaching of Computer Algorithms.

  10. Linear Optimization of Frequency Spectrum Assignments Across System

    Science.gov (United States)

    2016-03-01

    Instead of separate transmit and receive apertures for each of the multiple radar , communications, and electronic warfare systems, a few pairs of AMRF-C... OPTIMIZATION OF FREQUENCY SPECTRUM ASSIGNMENTS ACROSS SYSTEMS by Steven J. Fischbach March 2016 Thesis Advisor: Jeffrey Hyink Thesis Co-Advisor...March 2016 3. REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE LINEAR OPTIMIZATION OF FREQUENCY SPECTRUM ASSIGNMENTS ACROSS

  11. wrtg391 full course [ all discussions and all assignments

    OpenAIRE

    Laynebaril

    2017-01-01

    wrtg391 full course [ all discussions and all assignments   Critically Thinking in WRTG 391 Click Link Below To Buy: http://hwcampus.com/shop/wrtg391-full-course/   Actions for 'Critically Thinking in WRTG 391'SubscribeHide Description Welcome to WRTG 391!   Assignment: After watching Dr. Derek Cabrera's lecture please write a short paragraph in which you answer oneof the following questions: Why does Dr. Cabrera differentiate between the ability t...

  12. Assigning phrase breaks from part-of-speech sequences.

    OpenAIRE

    Black, Alan W.; Taylor, Paul A.

    1997-01-01

    One of the important stages in the process of turning unmarked text into speech is the assignment of appropriate phrase break boundaries. Phrase break boundaries are important to later modules including accent assignment, duration control and pause insertion. A number of different algorithms have been proposed for such a task, ranging from the simple to the complex. These different algorithms require different information such as part of speech tags, syntax and even ...

  13. HSA 505 Week 3 Assignment 1  Product Development

    OpenAIRE

    Laynebaril1

    2017-01-01

    HSA 505 Week 3 Assignment 1  Product Development   Click Link Below To Buy:   http://hwcampus.com/shop/hsa-505-week-3-assignment-1-product-development/   Health services continue to affect the gross domestic product, and this dramatic transformation has great demands on each dollar spent to deliver patient-centered products. Health care marketing must be repeatedly applied and practiced strategically to include environmental dimensions, such as technology, socioeco...

  14. Automatic frequency assignment for cellular telephones using constraint satisfaction techniques

    OpenAIRE

    Carlsson, Mats; Grindal, Mats

    1993-01-01

    We study the problem of automatic frequency assignment for cellular telephone systems. The frequency assignment problem is viewed as the problem to minimize the unsatisfied soft constraints in a constraint satisfaction problem (CSP) over a finite domain of frequencies involving co-channel, adjacent channel, and co-site constraints. The soft constraints are automatically derived from signal strength prediction data. The CSP is solved using a generalized graph coloring algorit...

  15. Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.

    Science.gov (United States)

    Li, Lei; Wang, Yan; Liu, Guanfeng; Wang, Meng; Wu, Xindong

    2015-01-01

    Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications) with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT), which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are.

  16. Competency-Based Assignment & Promotion to Meet Air Force Senior Leader Requirements

    Science.gov (United States)

    2006-04-01

    outplacement , senior officer by name requests, and other factors to place qualified officers in vacant positions while managing and attempting to balance...considering the senior leader skill pair development targets for that officer’s year group. After AFPC finalizes officer outplacements , many of which are...DAs, ACSC adjusts the officer course assignments if needed.109 Even if an officer’s outplacement is not a DA—example, an officer goes straight to

  17. Exploiting image registration for automated resonance assignment in NMR.

    Science.gov (United States)

    Strickland, Madeleine; Stephens, Thomas; Liu, Jian; Tjandra, Nico

    2015-06-01

    Analysis of protein NMR data involves the assignment of resonance peaks in a number of multidimensional data sets. To establish resonance assignment a three-dimensional search is used to match a pair of common variables, such as chemical shifts of the same spin system, in different NMR spectra. We show that by displaying the variables to be compared in two-dimensional plots the process can be simplified. Moreover, by utilizing a fast Fourier transform cross-correlation algorithm, more common to the field of image registration or pattern matching, we can automate this process. Here, we use sequential NMR backbone assignment as an example to show that the combination of correlation plots and segmented pattern matching establishes fast backbone assignment in fifteen proteins of varying sizes. For example, the 265-residue RalBP1 protein was 95.4% correctly assigned in 10 s. The same concept can be applied to any multidimensional NMR data set where analysis comprises the comparison of two variables. This modular and robust approach offers high efficiency with excellent computational scalability and could be easily incorporated into existing assignment software.

  18. PARETO OPTIMAL SOLUTIONS FOR MULTI-OBJECTIVE GENERALIZED ASSIGNMENT PROBLEM

    Directory of Open Access Journals (Sweden)

    S. Prakash

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: The Multi-Objective Generalized Assignment Problem (MGAP with two objectives, where one objective is linear and the other one is non-linear, has been considered, with the constraints that a job is assigned to only one worker – though he may be assigned more than one job, depending upon the time available to him. An algorithm is proposed to find the set of Pareto optimal solutions of the problem, determining assignments of jobs to workers with two objectives without setting priorities for them. The two objectives are to minimise the total cost of the assignment and to reduce the time taken to complete all the jobs.

    AFRIKAANSE OPSOMMING: ‘n Multi-doelwit veralgemeende toekenningsprobleem (“multi-objective generalised assignment problem – MGAP” met twee doelwitte, waar die een lineêr en die ander nielineêr is nie, word bestudeer, met die randvoorwaarde dat ‘n taak slegs toegedeel word aan een werker – alhoewel meer as een taak aan hom toegedeel kan word sou die tyd beskikbaar wees. ‘n Algoritme word voorgestel om die stel Pareto-optimale oplossings te vind wat die taaktoedelings aan werkers onderhewig aan die twee doelwitte doen sonder dat prioriteite toegeken word. Die twee doelwitte is om die totale koste van die opdrag te minimiseer en om die tyd te verminder om al die take te voltooi.

  19. Interactive visual exploration and refinement of cluster assignments.

    Science.gov (United States)

    Kern, Michael; Lex, Alexander; Gehlenborg, Nils; Johnson, Chris R

    2017-09-12

    With ever-increasing amounts of data produced in biology research, scientists are in need of efficient data analysis methods. Cluster analysis, combined with visualization of the results, is one such method that can be used to make sense of large data volumes. At the same time, cluster analysis is known to be imperfect and depends on the choice of algorithms, parameters, and distance measures. Most clustering algorithms don't properly account for ambiguity in the source data, as records are often assigned to discrete clusters, even if an assignment is unclear. While there are metrics and visualization techniques that allow analysts to compare clusterings or to judge cluster quality, there is no comprehensive method that allows analysts to evaluate, compare, and refine cluster assignments based on the source data, derived scores, and contextual data. In this paper, we introduce a method that explicitly visualizes the quality of cluster assignments, allows comparisons of clustering results and enables analysts to manually curate and refine cluster assignments. Our methods are applicable to matrix data clustered with partitional, hierarchical, and fuzzy clustering algorithms. Furthermore, we enable analysts to explore clustering results in context of other data, for example, to observe whether a clustering of genomic data results in a meaningful differentiation in phenotypes. Our methods are integrated into Caleydo StratomeX, a popular, web-based, disease subtype analysis tool. We show in a usage scenario that our approach can reveal ambiguities in cluster assignments and produce improved clusterings that better differentiate genotypes and phenotypes.

  20. A New Approach to Pointer Analysis for Assignments

    Institute of Scientific and Technical Information of China (English)

    黄波; 臧斌宇; 等

    2001-01-01

    Pointer analysis is a technique to identify at copile-time the potential values of the pointer expressions in a program,which promises significant benefits for optimzing and parallelizing complilers.In this paper,a new approach to pointer analysis for assignments is presented.In this approach,assignments are classified into three categories:pointer assignments,structure(union)assignents and normal assignments which don't affect the point-to information.Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm.When analyzing a pointer assigemtn.a new method called expression expansion is used to calculate both the left targets and the right targets.The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper,which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables.This algorithm is implemented in Agassiz,an analyzing tool for C programs developed by Institute of Parallel Processing,Fudan University,Its accuracy and effectiveness are illustrated by experimental data.

  1. Resonance Assignment of the NMR Spectra of Disordered Proteins Using a Multi-Objective Non-Dominated Sorting Genetic Algorithm

    Science.gov (United States)

    Yang, Yu; Fritzsching, Keith J.

    2014-01-01

    A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative merit of these assignments. Our approach is modeled after the recently introduced Monte Carlo simulated annealing (MC/SA) protocol, with the key difference that NSGA-II simultaneously optimizes multiple assignment objectives instead of searching for possible assignments based on a single composite score. The multiple objectives include maximizing the number of consistently assigned peaks between multiple spectra (“good connections”), maximizing the number of used peaks, minimizing the number of inconsistently assigned peaks between spectra (“bad connections”), and minimizing the number of assigned peaks that have no matching peaks in the other spectra (“edges”). Using six solid-state NMR protein chemical shift datasets with varying levels of imperfection that was introduced by peak deletion, random chemical shift changes, and manual peak picking of spectra with moderately broad linewidths, we show that the NSGA-II algorithm produces a large number of valid and good assignments rapidly. For high-quality chemical shift peak lists, NSGA-II and MC/SA perform similarly well. However, when the peak lists contain many missing peaks that are uncorrelated between different spectra and have chemical shift deviations between spectra, the modified NSGA-II produces a larger number of valid solutions than MC/SA, and is more effective at distinguishing good from mediocre assignments by avoiding the hazard of suboptimal weighting factors for the various objectives. These two advantages, namely diversity and better evaluation, lead to a higher probability of predicting the correct

  2. Resonance assignment of the NMR spectra of disordered proteins using a multi-objective non-dominated sorting genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Yu; Fritzsching, Keith J.; Hong, Mei, E-mail: mhong@iastate.edu [Iowa State University, Department of Chemistry (United States)

    2013-10-17

    A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR (SSNMR) spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative merit of these assignments. Our approach is modeled after the recently introduced Monte-Carlo simulated-annealing (MC/SA) protocol, with the key difference that NSGA-II simultaneously optimizes multiple assignment objectives instead of searching for possible assignments based on a single composite score. The multiple objectives include maximizing the number of consistently assigned peaks between multiple spectra (“good connections”), maximizing the number of used peaks, minimizing the number of inconsistently assigned peaks between spectra (“bad connections”), and minimizing the number of assigned peaks that have no matching peaks in the other spectra (“edges”). Using six SSNMR protein chemical shift datasets with varying levels of imperfection that was introduced by peak deletion, random chemical shift changes, and manual peak picking of spectra with moderately broad linewidths, we show that the NSGA-II algorithm produces a large number of valid and good assignments rapidly. For high-quality chemical shift peak lists, NSGA-II and MC/SA perform similarly well. However, when the peak lists contain many missing peaks that are uncorrelated between different spectra and have chemical shift deviations between spectra, the modified NSGA-II produces a larger number of valid solutions than MC/SA, and is more effective at distinguishing good from mediocre assignments by avoiding the hazard of suboptimal weighting factors for the various objectives. These two advantages, namely diversity and better evaluation, lead to a higher probability of predicting the correct

  3. Resonance assignment of the NMR spectra of disordered proteins using a multi-objective non-dominated sorting genetic algorithm.

    Science.gov (United States)

    Yang, Yu; Fritzsching, Keith J; Hong, Mei

    2013-11-01

    A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR (SSNMR) spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative merit of these assignments. Our approach is modeled after the recently introduced Monte-Carlo simulated-annealing (MC/SA) protocol, with the key difference that NSGA-II simultaneously optimizes multiple assignment objectives instead of searching for possible assignments based on a single composite score. The multiple objectives include maximizing the number of consistently assigned peaks between multiple spectra ("good connections"), maximizing the number of used peaks, minimizing the number of inconsistently assigned peaks between spectra ("bad connections"), and minimizing the number of assigned peaks that have no matching peaks in the other spectra ("edges"). Using six SSNMR protein chemical shift datasets with varying levels of imperfection that was introduced by peak deletion, random chemical shift changes, and manual peak picking of spectra with moderately broad linewidths, we show that the NSGA-II algorithm produces a large number of valid and good assignments rapidly. For high-quality chemical shift peak lists, NSGA-II and MC/SA perform similarly well. However, when the peak lists contain many missing peaks that are uncorrelated between different spectra and have chemical shift deviations between spectra, the modified NSGA-II produces a larger number of valid solutions than MC/SA, and is more effective at distinguishing good from mediocre assignments by avoiding the hazard of suboptimal weighting factors for the various objectives. These two advantages, namely diversity and better evaluation, lead to a higher probability of predicting the correct assignment for a

  4. On minimizing assignment errors and the trade-off between false positives and negatives in parentage analysis.

    Science.gov (United States)

    Harrison, Hugo B; Saenz-Agudelo, Pablo; Planes, Serge; Jones, Geoffrey P; Berumen, Michael L

    2013-12-01

    Genetic parentage analyses provide a practical means with which to identify parent-offspring relationships in the wild. In Harrison et al.'s study (2013a), we compare three methods of parentage analysis and showed that the number and diversity of microsatellite loci were the most important factors defining the accuracy of assignments. Our simulations revealed that an exclusion-Bayes theorem method was more susceptible to false-positive and false-negative assignments than other methods tested. Here, we analyse and discuss the trade-off between type I and type II errors in parentage analyses. We show that controlling for false-positive assignments, without reporting type II errors, can be misleading. Our findings illustrate the need to estimate and report both the rate of false-positive and false-negative assignments in parentage analyses.

  5. On minimizing assignment errors and the trade-off between false positives and negatives in parentage analysis

    KAUST Repository

    Harrison, Hugo B.

    2013-11-04

    Genetic parentage analyses provide a practical means with which to identify parent-offspring relationships in the wild. In Harrison et al.\\'s study (2013a), we compare three methods of parentage analysis and showed that the number and diversity of microsatellite loci were the most important factors defining the accuracy of assignments. Our simulations revealed that an exclusion-Bayes theorem method was more susceptible to false-positive and false-negative assignments than other methods tested. Here, we analyse and discuss the trade-off between type I and type II errors in parentage analyses. We show that controlling for false-positive assignments, without reporting type II errors, can be misleading. Our findings illustrate the need to estimate and report both the rate of false-positive and false-negative assignments in parentage analyses. © 2013 John Wiley & Sons Ltd.

  6. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    Science.gov (United States)

    Jackson, Justin Patrick

    This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm

  7. Visual words assignment via information-theoretic manifold embedding.

    Science.gov (United States)

    Deng, Yue; Li, Yipeng; Qian, Yanjun; Ji, Xiangyang; Dai, Qionghai

    2014-10-01

    Codebook-based learning provides a flexible way to extract the contents of an image in a data-driven manner for visual recognition. One central task in such frameworks is codeword assignment, which allocates local image descriptors to the most similar codewords in the dictionary to generate histogram for categorization. Nevertheless, existing assignment approaches, e.g., nearest neighbors strategy (hard assignment) and Gaussian similarity (soft assignment), suffer from two problems: 1) too strong Euclidean assumption and 2) neglecting the label information of the local descriptors. To address the aforementioned two challenges, we propose a graph assignment method with maximal mutual information (GAMI) regularization. GAMI takes the power of manifold structure to better reveal the relationship of massive number of local features by nonlinear graph metric. Meanwhile, the mutual information of descriptor-label pairs is ultimately optimized in the embedding space for the sake of enhancing the discriminant property of the selected codewords. According to such objective, two optimization models, i.e., inexact-GAMI and exact-GAMI, are respectively proposed in this paper. The inexact model can be efficiently solved with a closed-from solution. The stricter exact-GAMI nonparametrically estimates the entropy of descriptor-label pairs in the embedding space and thus leads to a relatively complicated but still trackable optimization. The effectiveness of GAMI models are verified on both the public and our own datasets.

  8. Visualizations for genetic assignment analyses using the saddlepoint approximation method.

    Science.gov (United States)

    McMillan, L F; Fewster, R M

    2017-09-01

    We propose a method for visualizing genetic assignment data by characterizing the distribution of genetic profiles for each candidate source population. This method enhances the assignment method of Rannala and Mountain (1997) by calculating appropriate graph positions for individuals for which some genetic data are missing. An individual with missing data is positioned in the distributions of genetic profiles for a population according to its estimated quantile based on its available data. The quantiles of the genetic profile distribution for each population are calculated by approximating the cumulative distribution function (CDF) using the saddlepoint method, and then inverting the CDF to get the quantile function. The saddlepoint method also provides a way to visualize assignment results calculated using the leave-one-out procedure. This new method offers an advance upon assignment software such as geneclass2, which provides no visualization method, and is biologically more interpretable than the bar charts provided by the software structure. We show results from simulated data and apply the methods to microsatellite genotype data from ship rats (Rattus rattus) captured on the Great Barrier Island archipelago, New Zealand. The visualization method makes it straightforward to detect features of population structure and to judge the discriminative power of the genetic data for assigning individuals to source populations. © 2017, The International Biometric Society.

  9. Wildlife forensic science: A review of genetic geographic origin assignment.

    Science.gov (United States)

    Ogden, Rob; Linacre, Adrian

    2015-09-01

    Wildlife forensic science has become a key means of enforcing legislation surrounding the illegal trade in protected and endangered species. A relatively new dimension to this area of forensic science is to determine the geographic origin of a seized sample. This review focuses on DNA testing, which relies on assignment of an unknown sample to its genetic population of origin. Key examples of this are the trade in timber, fish and ivory and these are used only to illustrate the large number of species for which this type of testing is potentially available. The role of mitochondrial and nuclear DNA markers is discussed, alongside a comparison of neutral markers with those exhibiting signatures of selection, which potentially offer much higher levels of assignment power to address specific questions. A review of assignment tests is presented along with detailed methods for evaluating error rates and considerations for marker selection. The availability and quality of reference data are of paramount importance to support assignment applications and ensure reliability of any conclusions drawn. The genetic methods discussed have been developed initially as investigative tools but comment is made regarding their use in courts. The potential to compliment DNA markers with elemental assays for greater assignment power is considered and finally recommendations are made for the future of this type of testing. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

  10. Channel assignment under a conflict-free allocation policy

    Science.gov (United States)

    Stavrakakis, Ioannis

    1994-02-01

    In this paper, a random, conflict-free slot assignment policy is adopted for the allocation of a common channel between two (non-communicating) stations. Although this policy is inferior to the optimal periodic, fixed slot assignment policy, it is shown than it achieves the performance of that optimal policy as the variance of the packet arrival process increases. The main advantage of the random, conflict-free slot assignment policy is that it is simple and always feasible unlike the optimal, periodic, fixed slot assignment policy. Furthermore, the proposed policy is easily implemented in a dynamically changing environment; the optimal of such a policy is derived, and a simple strategy based on a threshold test is developed for the identification of the optimal such policy, when estimates of the traffic parameters are available. No such strategy is known for the adaptation of the parameters of the optimal periodic, fixed slot assignment policy. The developed analysis approach can be applied, to a great extent, to a system with more than two stations.

  11. Reflective practice: assessment of assignments in English for Specific Purposes

    Directory of Open Access Journals (Sweden)

    Galina Kavaliauskiené

    2007-10-01

    Full Text Available The construct alternative assessment has been widely used in higher education. It is often defined as any type of assessment of learners who provide a response to an assignment. The key features of alternative assessment are active participation of learners in self-evaluation of their performance, and the development of reflective thinking through reflective thinking (Schön, 1983. The success of alternative assessment in language teaching is predetermined by student’s performance and demonstrates learner’s language proficiency in contemporary communicative classrooms. This paper aims at researching the influence of students’ evaluations of various assignments for their linguistic development in English for Specific Purposes (ESP. The study uses learners’ assessment of different assignments and learners’ in-course and post-course written reflections on benefits to language mastery. Learners’ assignments included were contributions to portfolios (dossiers, such as essays and summaries, oral presentations, short impromptu talks, creative tasks, tests, and self-assessment notes (reflections on activities in learning ESP. Findings were obtained for two streams of the project participants. Results showed that self-assessment was beneficial for learners’ linguistic development. The context of learners’ reflections reveals that the attitudes to various assignments are affected by success or failure in students’ performance. Reflective practice might help teachers develop ways of dealing with previously identified difficulties and improve the quality of teaching.

  12. Raman vapor spectrum and vibrational assignment for pyridine

    Science.gov (United States)

    Klots, T. D.

    1998-09-01

    Assignment modifications for the pyridine fundamentals are proposed, based on first time Raman vapor measurements, and a more complete set of infrared and Raman spectra for the gas and liquid. Raman polarization measurements are newly given for some 70 lines between 1600 and 3000 cm -1. The Kakiuti et al. (Kakiuti et al., J. Mol. Spectrosc. 61 (1976) 164) assignment for the nonplanar modes in CS 2 solution is shown to be the only previous correct assignment. Planar assignment modifications, though generally small, are warranted because of the benchmark nature of pyridine. A previous set of vibrational frequencies, derived from a scaled 4-21G force field calculation (Pongor et al., J. Am. Chem. Soc. 106 (1984) 2765; Pongor et al., J. Mol. Spectrosc. 114 (1985) 445), is in excellent agreement with the observed fundamentals, and in fact, tips the balance in favor of assigning ν22 to 1053 cm -1. Ideal-gas entropies derived from spectroscopic constants are also seen to be in excellent agreement with those from calorimetry (Chirico et al., J. Chem. Thermodyn. 28 (1996) 797; Chirico and Steele, J. Chem. Thermodyn. 28 (1996) 819).

  13. An integer programming model for assigning students to elective courses

    Directory of Open Access Journals (Sweden)

    Ivo Beroš

    2015-10-01

    Full Text Available This paper deals with the problem of assigning students to elective courses according to their preferences. This process of assigning students to elective courses according to their preferences often places before academic institutions numerous obstacles, the most typical being a limited number of students who can be assigned to any particular class. Furthermore, due to financial or technical reasons, the maximum number of the elective courses is determined in advance, meaning that the institution decides which courses to conduct. Therefore, the expectation that all the students will be assigned to their first choice of courses is not realistic (perfect satisfaction. This paper presents an integer programming model that maximizes the total student satisfaction in line with a number of different constraints. The measure of student satisfaction is based on a student's order of preference according to the principle: the more a choice is met the higher the satisfaction. Following the basic model, several versions of the models are generated to cover possible real-life situations, while taking into consideration the manner student satisfaction is measured, as well as the preference of academic institution within set technical and financial constraints. The main contribution of the paper is introducing the concept of the minimal student satisfaction level that reduces the number of students dissatised with the courses to which they were assigned.

  14. Lexical stress assignment as a problem of probabilistic inference.

    Science.gov (United States)

    Jouravlev, Olessia; Lupker, Stephen J

    2015-10-01

    A new conceptualization of the process of stress assignment, couched in the principles of (Bayesian) probabilistic inference, is introduced in this paper. According to this approach, in deciding where to place stress in a polysyllabic word, a reader estimates the posterior probabilities of alternative stress patterns. This estimation is accomplished by adjusting a prior belief about the likelihoods of alternative stress patterns (derived from experience with the distribution of stress patterns in the language) by using lexical and non-lexical sources of evidence for stress derived from the orthographic input. The proposed theoretical framework was used to compute probabilities of stress patterns for Russian disyllabic words and nonwords which were then compared with the performance of readers. The results showed that the estimated probabilities of stress patterns were reflective of actual stress assignment performance and of naming latencies, suggesting that the mechanisms that are involved in the process of stress assignment might indeed be inferentially-based.

  15. Graphical interpretation of Boolean operators for protein NMR assignments

    Energy Technology Data Exchange (ETDEWEB)

    Verdegem, Dries [Universite des Sciences et Technologies de Lille, Unite de Glycobiologie Structurale et Fonctionelle, UMR 8576 CNRS, IFR 147 (France); Dijkstra, Klaas [University of Groningen, Department of Biophysical Chemistry (Netherlands); Hanoulle, Xavier; Lippens, Guy [Universite des Sciences et Technologies de Lille, Unite de Glycobiologie Structurale et Fonctionelle, UMR 8576 CNRS, IFR 147 (France)], E-mail: guy.lippens@univ-lille1.fr

    2008-09-15

    We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies 'AND'-, 'OR'- and 'NOT'-like operations on planes pulled out of the classical three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal.

  16. Neural reactivations during sleep determine network credit assignment.

    Science.gov (United States)

    Gulati, Tanuj; Guo, Ling; Ramanathan, Dhakshin S; Bodepudi, Anitha; Ganguly, Karunesh

    2017-09-01

    A fundamental goal of motor learning is to establish the neural patterns that produce a desired behavioral outcome. It remains unclear how and when the nervous system solves this 'credit assignment' problem. Using neuroprosthetic learning, in which we could control the causal relationship between neurons and behavior, we found that sleep-dependent processing was required for credit assignment and the establishment of task-related functional connectivity reflecting the casual neuron-behavior relationship. Notably, we observed a strong link between the microstructure of sleep reactivations and credit assignment, with downscaling of non-causal activity. Decoupling of spiking to slow oscillations using optogenetic methods eliminated rescaling. Thus, our results suggest that coordinated firing during sleep is essential for establishing sparse activation patterns that reflect the causal neuron-behavior relationship.

  17. Quality control test for sequence-phenotype assignments.

    Directory of Open Access Journals (Sweden)

    Maria Teresa Lara Ortiz

    Full Text Available Relating a gene mutation to a phenotype is a common task in different disciplines such as protein biochemistry. In this endeavour, it is common to find false relationships arising from mutations introduced by cells that may be depurated using a phenotypic assay; yet, such phenotypic assays may introduce additional false relationships arising from experimental errors. Here we introduce the use of high-throughput DNA sequencers and statistical analysis aimed to identify incorrect DNA sequence-phenotype assignments and observed that 10-20% of these false assignments are expected in large screenings aimed to identify critical residues for protein function. We further show that this level of incorrect DNA sequence-phenotype assignments may significantly alter our understanding about the structure-function relationship of proteins. We have made available an implementation of our method at http://bis.ifc.unam.mx/en/software/chispas.

  18. Quality Control Test for Sequence-Phenotype Assignments

    Science.gov (United States)

    Ortiz, Maria Teresa Lara; Rosario, Pablo Benjamín Leon; Luna-Nevarez, Pablo; Gamez, Alba Savin; Martínez-del Campo, Ana; Del Rio, Gabriel

    2015-01-01

    Relating a gene mutation to a phenotype is a common task in different disciplines such as protein biochemistry. In this endeavour, it is common to find false relationships arising from mutations introduced by cells that may be depurated using a phenotypic assay; yet, such phenotypic assays may introduce additional false relationships arising from experimental errors. Here we introduce the use of high-throughput DNA sequencers and statistical analysis aimed to identify incorrect DNA sequence-phenotype assignments and observed that 10–20% of these false assignments are expected in large screenings aimed to identify critical residues for protein function. We further show that this level of incorrect DNA sequence-phenotype assignments may significantly alter our understanding about the structure-function relationship of proteins. We have made available an implementation of our method at http://bis.ifc.unam.mx/en/software/chispas. PMID:25700273

  19. CAPA-An integrated computer-assisted personalized assignment system

    Science.gov (United States)

    Kashy, E.; Sherrill, B. M.; Tsai, Y.; Thaler, D.; Weinshank, D.; Engelmann, M.; Morrissey, D. J.

    1993-12-01

    A new integrated computer-assisted personalized assignment (CAPA) system that creates individual assignments for each student has been developed and found to be a powerful motivator. The CAPA system allows students to enter their answers to personalized assignments directly via networked terminals, gives immediate feedback and hints (allowing challenging questions), while providing the instructor with on-line performance information. The students are encouraged to study together which is known to be an effective learning strategy, but each must still obtain his/her own correct answers. Students are allowed to re-enter solutions to the problems before the due date without penalty, thus providing students with different skills levels the opportunity and incentive to understand the material without being judged during the learning process. The features and operation of the system are described, observations on its use in an introductory general physics class are reported, and some of the highly favorable student reactions are included.

  20. The ICAP (Interactive Course Assignment Pages Publishing System

    Directory of Open Access Journals (Sweden)

    Kim Griggs

    2008-03-01

    Full Text Available The ICAP publishing system is an open source custom content management system that enables librarians to easily and quickly create and manage library help pages for course assignments (ICAPs, without requiring knowledge of HTML or other web technologies. The system's unique features include an emphasis on collaboration and content reuse and an easy-to-use interface that includes in-line help, simple forms and drag and drop functionality. The system generates dynamic, attractive course assignment pages that blend Web 2.0 features with traditional library resources, and makes the pages easier to find by providing a central web page for the course assignment pages. As of December 2007, the code is available as free, open-source software under the GNU General Public License.

  1. Quality control test for sequence-phenotype assignments.

    Science.gov (United States)

    Ortiz, Maria Teresa Lara; Rosario, Pablo Benjamín Leon; Luna-Nevarez, Pablo; Gamez, Alba Savin; Martínez-del Campo, Ana; Del Rio, Gabriel

    2015-01-01

    Relating a gene mutation to a phenotype is a common task in different disciplines such as protein biochemistry. In this endeavour, it is common to find false relationships arising from mutations introduced by cells that may be depurated using a phenotypic assay; yet, such phenotypic assays may introduce additional false relationships arising from experimental errors. Here we introduce the use of high-throughput DNA sequencers and statistical analysis aimed to identify incorrect DNA sequence-phenotype assignments and observed that 10-20% of these false assignments are expected in large screenings aimed to identify critical residues for protein function. We further show that this level of incorrect DNA sequence-phenotype assignments may significantly alter our understanding about the structure-function relationship of proteins. We have made available an implementation of our method at http://bis.ifc.unam.mx/en/software/chispas.

  2. Assigning on-ramp flows to maximize highway capacity

    Science.gov (United States)

    Wang, Qiao-Ming; Jiang, Rui; Sun, Xiao-Yan; Wang, Bing-Hong

    2009-09-01

    In this paper, we study the capacity of a highway with two on-ramps by using a cellular automata traffic flow model. We investigate how to improve the system capacity by assigning traffic flow to the two ramps. The system phase diagram is presented and different regions are classified. It is shown that in region I, in which both ramps are in free flow and the main road upstream of the ramps is in congestion, assigning a higher proportion of the demand to the upstream on-ramp could improve the overall flow, which is consistent with previous studies. This is explained through studying the spatiotemporal patterns and analytical investigations. In contrast, optimal assignment has not been observed in other regions. We point out that our result is robust and model independent under certain conditions.

  3. Assignment of sex in neonates with ambiguous genitalia.

    Science.gov (United States)

    Reiner, W G

    1999-08-01

    Sex assignment in the newborn with ambiguous genitalia has been based on the adequacy of the phallus in the male, potential fertility in the female, and cosmetic appearance of the reconstructed genitalia. Recent data from both the neurosciences and from clinical research, however, casts doubt on the validity of such criteria for clinical decision making. Current knowledge suggests a need to shift away from the current clinical approach and to incorporate these new data into decisions based on a broader understanding of the etiology of gender identity. Recognition of the primacy of psychosocial and psychosexual developmental outcomes for children with ambiguous genitalia is lending direction to longitudinal outcomes research. New approaches to sex assignment have been suggested, and the paradigm for sex assignment in the newborn period is in transition.

  4. A Stone Resource Assignment Model under the Fuzzy Environment

    Directory of Open Access Journals (Sweden)

    Liming Yao

    2012-01-01

    to tackle a stone resource assignment problem with the aim of decreasing dust and waste water emissions. On the upper level, the local government wants to assign a reasonable exploitation amount to each stone plant so as to minimize total emissions and maximize employment and economic profit. On the lower level, stone plants must reasonably assign stone resources to produce different stone products under the exploitation constraint. To deal with inherent uncertainties, the object functions and constraints are defuzzified using a possibility measure. A fuzzy simulation-based improved simulated annealing algorithm (FS-ISA is designed to search for the Pareto optimal solutions. Finally, a case study is presented to demonstrate the practicality and efficiency of the model. Results and a comparison analysis are presented to highlight the performance of the optimization method, which proves to be very efficient compared with other algorithms.

  5. Simulation Optimization of the Crossdock Door Assignment Problem

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel distance by material handling equipment is minimized. We propose a two fold solution; simulation and optimization of the simulation model simulation optimization. The novel aspect of our solution approach is that we intend to use simulation to derive a more realistic objective function and use Memetic algorithms to find an optimal solution. The main advantage of using Memetic algorithms is that it combines a local search with Genetic Algorithms. The Crossdock Door Assignment Problem is a new domain application to Memetic Algorithms and it is yet unknown how it will perform.

  6. A Circuit Simulation Technique for Congested Network Traffic Assignment Problem

    Science.gov (United States)

    Cho, Hsun-Jung; Huang, Heng

    2007-12-01

    The relation between electrical circuit and traffic network has been proposed by Sasaki and Inouye, but they proposed link cost function is a linear function which cannot present the congestion situation. Cho and Huang extended the link cost function to a nonlinear function which can explain the congested network. In this paper, we proposed a foremost and novel approach to solve the traffic assignment problem (TAP) by simulating the electrical circuit network which consists of nonlinear link cost function models. Comparing with the solutions of Frank-Wolfe algorithm, the simulation results are nearly identical. Thus, the simulation of a network circuit model can be applied to solve network traffic assignment problems. Finally, two examples are proposed, and the results confirmed that electrical circuit simulation is workable in solving congested network traffic assignment problems.

  7. Searching objective criteria for patient assignment in addiction treatment.

    Science.gov (United States)

    López-Goñi, José J; Fernández-Montalvo, Javier; Arteaga, Alfonso; Esarte, Sonia

    2017-05-01

    The main aim of this study was to objectify the treatment assignment criteria used in a clinical centre for addiction treatment in Spain. A sample of 162 patients (87 inpatients and 75 outpatients) who sought treatment between 2010 and 2012 was assessed. Clinical characteristics (addiction severity, psychopathological symptoms, impulsiveness and maladjustment) of the two treatment groups (inpatient and outpatient) into which patients were assigned according to the clinical criteria of therapists were analysed to identify which variables were more relevant for patient placement. Moreover, the therapeutic progression of patients who met and did not meet the assignment criteria received was studied. According to the results, a score above 4 in the family/social support area of the European Addiction Severity Index (EuropASI), or, in cases of a score between 2 and 4 in the family/social area of EuropASI, a score above 2 in the partner subscale of the Maladjustment Scale correctly classified 73.5% of cases (96.6% of inpatients and 46.7% of outpatients). Comparisons of therapeutic results depending on matching or mismatching these assignment criteria showed a larger effect size in mismatching patient assignment criteria for outpatient treatment. The results obtained in this study provide an objective criterion for addicted patient placement. Moreover, from a cost-effective perspective, they question the necessity of inpatient treatment in most cases, demonstrating that outpatient treatment is a sufficient level of care. This study addresses the approach to assigning patients to the treatment modality that best fits them, implementing the least expensive level of care needed to achieve treatment success. Copyright © 2017 Elsevier Inc. All rights reserved.

  8. Automatic Functionality Assignment to AUTOSAR Multicore Distributed Architectures

    DEFF Research Database (Denmark)

    Maticu, Florin; Pop, Paul; Axbrink, Christian

    2016-01-01

    of better performance, cost, size, fault-tolerance and power consumption. In this paper we present an approach for the automatic software functionality assignment to multicore distributed architectures. We consider that the systems use the AUTomotive Open System ARchitecture (AUTOSAR). The functionality...... is modeled as a set of software components composed of subtasks, called runnables, in AUTOSAR terminology. We have proposed a Simulated Annealing metaheuristic optimization that decides: the (i) mapping of software components to multicore ECUs, (ii) the assignment of runnables to the ECU cores, (iii...

  9. Convergence properties of the softassign quadratic assignment algorithm.

    Science.gov (United States)

    Rangarajan, A; Vuille, A; Mjolsness, E

    1999-08-15

    The softassign quadratic assignment algorithm is a discrete-time, continuous-state, synchronous updating optimizing neural network. While its effectiveness has been shown in the traveling salesman problem, graph matching, and graph partitioning in thousands of simulations, its convergence properties have not been studied. Here, we construct discrete-time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction, which show convergence to a fixed point. The combination of good convergence properties and experimental success makes the softassign algorithm an excellent choice for neural quadratic assignment optimization.

  10. Routing and wavelength assignment in hierarchical WDM networks

    Institute of Scientific and Technical Information of China (English)

    Yiyi LU; Ruxiang JIN; Chen HE

    2008-01-01

    A new routing and wavelength assignment method applied in hierarchical wavelength division multiplexing(WDM)networks is proposed.The algorithm is called offiine band priority algorithm(offiine BPA).The offline BPA targets to maximize the number of waveband paths under the condition of minimum number of wavelengths,and solve the routing and wavelength assignment(RWA)problem with waveband grooming to reduce cost.Based on the circle construction algorithm,waveband priority function is introduced to calculate the RWA problem.Simulation results demonstrate that the proposed algorithm achieves significant cost reduction in WDM network construction.

  11. New Method for Spin Assignment of Superdeformed Rotational Bands

    Institute of Scientific and Technical Information of China (English)

    MU Liang-Zhu; WU Chong-Shi

    2005-01-01

    A new method for spin assignment of superdeformed rotational bands is proposed and it turns out to be more efficient than other methods used before. The application is made to superdeformed bands in A ~ 190 and A ~ 150 mass regions. By analyzing the standard deviation of the fixed γ-ray energies of an SD band in different methods,the advantage of the present method over the other methods is presented. This method brings then a comprehensive interpretation of the methods used in spin assignment.

  12. AC 410 AC410 AC410 Unit 7 Homework Assignment

    OpenAIRE

    Laynebaril1

    2017-01-01

    AC 410 AC410 AC410 Unit 7 Homework Assignment Click Link Below To Buy: http://hwcampus.com/shop/ac410-unit-7-homework-assignment/    Questions Requiring Analysis 14-30   Early in your first audit of Star Corporation, you notice that sales and year-end inventory are almost unchanged from the prior year. However, cost of goods sold is less than in the preceding year, and accounts payable also are down substantially. Gross profit has increased, but this increase has not c...

  13. Evoked Feelings, Assigned Meanings and Constructed Knowledge Based on Mistakes

    Directory of Open Access Journals (Sweden)

    Luciane Guimarães Batistella Bianchini

    2017-09-01

    Full Text Available By means of Piaget's critical clinical method, the study investigated the meanings assigned to mistakes by four students in different activities and interactive situations. The research also analyzed the results of using self-regulatory situations in understanding mistakes initially committed by the students. Data collection instruments consisted of games, video recordings, diaries and interviews. Following intervention, the students were able to recognize their competence, establish positive interactions within the group, and avoid viewing mistakes as obstacles to learning. We concluded that the meanings assigned to mistakes depend on certain variables, among them feelings nurtured by the individuals about themselves, the other, and the object of knowledge.

  14. Regional pole assignment for uncertain delta-operator systems

    Institute of Scientific and Technical Information of China (English)

    Man LIU; Yuanwei JING; Siying ZHANG

    2004-01-01

    The pole assignment in a specified disk by state feedback for uncertain delta-operator systems is studied.By making use of algebra Riccati equations,a sufficient and necessary condition of pole assignment for a kind of parameter uncertain delta-operator system in a specified disk by state feedback is presented.And the design method of state feedback controller is also developed.The proposed method can unify some previous related results of continuous and discrete time systems into the delta framework.The efficiency of the design method is illustrated by a numerical example.

  15. Fiber Assignment in Next-generation Wide-field Spectrographs

    OpenAIRE

    Morales, Isaac; Montero-Dorta, Antonio D.; Azzaro, Marco; Prada, Francisco; Sanchez, Justo; Becerril, Santiago

    2011-01-01

    We present an optimized algorithm for assigning fibers to targets in next-generation fiber-fed multi-object spectrographs. The method, that we named draining algorithm, ensures that the maximum number of targets in a given target field is observed in the first few tiles. Using randomly distributed targets and mock galaxy catalogs we have estimated that the gain provided by the draining algorithm as compared to a random assignment can be as much as 2% for the first tiles. This would imply for ...

  16. Selection and Assignment of Machines: a Parallel Aproach

    OpenAIRE

    Francisco Ribeiro, José

    2003-01-01

    In this paper, a two-phase method is presented for selection of machines to be kept on the shop floor and assignment of parts to be manufactured to these machines. In the first phase, dynamic programming or a heuristic procedure identifies a set of feasible solutions to a knapsack problem. In the second phase, implicit enumeration technique or a greedy algorithm solves an assignment problem. The proposed method is written in language C and runs on a parallel virtual machine called PVM-W95. Th...

  17. MAT 300  Assignment 1: Bottling Company Case Study

    OpenAIRE

    Laynebaril

    2017-01-01

     MAT 300  Assignment 1: Bottling Company Case Study Click Link Below To Buy: http://hwcampus.com/shop/mat-300-assignment-1-bottling-company-case-study/   Due Week 10 and worth 140 points Imagine you are a manager at a major bottling company. Customers have begun to complain that the bottles of the brand of soda produced in your company contain less than the advertised sixteen (16) ounces of product. Your boss wants to solve the problem at hand and has asked you to investig...

  18. Two-dimensional assignment with merged measurements using Langrangrian relaxation

    Science.gov (United States)

    Briers, Mark; Maskell, Simon; Philpott, Mark

    2004-01-01

    Closely spaced targets can result in merged measurements, which complicate data association. Such merged measurements violate any assumption that each measurement relates to a single target. As a result, it is not possible to use the auction algorithm in its simplest form (or other two-dimensional assignment algorithms) to solve the two-dimensional target-to-measurement assignment problem. We propose an approach that uses the auction algorithm together with Lagrangian relaxation to incorporate the additional constraints resulting from the presence of merged measurements. We conclude with some simulated results displaying the concepts introduced, and discuss the application of this research within a particle filter context.

  19. New Method for Spin Assignment of Superdeformed Rotational Bands

    Science.gov (United States)

    Mu, Liang-Zhu; Wu, Chong-Shi

    2005-04-01

    A new method for spin assignment of superdeformed rotational bands is proposed and it turns out to be more efficient than other methods used before. The application is made to superdeformed bands in A~190 and A~150 mass regions. By analyzing the standard deviation of the fixed γ-ray energies of an SD band in different methods, the advantage of the present method over the other methods is presented. This method brings then a comprehensive interpretation of the methods used in spin assignment.

  20. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks

    Directory of Open Access Journals (Sweden)

    Enrique de la Hoz

    2015-11-01

    Full Text Available Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.

  1. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks.

    Science.gov (United States)

    de la Hoz, Enrique; Gimenez-Guzman, Jose Manuel; Marsa-Maestre, Ivan; Orden, David

    2015-11-24

    Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.

  2. QoS Aware Wavelength Assignment in Wavelength Division Multiplexing Based Optical Networks

    Directory of Open Access Journals (Sweden)

    U. Mahmud

    2015-01-01

    Full Text Available Wavelength Division Multiplexing (WDM is used in optical networks to implement data circuits. These circuits allow exchange of information as a measure of wavelength in optical domain. Quality of Service (QoS provisioning is one of the issues in WDM optical networks. This paper discusses different QoS aware Routing and Wavelength Assignment (RWA algorithms. Some unaddressed issues are identified that include the effects of degraded performance, traffic patterns and type of QoS service for users. A software module is proposed that calculates a ‘D’ factor facilitating in the wavelength assignment for QoS provisioning. This module is designed to work in conjunction with existing RWA algorithms.

  3. Two parametric approaches for eigenstructure assignment in second-order linear systems

    Institute of Scientific and Technical Information of China (English)

    Guangren DUAN

    2003-01-01

    This paper considers eigenstructure assignment in second-order linear systems via proportional plus derivative feedback. It is shown that the problem is closely related to a type of so-called second-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two complete parametric methods for the proposed eigenstructure assignment problem are presented. Both methods give simple complete parametric expressions for the feedback gains and the closed-loop eigenvector matrices. The first one mainly depends on a series of singular value decompositions, and is thus nurnerically simple and reliable; the second one utilizes the right factorization of the system, and allows the dosed-loop eigenvalues to be set undetermined and sought via certain optimization procedures. An example shows the effectiveness of the proposed approaches.

  4. Structure of {sup 11}Be studied in {beta}-delayed neutron- and {gamma}- decay from polarized {sup 11}Li

    Energy Technology Data Exchange (ETDEWEB)

    Hirayama, Y. [Department of Physics, Graduate School of Science, Osaka University (Japan); Shimoda, T. [Department of Physics, Graduate School of Science, Osaka University (Japan); Izumi, H. [Department of Physics, Graduate School of Science, Osaka University (Japan); Yano, H. [Department of Physics, Graduate School of Science, Osaka University (Japan); Yagi, M. [Department of Physics, Graduate School of Science, Osaka University (Japan); Hatakeyama, A. [Institute of Physics, Graduate School of Arts and Sciences, University of Tokyo (Japan); Levy, C.D.P. [TRIUMF (Canada); Jackson, K.P. [TRIUMF (Canada); Miyatake, H. [High Energy Accelerator Research Organization (KEK) (Japan)

    2004-12-27

    The detailed level scheme of {sup 11}Be, including spin-parity assignments, has been established from a {beta}-delayed decay spectroscopy of spin-polarized {sup 11}Li (Lig.s.11->{beta}Be*11->nBe*10->{gamma}Beg.s.10). From the decay scheme of {sup 11}Be, neutron spectroscopic factors of the levels in {sup 11}Be have been determined. The present results have been compared with the predictions by the Anti-symmetrized Molecular Dynamics (AMD) theory, where various types of {alpha}-cluster states have been predicted for the excited states both in {sup 11}Be and {sup 10}Be. Some of the levels in {sup 11}Be show good accord with the 2{alpha}-cluster states in the rotational bands and with a single {alpha}-cluster state.

  5. Wavelength and fiber assignment problems on avionic networks

    DEFF Research Database (Denmark)

    Zhang, Jiang; An, Yi; Berger, Michael Stübert

    2011-01-01

    This paper solves the wavelength and fiber assignment problems with systems' isolation requirements on the avionic ring networks. The experiment results give a general glace of the numbers of the wavelengths and fibers are required under certain scale of networks. At the beginning of increasing...

  6. Development of a SNP panel for parentage assignment in sheep

    Science.gov (United States)

    The construction of accurate pedigrees is important in a variety of animal production systems and research scenarios. For example, the ability to correctly assign the paternity of offspring derived from multi-sire mating is important to producers where lambs show variation in their economic merit at...

  7. Augmenting superpopulation capture-recapture models with population assignment data

    Science.gov (United States)

    Wen, Zhi; Pollock, Kenneth; Nichols, James; Waser, Peter

    2011-01-01

    Ecologists applying capture-recapture models to animal populations sometimes have access to additional information about individuals' populations of origin (e.g., information about genetics, stable isotopes, etc.). Tests that assign an individual's genotype to its most likely source population are increasingly used. Here we show how to augment a superpopulation capture-recapture model with such information. We consider a single superpopulation model without age structure, and split each entry probability into separate components due to births in situ and immigration. We show that it is possible to estimate these two probabilities separately. We first consider the case of perfect information about population of origin, where we can distinguish individuals born in situ from immigrants with certainty. Then we consider the more realistic case of imperfect information, where we use genetic or other information to assign probabilities to each individual's origin as in situ or outside the population. We use a resampling approach to impute the true population of origin from imperfect assignment information. The integration of data on population of origin with capture-recapture data allows us to determine the contributions of immigration and in situ reproduction to the growth of the population, an issue of importance to ecologists. We illustrate our new models with capture-recapture and genetic assignment data from a population of banner-tailed kangaroo rats Dipodomys spectabilis in Arizona.

  8. Java bytecode verification via static single assignment form

    DEFF Research Database (Denmark)

    Gal, Andreas; Probst, Christian W.; Franz, Michael

    2008-01-01

    that transforms JVM bytecode into Static Single Assignment Form (SSA) and thereby propagates definitions directly to uses. Type checking at control flow merge points can then be performed in a single pass. Our prototype implementation of the new algorithm is faster than the standard JVM bytecode verifier. It has...

  9. A Survey of the Routing and Wavelength Assignment Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    When transmitting data in an all-optical network, data connections must be established in such a way that two or more connections never share a wavelength on the same fi ber. The NP-hard Routing and Wavelength Assignment (RWA) problem consists of finding paths and wavelengths for a set of data...

  10. Clustered Self Organising Migrating Algorithm for the Quadratic Assignment Problem

    Science.gov (United States)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman

    2009-08-01

    An approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Self Organising Migrating Algorithm (SOMA) is modified using this approach and vetted with the Quadratic Assignment Problem (QAP). Extensive experimentation is conducted on benchmark problems in this area.

  11. A new heuristic for the quadratic assignment problem

    OpenAIRE

    Zvi Drezner

    2002-01-01

    We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.

  12. A Competitive and Experiential Assignment in Search Engine Optimization Strategy

    Science.gov (United States)

    Clarke, Theresa B.; Clarke, Irvine, III

    2014-01-01

    Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be…

  13. 34 CFR 682.508 - Assignment of a loan.

    Science.gov (United States)

    2010-07-01

    ... 34 Education 3 2010-07-01 2010-07-01 false Assignment of a loan. 682.508 Section 682.508 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION FEDERAL FAMILY EDUCATION LOAN (FFEL) PROGRAM Federal Guaranteed Student Loan...

  14. Preconditions of origin, essence and assignment of strategic managerial accounting

    OpenAIRE

    Boiko, I

    2010-01-01

    The article is devoted to the research of preconditions and necessity of creation strategic managerial accounting in the accounting system of enterprise. There are investigated economic essence and assignment of strategic managerial accounting and substantiated its importance for making strategic decisions on an enterprise.

  15. 37 CFR 1.46 - Assigned inventions and patents.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Assigned inventions and patents. 1.46 Section 1.46 Patents, Trademarks, and Copyrights UNITED STATES PATENT AND TRADEMARK OFFICE, DEPARTMENT OF COMMERCE GENERAL RULES OF PRACTICE IN PATENT CASES National Processing Provisions Who May...

  16. Bandit-Inspired Memetic Algorithms for Solving Quadratic Assignment Problems

    NARCIS (Netherlands)

    Puglierin, Francesco; Drugan, Madalina M.; Wiering, Marco

    2013-01-01

    In this paper we propose a novel algorithm called the Bandit-Inspired Memetic Algorithm (BIMA) and we have applied it to solve different large instances of the Quadratic Assignment Problem (QAP). Like other memetic algorithms, BIMA makes use of local search and a population of solutions. The novelty

  17. The Quadratic Assignment Problem is Easy for Robinsonian Matrices

    NARCIS (Netherlands)

    Laurent, M.; Seminaroti, M.

    2014-01-01

    We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A;B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson (dis)

  18. A bilinear programming solution to the quadratic assignment problem

    NARCIS (Netherlands)

    J.F. Kaashoek (Johan); J.H.P. Paelinck (Jean)

    1999-01-01

    textabstractThe quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and Wolkowicz, 1994). One of the authors has published some material, in which it was tried, by structuring the problem additionally, to bring it as closely as possible in the

  19. The quadratic assignment problem is easy for robinsonian matrices

    NARCIS (Netherlands)

    Laurent, M.; Seminaroti, M.

    2015-01-01

    We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans–Beckman form QAP(A,B), by showing that the identity permutation is optimal when AA and BB are respectively a Robinson similarity and dissimilarity matrix and one of AA or BB is a Toeplitz matrix. A Robinson (

  20. A Competitive and Experiential Assignment in Search Engine Optimization Strategy

    Science.gov (United States)

    Clarke, Theresa B.; Clarke, Irvine, III

    2014-01-01

    Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be new…

  1. Effect of Sex Identification on Instrument Assignment by Band Directors

    Science.gov (United States)

    Johnson, Christopher M.; Stewart, Erin E.

    2004-01-01

    The purpose of this study was to investigate the effect of sex identification on the assignment of instruments to beginning band students. Participants were band directors solicited at music conferences and music education students solicited from major universities across the United States. Participants completed an online survey about instrument…

  2. Nursing Distance Learning Course Comparison of Assignments and Examination Scores

    Science.gov (United States)

    Mundine, Jennifer

    2016-01-01

    Nursing programs have embraced distance learning in their curricula, but discussion is ongoing about course assignments and grading criteria to increase examination scores in nursing distance learning courses. Because course examinations are a predictor of success on the postgraduate licensing examination (NCLEX-RN), the purpose of this study was…

  3. Mental reconstruction:Semantic property assignment of 'along'

    Institute of Scientific and Technical Information of China (English)

    苏都

    2010-01-01

    This article is an attempt to discuss the semantic properties of the word 'along'in the context of general syntax. It reveals that the meaning of it covers two parts of speechin the process of mental reconstruction while interacting with adjacent syntactic components.In this process semantic property assignment does concerns some distinct principles,such asforegrounding and the like.

  4. A Research-Based Narrative Assignment for Global Health Education

    Science.gov (United States)

    Lencucha, Raphael

    2014-01-01

    There is a paucity of research on novel approaches to classroom-based global health education despite the growing popularity of this topic in health professional curricula. The purpose of the following paper is to (1) describe the rationale underlying the use of a research-based narrative assignment for global health education, and (2) describe…

  5. 46 CFR 42.13-10 - Freeboards assigned vessels.

    Science.gov (United States)

    2010-10-01

    ..., inclusive. (b) Vessels carrying timber deck cargoes may be assigned, in addition to the freeboards required by paragraph (a) of this section, timber freeboards in accordance with the provisions of §§ 42.25-1... Commandant under the procedure of paragraph (f) of this section. (d) Vessels of wood or of...

  6. Using Clouds for MapReduce Measurement Assignments

    Science.gov (United States)

    Rabkin, Ariel; Reiss, Charles; Katz, Randy; Patterson, David

    2013-01-01

    We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services and the standard Hadoop API. Using the standard API, students directly experienced the quality of industrial big-data tools. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware,…

  7. Designing Effective Classroom Assignments: Intellectual Work Worth Sharing

    Science.gov (United States)

    Hutchings, Pat; Jankowski, Natasha A.; Schultz, Kathryn E.

    2016-01-01

    The National Institute for Learning Outcomes Assessment's (NILOA's) online library of faculty-created assignments that both produce and demonstrate learning makes pedagogical work visible and available for colleagues to learn from, build on, and reward. This online library allows faculty to collaborate in sharing, critiquing, and improving…

  8. Understanding and Supporting the Career Implications of International Assignments

    Science.gov (United States)

    Collings, David G.; Doherty, Noeleen; Luethy, Madeleine; Osborn, Derek

    2011-01-01

    International assignments represent an important form of migration in the global economy. In contrast to most other migrants, international assignees enjoy a relatively privileged position in the labor market. Authored by a diverse team of academics and practitioners, this paper draws on insights from empirical research and unpublished examples…

  9. The Rescue Mission: Assigning Guilt to a Chaotic Scene.

    Science.gov (United States)

    Procter, David E.

    1987-01-01

    Seeks to identify rhetorical distinctiveness of the rescue mission as a form of belligerency--examining presidential discourse justifying the 1985 Lebanon intervention, the 1965 Dominican intervention, and the 1983 Grenada intervention. Argues that the distinction is in guilt narrowly assigned to a chaotic scene and the concomitant call for…

  10. A Randomized Experiment Comparing Random and Cutoff-Based Assignment

    Science.gov (United States)

    Shadish, William R.; Galindo, Rodolfo; Wong, Vivian C.; Steiner, Peter M.; Cook, Thomas D.

    2011-01-01

    In this article, we review past studies comparing randomized experiments to regression discontinuity designs, mostly finding similar results, but with significant exceptions. The latter might be due to potential confounds of study characteristics with assignment method or with failure to estimate the same parameter over methods. In this study, we…

  11. Single Assignment C (SAC): High Productivity meets High Performance

    NARCIS (Netherlands)

    Grelck, C.; Zsók, V.; Horváth, Z.; Plasmeijer, R.

    2012-01-01

    We present the ins and outs of the purely functional, data parallel programming language SaC (Single Assignment C). SaC defines state- and side-effect-free semantics on top of a syntax resembling that of imperative languages like C/C++/C# or Java: functional programming with curly brackets. In contr

  12. Spatio-temporal credit assignment in neuronal population learning.

    Science.gov (United States)

    Friedrich, Johannes; Urbanczik, Robert; Senn, Walter

    2011-06-01

    In learning from trial and error, animals need to relate behavioral decisions to environmental reinforcement even though it may be difficult to assign credit to a particular decision when outcomes are uncertain or subject to delays. When considering the biophysical basis of learning, the credit-assignment problem is compounded because the behavioral decisions themselves result from the spatio-temporal aggregation of many synaptic releases. We present a model of plasticity induction for reinforcement learning in a population of leaky integrate and fire neurons which is based on a cascade of synaptic memory traces. Each synaptic cascade correlates presynaptic input first with postsynaptic events, next with the behavioral decisions and finally with external reinforcement. For operant conditioning, learning succeeds even when reinforcement is delivered with a delay so large that temporal contiguity between decision and pertinent reward is lost due to intervening decisions which are themselves subject to delayed reinforcement. This shows that the model provides a viable mechanism for temporal credit assignment. Further, learning speeds up with increasing population size, so the plasticity cascade simultaneously addresses the spatial problem of assigning credit to synapses in different population neurons. Simulations on other tasks, such as sequential decision making, serve to contrast the performance of the proposed scheme to that of temporal difference-based learning. We argue that, due to their comparative robustness, synaptic plasticity cascades are attractive basic models of reinforcement learning in the brain.

  13. Derandomization of Online Assignment Algorithms for Dynamic Graphs

    CERN Document Server

    Sahai, Ankur

    2011-01-01

    This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints. Edges in this graph may disappear and reappear over time. Performance of these algorithms is measured using simulations. This paper also attempts to derandomize the randomized online algorithm for this problem.

  14. Undergraduates Improve upon Published Crystal Structure in Class Assignment

    Science.gov (United States)

    Horowitz, Scott; Koldewey, Philipp; Bardwell, James C.

    2014-01-01

    Recently, 57 undergraduate students at the University of Michigan were assigned the task of solving a crystal structure, given only the electron density map of a 1.3 Å crystal structure from the electron density server, and the position of the N-terminal amino acid. To test their knowledge of amino acid chemistry, the students were not given the…

  15. Single Assignment C (SAC): High Productivity meets High Performance

    NARCIS (Netherlands)

    Grelck, C.; Zsók, V; Horváth, Z; Plasmeijer, R

    2012-01-01

    We present the ins and outs of the purely functional, data parallel programming language SaC (Single Assignment C). SaC defines state- and side-effect-free semantics on top of a syntax resembling that of imperative languages like C/C++/C# or Java: functional programming with curly brackets. In contr

  16. applying reinforcement learning to the weapon assignment problem ...

    African Journals Online (AJOL)

    ismith

    Intelligence (AI) and modern computational techniques, may hold the key to relieving the ... In his 2007 book, The Utility of Force – The Art of War in the Modern. World, General ..... The assignment problem is solved given the status of DAs, .... This was not a good policy, seeing that it did not take into account where the.

  17. 48 CFR 208.7003-2 - Assignments under coordinated acquisition.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignments under coordinated acquisition. 208.7003-2 Section 208.7003-2 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE ACQUISITION PLANNING REQUIRED SOURCES OF SUPPLIES...

  18. UAV Cooperative Multiple Task Assignments using Genetic Algorithms

    Science.gov (United States)

    2005-06-01

    vehicle routing problem (VRP). In all of these classical problems the minimum cost assignment is sought where: in the TSP the tour is of one agent...10] Baker, Barrie, M. and Ayechew, M. A., “A Genetic Algorithm for the Vehicle Routing Problem ,” Computers and Operations Research, Vol. 30, 2003

  19. 24 CFR 251.2 - GNMA right to assignment.

    Science.gov (United States)

    2010-04-01

    ... right to assignment. If the lender-issuer defaults on its obligations under the GNMA Mortgage-Backed Securities Program, GNMA will have the right to cause all Coinsured Mortgages held in GNMA pools by the... URBAN DEVELOPMENT MORTGAGE AND LOAN INSURANCE PROGRAMS UNDER NATIONAL HOUSING ACT AND OTHER AUTHORITIES...

  20. 24 CFR 255.2 - GNMA right to assignment.

    Science.gov (United States)

    2010-04-01

    ... assignment. If the lender-issuer defaults on its obligations under the GNMA Mortgage-Backed Securities Program, GNMA will have the right to cause all Coinsured Mortgages held in GNMA pools by the defaulting... URBAN DEVELOPMENT MORTGAGE AND LOAN INSURANCE PROGRAMS UNDER NATIONAL HOUSING ACT AND OTHER AUTHORITIES...

  1. Using Clouds for MapReduce Measurement Assignments

    Science.gov (United States)

    Rabkin, Ariel; Reiss, Charles; Katz, Randy; Patterson, David

    2013-01-01

    We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services and the standard Hadoop API. Using the standard API, students directly experienced the quality of industrial big-data tools. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware,…

  2. Assigning Main Orientation to an EOH Descriptor on Multispectral Images

    Directory of Open Access Journals (Sweden)

    Yong Li

    2015-07-01

    Full Text Available This paper proposes an approach to compute an EOH (edge-oriented histogram descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform on multispectral images, but does not assign a main orientation to keypoints. Alternatively, it tends to assign the same main orientation to every keypoint, e.g., zero degrees. This limits EOH to matching keypoints between images of translation misalignment only. Observing this limitation, we propose assigning to keypoints the main orientation that is computed with PIIFD (partial intensity invariant feature descriptor. In the proposed method, SIFT keypoints are detected from images as the extrema of difference of Gaussians, and every keypoint is assigned to the main orientation computed with PIIFD. Then, EOH is computed for every keypoint with respect to its main orientation. In addition, an implementation variant is proposed for fast computation of the EOH descriptor. Experimental results show that the proposed approach performs more robustly than the original EOH on image pairs that have a rotation misalignment.

  3. 77 FR 8174 - EPAAR Prescription for Work Assignments

    Science.gov (United States)

    2012-02-14

    ... revised language communicates to contract personnel and program staff that government cost-related... (EPA). ACTION: Final rule. SUMMARY: EPA will amend the EPA Acquisition Regulation (EPAAR) prescription for the work assignment clause. This final rule provides revised language to the prescription for the...

  4. 76 FR 26232 - EPAAR Prescription for Work Assignments

    Science.gov (United States)

    2011-05-06

    ... Acquisition Regulation (EPAAR) to update policy, procedures, and contract clauses. The proposed rule provides revised language to the prescription for the work assignment clause, incorporating prescriptive language that provides further instructions on use of the related clause. DATES: Comments must be received on or...

  5. 48 CFR 1552.211-74 - Work assignments.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 6 2010-10-01 2010-10-01 true Work assignments. 1552.211-74 Section 1552.211-74 Federal Acquisition Regulations System ENVIRONMENTAL PROTECTION AGENCY CLAUSES... not allow for any change to the terms or conditions of the contract. Where any language in the...

  6. Optimization of Load Assignment to Boilers in Industrial Boiler Plants

    Institute of Scientific and Technical Information of China (English)

    CAO Jia-cong; QIU Guang; CAO Shuang-hua; LIU Feng-qiang

    2004-01-01

    Along with the increasing importance of sustainable energy, the optimization of load assignment to boilers in an industrial boiler plant becomes one of the major projects for the optimal operation of boiler plants. Optimal load assignment for power systems has been a long-lasting subject, while it is quite new for industrial boiler plants. The existing methods of optimal load assignment for boiler plants are explained and analyzed briefly in the paper. They all need the fuel cost curves of boilers. Thanks to some special features of the curves for industrial boilers, a new model referred to as minimized departure model (MDM) of optimization of load assignment for boiler plants is developed and proposed in the paper. It merely relies upon the accessible data of two typical working conditions to build the model, viz. the working conditions with the highest efficiency of a boiler and with no-load. Explanation of the algorithm of computer program is given, and effort is made so as to determine in advance how many and which boilers are going to work. Comparison between the results using MDM and the results reported in references is carried out, which proves that MDM is preferable and practicable.

  7. The Complexity of Approximately Counting Stable Roommate Assignments

    CERN Document Server

    Chebolu, Prasad; Martin, Russell

    2010-01-01

    We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the $k$-attribute model, in which the preference lists are determined by dot products of "preference vectors" with "attribute vectors" and (ii) the $k$-Euclidean model, in which the preference lists are determined by the closeness of the "positions" of the people to their "preferred positions". Exactly counting the number of assignments is #P-complete, since Irving and Leather demonstrated #P-completeness for the special case of the stable marriage problem. We show that counting the number of stable roommate assignments in the $k$-attribute model ($k \\geq 4$) and the $3$-Euclidean model($k \\geq 3$) is interreducible, in an approximation-preserving sense, with counting independent sets (of all sizes) (#IS) in a graph, or counting the number of satisfying assignments of a Boolean formula (#SAT). This means that there can be no FPRAS for any of these problems unless NP=RP. As a consequence, we infer that there ...

  8. Connecting Student and Subject Matter: The Cultural Artifact Discussion Assignment

    Science.gov (United States)

    Smith-Sanders, Alane K.

    2008-01-01

    This article presents a class activity where students work in dyads to select an artifact related to a course topic and, using this artifact, develop discussion questions to engage their classmates. This cultural artifact assignment is intended to, in part, answer John Dewey's call to cultivate connections between subject matter and life…

  9. Concept Maps as Cognitive Visualizations of Writing Assignments

    Science.gov (United States)

    Villalon, Jorge; Calvo, Rafael A.

    2011-01-01

    Writing assignments are ubiquitous in higher education. Writing develops not only communication skills, but also higher-level cognitive processes that facilitate deep learning. Cognitive visualizations, such as concept maps, can also be used as part of learning activities including as a form of scaffolding, or to trigger reflection by making…

  10. Integrating Video Documentary into the Classroom: A Community Assessment Assignment

    Science.gov (United States)

    Levinson, Samantha G.; Caldwell, Keith; Petracchi, Helen E.; Wexler, Sandra; Engel, Rafael

    2016-01-01

    Community assessment is a strategy commonly taught to social work students to identify a community's strengths and challenges. This article describes the value of using video documentary as part of a community assessment assignment. We identify the advantages of using video documentary in the assessment process and the reporting of findings. We…

  11. Preconditions of origin, essence and assignment of strategic managerial accounting

    OpenAIRE

    Boiko, I.

    2010-01-01

    The article is devoted to the research of preconditions and necessity of creation strategic managerial accounting in the accounting system of enterprise. There are investigated economic essence and assignment of strategic managerial accounting and substantiated its importance for making strategic decisions on an enterprise.

  12. Unintended Cognitive, Affective, and Behavioral Consequences of Group Assignments

    Science.gov (United States)

    Neu, Wayne A.

    2012-01-01

    Pedagogical strategies can be thought of as a set of stimuli placed in students' environment to influence their cognition, affect, and behavior. The design of strategies such as group assignments and a comprehensive understanding of their consequences for students should then include an analysis of all three of these elements and the…

  13. Probabilistic assignment of formulas to mass peaks in metabolomics experiments

    NARCIS (Netherlands)

    Rogers, Simon; Scheltema, Richard A.; Girolami, Mark; Breitling, Rainer

    2009-01-01

    Motivation: High-accuracy mass spectrometry is a popular technology for high-throughput measurements of cellular metabolites (metabolomics). One of the major challenges is the correct identification of the observed mass peaks, including the assignment of their empirical formula, based on the

  14. Nursing Distance Learning Course Comparison of Assignments and Examination Scores

    Science.gov (United States)

    Mundine, Jennifer

    2016-01-01

    Nursing programs have embraced distance learning in their curricula, but discussion is ongoing about course assignments and grading criteria to increase examination scores in nursing distance learning courses. Because course examinations are a predictor of success on the postgraduate licensing examination (NCLEX-RN), the purpose of this study was…

  15. Developing Team Skills through a Collaborative Writing Assignment

    Science.gov (United States)

    Thomas, Theda Ann

    2014-01-01

    Employers want students who are able to work effectively as members of a team, and expect universities to develop this ability in their graduates. This paper proposes a framework for a collaborative writing assignment that specifically develops students' ability to work in teams. The framework has been tested using two iterations of an action…

  16. 48 CFR 552.232-23 - Assignment of Claims.

    Science.gov (United States)

    2010-10-01

    ... following is substituted therefor: In order to prevent confusion and delay in making payment, the Contractor..., including any Federal lending agency, under the provisions of the Assignment of Claims Act, as amended, 31 U.S.C. 3727, 41 U.S.C. 15 (hereinafter referred to as “the Act”), all amounts due or to become...

  17. Threat evaluation and weapon assignment decision support: A ...

    African Journals Online (AJOL)

    Evaluation and Weapon Assignment (TEWA) process with regards to Command and ... [81] TE refers to “the part of threat analysis concerned with the ...... makers are more likely to screen options with respect to cut-offs or goals when there is.

  18. Hierarchical method of task assignment for multiple cooperating UAV teams

    Institute of Scientific and Technical Information of China (English)

    Xiaoxuan Hu; Huawei Ma; Qingsong Ye; He Luo

    2015-01-01

    The problem of task assignment for multiple cooperat-ing unmanned aerial vehicle (UAV) teams is considered. Multiple UAVs forming several smal teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchical task assignment method is presented to address the problem. It breaks the original problem down to three levels of sub-problems: tar-get clustering, cluster al ocation and target assignment. The first two sub-problems are central y solved by using clustering algo-rithms and integer linear programming, respectively, and the third sub-problem is solved in a distributed and paral el manner, using a mixed integer linear programming model and an improved ant colony algorithm. The proposed hierarchical method can reduce the computational complexity of the task assignment problem con-siderably, especial y when the number of tasks or the number of UAVs is large. Experimental results show that this method is feasi-ble and more efficient than non-hierarchical methods.

  19. Wavelength and fiber assignment problems on avionic networks

    DEFF Research Database (Denmark)

    Zhang, Jiang; An, Yi; Berger, Michael Stübert;

    2011-01-01

    This paper solves the wavelength and fiber assignment problems with systems' isolation requirements on the avionic ring networks. The experiment results give a general glace of the numbers of the wavelengths and fibers are required under certain scale of networks. At the beginning of increasing...

  20. A Competitive and Experiential Assignment in Search Engine Optimization Strategy

    Science.gov (United States)

    Clarke, Theresa B.; Clarke, Irvine, III

    2014-01-01

    Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be new…

  1. Challenges and Dilemmas in Implementing Random Assignment in Educational Research

    Science.gov (United States)

    Ong-Dean, Colin; Hofstetter, Carolyn Huie; Strick, Betsy R.

    2011-01-01

    In the contentious debate over the use of randomized clinical trials (RCTs) in education research, little attention has been given to how methodological issues arise and/or are resolved in the implementation of random assignment. Following a review of the methodological-theoretical literature on RCTs and alternative research designs, this article…

  2. Assigning Main Orientation to an EOH Descriptor on Multispectral Images.

    Science.gov (United States)

    Li, Yong; Shi, Xiang; Wei, Lijun; Zou, Junwei; Chen, Fang

    2015-07-01

    This paper proposes an approach to compute an EOH (edge-oriented histogram) descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform) on multispectral images, but does not assign a main orientation to keypoints. Alternatively, it tends to assign the same main orientation to every keypoint, e.g., zero degrees. This limits EOH to matching keypoints between images of translation misalignment only. Observing this limitation, we propose assigning to keypoints the main orientation that is computed with PIIFD (partial intensity invariant feature descriptor). In the proposed method, SIFT keypoints are detected from images as the extrema of difference of Gaussians, and every keypoint is assigned to the main orientation computed with PIIFD. Then, EOH is computed for every keypoint with respect to its main orientation. In addition, an implementation variant is proposed for fast computation of the EOH descriptor. Experimental results show that the proposed approach performs more robustly than the original EOH on image pairs that have a rotation misalignment.

  3. Probabilistic assignment of formulas to mass peaks in metabolomics experiments

    NARCIS (Netherlands)

    Rogers, Simon; Scheltema, Richard A.; Girolami, Mark; Breitling, Rainer

    2009-01-01

    Motivation: High-accuracy mass spectrometry is a popular technology for high-throughput measurements of cellular metabolites (metabolomics). One of the major challenges is the correct identification of the observed mass peaks, including the assignment of their empirical formula, based on the measure

  4. 31 CFR 306.40 - Execution of assignments.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Execution of assignments. 306.40 Section 306.40 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE TREASURY BUREAU OF THE PUBLIC DEBT GENERAL REGULATIONS GOVERNING...

  5. 31 CFR 306.41 - Form of assignment.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Form of assignment. 306.41 Section 306.41 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE TREASURY BUREAU OF THE PUBLIC DEBT GENERAL REGULATIONS GOVERNING...

  6. 31 CFR 306.43 - Voidance of assignments.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Voidance of assignments. 306.43 Section 306.43 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE TREASURY BUREAU OF THE PUBLIC DEBT GENERAL REGULATIONS GOVERNING...

  7. Constrained resource assignments: Fast algorithms and applications in wireless networks

    NARCIS (Netherlands)

    Berger, A.; Gross, J.; Harks, T.; Tenbusch, S.

    2016-01-01

    Resource assignment problems occur in a vast variety of applications, from scheduling problems over image recognition to communication networks. Often these problems can be modeled by a maximum weight matching problem in (bipartite) graphs or generalizations thereof, and efficient and practical algo

  8. Comparison of Categorical Assignments of the BSRI and the PAQ.

    Science.gov (United States)

    Gaa, John P.; Liberman, Dov

    The degree of agreement between the Bem Sex Role Inventory (BSRI) and the Personality Attributes Questionnaire (PAQ) in assigning sex role categories was investigated by administering both instruments to undergraduate education majors. As a result of scoring, subjects were classified as androgynous, masculine, feminine, or undifferentiated. It was…

  9. Assignment of circadian function for the Neurospora clock gene frequency

    NARCIS (Netherlands)

    Merrow, Martha; Brunner, Michael; Roenneberg, Till

    1999-01-01

    Circadian clocks consist of three elements: entrainment pathways (inputs), the mechanism generating the rhythmicity (oscillator), and the output pathways that control the circadian rhythms. It is difficult to assign molecular clock components to any one of these elements. Experiments show that input

  10. Proposed criteria for the evaluation of an address assignment scheme in Botswana

    CSIR Research Space (South Africa)

    Ditsela, J

    2011-06-01

    Full Text Available An address assignment scheme identifies the components that make up an address and describes how values are assigned to these components. Address assignment schemes vary from country to country and there is often a strong cultural, religious...

  11. Comparing User-Assigned Terms with Indexer-Assigned Terms for Storage and Retrieval of Moving Images: Research Results.

    Science.gov (United States)

    Turner, James M.

    1995-01-01

    Discussion of indexing moving image documents at the shot level focuses on a study conducted at the National Film Board of Canada. Popular terms supplied by users were compared with terms assigned by professional indexers in the source stockshot collection. Results suggest that indexing images using preiconographic (ofness) and iconographic…

  12. Assignment of the Q-bands of the chlorophylls: coherence loss via Qx - Qy mixing.

    Science.gov (United States)

    Reimers, Jeffrey R; Cai, Zheng-Li; Kobayashi, Rika; Rätsep, Margus; Freiberg, Arvi; Krausz, Elmars

    2013-09-26

    We provide a new and definitive spectral assignment for the absorption, emission, high-resolution fluorescence excitation, linear dichroism, and/or magnetic circular dichroism spectra of 32 chlorophyllides in various environments. This encompases all data used to justify previous assignments and provides a simple interpretation of unexplained complex decoherence phenomena associated with Qx → Qy relaxation. Whilst most chlorophylls conform to the Gouterman model and display two independent transitions Qx (S2) and Qy (S1), strong vibronic coupling inseparably mixes these states in chlorophyll-a. This spreads x-polarized absorption intensity over the entire Q-band system to influence all exciton-transport, relaxation and coherence properties of chlorophyll-based photosystems. The fraction of the total absorption intensity attributed to Qx ranges between 7% and 33%, depending on chlorophyllide and coordination, and is between 10% and 25% for chlorophyll-a. CAM-B3LYP density-functional-theory calculations of the band origins, relative intensities, vibrational Huang-Rhys factors, and vibronic coupling strengths fully support this new assignment.

  13. Obesogenic environmental influences on young adults: evidence from college dormitory assignments.

    Science.gov (United States)

    Kapinos, Kandice A; Yakusheva, Olga; Eisenberg, Daniel

    2014-01-01

    This study utilizes a natural experiment-conditionally random dormitory assignments of first-year US college students-to investigate the influence of obesogenic environmental factors in explaining changes in weight and exercise behavior during the 2009-2010 academic year. The design addresses potential selection biases resulting from the likelihood that individuals sort into built environments that match their preferences for exercise and healthy eating. We find some evidence that the food environment, specifically access to campus dining, significantly affected the weight of female students in our study. Females assigned to dormitories where the nearest campus dining hall was closed on the weekends gained about 1lb less over the course of the year than females assigned to dormitories near dining halls that were open 7 days a week. We also find some evidence that female who lived in close proximity to a grocery store gained less weight over the course of the year. Finally, females who lived closer to campus gym reported more frequent exercise over the course of the year. We do not find significant effects of the built environment on weight changes of males in our sample, but we are cautious to draw strong conclusions from this because the male weight change in our sample was quite small.

  14. Systematic assignment of thermodynamic constraints in metabolic network models

    Directory of Open Access Journals (Sweden)

    Heinemann Matthias

    2006-11-01

    Full Text Available Abstract Background The availability of genome sequences for many organisms enabled the reconstruction of several genome-scale metabolic network models. Currently, significant efforts are put into the automated reconstruction of such models. For this, several computational tools have been developed that particularly assist in identifying and compiling the organism-specific lists of metabolic reactions. In contrast, the last step of the model reconstruction process, which is the definition of the thermodynamic constraints in terms of reaction directionalities, still needs to be done manually. No computational method exists that allows for an automated and systematic assignment of reaction directions in genome-scale models. Results We present an algorithm that – based on thermodynamics, network topology and heuristic rules – automatically assigns reaction directions in metabolic models such that the reaction network is thermodynamically feasible with respect to the production of energy equivalents. It first exploits all available experimentally derived Gibbs energies of formation to identify irreversible reactions. As these thermodynamic data are not available for all metabolites, in a next step, further reaction directions are assigned on the basis of network topology considerations and thermodynamics-based heuristic rules. Briefly, the algorithm identifies reaction subsets from the metabolic network that are able to convert low-energy co-substrates into their high-energy counterparts and thus net produce energy. Our algorithm aims at disabling such thermodynamically infeasible cyclic operation of reaction subnetworks by assigning reaction directions based on a set of thermodynamics-derived heuristic rules. We demonstrate our algorithm on a genome-scale metabolic model of E. coli. The introduced systematic direction assignment yielded 130 irreversible reactions (out of 920 total reactions, which corresponds to about 70% of all irreversible

  15. Review of Outcome Information in 46,XX Patients with Congenital Adrenal Hyperplasia Assigned/Reared Male: What Does It Say about Gender Assignment?

    Directory of Open Access Journals (Sweden)

    Lee PeterA

    2010-12-01

    Full Text Available There is ample historical verification of 46,XX congenital adrenal hyperplasia (CAH patients being born with essentially male genitaliawhile outcome information is scant. Prior to glucocorticoid therapy, most patients died very young from adrenal insufficiency. Most available reports from laterchildhood, contain little information concerning sexual identity. Reports on older individuals lack adequate information about sexual identity and quality of life. The difficulty in assessing the relative impact of multiple dynamic environmental factors on the development of sexual identity, self- and body esteem and overall adjustment to life is clear. Nevertheless, it remains unclear whether those infants whose masculine genitalia at birth resulted in an initial male assignment would have enjoyed a better adult outcome had they been allowed to remain male rather than the female reassignment that most received. Further, one could ask whether a male sex of rearing should be considered in 46,XX CAH infants with male external genitalia. After reviewing available literature, we conclude that because those extremely virlized 46,XX CAH patients who were reared male with healthy social support demonstrated satisfactory levels of social and sexual function as adults a male sex assignment should be considered in these types of infants when social and cultural environment are supportive.

  16. Review of Outcome Information in 46,XX Patients with Congenital Adrenal Hyperplasia Assigned/Reared Male: What Does It Say about Gender Assignment?

    Science.gov (United States)

    Lee, Peter A; Houk, Christopher P

    2010-01-01

    There is ample historical verification of 46,XX congenital adrenal hyperplasia (CAH) patients being born with essentially male genitaliawhile outcome information is scant. Prior to glucocorticoid therapy, most patients died very young from adrenal insufficiency. Most available reports from laterchildhood, contain little information concerning sexual identity. Reports on older individuals lack adequate information about sexual identity and quality of life. The difficulty in assessing the relative impact of multiple dynamic environmental factors on the development of sexual identity, self- and body esteem and overall adjustment to life is clear. Nevertheless, it remains unclear whether those infants whose masculine genitalia at birth resulted in an initial male assignment would have enjoyed a better adult outcome had they been allowed to remain male rather than the female reassignment that most received. Further, one could ask whether a male sex of rearing should be considered in 46,XX CAH infants with male external genitalia. After reviewing available literature, we conclude that because those extremely virlized 46,XX CAH patients who were reared male with healthy social support demonstrated satisfactory levels of social and sexual function as adults a male sex assignment should be considered in these types of infants when social and cultural environment are supportive.

  17. Block-decoupling vibration control using eigenstructure assignment

    Science.gov (United States)

    Wei, Xiaojun; Mottershead, John E.

    2016-06-01

    A theoretical study is presented on the feasibility of applying active control for the purpose of vibration isolation in lightweight structures by block diagonalisation of the system matrices and at the same time assigning eigenvalues (natural frequencies and damping) to the chosen substructures separately. The methodology, based on eigenstructure assignment using the method of receptances, is found to work successfully when the eigenvalues of the open-loop system are controllable and the open- and closed-loop eigenvalues are distinct. In the first part of the paper results are obtained under the restriction that the mass matrix is diagonal (lumped). This is certainly applicable in the case of numerous engineering systems consisting of discrete masses with flexible interconnections of negligible mass. Later in the paper this restriction is lifted to allow bandedness of the mass matrix. Several numerical examples are used to illustrate the working of the proposed algorithm.

  18. Application of Neutrosophic Set Theory in Generalized Assignment Problem

    Directory of Open Access Journals (Sweden)

    Supriya Kar

    2015-09-01

    Full Text Available This paper presents the application of Neutrosophic Set Theory (NST in solving Generalized Assignment Problem (GAP. GAP has been solved earlier under fuzzy environment. NST is a generalization of the concept of classical set, fuzzy set, interval-valued fuzzy set, intuitionistic fuzzy set. Elements of Neutrosophic set are characterized by a truth-membership function, falsity and also indeterminacy which is a more realistic way of expressing the parameters in real life problem. Here the elements of the cost matrix for the GAP are considered as neutrosophic elements which have not been considered earlier by any other author. The problem has been solved by evaluating score function matrix and then solving it by Extremum Difference Method (EDM [1] to get the optimal assignment. The method has been demonstrated by a suitable numerical example.

  19. Pole assignment for stochastic systems with unknown coefficients

    Institute of Scientific and Technical Information of China (English)

    陈翰馥[1; 曹希仁[2

    2000-01-01

    This paper solves the exact pole assignment problem for the single-input stochastic systems with unknown coefficients under the controllability assumption which is necessary and sufficient for the arbitrary pole assignment for systems with known coefficients. The system noise is required to be mutually independent with zero mean and bounded second moment. Two approaches to solving the problem are proposed: One is the iterative learning approach which can be applied when the state at a fixed time can be repeatedly observed with different feedback gains; the other is the adaptive control approach which works when the trajectories satisfy a nondegeneracy condition. Both methods are essentially based on stochastic approximation, and the feedback gains are recursively given without invoking the certainty-equivalency-principle.

  20. Scalable Task Assignment for Heterogeneous Multi-Robot Teams

    Directory of Open Access Journals (Sweden)

    Paula García

    2013-02-01

    Full Text Available This work deals with the development of a dynamic task assignment strategy for heterogeneous multi‐robot teams in typical real world scenarios. The strategy must be efficiently scalable to support problems of increasing complexity with minimum designer intervention. To this end, we have selected a very simple auction‐based strategy, which has been implemented and analysed in a multi‐robot cleaning problem that requires strong coordination and dynamic complex subtask organization. We will show that the selection of a simple auction strategy provides a linear computational cost increase with the number of robots that make up the team and allows the solving of highly complex assignment problems in dynamic conditions by means of a hierarchical sub‐auction policy. To coordinate and control the team, a layered behaviour‐based architecture has been applied that allows the reusing of the auction‐based strategy to achieve different coordination levels.