J. Nielsen - INT - University of Ulm.

J. Nielsen
Are you J. Nielsen?

Claim your profile, edit publications, add additional information:

Contact Details

Name
J. Nielsen
Affiliation
INT - University of Ulm.
City
Ulm
Country
Germany

Pubs By Year

Pub Categories

 
Computer Science - Information Theory (24)
 
Mathematics - Information Theory (24)
 
High Energy Physics - Phenomenology (6)
 
Computer Science - Networking and Internet Architecture (6)
 
High Energy Physics - Experiment (4)
 
Computer Science - Symbolic Computation (3)
 
Instrumentation and Methods for Astrophysics (3)
 
Cosmology and Nongalactic Astrophysics (3)
 
Computer Science - Data Structures and Algorithms (3)
 
Physics - Chemical Physics (2)
 
Computer Science - Computational Engineering; Finance; and Science (2)
 
Physics - Physics and Society (2)
 
General Relativity and Quantum Cosmology (2)
 
Computer Science - Artificial Intelligence (2)
 
Astrophysics of Galaxies (2)
 
Computer Science - Learning (2)
 
Statistics - Machine Learning (1)
 
Quantitative Biology - Quantitative Methods (1)
 
Physics - Instrumentation and Detectors (1)
 
Physics - Biological Physics (1)
 
Mathematics - Statistics (1)
 
Physics - Data Analysis; Statistics and Probability (1)
 
Computer Science - Computational Geometry (1)
 
Computer Science - Distributed; Parallel; and Cluster Computing (1)
 
Statistics - Theory (1)
 
Physics - Accelerator Physics (1)

Publications Authored By J. Nielsen

We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami--Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power decoding algorithm for Reed--Solomon codes and does not require an expensive root-finding step. Read More

We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes. Read More

In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals from multiple remote radio heads are processed in a centralized baseband unit (BBU) pool. This architecture allows network operators to adapt the BBU's computational resources to the aggregate access load experienced at the BBU, which can change in every air-interface access frame. The degree of savings that can be achieved by adapting the resources is a tradeoff between savings, adaptation frequency, and increased queuing time. Read More

The $k$-Means clustering problem on $n$ points is NP-Hard for any dimension $d\ge 2$, however, for the 1D case there exist exact polynomial time algorithms. Previous literature reported an $O(kn^2)$ dynamic programming algorithm that uses $O(kn)$ space. We present a new algorithm improving this to $O(n\log n+ kn)$ time and optimal $O(n)$ space. Read More

We propose a new partial decoding algorithm for $m$-interleaved Reed--Solomon (IRS) codes that can decode, with high probability, a random error of relative weight $1-R^{\frac{m}{m+1}}$ at all code rates $R$, in time polynomial in the code length $n$. This is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for $R > 1/3$ in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius. Read More

The electricity production and distribution is facing two major changes. First, the production is shifting from classical energy sources such as coal and nuclear power towards renewable resources such as solar and wind. Secondly, the consumption in the low voltage grid is expected to grow significantly due to expected introduction of electrical vehicles. Read More

We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code. Read More

Here, we present the concept of an open virtual prototyping framework for maritime systems and operations that enables its users to develop re-usable component or subsystem models, and combine them in full-system simulations for prototyping, verification, training, and performance studies. This framework consists of a set of guidelines for model coupling, high-level and low-level coupling interfaces to guarantee interoperability, a full-system simulation software, and example models and demonstrators. We discuss the requirements for such a framework, address the challenges and the possibilities in fulfilling them, and aim to give a list of best practices for modular and efficient virtual prototyping and full-system simulation. Read More

2016Oct
Authors: D. de Florian1, C. Grojean2, F. Maltoni3, C. Mariotti4, A. Nikitenko5, M. Pieri6, P. Savard7, M. Schumacher8, R. Tanaka9, R. Aggleton10, M. Ahmad11, B. Allanach12, C. Anastasiou13, W. Astill14, S. Badger15, M. Badziak16, J. Baglio17, E. Bagnaschi18, A. Ballestrero19, A. Banfi20, D. Barducci21, M. Beckingham22, C. Becot23, G. Bélanger24, J. Bellm25, N. Belyaev26, F. U. Bernlochner27, C. Beskidt28, A. Biekötter29, F. Bishara30, W. Bizon31, N. E. Bomark32, M. Bonvini33, S. Borowka34, V. Bortolotto35, S. Boselli36, F. J. Botella37, R. Boughezal38, G. C. Branco39, J. Brehmer40, L. Brenner41, S. Bressler42, I. Brivio43, A. Broggio44, H. Brun45, G. Buchalla46, C. D. Burgard47, A. Calandri48, L. Caminada49, R. Caminal Armadans50, F. Campanario51, J. Campbell52, F. Caola53, C. M. Carloni Calame54, S. Carrazza55, A. Carvalho56, M. Casolino57, O. Cata58, A. Celis59, F. Cerutti60, N. Chanon61, M. Chen62, X. Chen63, B. Chokoufé Nejad64, N. Christensen65, M. Ciuchini66, R. Contino67, T. Corbett68, D. Curtin69, M. Dall'Osso70, A. David71, S. Dawson72, J. de Blas73, W. de Boer74, P. de Castro Manzano75, C. Degrande76, R. L. Delgado77, F. Demartin78, A. Denner79, B. Di Micco80, R. Di Nardo81, S. Dittmaier82, A. Dobado83, T. Dorigo84, F. A. Dreyer85, M. Dührssen86, C. Duhr87, F. Dulat88, K. Ecker89, K. Ellis90, U. Ellwanger91, C. Englert92, D. Espriu93, A. Falkowski94, L. Fayard95, R. Feger96, G. Ferrera97, A. Ferroglia98, N. Fidanza99, T. Figy100, M. Flechl101, D. Fontes102, S. Forte103, P. Francavilla104, E. Franco105, R. Frederix106, A. Freitas107, F. F. Freitas108, F. Frensch109, S. Frixione110, B. Fuks111, E. Furlan112, S. Gadatsch113, J. Gao114, Y. Gao115, M. V. Garzelli116, T. Gehrmann117, R. Gerosa118, M. Ghezzi119, D. Ghosh120, S. Gieseke121, D. Gillberg122, G. F. Giudice123, E. W. N. Glover124, F. Goertz125, D. Gonçalves126, J. Gonzalez-Fraile127, M. Gorbahn128, S. Gori129, C. A. Gottardo130, M. Gouzevitch131, P. Govoni132, D. Gray133, M. Grazzini134, N. Greiner135, A. Greljo136, J. Grigo137, A. V. Gritsan138, R. Gröber139, S. Guindon140, H. E. Haber141, C. Han142, T. Han143, R. Harlander144, M. A. Harrendorf145, H. B. Hartanto146, C. Hays147, S. Heinemeyer148, G. Heinrich149, M. Herrero150, F. Herzog151, B. Hespel152, V. Hirschi153, S. Hoeche154, S. Honeywell155, S. J. Huber156, C. Hugonie157, J. Huston158, A. Ilnicka159, G. Isidori160, B. Jäger161, M. Jaquier162, S. P. Jones163, A. Juste164, S. Kallweit165, A. Kaluza166, A. Kardos167, A. Karlberg168, Z. Kassabov169, N. Kauer170, D. I. Kazakov171, M. Kerner172, W. Kilian173, F. Kling174, K. Köneke175, R. Kogler176, R. Konoplich177, S. Kortner178, S. Kraml179, C. Krause180, F. Krauss181, M. Krawczyk182, A. Kulesza183, S. Kuttimalai184, R. Lane185, A. Lazopoulos186, G. Lee187, P. Lenzi188, I. M. Lewis189, Y. Li190, S. Liebler191, J. Lindert192, X. Liu193, Z. Liu194, F. J. Llanes-Estrada195, H. E. Logan196, D. Lopez-Val197, I. Low198, G. Luisoni199, P. Maierhöfer200, E. Maina201, B. Mansoulié202, H. Mantler203, M. Mantoani204, A. C. Marini205, V. I. Martinez Outschoorn206, S. Marzani207, D. Marzocca208, A. Massironi209, K. Mawatari210, J. Mazzitelli211, A. McCarn212, B. Mellado213, K. Melnikov214, S. B. Menari215, L. Merlo216, C. Meyer217, P. Milenovic218, K. Mimasu219, S. Mishima220, B. Mistlberger221, S. -O. Moch222, A. Mohammadi223, P. F. Monni224, G. Montagna225, M. Moreno Llácer226, N. Moretti227, S. Moretti228, L. Motyka229, A. Mück230, M. Mühlleitner231, S. Munir232, P. Musella233, P. Nadolsky234, D. Napoletano235, M. Nebot236, C. Neu237, M. Neubert238, R. Nevzorov239, O. Nicrosini240, J. Nielsen241, K. Nikolopoulos242, J. M. No243, C. O'Brien244, T. Ohl245, C. Oleari246, T. Orimoto247, D. Pagani248, C. E. Pandini249, A. Papaefstathiou250, A. S. Papanastasiou251, G. Passarino252, B. D. Pecjak253, M. Pelliccioni254, G. Perez255, L. Perrozzi256, F. Petriello257, G. Petrucciani258, E. Pianori259, F. Piccinini260, M. Pierini261, A. Pilkington262, S. Plätzer263, T. Plehn264, R. Podskubka265, C. T. Potter266, S. Pozzorini267, K. Prokofiev268, A. Pukhov269, I. Puljak270, M. Queitsch-Maitland271, J. Quevillon272, D. Rathlev273, M. Rauch274, E. Re275, M. N. Rebelo276, D. Rebuzzi277, L. Reina278, C. Reuschle279, J. Reuter280, M. Riembau281, F. Riva282, A. Rizzi283, T. Robens284, R. Röntsch285, J. Rojo286, J. C. Romão287, N. Rompotis288, J. Roskes289, R. Roth290, G. P. Salam291, R. Salerno292, R. Santos293, V. Sanz294, J. J. Sanz-Cillero295, H. Sargsyan296, U. Sarica297, P. Schichtel298, J. Schlenk299, T. Schmidt300, C. Schmitt301, M. Schönherr302, U. Schubert303, M. Schulze304, S. Sekula305, M. Sekulla306, E. Shabalina307, H. S. Shao308, J. Shelton309, C. H. Shepherd-Themistocleous310, S. Y. Shim311, F. Siegert312, A. Signer313, J. P. Silva314, L. Silvestrini315, M. Sjodahl316, P. Slavich317, M. Slawinska318, L. Soffi319, M. Spannowsky320, C. Speckner321, D. M. Sperka322, M. Spira323, O. Stål324, F. Staub325, T. Stebel326, T. Stefaniak327, M. Steinhauser328, I. W. Stewart329, M. J. Strassler330, J. Streicher331, D. M. Strom332, S. Su333, X. Sun334, F. J. Tackmann335, K. Tackmann336, A. M. Teixeira337, R. Teixeira de Lima338, V. Theeuwes339, R. Thorne340, D. Tommasini341, P. Torrielli342, M. Tosi343, F. Tramontano344, Z. Trócsányi345, M. Trott346, I. Tsinikos347, M. Ubiali348, P. Vanlaer349, W. Verkerke350, A. Vicini351, L. Viliani352, E. Vryonidou353, D. Wackeroth354, C. E. M. Wagner355, J. Wang356, S. Wayand357, G. Weiglein358, C. Weiss359, M. Wiesemann360, C. Williams361, J. Winter362, D. Winterbottom363, R. Wolf364, M. Xiao365, L. L. Yang366, R. Yohay367, S. P. Y. Yuen368, G. Zanderighi369, M. Zaro370, D. Zeppenfeld371, R. Ziegler372, T. Zirke373, J. Zupan374
Affiliations: 1eds., 2eds., 3eds., 4eds., 5eds., 6eds., 7eds., 8eds., 9eds., 10The LHC Higgs Cross Section Working Group, 11The LHC Higgs Cross Section Working Group, 12The LHC Higgs Cross Section Working Group, 13The LHC Higgs Cross Section Working Group, 14The LHC Higgs Cross Section Working Group, 15The LHC Higgs Cross Section Working Group, 16The LHC Higgs Cross Section Working Group, 17The LHC Higgs Cross Section Working Group, 18The LHC Higgs Cross Section Working Group, 19The LHC Higgs Cross Section Working Group, 20The LHC Higgs Cross Section Working Group, 21The LHC Higgs Cross Section Working Group, 22The LHC Higgs Cross Section Working Group, 23The LHC Higgs Cross Section Working Group, 24The LHC Higgs Cross Section Working Group, 25The LHC Higgs Cross Section Working Group, 26The LHC Higgs Cross Section Working Group, 27The LHC Higgs Cross Section Working Group, 28The LHC Higgs Cross Section Working Group, 29The LHC Higgs Cross Section Working Group, 30The LHC Higgs Cross Section Working Group, 31The LHC Higgs Cross Section Working Group, 32The LHC Higgs Cross Section Working Group, 33The LHC Higgs Cross Section Working Group, 34The LHC Higgs Cross Section Working Group, 35The LHC Higgs Cross Section Working Group, 36The LHC Higgs Cross Section Working Group, 37The LHC Higgs Cross Section Working Group, 38The LHC Higgs Cross Section Working Group, 39The LHC Higgs Cross Section Working Group, 40The LHC Higgs Cross Section Working Group, 41The LHC Higgs Cross Section Working Group, 42The LHC Higgs Cross Section Working Group, 43The LHC Higgs Cross Section Working Group, 44The LHC Higgs Cross Section Working Group, 45The LHC Higgs Cross Section Working Group, 46The LHC Higgs Cross Section Working Group, 47The LHC Higgs Cross Section Working Group, 48The LHC Higgs Cross Section Working Group, 49The LHC Higgs Cross Section Working Group, 50The LHC Higgs Cross Section Working Group, 51The LHC Higgs Cross Section Working Group, 52The LHC Higgs Cross Section Working Group, 53The LHC Higgs Cross Section Working Group, 54The LHC Higgs Cross Section Working Group, 55The LHC Higgs Cross Section Working Group, 56The LHC Higgs Cross Section Working Group, 57The LHC Higgs Cross Section Working Group, 58The LHC Higgs Cross Section Working Group, 59The LHC Higgs Cross Section Working Group, 60The LHC Higgs Cross Section Working Group, 61The LHC Higgs Cross Section Working Group, 62The LHC Higgs Cross Section Working Group, 63The LHC Higgs Cross Section Working Group, 64The LHC Higgs Cross Section Working Group, 65The LHC Higgs Cross Section Working Group, 66The LHC Higgs Cross Section Working Group, 67The LHC Higgs Cross Section Working Group, 68The LHC Higgs Cross Section Working Group, 69The LHC Higgs Cross Section Working Group, 70The LHC Higgs Cross Section Working Group, 71The LHC Higgs Cross Section Working Group, 72The LHC Higgs Cross Section Working Group, 73The LHC Higgs Cross Section Working Group, 74The LHC Higgs Cross Section Working Group, 75The LHC Higgs Cross Section Working Group, 76The LHC Higgs Cross Section Working Group, 77The LHC Higgs Cross Section Working Group, 78The LHC Higgs Cross Section Working Group, 79The LHC Higgs Cross Section Working Group, 80The LHC Higgs Cross Section Working Group, 81The LHC Higgs Cross Section Working Group, 82The LHC Higgs Cross Section Working Group, 83The LHC Higgs Cross Section Working Group, 84The LHC Higgs Cross Section Working Group, 85The LHC Higgs Cross Section Working Group, 86The LHC Higgs Cross Section Working Group, 87The LHC Higgs Cross Section Working Group, 88The LHC Higgs Cross Section Working Group, 89The LHC Higgs Cross Section Working Group, 90The LHC Higgs Cross Section Working Group, 91The LHC Higgs Cross Section Working Group, 92The LHC Higgs Cross Section Working Group, 93The LHC Higgs Cross Section Working Group, 94The LHC Higgs Cross Section Working Group, 95The LHC Higgs Cross Section Working Group, 96The LHC Higgs Cross Section Working Group, 97The LHC Higgs Cross Section Working Group, 98The LHC Higgs Cross Section Working Group, 99The LHC Higgs Cross Section Working Group, 100The LHC Higgs Cross Section Working Group, 101The LHC Higgs Cross Section Working Group, 102The LHC Higgs Cross Section Working Group, 103The LHC Higgs Cross Section Working Group, 104The LHC Higgs Cross Section Working Group, 105The LHC Higgs Cross Section Working Group, 106The LHC Higgs Cross Section Working Group, 107The LHC Higgs Cross Section Working Group, 108The LHC Higgs Cross Section Working Group, 109The LHC Higgs Cross Section Working Group, 110The LHC Higgs Cross Section Working Group, 111The LHC Higgs Cross Section Working Group, 112The LHC Higgs Cross Section Working Group, 113The LHC Higgs Cross Section Working Group, 114The LHC Higgs Cross Section Working Group, 115The LHC Higgs Cross Section Working Group, 116The LHC Higgs Cross Section Working Group, 117The LHC Higgs Cross Section Working Group, 118The LHC Higgs Cross Section Working Group, 119The LHC Higgs Cross Section Working Group, 120The LHC Higgs Cross Section Working Group, 121The LHC Higgs Cross Section Working Group, 122The LHC Higgs Cross Section Working Group, 123The LHC Higgs Cross Section Working Group, 124The LHC Higgs Cross Section Working Group, 125The LHC Higgs Cross Section Working Group, 126The LHC Higgs Cross Section Working Group, 127The LHC Higgs Cross Section Working Group, 128The LHC Higgs Cross Section Working Group, 129The LHC Higgs Cross Section Working Group, 130The LHC Higgs Cross Section Working Group, 131The LHC Higgs Cross Section Working Group, 132The LHC Higgs Cross Section Working Group, 133The LHC Higgs Cross Section Working Group, 134The LHC Higgs Cross Section Working Group, 135The LHC Higgs Cross Section Working Group, 136The LHC Higgs Cross Section Working Group, 137The LHC Higgs Cross Section Working Group, 138The LHC Higgs Cross Section Working Group, 139The LHC Higgs Cross Section Working Group, 140The LHC Higgs Cross Section Working Group, 141The LHC Higgs Cross Section Working Group, 142The LHC Higgs Cross Section Working Group, 143The LHC Higgs Cross Section Working Group, 144The LHC Higgs Cross Section Working Group, 145The LHC Higgs Cross Section Working Group, 146The LHC Higgs Cross Section Working Group, 147The LHC Higgs Cross Section Working Group, 148The LHC Higgs Cross Section Working Group, 149The LHC Higgs Cross Section Working Group, 150The LHC Higgs Cross Section Working Group, 151The LHC Higgs Cross Section Working Group, 152The LHC Higgs Cross Section Working Group, 153The LHC Higgs Cross Section Working Group, 154The LHC Higgs Cross Section Working Group, 155The LHC Higgs Cross Section Working Group, 156The LHC Higgs Cross Section Working Group, 157The LHC Higgs Cross Section Working Group, 158The LHC Higgs Cross Section Working Group, 159The LHC Higgs Cross Section Working Group, 160The LHC Higgs Cross Section Working Group, 161The LHC Higgs Cross Section Working Group, 162The LHC Higgs Cross Section Working Group, 163The LHC Higgs Cross Section Working Group, 164The LHC Higgs Cross Section Working Group, 165The LHC Higgs Cross Section Working Group, 166The LHC Higgs Cross Section Working Group, 167The LHC Higgs Cross Section Working Group, 168The LHC Higgs Cross Section Working Group, 169The LHC Higgs Cross Section Working Group, 170The LHC Higgs Cross Section Working Group, 171The LHC Higgs Cross Section Working Group, 172The LHC Higgs Cross Section Working Group, 173The LHC Higgs Cross Section Working Group, 174The LHC Higgs Cross Section Working Group, 175The LHC Higgs Cross Section Working Group, 176The LHC Higgs Cross Section Working Group, 177The LHC Higgs Cross Section Working Group, 178The LHC Higgs Cross Section Working Group, 179The LHC Higgs Cross Section Working Group, 180The LHC Higgs Cross Section Working Group, 181The LHC Higgs Cross Section Working Group, 182The LHC Higgs Cross Section Working Group, 183The LHC Higgs Cross Section Working Group, 184The LHC Higgs Cross Section Working Group, 185The LHC Higgs Cross Section Working Group, 186The LHC Higgs Cross Section Working Group, 187The LHC Higgs Cross Section Working Group, 188The LHC Higgs Cross Section Working Group, 189The LHC Higgs Cross Section Working Group, 190The LHC Higgs Cross Section Working Group, 191The LHC Higgs Cross Section Working Group, 192The LHC Higgs Cross Section Working Group, 193The LHC Higgs Cross Section Working Group, 194The LHC Higgs Cross Section Working Group, 195The LHC Higgs Cross Section Working Group, 196The LHC Higgs Cross Section Working Group, 197The LHC Higgs Cross Section Working Group, 198The LHC Higgs Cross Section Working Group, 199The LHC Higgs Cross Section Working Group, 200The LHC Higgs Cross Section Working Group, 201The LHC Higgs Cross Section Working Group, 202The LHC Higgs Cross Section Working Group, 203The LHC Higgs Cross Section Working Group, 204The LHC Higgs Cross Section Working Group, 205The LHC Higgs Cross Section Working Group, 206The LHC Higgs Cross Section Working Group, 207The LHC Higgs Cross Section Working Group, 208The LHC Higgs Cross Section Working Group, 209The LHC Higgs Cross Section Working Group, 210The LHC Higgs Cross Section Working Group, 211The LHC Higgs Cross Section Working Group, 212The LHC Higgs Cross Section Working Group, 213The LHC Higgs Cross Section Working Group, 214The LHC Higgs Cross Section Working Group, 215The LHC Higgs Cross Section Working Group, 216The LHC Higgs Cross Section Working Group, 217The LHC Higgs Cross Section Working Group, 218The LHC Higgs Cross Section Working Group, 219The LHC Higgs Cross Section Working Group, 220The LHC Higgs Cross Section Working Group, 221The LHC Higgs Cross Section Working Group, 222The LHC Higgs Cross Section Working Group, 223The LHC Higgs Cross Section Working Group, 224The LHC Higgs Cross Section Working Group, 225The LHC Higgs Cross Section Working Group, 226The LHC Higgs Cross Section Working Group, 227The LHC Higgs Cross Section Working Group, 228The LHC Higgs Cross Section Working Group, 229The LHC Higgs Cross Section Working Group, 230The LHC Higgs Cross Section Working Group, 231The LHC Higgs Cross Section Working Group, 232The LHC Higgs Cross Section Working Group, 233The LHC Higgs Cross Section Working Group, 234The LHC Higgs Cross Section Working Group, 235The LHC Higgs Cross Section Working Group, 236The LHC Higgs Cross Section Working Group, 237The LHC Higgs Cross Section Working Group, 238The LHC Higgs Cross Section Working Group, 239The LHC Higgs Cross Section Working Group, 240The LHC Higgs Cross Section Working Group, 241The LHC Higgs Cross Section Working Group, 242The LHC Higgs Cross Section Working Group, 243The LHC Higgs Cross Section Working Group, 244The LHC Higgs Cross Section Working Group, 245The LHC Higgs Cross Section Working Group, 246The LHC Higgs Cross Section Working Group, 247The LHC Higgs Cross Section Working Group, 248The LHC Higgs Cross Section Working Group, 249The LHC Higgs Cross Section Working Group, 250The LHC Higgs Cross Section Working Group, 251The LHC Higgs Cross Section Working Group, 252The LHC Higgs Cross Section Working Group, 253The LHC Higgs Cross Section Working Group, 254The LHC Higgs Cross Section Working Group, 255The LHC Higgs Cross Section Working Group, 256The LHC Higgs Cross Section Working Group, 257The LHC Higgs Cross Section Working Group, 258The LHC Higgs Cross Section Working Group, 259The LHC Higgs Cross Section Working Group, 260The LHC Higgs Cross Section Working Group, 261The LHC Higgs Cross Section Working Group, 262The LHC Higgs Cross Section Working Group, 263The LHC Higgs Cross Section Working Group, 264The LHC Higgs Cross Section Working Group, 265The LHC Higgs Cross Section Working Group, 266The LHC Higgs Cross Section Working Group, 267The LHC Higgs Cross Section Working Group, 268The LHC Higgs Cross Section Working Group, 269The LHC Higgs Cross Section Working Group, 270The LHC Higgs Cross Section Working Group, 271The LHC Higgs Cross Section Working Group, 272The LHC Higgs Cross Section Working Group, 273The LHC Higgs Cross Section Working Group, 274The LHC Higgs Cross Section Working Group, 275The LHC Higgs Cross Section Working Group, 276The LHC Higgs Cross Section Working Group, 277The LHC Higgs Cross Section Working Group, 278The LHC Higgs Cross Section Working Group, 279The LHC Higgs Cross Section Working Group, 280The LHC Higgs Cross Section Working Group, 281The LHC Higgs Cross Section Working Group, 282The LHC Higgs Cross Section Working Group, 283The LHC Higgs Cross Section Working Group, 284The LHC Higgs Cross Section Working Group, 285The LHC Higgs Cross Section Working Group, 286The LHC Higgs Cross Section Working Group, 287The LHC Higgs Cross Section Working Group, 288The LHC Higgs Cross Section Working Group, 289The LHC Higgs Cross Section Working Group, 290The LHC Higgs Cross Section Working Group, 291The LHC Higgs Cross Section Working Group, 292The LHC Higgs Cross Section Working Group, 293The LHC Higgs Cross Section Working Group, 294The LHC Higgs Cross Section Working Group, 295The LHC Higgs Cross Section Working Group, 296The LHC Higgs Cross Section Working Group, 297The LHC Higgs Cross Section Working Group, 298The LHC Higgs Cross Section Working Group, 299The LHC Higgs Cross Section Working Group, 300The LHC Higgs Cross Section Working Group, 301The LHC Higgs Cross Section Working Group, 302The LHC Higgs Cross Section Working Group, 303The LHC Higgs Cross Section Working Group, 304The LHC Higgs Cross Section Working Group, 305The LHC Higgs Cross Section Working Group, 306The LHC Higgs Cross Section Working Group, 307The LHC Higgs Cross Section Working Group, 308The LHC Higgs Cross Section Working Group, 309The LHC Higgs Cross Section Working Group, 310The LHC Higgs Cross Section Working Group, 311The LHC Higgs Cross Section Working Group, 312The LHC Higgs Cross Section Working Group, 313The LHC Higgs Cross Section Working Group, 314The LHC Higgs Cross Section Working Group, 315The LHC Higgs Cross Section Working Group, 316The LHC Higgs Cross Section Working Group, 317The LHC Higgs Cross Section Working Group, 318The LHC Higgs Cross Section Working Group, 319The LHC Higgs Cross Section Working Group, 320The LHC Higgs Cross Section Working Group, 321The LHC Higgs Cross Section Working Group, 322The LHC Higgs Cross Section Working Group, 323The LHC Higgs Cross Section Working Group, 324The LHC Higgs Cross Section Working Group, 325The LHC Higgs Cross Section Working Group, 326The LHC Higgs Cross Section Working Group, 327The LHC Higgs Cross Section Working Group, 328The LHC Higgs Cross Section Working Group, 329The LHC Higgs Cross Section Working Group, 330The LHC Higgs Cross Section Working Group, 331The LHC Higgs Cross Section Working Group, 332The LHC Higgs Cross Section Working Group, 333The LHC Higgs Cross Section Working Group, 334The LHC Higgs Cross Section Working Group, 335The LHC Higgs Cross Section Working Group, 336The LHC Higgs Cross Section Working Group, 337The LHC Higgs Cross Section Working Group, 338The LHC Higgs Cross Section Working Group, 339The LHC Higgs Cross Section Working Group, 340The LHC Higgs Cross Section Working Group, 341The LHC Higgs Cross Section Working Group, 342The LHC Higgs Cross Section Working Group, 343The LHC Higgs Cross Section Working Group, 344The LHC Higgs Cross Section Working Group, 345The LHC Higgs Cross Section Working Group, 346The LHC Higgs Cross Section Working Group, 347The LHC Higgs Cross Section Working Group, 348The LHC Higgs Cross Section Working Group, 349The LHC Higgs Cross Section Working Group, 350The LHC Higgs Cross Section Working Group, 351The LHC Higgs Cross Section Working Group, 352The LHC Higgs Cross Section Working Group, 353The LHC Higgs Cross Section Working Group, 354The LHC Higgs Cross Section Working Group, 355The LHC Higgs Cross Section Working Group, 356The LHC Higgs Cross Section Working Group, 357The LHC Higgs Cross Section Working Group, 358The LHC Higgs Cross Section Working Group, 359The LHC Higgs Cross Section Working Group, 360The LHC Higgs Cross Section Working Group, 361The LHC Higgs Cross Section Working Group, 362The LHC Higgs Cross Section Working Group, 363The LHC Higgs Cross Section Working Group, 364The LHC Higgs Cross Section Working Group, 365The LHC Higgs Cross Section Working Group, 366The LHC Higgs Cross Section Working Group, 367The LHC Higgs Cross Section Working Group, 368The LHC Higgs Cross Section Working Group, 369The LHC Higgs Cross Section Working Group, 370The LHC Higgs Cross Section Working Group, 371The LHC Higgs Cross Section Working Group, 372The LHC Higgs Cross Section Working Group, 373The LHC Higgs Cross Section Working Group, 374The LHC Higgs Cross Section Working Group

This Report summarizes the results of the activities of the LHC Higgs Cross Section Working Group in the period 2014-2016. The main goal of the working group was to present the state-of-the-art of Higgs physics at the LHC, integrating all new results that have appeared in the last few years. The first part compiles the most up-to-date predictions of Higgs boson production cross sections and decay branching ratios, parton distribution functions, and off-shell Higgs boson production and interference effects. Read More

This letter presents an experimental study and a novel modelling approach of the wireless channel of smart utility meters placed in basements or sculleries. The experimental data consist of signal strength measurements of consumption report packets. Since such packets are only registered if they can be decoded by the receiver, the part of the signal strength distribution that falls below the receiver sensitivity threshold is not observable. Read More

Effective operators have been used extensively to understand small deviations from the Standard Model in the search for new physics. So far there has been no general method to fit for small parameters when higher order corrections in these parameters are present but unknown. We present a new technique that solves this problem, allowing for an exact p-value calculation under the assumption that higher order theoretical contributions can be treated as gaussian distributed random variables. Read More

We use the Wide-field Infrared Survey Explorer (WISE) and the Sloan Digital Sky Survey (SDSS) to confirm a connection between dust-obscured active galactic nuclei (AGNs) and galaxy merging. Using a new, volume-limited (z <= 0.08) catalog of visually-selected major mergers and galaxy-galaxy interactions from the SDSS, with stellar masses above 2x10^10 Msun, we find that major mergers (interactions) are 5-17 (3-5) times more likely to have red [3. Read More

We review the number counts to second order concentrating on the terms which dominate on sub horizon scales. We re-derive the result for these terms and compare it with the different versions found in the literature. We generalize our derivation to higher order terms, especially the third order number counts which are needed to compute the 1-loop contribution to the power spectrum. Read More

One of the ways to satisfy the requirements of ultra-reliable low latency communication for mission critical Machine-type Communications (MTC) applications is to integrate multiple communication interfaces. In order to estimate the performance in terms of latency and reliability of such an integrated communication system, we propose an analysis framework that combines traditional reliability models with technology-specific latency probability distributions. In our proposed model we demonstrate how failure correlation between technologies can be taken into account. Read More

We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be extremely useful in proving high and unconditional lower bounds that cannot be obtained in any other known model of computation with the current techniques. Often our lower bounds match the known space-query time trade-off curve and in fact for all the problems considered, there is a very good and reasonable match between the our lower bounds and the known upper bounds, at least for some choice of input parameters. The problems that we consider are set intersection queries (both the reporting variant and the semi-group counting variant), indexing a set of documents for two-pattern queries, or forbidden- pattern queries, or queries with wild-cards, and indexing an input set of gapped-patterns (or two-patterns) to find those matching a document given at the query time. Read More

We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an $O(\ell^3 n^{(\omega+1)/2} \log(n))$ decoding algorithm for $\ell$-Interleaved Gabidulin codes of length $n$, where $\omega$ is the matrix multiplication exponent, improving in the exponent of $n$ compared to previous results. Read More

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using curves with d degrees of freedom. Another generalization is the Hyperplane Cover problem where points in d-dimensional space are to be covered by hyperplanes. Read More

We describe how to solve simultaneous Pad\'e approximations over a power series ring $K[[x]]$ for a field $K$ using $O~(n^{\omega - 1} d)$ operations in $K$, where $d$ is the sought precision and $n$ is the number of power series to approximate. We develop two algorithms using different approaches. Both algorithms return a reduced sub-bases that generates the complete set of solutions to the input approximations problem that satisfy the given degree constraints. Read More

We show that decoding of $\ell$-Interleaved Gabidulin codes, as well as list-$\ell$ decoding of Mahdavifar--Vardy codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of $\F[x]$ matrices, we develop a general and flexible approach of transforming matrices over skew polynomial rings into a certain reduced form. We apply this to solve generalised shift register problems over skew polynomial rings which occur in decoding $\ell$-Interleaved Gabidulin codes. Read More

The cosmological standard model at present is widely accepted as containing mainly things we do not understand. In particular the appearance of a Cosmological Constant, or dark energy, is puzzling. This was first inferred from the Hubble diagram of a low number of Type Ia supernovae, and later corroborated by complementary cosmological probes. Read More

While LTE is becoming widely rolled out for human-type services, it is also a promising solution for cost-efficient connectivity of the smart grid monitoring equipment. This is a type of machine-to-machine (M2M) traffic that consists mainly of sporadic uplink transmissions. In such a setting, the amount of traffic that can be served in a cell is not constrained by the data capacity, but rather by the signaling constraints in the random access channel and control channel. Read More

Massive MIMO is a new technique for wireless communications that claims to offer very high system throughput and energy efficiency in multi-user scenarios. The cost is to add a very large number of antennas at the base station. Theoretical research has probed these benefits, but very few measurements have showed the potential of Massive MIMO in practice. Read More

The "standard" model of cosmology is founded on the basis that the expansion rate of the universe is accelerating at present --- as was inferred originally from the Hubble diagram of Type Ia supernovae. There exists now a much bigger database of supernovae so we can perform rigorous statistical tests to check whether these "standardisable candles" indeed indicate cosmic acceleration. Taking account of the empirical procedure by which corrections are made to their absolute magnitudes to allow for the varying shape of the light curve and extinction by dust, we find, rather surprisingly, that the data are still quite consistent with a constant rate of expansion. Read More

Relaying can improve the coverage and performance of wireless access networks. In presence of a localisation system at the mobile nodes, the use of such location estimates for relay node selection can be advantageous as such information can be collected by access points in linear effort with respect to number of mobile nodes (while the number of links grows quadratically). However, the localisation error and the chosen update rate of location information in conjunction with the mobility model affect the performance of such location-based relay schemes; these parameters also need to be taken into account in the design of optimal policies. Read More

Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed-Solomon codes up to the Sudan radius. Since the method's inception, it has been an open question if it is possible to incorporate "multiplicities", the parameter allowing the Guruswami-Sudan algorithm to decode up to the Johnson radius. In this paper we show that this can be done, and describe how to efficiently solve the resulting key equations. Read More

A canonical scenario in Machine-Type Communications (MTC) is the one featuring a large number of devices, each of them with sporadic traffic. Hence, the number of served devices in a single LTE cell is not determined by the available aggregate rate, but rather by the limitations of the LTE access reservation protocol. Specifically, the limited number of contention preambles and the limited amount of uplink grants per random access response are crucial to consider when dimensioning LTE networks for MTC. Read More

The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements $n$ - here denoted a strictly implicit priority queue. We introduce two new strictly implicit priority queues. The first structure supports amortized $O(1)$ time Insert and $O(\log n)$ time ExtractMin operations, where both operations require amortized $O(1)$ element moves. Read More

This paper generalizes recent proposals of density forecasting models and it develops theory for this class of models. In density forecasting, the density of observations is estimated in regions where the density is not observed. Identification of the density in such regions is guaranteed by structural assumptions on the density that allows exact extrapolation. Read More

The introduction of smart electricity meters with cellular radio interface puts an additional load on the wireless cellular networks. Currently, these meters are designed for low duty cycle billing and occasional system check, which generates a low-rate sporadic traffic. As the number of distributed energy resources increases, the household power will become more variable and thus unpredictable from the viewpoint of the Distribution System Operator (DSO). Read More

For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of $\ell$-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity $O(\ell \mu^2)$ where $\mu$ measures the size of the input problem. Read More

Two-way is a dominant mode of communication in wireless systems. Departing from the tradition to optimize each transmission direction separately, recent work has demonstrated that, for time-division duplex (TDD) systems, optimizing the schedule of the two transmission directions depending on traffic load and interference condition leads to performance gains. In this letter, a general network of multiple interfering two-way links is studied under the assumption of a balanced load in the two directions for each link. Read More

We present a methodology for the regularisation and combination of sparse sampled and irregularly gridded observations from fibre-optic multi-object integral-field spectroscopy. The approach minimises interpolation and retains image resolution on combining sub-pixel dithered data. We discuss the methodology in the context of the Sydney-AAO Multi-object Integral-field spectrograph (SAMI) Galaxy Survey underway at the Anglo-Australian Telescope. Read More

We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating the output of the EEA at the least reliable positions of the received word. Read More

The K\"otter-Nielsen-H{\o}holdt algorithm is a popular way to construct the bivariate interpolation polynomial in the Guruswami-Sudan decoding algorithm for Reed-Solomon codes. In this paper, we show how one can use Divide & Conquer techniques to provide an asymptotic speed-up of the algorithm, rendering its complexity quasi-linear in n. Several of our observations can also provide a practical speed-up to the classical version of the algorithm. Read More

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami-Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. Read More

An iterated refinement procedure for the Guruswami-Sudan list decoding algorithm for Generalised Reed-Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of closest codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity. Read More

2013Nov
Affiliations: 1Australian National University, 2Australian National University, 3Australian National University, 4Australian National University

We present PyWiFeS, a new Python-based data reduction pipeline for the Wide Field Spectrograph (WiFeS). PyWiFeS consists of a series of core data processing routines built on standard scientific Python packages commonly used in astronomical applications. Included in PyWiFeS is an implementation of a new global optical model of the spectrograph which provides wavelengths solutions accurate to $\sim$0. Read More

Power decoding, or "decoding by virtual interleaving", of Reed--Solomon codes is a method for unique decoding beyond half the minimum distance. We give a new variant of the Power decoding scheme, building upon the key equation of Gao. We show various interesting properties such as behavioural equivalence to the classical scheme using syndromes, as well as a new bound on the failure probability when the powering degree is 3. Read More

There is currently limited understanding of the role played by haemodynamic forces on the processes governing vascular development. One of many obstacles to be overcome is being able to measure those forces, at the required resolution level, on vessels only a few micrometres thick. In the current paper, we present an in silico method for the computation of the haemodynamic forces experienced by murine retinal vasculature (a widely used vascular development animal model) beyond what is measurable experimentally. Read More

2013Oct

This report summarizes the work of the Energy Frontier Higgs Boson working group of the 2013 Community Summer Study (Snowmass). We identify the key elements of a precision Higgs physics program and document the physics potential of future experimental facilities as elucidated during the Snowmass study. We study Higgs couplings to gauge boson and fermion pairs, double Higgs production for the Higgs self-coupling, its quantum numbers and $CP$-mixing in Higgs couplings, the Higgs mass and total width, and prospects for direct searches for additional Higgs bosons in extensions of the Standard Model. Read More

The mixed-field orientation of an asymmetric-rotor molecule with its permanent dipole moment non-parallel to the principal axes of polarizability is investigated experimentally and theoretically. We find that for the typical case of a strong, nonresonant laser field and a weak static electric field complete 3D orientation is induced if the laser field is elliptically polarized and if its major and minor polarization axes are not parallel to the static field. For a linearly polarized laser field solely the dipole moment component along the most polarizable axis of the molecule is relevant resulting in 1D orientation even when the laser polarization and the static field are non parallel. Read More

We show how to solve a generalised version of the Multi-sequence Linear Feedback Shift-Register (MLFSR) problem using minimisation of free modules over $\mathbb F[x]$. We show how two existing algorithms for minimising such modules run particularly fast on these instances. Furthermore, we show how one of them can be made even faster for our use. Read More

2013Jan
Affiliations: 1Technical University of Denmark, 2INT - University of Ulm., INRIA Saclay - Ile de France

An iterated refinement procedure for the Guruswami--Sudan list decoding algorithm for Generalised Reed--Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of \emph{closest} codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity. Read More

We show that a 450 fs nonresonant, moderately intense, linearly polarized laser pulse can induce field-free molecular axis alignment of methyliodide molecules dissolved in a helium nanodroplet. Time-resolved measurements reveal rotational dynamics much slower than that of isolated molecules and, surprisingly, complete absence of the sharp transient alignment recurrences characteristic of gas phase molecules. Our results presage a range of new opportunities for exploring both molecular dynamics in a dissipative environment and the properties of He nanodroplets. Read More

Security organizations often attempt to disrupt terror or insurgent networks by targeting "high value targets" (HVT's). However, there have been numerous examples that illustrate how such networks are able to quickly re-generate leadership after such an operation. Here, we introduce the notion of a "shaping" operation in which the terrorist network is first targeted for the purpose of reducing its leadership re-generation ability before targeting HVT's. Read More

We derive the Wu list-decoding algorithm for Generalised Reed-Solomon (GRS) codes by using Gr\"obner bases over modules and the Euclidean algorithm (EA) as the initial algorithm instead of the Berlekamp-Massey algorithm (BMA). We present a novel method for constructing the interpolation polynomial fast. We give a new application of the Wu list decoder by decoding irreducible binary Goppa codes up to the binary Johnson radius. Read More

2012Oct
Authors: T. Aaltonen, B. Alvarez Gonzalez, S. Amerio, D. Amidei, A. Anastassov, A. Annovi, J. Antos, G. Apollinari, J. A. Appel, A. Apresyan, T. Arisawa, A. Artikov, J. Asaadi, W. Ashmanskas, B. Auerbach, A. Aurisano, F. Azfar, W. Badgett, A. Barbaro-Galtieri, V. E. Barnes, B. A. Barnett, P. Barria, P. Bartos, M. Bauce, G. Bauer, F. Bedeschi, D. Beecher, S. Behari, G. Bellettini, J. Bellinger, D. Benjamin, A. Beretvas, A. Bhatti, M. Binkley, D. Bisello, I. Bizjak, K. R. Bland, B. Blumenfeld, A. Bocci, A. Bodek, D. Bortoletto, J. Boudreau, A. Boveia, L. Brigliadori, A. Brisuda, C. Bromberg, E. Brucken, M. Bucciantonio, J. Budagov, H. S. Budd, S. Budd, K. Burkett, G. Busetto, P. Bussey, A. Buzatu, C. Calancha, S. Camarda, M. Campanelli, M. Campbell, F. Canelli, B. Carls, D. Carlsmith, R. Carosi, S. Carrillo, S. Carron, B. Casal, M. Casarsa, A. Castro, P. Catastini, D. Cauz, V. Cavaliere, M. Cavalli-Sforza, A. Cerri, L. Cerrito, Y. C. Chen, M. Chertok, G. Chiarelli, G. Chlachidze, F. Chlebana, K. Cho, D. Chokheli, J. P. Chou, W. H. Chung, Y. S. Chung, C. I. Ciobanu, M. A. Ciocci, A. Clark, C. Clarke, G. Compostella, M. E. Convery, J. Conway, M. Corbo, M. Cordelli, C. A. Cox, D. J. Cox, F. Crescioli, C. Cuenca Almenar, J. Cuevas, R. Culbertson, D. Dagenhart, N. d'Ascenzo, M. Datta, P. de Barbaro, S. De Cecco, G. De Lorenzo, M. Dell'Orso, C. Deluca, L. Demortier, J. Deng, M. Deninno, F. Devoto, M. d'Errico, A. Di Canto, B. Di Ruzza, J. R. Dittmann, M. D'Onofrio, S. Donati, P. Dong, M. Dorigo, T. Dorigo, K. Ebina, A. Elagin, A. Eppig, R. Erbacher, D. Errede, S. Errede, N. Ershaidat, R. Eusebi, H. C. Fang, S. Farrington, M. Feindt, J. P. Fernandez, C. Ferrazza, R. Field, G. Flanagan, R. Forrest, M. J. Frank, M. Franklin, J. C. Freeman, Y. Funakoshi, I. Furic, M. Gallinaro, J. Galyardt, J. E. Garcia, A. F. Garfinkel, P. Garosi, H. Gerberich, E. Gerchtein, S. Giagu, V. Giakoumopoulou, P. Giannetti, K. Gibson, C. M. Ginsburg, N. Giokaris, P. Giromini, M. Giunta, G. Giurgiu, V. Glagolev, D. Glenzinski, M. Gold, D. Goldin, N. Goldschmidt, A. Golossanov, G. Gomez, G. Gomez-Ceballos, M. Goncharov, O. Gonzalez, I. Gorelov, A. T. Goshaw, K. Goulianos, S. Grinstein, C. Grosso-Pilcher, R. C. Group, J. Guimaraes da Costa, Z. Gunay-Unalan, C. Haber, S. R. Hahn, E. Halkiadakis, A. Hamaguchi, J. Y. Han, F. Happacher, K. Hara, D. Hare, M. Hare, R. F. Harr, K. Hatakeyama, C. Hays, M. Heck, J. Heinrich, M. Herndon, S. Hewamanage, D. Hidas, A. Hocker, W. Hopkins, D. Horn, S. Hou, R. E. Hughes, M. Hurwitz, U. Husemann, N. Hussain, M. Hussein, J. Huston, G. Introzzi, M. Iori, A. Ivanov, E. James, D. Jang, B. Jayatilaka, E. J. Jeon, M. K. Jha, S. Jindariani, W. Johnson, M. Jones, K. K. Joo, S. Y. Jun, T. R. Junk, T. Kamon, P. E. Karchin, A. Kasmi, Y. Kato, W. Ketchum, J. Keung, V. Khotilovich, B. Kilminster, D. H. Kim, H. S. Kim, H. W. Kim, J. E. Kim, M. J. Kim, S. B. Kim, S. H. Kim, Y. K. Kim, N. Kimura, M. Kirby, S. Klimenko, K. Kondo, D. J. Kong, J. Konigsberg, A. V. Kotwal, M. Kreps, J. Kroll, D. Krop, N. Krumnack, M. Kruse, V. Krutelyov, T. Kuhr, M. Kurata, S. Kwang, A. T. Laasanen, S. Lami, S. Lammel, M. Lancaster, R. L. Lander, K. Lannon, A. Lath, G. Latino, T. LeCompte, E. Lee, H. S. Lee, J. S. Lee, S. W. Lee, S. Leo, S. Leone, J. D. Lewis, A. Limosani, C. -J. Lin, J. Linacre, M. Lindgren, E. Lipeles, A. Lister, D. O. Litvintsev, C. Liu, Q. Liu, T. Liu, S. Lockwitz, A. Loginov, D. Lucchesi, J. Lueck, P. Lujan, P. Lukens, G. Lungu, J. Lys, R. Lysak, R. Madrak, K. Maeshima, K. Makhoul, S. Malik, G. Manca, A. Manousakis-Katsikakis, F. Margaroli, C. Marino, M. Martinez, R. Martinez-Ballarin, P. Mastrandrea, M. E. Mattson, P. Mazzanti, K. S. McFarland, P. McIntyre, R. McNulty, A. Mehta, P. Mehtala, A. Menzione, C. Mesropian, T. Miao, D. Mietlicki, A. Mitra, H. Miyake, S. Moed, N. Moggi, M. N. Mondragon, C. S. Moon, R. Moore, M. J. Morello, J. Morlock, P. Movilla Fernandez, A. Mukherjee, Th. Muller, P. Murat, M. Mussini, J. Nachtman, Y. Nagai, J. Naganoma, I. Nakano, A. Napier, J. Nett, C. Neu, M. S. Neubauer, J. Nielsen, L. Nodulman, O. Norniella, E. Nurse, L. Oakes, S. H. Oh, Y. D. Oh, I. Oksuzian, T. Okusawa, R. Orava, L. Ortolan, S. Pagan Griso, C. Pagliarone, E. Palencia, V. Papadimitriou, A. A. Paramonov, J. Patrick, G. Pauletta, M. Paulini, C. Paus, D. E. Pellett, A. Penzo, T. J. Phillips, G. Piacentino, E. Pianori, J. Pilot, K. Pitts, C. Plager, L. Pondrom, S. Poprocki, K. Potamianos, O. Poukhov, F. Prokoshin, A. Pronko, F. Ptohos, E. Pueschel, G. Punzi, J. Pursley, A. Rahaman, V. Ramakrishnan, N. Ranjan, J. Ray, I. Redondo, P. Renton, M. Rescigno, T. Riddick, F. Rimondi, L. Ristori, A. Robson, T. Rodrigo, T. Rodriguez, E. Rogers, S. Rolli, R. Roser, M. Rossi, F. Rubbo, F. Ruffini, A. Ruiz, J. Russ, V. Rusu, A. Safonov, W. K. Sakumoto, Y. Sakurai, L. Santi, L. Sartori, K. Sato, V. Saveliev, A. Savoy-Navarro, P. Schlabach, A. Schmidt, E. E. Schmidt, M. P. Schmidt, M. Schmitt, T. Schwarz, L. Scodellaro, A. Scribano, F. Scuri, A. Sedov, S. Seidel, Y. Seiya, A. Semenov, F. Sforza, A. Sfyrla, S. Z. Shalhout, T. Shears, P. F. Shepard, M. Shimojima, S. Shiraishi, M. Shochet, I. Shreyber, A. Simonenko, P. Sinervo, A. Sissakian, K. Sliwa, J. R. Smith, F. D. Snider, A. Soha, S. Somalwar, V. Sorin, P. Squillacioti, M. Stancari, M. Stanitzki, R. St. Denis, B. Stelzer, O. Stelzer-Chilton, D. Stentz, J. Strologas, G. L. Strycker, Y. Sudo, A. Sukhanov, I. Suslov, K. Takemasa, Y. Takeuchi, J. Tang, M. Tecchio, P. K. Teng, J. Thom, J. Thome, G. A. Thompson, E. Thomson, P. Ttito-Guzman, S. Tkaczyk, D. Toback, S. Tokar, K. Tollefson, T. Tomura, D. Tonelli, S. Torre, D. Torretta, P. Totaro, M. Trovato, Y. Tu, F. Ukegawa, S. Uozumi, A. Varganov, J. Vasquez, F. Vazquez, G. Velev, C. Vellidis, M. Vidal, I. Vila, R. Vilar, J. Vizan, M. Vogel, G. Volpi, P. Wagner, R. L. Wagner, T. Wakisaka, R. Wallny, S. M. Wang, A. Warburton, D. Waters, M. Weinberger, W. C. Wester III, B. Whitehouse, D. Whiteson, A. B. Wicklund, E. Wicklund, S. Wilbur, F. Wick, H. H. Williams, J. S. Wilson, P. Wilson, B. L. Winer, P. Wittich, S. Wolbers, H. Wolfe, T. Wright, X. Wu, Z. Wu, K. Yamamoto, J. Yamaoka, T. Yang, U. K. Yang, Y. C. Yang, W. -M. Yao, G. P. Yeh, K. Yi, J. Yoh, K. Yorita, T. Yoshida, G. B. Yu, I. Yu, S. S. Yu, J. C. Yun, A. Zanetti, Y. Zeng, S. Zucchelli

We present a measurement of the mass difference between top ($t$) and anti-top ($\bar{t}$) quarks using $t\bar{t}$ candidate events reconstructed in the final state with one lepton and multiple jets. We use the full data set of Tevatron $\sqrt{s} = 1.96$ TeV proton-antiproton collisions recorded by the CDF II detector, corresponding to an integrated luminosity of 8. Read More

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). Read More