On Codes with w-identifiable Parent Property
Institute of Scientific and Technical Information of China (English)
MA Jun; XIONG Yu
2008-01-01
A code is said to be a w-identifiable parent property code (or w-IPP code for short) if whenever d is a descendant of w (or fewer) codewords, and one can always identify at least one of the parents of d. Let C be an (N, w + 1, q)-code and C* an (w + 1)-color graph for C. If a graph G is a subgraph of C* and consists of w + 1 edges with different colors, then G is called a (w + 1)-pattern of C*. In this paper, we proved that C is a w-IPP code if and only if there exists at most one vertex with color degree more than 1 in any (w + 1)-pattern of C*.
Codes in W*-Metric Spaces: Theory and Examples
Bumgardner, Christopher J.
2011-01-01
We introduce a "W*"-metric space, which is a particular approach to non-commutative metric spaces where a "quantum metric" is defined on a von Neumann algebra. We generalize the notion of a quantum code and quantum error correction to the setting of finite dimensional "W*"-metric spaces, which includes codes and error correction for classical…
Quantum Teleportation and Superdense Coding via W-Class States
Institute of Scientific and Technical Information of China (English)
YAN Jun; WU Huai-Zhi; YANG Zhen-Biao; ZHENG Shi-Biao
2008-01-01
According to the protocol of Agrawal et al., we propose a cavity QED scheme for realization of teleportation and dense coding. Instead of using EPR states and GHZ states, our scheme is more insensitive to the loss of one particle by using a W-class state as a quantum channel. Besides, our scheme is immune to thermal field, and does not require the cavity to remain in the vacuum state throughout the procedure.
Generating multi-photon W-like states for perfect quantum teleportation and superdense coding
Li, Ke; Kong, Fan-Zhen; Yang, Ming; Ozaydin, Fatih; Yang, Qing; Cao, Zhuo-Liang
2016-08-01
An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient preparation of such W-like states is of great importance in quantum communications, which has not been studied as much as the preparation of W states. In this paper, we propose a simple optical scheme for efficient preparation of large-scale polarization-based entangled W-like states by fusing two W-like states or expanding a W-like state with an ancilla photon. Our scheme can also generate large-scale W states by fusing or expanding W or even W-like states. The cost analysis shows that in generating large-scale W states, the fusion mechanism achieves a higher efficiency with non-maximally entangled W-like states than maximally entangled W states. Our scheme can also start fusion or expansion with Bell states, and it is composed of a polarization-dependent beam splitter, two polarizing beam splitters and photon detectors. Requiring no ancilla photon or controlled gate to operate, our scheme can be realized with the current photonics technology and we believe it enable advances in quantum teleportation and superdense coding in multipartite settings.
Scheme for implementing quantum dense coding with W-class state in cavity QED
Institute of Scientific and Technical Information of China (English)
He Juan; Ye Liu; Ni Zhi-Xiang
2008-01-01
An experimentally feasible protocol for realizing dense coding by using a class of W-state in cavity quantum electrodynamics (QED) is proposed in this paper.The prominent advantage of our scheme is that the succeasful probability of the dense coding with a W-class state can reach 1.In addition,the scheme can be implemented by the present cavity QED techniques.
The states of W-class as shared resources for perfect teleportation and superdense coding
Energy Technology Data Exchange (ETDEWEB)
Li, Lvzhou; Qiu, Daowen [Department of Computer Science, Zhongshan University, Guangzhou 510275 (China)
2007-08-31
As we know, the states of triqubit systems have two important classes: GHZ-class and W-class. In this paper, the states of W-class are considered for teleportation and superdense coding, and they are generalized to multi-particle systems. First we describe two transformations on the shared resources for teleportation and superdense coding. With these transformations, we obtain a sufficient and necessary condition for a state of W-class being suitable for perfect teleportation and superdense coding. For the state vertical bar W>{sub 123} = 1/2 (vertical bar 100>{sub 123} + vertical bar 010>{sub 123} + {radical}2 vertical bar 001>{sub 123}) which was thought to be not suitable for sending three classical bits by sending two qubits by Agrawal and Pati (2006 Phys. Rev. A 74 062320), we show that it may be used to fulfil that task, if entangled unitary operations on two qubits are allowed. We generalize the states of W-class to multi-qubit systems and multi-particle systems with higher dimension. We propose two protocols for teleportation and superdense coding by using W-states of multi-qubit systems that generalize the protocols by using |W){sub 123} proposed by Agrawal and Pati. We obtain an optimal way to partition some W-states of multi-qubit systems into two subsystems, such that the entanglement between them achieves maximum value.
Development of statistical analysis code for meteorological data (W-View)
Energy Technology Data Exchange (ETDEWEB)
Tachibana, Haruo; Sekita, Tsutomu; Yamaguchi, Takenori [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment
2003-03-01
A computer code (W-View: Weather View) was developed to analyze the meteorological data statistically based on 'the guideline of meteorological statistics for the safety analysis of nuclear power reactor' (Nuclear Safety Commission on January 28, 1982; revised on March 29, 2001). The code gives statistical meteorological data to assess the public dose in case of normal operation and severe accident to get the license of nuclear reactor operation. This code was revised from the original code used in a large office computer code to enable a personal computer user to analyze the meteorological data simply and conveniently and to make the statistical data tables and figures of meteorology. (author)
Benchmark of Subchannel Code VIPRE-W with PSBT Void and Temperature Test Data
Directory of Open Access Journals (Sweden)
Y. Sung
2012-01-01
Full Text Available This paper summarizes comparisons of VIPRE-W thermal-hydraulic subchannel code predictions with measurements of fluid temperature and void from pressurized water reactor subchannel and bundle tests. Using an existing turbulent mixing model, the empirical coefficient derived from code predictions in comparison to the fluid temperature measurement is similar to those from previous mixing tests of similar bundle configurations. The predicted steady-state axial void distributions and time-dependent void profiles based on the Lellouche and Zolotar model generally agree well with the test data. The void model tends to predict lower void at the upper elevation under bulk boiling. The void predictions are in closer agreement with the measurements from the power increase, temperature increase, and flow reduction transients than the depressurization transient. Additional model sensitivity studies showed no significant improvement in the code predictions as compared to the published test data.
Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus
Directory of Open Access Journals (Sweden)
Anne Hillebrand
2012-10-01
Full Text Available Quantum entanglement is a key resource in many quantum protocols, such as quantum teleportation and quantum cryptography. Yet entanglement makes protocols presented in Dirac notation difficult to verify. This is why Coecke and Duncan have introduced a diagrammatic language for quantum protocols, called the ZX-calculus. This diagrammatic notation is both intuitive and formally rigorous. It is a simple, graphical, high level language that emphasises the composition of systems and naturally captures the essentials of quantum mechanics. In the author's MSc thesis it has been shown for over 25 quantum protocols that the ZX-calculus provides a relatively easy and more intuitive presentation. Moreover, the author embarked on the task to apply categorical quantum mechanics on quantum security; earlier works did not touch anything but Bennett and Brassard's quantum key distribution protocol, BB84. Superdense coding with the Greenberger-Horne-Zeilinger state and quantum key distribution with the W-state are presented in the ZX-calculus in this paper.
Le, Minh Hung; Liyana-Pathirana, Ranjith
2003-06-01
The unequal error protection (UEP) codes with wavelet-based algorithm for video compression over wide-band code division multiple access (W-CDMA), additive white Gaussian noise (AWGN) and Rayleigh fading channels are analysed. The utilization of Wavelets has come out to be a powerful method for compress video sequence. The wavelet transform compression technique has shown to be more appropriate to high quality video applications, producing better quality output for the compressed frames of video. A spatially scalable video coding framework of MPEG2 in which motion correspondences between successive video frames are exploited in the wavelet transform domain. The basic motivation for our coder is that motion fields are typically smooth that can be efficiently captured through a multiresolutional framework. Wavelet decomposition is applied to video frames and the coefficients at each level are predicted from the coarser level through backward motion compensation. The proposed algorithms of the embedded zero-tree wavelet (EZW) coder and the 2-D wavelet packet transform (2-D WPT) are investigated.
Yang, L G; Sung, J Y; Chow, C W; Yeh, C H; Cheng, K T; Shi, J W; Pan, C L
2014-10-20
We demonstrate experimentally Manchester (MC) coding based W-band (75 - 110 GHz) radio-over-fiber (ROF) system to reduce the low-frequency-components (LFCs) signal distortion generated by two independent low-cost lasers using spectral shaping. Hence, a low-cost and higher performance W-band ROF system is achieved. In this system, direct-beating of two independent low-cost CW lasers without frequency tracking circuit (FTC) is used to generate the millimeter-wave. Approaches, such as delayed self-heterodyne interferometer and heterodyne beating are performed to characterize the optical-beating-interference sub-terahertz signal (OBIS). Furthermore, W-band ROF systems using MC coding and NRZ-OOK are compared and discussed.
Carrión, M; Gómez, M J; Merchante-Schubert, R; Dongarrá, S; Ayala, J A
1999-01-01
Three new open reading frames, mraZ, mraW and mraR (also called ftsL), were revealed by DNA sequencing immediately upstream of gene pbpB in the dcw cluster of Escherichia coli. We have found that mraW and mraZ are active genes, coding for two proteins with relative molecular masses of 34 800 and 17 300, respectively. MraW is a cytoplasmic protein that under overproduction condition is also loosely bound to the membrane. Soluble MraW was purified up to 90% by a single high performance electrophoresis (HPEC) step from an extract of an overproducing strain. The protein exhibits a S-adenosyl-dependent methyltransferase activity on membrane-located substrates.
Energy Technology Data Exchange (ETDEWEB)
Ferreira, A. J.; Israelsson, C.; Jimenez, G.
2013-07-01
The type SGTR accident is a case of loss of coolant accident small features which make it necessary to differentiate and evolution of classical studies LOCA sequence type. To simulate this type of accident has chosen the MELCOR code, which aims to study the progression of severe accidents in LWR plants. It has been developed by Sandia National Laboratories for the United States Nuclear Regulatory Commission.
Energy Technology Data Exchange (ETDEWEB)
Ferreira, A. J.; Jimenez Varas, G.; Israelsson, L. C.
2014-04-01
Steam Generator tube Rupture (SGTR) is a small break loss of coolant accident. the issues related to this kind of transients makes them different from the classics LOCA studies. SGTR accidents in Pressurized Water Reactor are known to be one of the most demanding transients for the operating crew. It this accident is not managed in a proper way it could lead to steam generator overfill and a severe accident inside containment . To simulate this accident the MELCOR code was chosen, whose aim is the assessment of the progression of severe accidents in Light Water Reactors. (Author)
Test results of a 40 kW Stirling engine and comparison with the NASA-Lewis computer code predictions
Allen, D.; Cairelli, J.
1985-01-01
A Stirling engine was tested without auxiliaries at NASA-Lewis. Three different regenerator configurations were tested with hydrogen. The test objectives were (1) to obtain steady-state and dynamic engine data, including indicated power, for validation of an existing computer model for this engine; and (2) to evaluate structurally the use of silicon carbide regenerators. This paper presents comparisons of the measured brake performance, indicated mean effective pressure, and cyclic pressure variations with those predicted by the code. The measured data tended to be lower than the computer code predictions. The silicon carbide foam regenerators appear to be structurally suitable, but the foam matrix tested severely reduced performance.
Energy Technology Data Exchange (ETDEWEB)
Kačegavičius, Tomas, E-mail: Tomas.Kacegavicius@lei.lt; Povilaitis, Mantas, E-mail: Mantas.Povilaitis@lei.lt
2015-12-15
Highlights: • The analysis of loss-of-coolant accident (LOCA) in W7-X facility. • Burst disc is sufficient to prevent pressure inside the plasma vessel exceeding 110 kPa. • Developed model of the cooling system adequately represents the expected phenomena. - Abstract: Fusion is the energy production technology, which could potentially solve problems with growing energy demand of population in the future. Wendelstein 7-X (W7-X) is an experimental facility of stellarator type, which is currently being built at the Max-Planck-Institute for Plasmaphysics located in Greifswald, Germany. W7-X shall demonstrate that in future the energy could be produced in such type of fusion reactors. The safety analysis is required before the operation of the facility could be started. A rupture of 40 mm diameter pipe, which is connected to the divertor unit (module for plasma cooling) to ensure heat removal from the vacuum vessel in case of no-plasma operation mode “baking” is one of the design basis accidents to be investigated. During “baking” mode the vacuum vessel structures and working fluid – water are heated to the temperature 160 °C. This accident was selected for the detailed analysis using integral code ASTEC, which is developed by IRSN (France) and GRS mbH (Germany). This paper presents the integral analysis of W7-X response to a selected accident scenario. The model of the main cooling circuit and “baking” circuit was developed for ASTEC code. There were analysed two cases: (1) rupture of a pipe connected to the upper divertor unit and (2) rupture of a pipe connected to the lower divertor unit. The results of analysis showed that in both cases the water is almost completely released from the units into the plasma vessel. In both cases the pressure in the plasma vessel rapidly increases and in 28 s the set point for burst disc opening is reached preventing further pressurisation.
National Oceanic and Atmospheric Administration, Department of Commerce — Taxonomic Code, temperature, and other data were collected using net casts and other instruments in the North Atlantic Ocean from G.W. PIERCE. Data were collected...
Test results of a 40-kW Stirling engine and comparison with the NASA Lewis computer code predictions
Allen, David J.; Cairelli, James E.
1988-01-01
A Stirling engine was tested without auxiliaries at Nasa-Lewis. Three different regenerator configurations were tested with hydrogen. The test objectives were: (1) to obtain steady-state and dynamic engine data, including indicated power, for validation of an existing computer model for this engine; and (2) to evaluate structurally the use of silicon carbide regenerators. This paper presents comparisons of the measured brake performance, indicated mean effective pressure, and cyclic pressure variations from those predicted by the code. The silicon carbide foam generators appear to be structurally suitable, but the foam matrix showed severely reduced performance.
Energy Technology Data Exchange (ETDEWEB)
Bocanegra, R.; Jimenez, G.
2013-07-01
The objective of this project will be a model of containment PWR-W with the GOTHIC code that allows analyzing the behavior detailed after a design basis accident or a severe accident. Unlike the models normally used in codes of this type, the analysis will take place using a three-dimensional model of the containment, being this much more accurate.
Ymr315w protein levels have been shown to increase in cells grown on xylose. The mRNA level for the YMR315W gene was also seen to increase in cells grown on xylose, indicating an important function for YMR315W during growth on xylose. YMR315W encodes for a highly conserved protein of unknown funct...
Energy Technology Data Exchange (ETDEWEB)
Perianez Alvarez, V.
2013-07-01
The main objective of the work is the simulation of a severe accident, type LOCA with the GOTHIC-code, calculations of pressure and temperature in the containment levels, as well as the three-dimensional distribution of the inventory within the containment.
Performance Evaluation of Wavelet-Coded OFDM on a 4.9 Gbps W-Band Radio-over-Fiber Link
DEFF Research Database (Denmark)
Cavalcante, Lucas Costa Pereira; Rommel, Simon; Dinis, Rui
2017-01-01
Future generation mobile communications running on mm-wave frequencies will require great robustness against frequency selective channels. In this work we evaluate the transmission performance of 4.9 Gbps Wavelet-Coded OFDM signals on a 10 km fiber plus 58 m wireless Radio-over-Fiber link using a...
Wai, J. C.; Blom, G.; Yoshihara, H.; Chaussee, D.
1986-01-01
The NASA/Ames parabolized Navier/Stokes computer code was used to calculate the turbulent flow over the wing/fuselage for a generic fighter at M = 2.2. 18 deg angle-of-attack, and 0 and 5 deg yaw. Good test/theory agreement was achieved in the zero yaw case. No test data were available for the yaw case.
DEFF Research Database (Denmark)
Cavalcante, Lucas Costa Pereira; Silveira, Luiz F. Q.; Rommel, Simon
2016-01-01
Millimeter wave communications based on photonic technologies have gained increased attention to provide optic fiber-like capacity in wireless environments. However, the new hybrid fiber-wireless channel represents new challenges in terms of signal transmission performance analysis. Traditionally......, such systems use diversity schemes in combination with digital signal processing (DSP) techniques to overcome effects such as fading and inter-symbol interference (ISI). Wavelet Channel Coding (WCC) has emerged as a technique to minimize the fading effects of wireless channels, which is a mayor challenge...... in systems operating in the millimeter wave regime. This work takes the WCC one step beyond by performance evaluation in terms of bit error probability, over time-varying, frequency-selective multipath Rayleigh fading channels. The adopted propagation model follows the COST207 norm, the main international...
Mikellides, Ioannis G.; Katz, Ira; Kamhawi, Hani; Vannoord, Jonathan L.
2011-01-01
This paper reports on numerical simulations of the NASA-300M, a 20-kW class Hall thruster developed at the NASA Glenn Research Center (GRC). The numerical simulations have been performed with a 2-D axisymmetric, magnetic field-aligned-mesh (MFAM) plasma solver developed at the Jet Propulsion Laboratory (JPL). The main objective of the collaborative effort is to combine physics-based simulation, plasma diagnostics and recent findings on erosion physics to design and demonstrate a high-power, high-performance Hall thruster that exceeds the life of state-of-the-art Hall thrusters by more than one order of magnitude. The thruster simulations have been carried out at a discharge voltage of 500 V and discharge current of 40 A. The results indicate that although the impact energy of ions may attain values that are comparable to the discharge voltage along the downstream portions of the channel, a withdrawn ionization region and significant ion focusing combine to sustain erosion rates below 1 mm/kh. A more extensive evaluation of the baseline NASA-300M configuration and re-design of this thruster with magnetically shielded walls constitute the main focus of our work in the coming months.
Bachoc, Christine; Cohen, Gerard; Sole, Patrick; Tchamkerten, Aslan
2010-01-01
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters.
Merging W W and W W + jet with M inlo
Hamilton, Keith; Melia, Tom; Monni, Pier Francesco; Re, Emanuele; Zanderighi, Giulia
2016-09-01
We present a simulation program for the production of a pair of W bosons in association with a jet, that can be used in conjunction with general-purpose shower Monte Carlo generators, according to the Powheg method. We have further adapted and implemented the M inlo ' method on top of the NLO calculation underlying our W + W - + jet generator. Thus, the resulting simulation achieves NLO accuracy not only for inclusive distributions in W + W - + jet production but also W + W - production, i.e. when the associated jet is not resolved, without the introduction of any unphysical merging scale. This work represents the first extension of the M inlo ' method, in its original form, to the case of a genuine underlying 2 → 2 process, with non-trivial virtual corrections.
Coding for Correlated Sources with Unknown Parameters.
1980-05-01
A 1 (pl) is used, and hence a coding technique which gives o mal performance is easily obtained. This is not the case with the F ’ian- Wolf problem...consider conditional distributions wl, w2, w3 defined by wl( OjO ) w1 (0O0) = w2 (lll) = .5, w1 (l) = w2 (0l0) = 1, and Wa3(UIV ) [ Wl (UIV ) +w 2(ujvl
Directory of Open Access Journals (Sweden)
Fabio Burderi
2007-05-01
Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.
Properties of Codes in the Johnson Scheme
Silberstein, Natalia
2010-01-01
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect codes over finite fields are known, in the Johnson metric it was conjectured by Delsarte in 1970's that there are no nontrivial perfect codes. The general nonexistence proof still remains the open problem. In this work we examine constant weight codes as well as doubly constant weight codes, and reduce the range of parameters in which perfect codes may exist in both cases. We start with the constant weight codes. We introduce an improvement of Roos' bound for one-perfect codes, and present some new divisibility conditions, which are based on the connection between perfect codes in Johnson graph J(n,w) and block designs. Next, we consider binomial moments for perfect codes. We show which parameters can be excluded for one-perfect codes. We examine two-perfect codes in J(2w,w) a...
2010-03-04
... Internal Revenue Service Proposed Collection; Comment Request for Forms W-2, W-2c, W-2AS, W-2GU, W-2VI, W-3, W-3c, W-3cPR, W-3PR, and W-3SS AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and... comments concerning Forms W-2, W-2c, W-2AS, W-2GU, W-2VI, W-3,......
Latorre, Jose I
2015-01-01
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical properties of the boundary determine those of the bulk. This H-code is made of an even superposition of states whose relative Hamming distances are exponentially large with the size of the boundary. This property makes H-codes natural states for a quantum memory. H-codes exist on tori of definite sizes and get classified in three different sectors characterized by the sum of their qutrits on cycles wrapped through the boundaries of the system. We construct a parent Hamiltonian for the H-code which is highly non local and finally we compute the topological entanglement entropy of the H-code.
Kubilius, Jonas
2014-01-01
Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF). GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
Energy Technology Data Exchange (ETDEWEB)
2017-02-17
STOMP is a numerical simulator, developed by PNNL, for solving problems involving multi-fluid coupled flow and reactive transport in geologic media. The code has been under development at PNNL for more than twenty-five years. This release of STOMP will allow users to directly access the software, and will be limited to selected operational modes. The initial release will include STOMP-W. Additional operational modes will be released depending on market trends and user needs.The STOMP simulator has been available to parties outside of PNNL via license agreements. A new trend in projects supported by the U.S. government is that software be available as open source. This release of the STOMP software will meet that need. The initial target operational mode, STOMP-W, is one that solves isothermal problems involving variably saturated geologic systems with nonreactive solutes and reactive species. The capabilities of this simulator are often applied to environmental stewardship and restoration problems, such as those at the Hanford Site.
DEFF Research Database (Denmark)
Cox, Geoff
Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and software...
2014-12-01
QPSK Gaussian channels . .......................................................................... 39 vi 1. INTRODUCTION Forward error correction (FEC...Capacity of BSC. 7 Figure 5. Capacity of AWGN channel . 8 4. INTRODUCTION TO POLAR CODES Polar codes were introduced by E. Arikan in [1]. This paper...Under authority of C. A. Wilgenbusch, Head ISR Division EXECUTIVE SUMMARY This report describes the results of the project “More reliable wireless
New Codes for Spectral Amplitude Coding Optical CDMA Systems
Directory of Open Access Journals (Sweden)
Hassan Yousif Ahmed
2011-03-01
Full Text Available A new code structure with zero in-phase cross correlation for spectral amplitude coding optical code division multiple access (SAC-OCDMA system is proposed, and called zero vectors combinatorial (ZVC. This code is constructed in a simple algebraic way using Euclidean vectors and combinatorial theories based on the relationship between the number of users N and the weight W. One of the important properties of this code is that the maximum cross correlation (CC is always zero, which means that multi-user interference (MUI and phase induced intensity noise (PIIN are reduced. Bit error rate (BER performance is compared with previous reported codes. Therefore, theoretically, we demonstrate the performance of ZVC code with the related equations. In addition, the structure of the encoder/decoder based on fiber Bragg gratings (FBGs and the proposed system have been analyzed theoretically by taking into consideration the effects of some noises. The results characterizing BER with respect to the total number of active users show that ZVC code offers a significantly improved performance over previous reported codes by supporting large numbers of users at BER≥ 10-9. A comprehensive simulation study has been carried out using a commercial optical system simulator “VPI™”. Moreover, it was shown that the proposed code managed to reduce the hardware complexity and eventually the cost.
W-O+W-A的GNS算法%GNS Algorithm for W-O+W-A
Institute of Scientific and Technical Information of China (English)
牛春平; 任哲平; 韩菊
2009-01-01
针对电路板线或和线与(W-O+W-A)共存的互连故障诊断问题,提出了针对W-O+W-A的GNS算法.该算法采用组同时具备W-O和W-A对角独立性移位序列、网络同时具备W-O和W-A对角独立性移位序列和转移网络同时具备W-O和W-A对角独立性移位序列组成W-O+W-A的GNS序列,重点对其故障诊断能力进行了讨论,并进行了算法的性能验证.
The w-Socles of w-Modules%w-模的w-底座
Institute of Scientific and Technical Information of China (English)
张俊; 王芳贵
2013-01-01
引入了w-模的w-底座的概念,举例说明了w-底座与底座是不同的2个概念.借助w-底座,证明了设M是w-模,M是w-Artin模当且仅当若A是M的非零GV-无挠的商模,则w-soc(Aw)≠0且w-soc(Aw)是有限个w-单模的直和.
Energy Technology Data Exchange (ETDEWEB)
Ravishankar, C., Hughes Network Systems, Germantown, MD
1998-05-08
Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the
Study on cipher propertys of constant weight codes
Institute of Scientific and Technical Information of China (English)
Lin Bogang
2006-01-01
Constant weight code is an important error-correcting control code in communications. Basic structure of constant weight codes for some arriving at Johnson bound, A(n, 2u, w), is presented. Some correlative propertys of the codes, the solution of arriving at Johnson bound, and the results on the couple constant code and some constant weight codes are discussed. The conclusion is verified through four examples.
DEFF Research Database (Denmark)
Cox, Geoff
; alternatives to mainstream development, from performances of the live-coding scene to the organizational forms of commons-based peer production; the democratic promise of social media and their paradoxical role in suppressing political expression; and the market’s emptying out of possibilities for free...... development, Speaking Code unfolds an argument to undermine the distinctions between criticism and practice, and to emphasize the aesthetic and political aspects of software studies. Not reducible to its functional aspects, program code mirrors the instability inherent in the relationship of speech...... expression in the public realm. The book’s line of argument defends language against its invasion by economics, arguing that speech continues to underscore the human condition, however paradoxical this may seem in an era of pervasive computing....
Bouwknegt, P G
1995-01-01
W-symmetry is an extension of conformal symmetry in two dimensions. Since its introduction in 1985, W-symmetry has become one of the central notions in the study of two-dimensional conformal field theory. The mathematical structures that underlie W-symmetry are so-called W-algebras, which are higher-spin extensions of the Virasoro algebra. This book contains a collection of papers on W-symmetry, covering the period from 1985 through 1993. Its main focus is the construction of W-algebras and their representation theory. A recurrent theme is the intimate connection between W-algebras and affine
Personage Column： W. －W. Hoepker
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
W.-W. Hoepker was born in July 1942 in Frankfurt/Main, Germany. He studied medicine and philosophy inHamburg and Heidelberg. In Mtinster/Westphalia he wasappointed to a professorship at the Institute of Pathologyin Heidelberg; Since 1987 he has been the Head of theInstitute of Pathology at Barmbek General Hospital, Ham-burg.
Energy Technology Data Exchange (ETDEWEB)
Delbecq, J.M
1999-07-01
The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)
Optimal codes as Tanner codes with cyclic component codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pinero, Fernando; Zeng, Peng
2014-01-01
In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe...... the codes succinctly using Gröbner bases....
$W^+ W^-$ + Jet: Compact Analytic Results
Energy Technology Data Exchange (ETDEWEB)
Campbell, John [Fermilab; Miller, David [Glasgow U.; Robens, Tania [Dresden, Tech. U.
2016-01-14
In the second run of the LHC, which started in April 2015, an accurate understanding of Standard Model processes is more crucial than ever. Processes including electroweak gauge bosons serve as standard candles for SM measurements, and equally constitute important background for BSM searches. We here present the NLO QCD virtual contributions to W+W- + jet in an analytic format obtained through unitarity methods and show results for the full process using an implementation into the Monte Carlo event generator MCFM. Phenomenologically, we investigate total as well as differential cross sections for the LHC with 14 TeV center-of-mass energy, as well as a future 100 TeV proton-proton machine. In the format presented here, the one-loop virtual contributions also serve as important ingredients in the calculation of W+W- pair production at NNLO.
Fernández-Jambrina, L
2015-01-01
In this talk we would like to analyse the appearance of singularities in FLRW cosmological models which evolve close to w=-1, where w is the barotropic index of the universe. We relate small terms in cosmological time around w=-1 with the correspondent scale factor of the universe and check for the formation of singularities.
NOVEL BIPHASE CODE -INTEGRATED SIDELOBE SUPPRESSION CODE
Institute of Scientific and Technical Information of China (English)
Wang Feixue; Ou Gang; Zhuang Zhaowen
2004-01-01
A kind of novel binary phase code named sidelobe suppression code is proposed in this paper. It is defined to be the code whose corresponding optimal sidelobe suppression filter outputs the minimum sidelobes. It is shown that there do exist sidelobe suppression codes better than the conventional optimal codes-Barker codes. For example, the sidelobe suppression code of length 11 with filter of length 39 has better sidelobe level up to 17dB than that of Barker code with the same code length and filter length.
From concatenated codes to graph codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom
2004-01-01
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...
Jażdżewska, Iwona; Urbański, Jacek
2013-01-01
Artykuł prezentuje podejście świata nauki do roli, jaką odgrywa GIS w jej ramach. Przedstawia dyskusję, jaka miała miejsce w 1993 r. w ramach debaty GIS-L, jej najważniejsze wnioski zaprezentowane w pracy D.J. Wrighta, M.F. Goodchilda i J.D. Proctora (1997), a także przyszłość Systemów Informacji Geograficznej widzianą oczami M. Goodchilda (2010). Na tle tych rozważań autorzy przedstawili własne doś- wiadczenia związane z GIS w polskiej nauce oraz podejście do GIS jako nauki. ...
Rola leptyny w regulacji metabolizmu lipidów i węglowodanów
Directory of Open Access Journals (Sweden)
Patrycja Gogga*
2011-01-01
Full Text Available Leptyna jest białkiem wydzielanym głównie przez tkankę tłuszczową, a jej stężenie we krwi jest ściśle związane z ilością zapasów energetycznych zgromadzonych w adipocytach. Jako hormon leptyna ma niezwykle szeroki zakres działania. Białko to bezpośrednio lub za pośrednictwem układu współczulnego bierze udział w regulacji metabolizmu energetycznego. Leptyna hamuje biosyntezę triacylogliceroli w wątrobie i tkance tłuszczowej, a także w mięśniach szkieletowych, obniżając tym samym ilość odkładanych w nich lipidów. W adipocytach leptyna zmniejsza ekspresję genów kodujących syntazę kwasów tłuszczowych (FAS i karboksylazę acetylo-CoA (ACC – główne enzymy szlaku biosyntezy kwasów tłuszczowych. Zwiększa z kolei ekspresję genu kodującego lipazę zależną od hormonów (HSL, co stymuluje hydrolizę triacylogliceroli w tkance tłuszczowej. Ponadto leptyna wzmaga utlenianie kwasów tłuszczowych w adipocytach, mięśniach szkieletowych oraz w mięśniu sercowym, wywołując wzrost ekspresji genów kodujących podstawowe dla tego procesu enzymy, palmitoilotransferazę karnitynową 1 (CPT1 i dehydrogenazę acylo-CoA o średniej długości łańcucha (MCAD. Wykazano również, że hormon ten zwiększa wrażliwość tkanek na insulinę i poprawia tolerancję glukozy – pod wpływem leptyny wzrasta transport glukozy do komórek oraz intensywność glikolizy.Wiadomo, że leptyna bierze udział w długoterminowej regulacji pobierania pokarmu, jednak coraz więcej badań wskazuje, że ma ona również wpływ na przemiany substratów energetycznych w tkankach obwodowych. Leptyna może zatem kontrolować homeostaz�� energetyczną organizmu wywołując zmiany metabolizmu lipidów i węglowodanów, przede wszystkim w tkance tłuszczowej i w mięśniach.
Good Codes From Generalised Algebraic Geometry Codes
Jibril, Mubarak; Ahmed, Mohammed Zaki; Tjhai, Cen
2010-01-01
Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the best known codes of the same length and rate. The construction method uses places of small degree with a technique originally published over 10 years ago for the construction of generalised algebraic geometry codes.
Evaluation of help model replacement codes
Energy Technology Data Exchange (ETDEWEB)
Whiteside, Tad [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL); Hang, Thong [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL); Flach, Gregory [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL)
2009-07-01
This work evaluates the computer codes that are proposed to be used to predict percolation of water through the closure-cap and into the waste containment zone at the Department of Energy closure sites. This work compares the currently used water-balance code (HELP) with newly developed computer codes that use unsaturated flow (Richards’ equation). It provides a literature review of the HELP model and the proposed codes, which result in two recommended codes for further evaluation: HYDRUS-2D3D and VADOSE/W. This further evaluation involved performing actual simulations on a simple model and comparing the results of those simulations to those obtained with the HELP code and the field data. From the results of this work, we conclude that the new codes perform nearly the same, although moving forward, we recommend HYDRUS-2D3D.
Uwagi teoretyczne na temat zmiany kodu w monologach starowierców mieszkających w Polsce
Directory of Open Access Journals (Sweden)
Michał Głuszkowski
2015-12-01
Full Text Available Theoretical remarks on code-switching in monologues of the Old Believers living in Poland The Old Believers living in Poland are a bilingual community. Although they managed to maintain their religion, culture and language through ages, their language situation as well as the structure of the dialect have been undergoing severe changes. In spite of Polish loan translations and borrowings present in the Russian dialect, the Old Believers tend to switch the code between sentences and inside of them. The article is an approach to find an appropriate theoretical approach to characterize the phenomenon of code switching and code mixing in monologues, i.e. these cases of switching which are caused neither by the change of interlocutor nor by the change of communicative situation. Uwagi teoretyczne na temat zmiany kodu w monologach starowierców mieszkających w Polsce Mieszkający w Polsce staroobrzędowcy są społecznością dwujęzyczną. Choć na przestrzeni kilku stuleci udało im się zachować swoją religię, kulturę i język, ich sytuacja językowa oraz struktura dialektu wciąż podlegają poważnym zmianom. Oprócz zapożyczeń i kalk z języka polskiego przejawem tych zmian jest tendencja do przełączania kodów pomiędzy zdaniami i wewnątrz nich. Artykuł stanowi próbę znalezienia podejścia teoretycznego, które byłoby odpowiednie do opisu zjawisk przełączania i mieszania kodów w monologach, czyli tych przypadków zmiany języka wypowiedzi, które nie są spowodowane zmianą rozmówcy ani sytuacji komunikacyjnej.
Bergshoeff, E.; Roo, M. de
1993-01-01
We quantize the classical gauge theory of N = 2 wâˆž supergravity and show how the underlying N = 2 super-wâˆž algebra gets deformed into an N = 2 super-Wâˆž algebra. Both algebras contain the N = 2 super-Virasoro algebra as a subalgebra. We discuss how one can extract from these results information
Space Time Codes from Permutation Codes
Henkel, Oliver
2006-01-01
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.
Fundamentals of convolutional coding
Johannesson, Rolf
2015-01-01
Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field * Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding * Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes * Distance properties of convolutional codes * Includes a downloadable solutions manual
Strong Trinucleotide Circular Codes
Directory of Open Access Journals (Sweden)
Christian J. Michel
2011-01-01
Full Text Available Recently, we identified a hierarchy relation between trinucleotide comma-free codes and trinucleotide circular codes (see our previous works. Here, we extend our hierarchy with two new classes of codes, called DLD and LDL codes, which are stronger than the comma-free codes. We also prove that no circular code with 20 trinucleotides is a DLD code and that a circular code with 20 trinucleotides is comma-free if and only if it is a LDL code. Finally, we point out the possible role of the symmetric group ∑4 in the mathematical study of trinucleotide circular codes.
W. W. "Mo" Cleland: a catalytic life.
Dunaway-Mariano, Debra; Holden, Hazel M; Raushel, Frank M
2013-12-23
Professor W. Wallace Cleland, the architect of modern steady-state enzyme kinetics, died on March 6, 2013, from injuries sustained in a fall outside of his home. He will be most remembered for giving the enzyme community Ping-Pong kinetics and the invention of dithiothreitol (DTT). He pioneered the utilization of heavy atom isotope effects for the elucidation of the chemical mechanisms of enzyme-catalyzed reactions. His favorite research journal was Biochemistry, in which he published more than 135 papers beginning in 1964 with the disclosure of DTT.
W-320 Project thermal modeling
Energy Technology Data Exchange (ETDEWEB)
Sathyanarayana, K., Fluor Daniel Hanford
1997-03-18
This report summarizes the results of thermal analysis performed to provide a technical basis in support of Project W-320 to retrieve by sluicing the sludge in Tank 241-C-106 and to transfer into Tank 241-AY-102. Prior theraml evaluations in support of Project W-320 safety analysis assumed the availability of 2000 to 3000 CFM, as provided by Tank Farm Operations, for tank floor cooling channels from the secondary ventilation system. As this flow availability has no technical basis, a detailed Tank 241-AY-102 secondary ventilation and floor coating channel flow model was developed and analysis was performed. The results of the analysis show that only about 150 cfm flow is in floor cooLing channels. Tank 241-AY-102 thermal evaluation was performed to determine the necessary cooling flow for floor cooling channels using W-030 primary ventilation system for different quantities of Tank 241-C-106 sludge transfer into Tank 241-AY-102. These sludge transfers meet different options for the project along with minimum required modification of the ventilation system. Also the results of analysis for the amount of sludge transfer using the current system is presented. The effect of sludge fluffing factor, heat generation rate and its distribution between supernatant and sludge in Tank 241-AY-102 on the amount of sludge transfer from Tank 241-C-106 were evaluated and the results are discussed. Also transient thermal analysis was performed to estimate the time to reach the steady state. For a 2 feet sludge transfer, about 3 months time will be requirad to reach steady state. Therefore, for the purpose of process control, a detailed transient thermal analysis using GOTH Computer Code will be required to determine transient response of the sludge in Tank 241-AY-102. Process control considerations are also discussed to eliminate the potential for a steam bump during retrieval and storage in Tanks 241-C-106 and 241-AY-102 respectively.
29 CFR Appendix A to Subpart W to... - Figures W-14 through W-28
2010-07-01
... 29 Labor 8 2010-07-01 2010-07-01 false Figures W-14 through W-28 A Appendix A to Subpart W to part 1926 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION...; Overhead Protection Pt. 1926, Subpt. W, App. A Appendix A to Subpart W to part 1926—Figures W-14 through...
Joint source channel coding using arithmetic codes
Bi, Dongsheng
2009-01-01
Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code. The number of states used can be reduced and techniques used fo
New Mexico Univ., Albuquerque. American Indian Law Center.
The Model Children's Code was developed to provide a legally correct model code that American Indian tribes can use to enact children's codes that fulfill their legal, cultural and economic needs. Code sections cover the court system, jurisdiction, juvenile offender procedures, minor-in-need-of-care, and termination. Almost every Code section is…
2401-W Waste storage building closure plan
Energy Technology Data Exchange (ETDEWEB)
LUKE, S.M.
1999-07-15
This plan describes the performance standards met and closure activities conducted to achieve clean closure of the 2401-W Waste Storage Building (2401-W) (Figure I). In August 1998, after the last waste container was removed from 2401-W, the U.S. Department of Energy, Richland Operations Office (DOE-RL) notified Washington State Department of Ecology (Ecology) in writing that the 2401-W would no longer receive waste and would be closed as a Resource Conservation and Recovery Act (RCRA) of 1976 treatment, storage, and/or disposal (TSD) unit (98-EAP-475). Pursuant to this notification, closure activities were conducted, as described in this plan, in accordance with Washington Administrative Code (WAC) 173-303-610 and completed on February 9, 1999. Ecology witnessed the closure activities. Consistent with clean closure, no postclosure activities will be necessary. Because 2401-W is a portion of the Central Waste Complex (CWC), these closure activities become the basis for removing this building from the CWC TSD unit boundary. The 2401-W is a pre-engineered steel building with a sealed concrete floor and a 15.2-centimeter concrete curb around the perimeter of the floor. This building operated from April 1988 until August 1998 storing non-liquid containerized mixed waste. All waste storage occurred indoors. No potential existed for 2401-W operations to have impacted soil. A review of operating records and interviews with cognizant operations personnel indicated that no waste spills occurred in this building (Appendix A). After all waste containers were removed, a radiation survey of the 2401-W floor for radiological release of the building was performed December 17, 1998, which identified no radiological contamination (Appendix B).
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip
2012-01-01
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....
Andari, Nansi; The ATLAS collaboration
2017-01-01
A first measurement of the W-boson mass at the LHC is presented based on about 4.6 fb^-1 of proton–proton collision data recorded in 2011 at a centre-of-mass energy of 7 TeV with the ATLAS detector. The measured value is 80370±19 MeV, consistent with the Standard Model prediction, with the combined values measured at the LEP and Tevatron colliders, and with the world average. The ATLAS result equals in precision the previous best measurement of the W mass, performed by the CDF collaboration. The CMS results for the W-like measurement of the Z boson mass using dimuon events are also shown. An overview of the analyses is shown with a special emphasis on the evaluation of the experimental systematic uncertainties, as well as on the uncertainties due to the modelling of the vector boson production and decay.
Abraham, Nikhil
2015-01-01
Hands-on exercises help you learn to code like a pro No coding experience is required for Coding For Dummies,your one-stop guide to building a foundation of knowledge inwriting computer code for web, application, and softwaredevelopment. It doesn't matter if you've dabbled in coding or neverwritten a line of code, this book guides you through the basics.Using foundational web development languages like HTML, CSS, andJavaScript, it explains in plain English how coding works and whyit's needed. Online exercises developed by Codecademy, a leading online codetraining site, help hone coding skill
Gao, Wen
2015-01-01
This comprehensive and accessible text/reference presents an overview of the state of the art in video coding technology. Specifically, the book introduces the tools of the AVS2 standard, describing how AVS2 can help to achieve a significant improvement in coding efficiency for future video networks and applications by incorporating smarter coding tools such as scene video coding. Topics and features: introduces the basic concepts in video coding, and presents a short history of video coding technology and standards; reviews the coding framework, main coding tools, and syntax structure of AV
Energy Technology Data Exchange (ETDEWEB)
2017-09-27
Demeter-W, an open-access software written in Python, consists of extensible module packages. It is developed with statistical downscaling algorithms, to spatially and temporally downscale water demand data into finer scale. The spatial resolution will be downscaled from region/basin scale to grid (0.5 geographic degree) scale and the temporal resolution will be downscaled from year to month. For better understanding of the driving forces and patterns for global water withdrawal, the researchers is able to utilize Demeter-W to reconstruct the data sets to examine the issues related to water withdrawals at fine spatial and temporal scales.
Gonzalez-Sanchez, Jon
2010-01-01
Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\\{w (g_1,...,g_n)^{\\pm 1} | g_i \\in G, 1\\leq i\\leq n \\}$ of all $w$-values in $G$. We say that a (finite) group $G$ is $w$-maximal if $|G:w(G)|> |H:w(H)|$ for all proper subgroups $H$ of $G$ and that $G$ is hereditarily $w$-maximal if every subgroup of $G$ is $w$-maximal. In this text we study $w$-maximal and hereditarily $w$-maximal (finite) groups.
2013-10-24
... Internal Revenue Service Proposed Collection; Comment Request for Forms W-8BEN, W-8BEN-E, W-8ECI, W-8EXP, and W-8IMY AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and request for comments... Form W-8BEN, Certificate of Foreign Status of Beneficial Owner for United States Tax Withholding,...
76 FR 36618 - Proposed Collection; Comment Request for Form W-2G
2011-06-22
... Internal Revenue Service Proposed Collection; Comment Request for Form W-2G AGENCY: Internal Revenue...(c)(2)(A)). Currently, the IRS is soliciting comments concerning Form W-2G, Certain Gambling Winnings... Winnings. OMB Number: 1545-0238. Form Number: Form W-2G. Abstract: Internal Revenue Code sections...
DEFF Research Database (Denmark)
Jakobsen, Kaj Bjarne
1999-01-01
Specifications, Direct Sequence, Frequency Hopping, Hybrid, W-CDMA, and Power Amplifier Linearisation.......Specifications, Direct Sequence, Frequency Hopping, Hybrid, W-CDMA, and Power Amplifier Linearisation....
Verified OS Interface Code Synthesis
2016-12-01
5c. PROGRAM ELEMENT NUMBER 61102F 6. AUTHOR(S) Gerwin Klein, Toby Murray 5d. PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING...llisapi.dll Verified OS Interface Code Synthesis Final Report for AFOSR AOARD Grant FA2386-14-1-4093 Gerwin Klein, Ramana Kumar, Toby Murray gerwin.klein... Murray t +61 2 8306 0550 e gerwin.klein@data61.csiro.au w trustworthy.systems DISTRIBUTION A. Approved for public release: distribution unlimited.
Code Component Composition Reuse Is a New Programming Paradigm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
After describing the characteristics of programming paradigm,this pap er introduces the approach of code component composition reuse in detail, propos es and discusses viewpoint that code component composition reuse is a kind of ne w programming paradigm. This paper also specifies the characteristics of this ne w programming paradigm in detail, and points out some issues that must be resolv ed for using this new programming paradigm.
Spanning QTAIM topology phase diagrams of water isomers W4, W5 and W6.
Jenkins, Samantha; Restrepo, Albeiro; David, Jorge; Yin, Dulin; Kirk, Steven R
2011-06-28
Structural and chemical properties of the small water clusters W(4), W(5) and W(6) are investigated with the theory of atoms and molecules (QTAIM). For the W(4), W(5) and W(6) clusters, nine, fourteen and twenty-seven conformers, respectively, have been analyzed. For the W(4), W(5) and W(6) clusters one, two and three of these structures, respectively, have not been reported before. We then proceed to extend the W(4), W(5) and W(6) water cluster topology space using QTAIM; the Poincaré-Hopf topological sum rules are applied to create rules to identify the spanning set of conformer topologies, this includes finding three, ten and eight new distinct topologies that satisfy the Poincaré-Hopf relation for W(4), W(5) and W(6) respectively. The topological stability of degenerate solutions to the Poincaré-Hopf relation is compared by evaluating the proximity to rupturing of critical points of the gradient vector field of the charge density. We introduce a QTAIM topology space to replace the inconsistent use of Euclidean geometry to determine whether a cluster is 1-, 2- or 3-D. We show from the topology of the charge density that the conformers of the W(4), W(5) clusters are more energetically stable in less compact, planar forms, conversely the conformers of W(6) are more energetically stable with compact 3-D topologies. Quantifying the degree of covalent character in the hydrogen bonding for the W(4), W(5) and W(6) clusters independently verifies this finding. Differences in simple rules for the number of hydrogen bonds obeying the Bernal-Fowler ice rules between W(4), W(5) and W(6) reflect the transition from 2-D to 3-D structures being more energetically stable. In addition, we identify a new class of O-O bonding interactions that are up to 48% longer than the inter-nuclear separation and appear to be failed hydrogen bonds.
Locally Orderless Registration Code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Locally orderless registration code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark
2012-01-01
A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…
Institute of Scientific and Technical Information of China (English)
2008-01-01
Quantum error correcting codes are indispensable for quantum information processing and quantum computation.In 1995 and 1996,Shor and Steane gave first several examples of quantum codes from classical error correcting codes.The construction of efficient quantum codes is now an active multi-discipline research field.In this paper we review the known several constructions of quantum codes and present some examples.
Analysis of Discourse Accent and Discursive Practices I&W
2010-09-01
release; distribution in unlimited. 88ABW-2010-6005, 10 Nov 10 Code Choice • Language/ dialect choice (switching between Spanish and English ...AFRL-RH-WP-TR-2010-0128 ANALYSIS OF DISCOURSE ACCENT AND DISCURSIVE PRACTICES I&W Pamela Toman Larry Kuznar Tessa Baker April Hartman...Discourse Accent and Discursive Practices I&W 5a. CONTRACT NUMBER FA8650-07-C-6837 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 63231F 6. AUTHOR
1996-01-01
This track is an example of real data collected from the DELPHI detector on the Large Electron-Positron (LEP) collider at CERN, which ran between 1989 and 2000. These are the first pair of W particles produced at LEP2, the high energy upgrade of LEP that took place in 1996. Both Ws decay into a quark-antiquark pair, which are each seen as one of the four jets of hadrons in the detector.
W-jet Tagging: Optimizing the Identification of Boosted Hadronically-Decaying W Bosons
Cui, Yanou; Schwartz, Matthew D
2010-01-01
A method is proposed for distinguishing highly boosted hadronically decaying W's (W-jets) from QCD-jets using jet substructure. Previous methods, such as the filtering/mass-drop method, can give a factor of ~2 improvement in S/sqrt(B) for jet pT > 200 GeV. In contrast, a multivariate approach including new discriminants such as R-cores, which characterize the shape of the W-jet, subjet planar flow, and grooming-sensitivities is shown to provide a much larger factor of ~5 improvement in S/sqrt(B). For longitudinally polarized W's, such as those coming from many new physics models, the discrimination is even better. Comparing different Monte Carlo simulations, we observe a sensitivity of some variables to the underlying event; however, even with a conservative estimates, the multivariate approach is very powerful. Applications to semileptonic WW resonance searches and all-hadronic W+jet searches at the LHC are also discussed. Code implementing our W-jet tagging algorithm is publicly available at http://jets.phy...
Kształcenie brokerów informacji w Polsce / Education information brokers in Poland
Directory of Open Access Journals (Sweden)
Karolina Kustra
2013-07-01
Full Text Available We współczesnym świecie, w dobie Internetu, to informacja jest najważniejsza, ale żeby ocenić czy jest wiarygodna potrzebni są specjaliści – brokerzy informacji. W Polsce ten zawód jest jeszcze młody, a jego przedstawiciele nie mając własnego stowarzyszenia, stosują się do zasad kodeksu etyki infobrokerskiej stworzonego przez Association of Independent Information Professionals. Oferta kształcenia infobrokerów w Polsce jest coraz szersza i przyszli brokerzy informacji mogą się przygotowywać do zawodu na studiach I i II stopnia, studiach podyplomowych oraz na szkoleniach i kursach. English abstractIn the modern world, the age of the Internet, the information is important, but to assess whether there is credible experts are needed – information brokers. In Poland, the profession is still young, and it’s representatives don’t have their own associations, follow the rules of the Code of Ethical Business Practiced created by the Association of Independent Information Professionals. Offer infobrokerów education in Poland is getting wider and future information brokers can prepare for the profession at the undergraduate and secondary education, post-graduate studies and training courses.
Turbo Codes Extended with Outer BCH Code
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
1996-01-01
The "error floor" observed in several simulations with the turbo codes is verified by calculation of an upper bound to the bit error rate for the ensemble of all interleavers. Also an easy way to calculate the weight enumerator used in this bound is presented. An extended coding scheme is proposed...
Hybrid Noncoherent Network Coding
Skachek, Vitaly; Nedic, Angelia
2011-01-01
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the network and when the min-cut of the networks is much smaller then the length of the transmitted codewords, the new family of codes outperforms their subspace code counterparts. For the proposed coding scheme, termed hybrid network coding, we derive two upper bounds on the size of the codes. These bounds represent a variation of the Singleton and of the sphere-packing bound. We show that a simple concatenated scheme that represents a combination of subspace codes and Reed-Solomon codes is asymptotically optimal with respect to the Singleton bound. Finally, we describe two efficient decoding algorithms for concatenated subspace codes that in certain cases have smaller complexity than subspace decoder...
Simulating W Impurity Transport in Tokamaks
Younkin, Timothy R.; Green, David L.; Lasa, Ane; Canik, John M.; Wirth, Brian D.
2016-10-01
The extreme heat and charged particle flux to plasma facing materials in magnetically confined fusion devices has motivated Tungsten experiments such as the ``W-Ring'' experiment on the DIII-D tokamak to investigate W divertor viability. In this domain, the transport of W impurities from their tile locations to other first-wall tiles is highly relevant to material lifetimes and tokamak operation. Here we present initial results from a simulation of this W transport. Given that sputtered impurities may experience prompt redeposition near the divertor strikepoint, or migrate far from its origin to the midplane, there is a need to track the global, 3-D, impurity redistribution. This is done by directly integrating the 6-D Lorentz equation of motion (plus thermal gradient terms and relevant Monte-Carlo operators) for the impurity ions and neutrals under background plasma parameters determined by the SOLPS edge plasma code. The geometric details of the plasma facing components are represented to a fidelity sufficient to examine the global impurity migration trends with initial work also presented on advanced surface meshing capabilities targeting high fidelity simulation. This work is supported by U.S. DOE Office of Science SciDAC project on plasma-surface interactions under US DOE contract DE-AC05-00OR22725.
Network coding for computing: Linear codes
Appuswamy, Rathinakumar; Karamchandani, Nikhil; Zeger, Kenneth
2011-01-01
In network coding it is known that linear codes are sufficient to achieve the coding capacity in multicast networks and that they are not sufficient in general to achieve the coding capacity in non-multicast networks. In network computing, Rai, Dey, and Shenvi have recently shown that linear codes are not sufficient in general for solvability of multi-receiver networks with scalar linear target functions. We study single receiver networks where the receiver node demands a target function of the source messages. We show that linear codes may provide a computing capacity advantage over routing only when the receiver demands a `linearly-reducible' target function. % Many known target functions including the arithmetic sum, minimum, and maximum are not linearly-reducible. Thus, the use of non-linear codes is essential in order to obtain a computing capacity advantage over routing if the receiver demands a target function that is not linearly-reducible. We also show that if a target function is linearly-reducible,...
Practices in Code Discoverability
Teuben, Peter; Nemiroff, Robert J; Shamir, Lior
2012-01-01
Much of scientific progress now hinges on the reliability, falsifiability and reproducibility of computer source codes. Astrophysics in particular is a discipline that today leads other sciences in making useful scientific components freely available online, including data, abstracts, preprints, and fully published papers, yet even today many astrophysics source codes remain hidden from public view. We review the importance and history of source codes in astrophysics and previous efforts to develop ways in which information about astrophysics codes can be shared. We also discuss why some scientist coders resist sharing or publishing their codes, the reasons for and importance of overcoming this resistance, and alert the community to a reworking of one of the first attempts for sharing codes, the Astrophysics Source Code Library (ASCL). We discuss the implementation of the ASCL in an accompanying poster paper. We suggest that code could be given a similar level of referencing as data gets in repositories such ...
Djordjevic, Ivan; Vasic, Bane
2010-01-01
This unique book provides a coherent and comprehensive introduction to the fundamentals of optical communications, signal processing and coding for optical channels. It is the first to integrate the fundamentals of coding theory and optical communication.
QUANTIZATION DEFORMS W-INFINITY TO W-INFINITY GRAVITY
BERGSHOEFF, E; HOWE, PS; POPE, CN; SEZGIN, E; SHEN, [No Value; STELLE, KS
1991-01-01
Quantising a classical theory of w infinity gravity requires the introduction of an infinite number of counterterms in order to remove matter-dependent anomalies. We show that these counterterms correspond precisely to a renormalisation of the classical w infinity currents to quantum W(x) currents.
Zhang, Linfan; Zheng, Shuang
2015-01-01
Quick Response code opens possibility to convey data in a unique way yet insufficient prevention and protection might lead into QR code being exploited on behalf of attackers. This thesis starts by presenting a general introduction of background and stating two problems regarding QR code security, which followed by a comprehensive research on both QR code itself and related issues. From the research a solution taking advantages of cloud and cryptography together with an implementation come af...
A. van Deursen (Arie); L.M.F. Moonen (Leon); A. van den Bergh; G. Kok
2001-01-01
textabstractTwo key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from
Bergstra, Jan A
2010-01-01
General definitions as well as rules of reasoning regarding control code production, distribution, deployment, and usage are described. The role of testing, trust, confidence and risk analysis is considered. A rationale for control code testing is sought and found for the case of safety critical embedded control code.
DEFF Research Database (Denmark)
Bombin Palomo, Hector
2015-01-01
Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a generalized, subsystem version of color codes. In 3D they allow...
Deursen, A. van; Moonen, L.M.F.; Bergh, A. van den; Kok, G.
2001-01-01
Two key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from refactoring product
ARC Code TI: CODE Software Framework
National Aeronautics and Space Administration — CODE is a software framework for control and observation in distributed environments. The basic functionality of the framework allows a user to observe a distributed...
ARC Code TI: ROC Curve Code Augmentation
National Aeronautics and Space Administration — ROC (Receiver Operating Characteristic) curve Code Augmentation was written by Rodney Martin and John Stutz at NASA Ames Research Center and is a modification of ROC...
Fountain Codes: LT And Raptor Codes Implementation
Directory of Open Access Journals (Sweden)
Ali Bazzi, Hiba Harb
2017-01-01
Full Text Available Digital fountain codes are a new class of random error correcting codes designed for efficient and reliable data delivery over erasure channels such as internet. These codes were developed to provide robustness against erasures in a way that resembles a fountain of water. A digital fountain is rateless in a way that sender can send limitless number of encoded packets. The receiver doesn’t care which packets are received or lost as long as the receiver gets enough packets to recover original data. In this paper, the design of the fountain codes is explored with its implementation of the encoding and decoding algorithm so that the performance in terms of encoding/decoding symbols, reception overhead, data length, and failure probability is studied.
Welding Development W87 Baseline
Energy Technology Data Exchange (ETDEWEB)
A. Newman; G. Gibbs; G. K. Hicken
1998-11-01
This report covers the development activities used to qualify the Gas Tungsten Arc (FTA) girth weld and the resistance stem attachments on the W87 Base Line (W87BL). Design of experiments was used throughout the development activities.
Universal Rateless Codes From Coupled LT Codes
Aref, Vahid
2011-01-01
It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performance of spatially coupled low-density generator-matrix ensembles when used for transmission over binary-input memoryless output-symmetric channels. We show by means of density evolution that the threshold saturation phenomenon also takes place in this setting. Our motivation for studying low-density generator-matrix codes is that they can easily be converted into rateless codes. Although there are already several classes of excellent rateless codes known to date, rateless codes constructed via spatial coupling might offer some additional advantages. In particular, by the very nature of the threshold phenomenon one expects that codes constructed on this principle can be made to be universal, i.e., a single construction can uniformly approach capacity over the cl...
Software Certification - Coding, Code, and Coders
Havelund, Klaus; Holzmann, Gerard J.
2011-01-01
We describe a certification approach for software development that has been adopted at our organization. JPL develops robotic spacecraft for the exploration of the solar system. The flight software that controls these spacecraft is considered to be mission critical. We argue that the goal of a software certification process cannot be the development of "perfect" software, i.e., software that can be formally proven to be correct under all imaginable and unimaginable circumstances. More realistically, the goal is to guarantee a software development process that is conducted by knowledgeable engineers, who follow generally accepted procedures to control known risks, while meeting agreed upon standards of workmanship. We target three specific issues that must be addressed in such a certification procedure: the coding process, the code that is developed, and the skills of the coders. The coding process is driven by standards (e.g., a coding standard) and tools. The code is mechanically checked against the standard with the help of state-of-the-art static source code analyzers. The coders, finally, are certified in on-site training courses that include formal exams.
Ekspansja muzeów w Europie Środkowej?
Directory of Open Access Journals (Sweden)
Jagodzińska, Katarzyna
2015-06-01
Full Text Available Przedmiotem artykułu są rozważania na temat specyfiki Europy Środkowej w zakresie kolekcji i muzeów sztuki współczesnej oraz możliwość stworzenia alternatywy regionalnej dla krajów zachodnich. Kontekstem dla tych rozważań jest ekspansjonistyczna polityka współczesnych muzeów, która w związku z licznymi nowymi inwestycjami – w szczególności Luwru, Fundacji Guggenheima, Ermitażu – budzi w świecie muzeologicznym różnorakie dylematy. Autorka omawia światowe "marki muzealne" inwestujące w Europie Środkowej, zastanawia się nad skutkami ekspansji tych "koncernów" dla kultury w regionie, wskazuje też na potencjał regionu, który można wykorzystać bez posiłkowania się nazwiskami światowych kolekcjonerów.
Rice, R. F.; Lee, J. J.
1986-01-01
Scheme for coding facsimile messages promises to reduce data transmission requirements to one-tenth current level. Coding scheme paves way for true electronic mail in which handwritten, typed, or printed messages or diagrams sent virtually instantaneously - between buildings or between continents. Scheme, called Universal System for Efficient Electronic Mail (USEEM), uses unsupervised character recognition and adaptive noiseless coding of text. Image quality of resulting delivered messages improved over messages transmitted by conventional coding. Coding scheme compatible with direct-entry electronic mail as well as facsimile reproduction. Text transmitted in this scheme automatically translated to word-processor form.
Schopper,H
1981-01-01
Le DG H.Schopper fait une introduction pour la commémoration et cérémonie de la vie et du travail du Prof.Wolfgang Gentner. W. Gentner, physicien allemand, né en 1906 à Francfort et mort en septembre 1980 à Heidelberg, était directeur au Cern de 1955 à 1960, président du "scientific policy commitee" de 1968 à 1971 et président du Conseil du Cern de 1972 à 1974. Il était un des fondateurs du Cern et 4 personnes qui l'ont bien connu lui rendent hommage, entre autres un de ses élèves, ainsi que Mme ?, J.B.Adams et O.Sheffard(?)
Energy Technology Data Exchange (ETDEWEB)
2017-02-17
STOMP is a numerical simulator, developed by PNNL, for solving problems involving multifluid coupled flow and reactive transport in geologic media. The code has been under development at PNNL for more than twentyfive years. This release of STOMP will allow users to directly access the software, and will be limited to selected operational modes. The initial release will include STOMPW. Additional operational modes will be released depending on market trends and user needs.The STOMP simulator has been available to parties outside of PNNL via license agreements. A new trend in projects supported by the U.S. government is that software be available as open source. This release of the STOMP software will meet that need. The initial target operational mode, STOMPW, is one that solves isothermal problems involving variably saturated geologic systems with nonreactive solutes and reactive species. The capabilities of this simulator are often applied to environmental stewardship and restoration problems, such as those at the Hanford Site.
Institute of Scientific and Technical Information of China (English)
邱晓理
2001-01-01
@@ 病毒特征 病毒信息: 病毒名称:CodeRedll; 英文名:W32/CodeRed c.worm 别名:红色代码二 病毒的运行方式(驻留否):是 病毒类型(黑客,蠕虫…):内存型一 发现日期:08/04/2001 病毒详细资料: 1.病毒依赖的系统:WinNT/2000(安装且运行了IIS服务程序和Indexing Service服务).
Low Rank Sparse Coding for Image Classification
2013-12-08
Singapore 4 Institute of Automation, Chinese Academy of Sciences, P. R. China 5 University of Illinois at Urbana-Champaign, Urbana, IL USA Abstract In this...coding [36]. 1. Introduction The bag-of-words (BoW) model is one of the most pop - ular models for feature design. It has been successfully applied to...defense of softassignment coding. In ICCV, 2011. [26] S. Liu, J. Feng, Z. Song , T. Zhang, H. Lu, C. Xu, and S. Yan. Hi, magic closet, tell me what to
Lim, Sung Hoon; Gamal, Abbas El; Chung, Sae-Young
2010-01-01
A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme involves message repetition coding, relay signal compression, and simultaneous decoding. Unlike previous compress--forward schemes, where independent messages are sent over multiple blocks, the same message is sent multiple times using independent codebooks as in the network coding scheme for cyclic networks. Furthermore, the relays do not use Wyner--Ziv binning as in previous compress-forward sch...
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2009-01-01
Property testing was initially studied from various motivations in 1990's.A code C (∩)GF(r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector's coordinates.The problem of testing codes was firstly studied by Blum,Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs).How to characterize locally testable codes is a complex and challenge problem.The local tests have been studied for Reed-Solomon (RS),Reed-Muller (RM),cyclic,dual of BCH and the trace subcode of algebraicgeometric codes.In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions).We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Institute of Scientific and Technical Information of China (English)
ZHANG Aili; LIU Xiufeng
2006-01-01
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory.The new type of linear codes take the congruence class in the congruence class ring R/I1 ∩ I2 ∩…∩ In for the information bit,embed R/Ji into R/I1 ∩ I2 ∩…∩ In,and assign the cosets of R/Ji as the subring of R/I1 ∩ I2 ∩…∩ In and the cosets of R/Ji in R/I1 ∩ I2 ∩…∩ In as check lines.Many code classes exist in the Chinese remainder codes that have high code rates.Chinese remainder codes are the essential generalization of Sun Zi codes.
Institute of Scientific and Technical Information of China (English)
张爱丽; 刘秀峰; 靳蕃
2004-01-01
Chinese Remainder Codes are constructed by applying weak block designs and Chinese Remainder Theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I1∩I2∩…∩In for the information bit, embed R/Ji into R/I1∩I2∩…∩In, and asssign the cosets of R/Ji as the subring of R/I1∩I2∩…∩In and the cosets of R/Ji in R/I1∩I2∩…∩In as check lines. There exist many code classes in Chinese Remainder Codes, which have high code rates. Chinese Remainder Codes are the essential generalization of Sun Zi Codes.
DEFF Research Database (Denmark)
Adelstein, Jennifer; Clegg, Stewart
2016-01-01
Ethical codes have been hailed as an explicit vehicle for achieving more sustainable and defensible organizational practice. Nonetheless, when legal compliance and corporate governance codes are conflated, codes can be used to define organizational interests ostentatiously by stipulating norms...... for employee ethics. Such codes have a largely cosmetic and insurance function, acting subtly and strategically to control organizational risk management and protection. In this paper, we conduct a genealogical discourse analysis of a representative code of ethics from an international corporation...... to understand how management frames expectations of compliance. Our contribution is to articulate the problems inherent in codes of ethics, and we make some recommendations to address these to benefit both an organization and its employees. In this way, we show how a code of ethics can provide a foundation...
Defeating the coding monsters.
Colt, Ross
2007-02-01
Accuracy in coding is rapidly becoming a required skill for military health care providers. Clinic staffing, equipment purchase decisions, and even reimbursement will soon be based on the coding data that we provide. Learning the complicated myriad of rules to code accurately can seem overwhelming. However, the majority of clinic visits in a typical outpatient clinic generally fall into two major evaluation and management codes, 99213 and 99214. If health care providers can learn the rules required to code a 99214 visit, then this will provide a 90% solution that can enable them to accurately code the majority of their clinic visits. This article demonstrates a step-by-step method to code a 99214 visit, by viewing each of the three requirements as a monster to be defeated.
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Property testing was initially studied from various motivations in 1990’s. A code C GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally testable codes is a complex and challenge problem. The local tests have been studied for Reed-Solomon (RS), Reed-Muller (RM), cyclic, dual of BCH and the trace subcode of algebraicgeometric codes. In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions). We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Serially Concatenated IRA Codes
Cheng, Taikun; Belzer, Benjamin J
2007-01-01
We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared to a 16384-bit rate 1/2 IRA code, but incurs an SNR penalty of about 2 dB at low to medium SNRs. Experiments indicate that the SNR penalty can be reduced at larger blocklengths.
Hull, C. M.
1993-01-01
The higher-spin geometries of $W_\\infty$-gravity and $W_N$-gravity are analysed and used to derive the complete non-linear structure of the coupling to matter and its symmetries. The symmetry group is a subgroup of the symplectic diffeomorphisms of the cotangent bundle of the world-sheet, and the $W_N$ geometry is obtained from a non-linear truncation of the $W_\\infty$ geometry. Quantum W-gravity is briefly discussed. (Talk given at {\\it Pathways to Fundamental Interactions}, the 16th John Ho...
Hull, C M
1993-01-01
The higher-spin geometries of $W_\\infty$-gravity and $W_N$-gravity are analysed and used to derive the complete non-linear structure of the coupling to matter and its symmetries. The symmetry group is a subgroup of the symplectic diffeomorphisms of the cotangent bundle of the world-sheet, and the $W_N$ geometry is obtained from a non-linear truncation of the $W_\\infty$ geometry. Quantum W-gravity is briefly discussed. (Talk given at {\\it Pathways to Fundamental Interactions}, the 16th John Hopkins Workshop on Current Problems in Particle Theory, Gothenborg, 1992.)
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
DEFF Research Database (Denmark)
Gál, Anna; Hansen, Kristoffer Arnsfelt; Koucký, Michal;
2011-01-01
We bound the minimum number w of wires needed to compute any (asymptotically good) error-correcting code C:01(n)01n with minimum distance (n), using unbounded fan-in circuits of depth d with arbitrary gates. Our main results are: (1) If d=2 then w=(n(lognloglogn)2) . (2) If d=3 then w=(nlglgn). (3...
User`s manual for SNL-SAND-II code
Energy Technology Data Exchange (ETDEWEB)
Griffin, P.J.; Kelly, J.G. [Sandia National Labs., Albuquerque, NM (United States); VanDenburg, J.W. [Science and Engineering Associates, Inc., Albuquerque, NM (United States)
1994-04-01
Sandia National Laboratories, in the process of characterizing the neutron environments at its reactor facilities, has developed an enhanced version of W. McElroy`s original SAND-II code. The enhanced input, output, and plotting interfaces make the code much easier to use. The basic physics and operation of the code remain unchanged. Important code enhancements include the interfaces to the latest ENDF/B-VI and IRDF-90 dosimetry-quality cross sections and the ability to use silicon displacement-sensitive devices as dosimetry sensors.
Evolutionary interaction between W/Y chromosome and transposable elements.
Śliwińska, Ewa B; Martyka, Rafał; Tryjanowski, Piotr
2016-06-01
The W/Y chromosome is unique among chromosomes as it does not recombine in its mature form. The main side effect of cessation of recombination is evolutionary instability and degeneration of the W/Y chromosome, or frequent W/Y chromosome turnovers. Another important feature of W/Y chromosome degeneration is transposable element (TEs) accumulation. Transposon accumulation has been confirmed for all W/Y chromosomes that have been sequenced so far. Models of W/Y chromosome instability include the assemblage of deleterious mutations in protein coding genes, but do not include the influence of transposable elements that are accumulated gradually in the non-recombining genome. The multiple roles of genomic TEs, and the interactions between retrotransposons and genome defense proteins are currently being studied intensively. Small RNAs originating from retrotransposon transcripts appear to be, in some cases, the only mediators of W/Y chromosome function. Based on the review of the most recent publications, we present knowledge on W/Y evolution in relation to retrotransposable element accumulation.
Mukai, Takahito; Lajoie, Marc J; Englert, Markus; Söll, Dieter
2017-09-08
The genetic code-the language used by cells to translate their genomes into proteins that perform many cellular functions-is highly conserved throughout natural life. Rewriting the genetic code could lead to new biological functions such as expanding protein chemistries with noncanonical amino acids (ncAAs) and genetically isolating synthetic organisms from natural organisms and viruses. It has long been possible to transiently produce proteins bearing ncAAs, but stabilizing an expanded genetic code for sustained function in vivo requires an integrated approach: creating recoded genomes and introducing new translation machinery that function together without compromising viability or clashing with endogenous pathways. In this review, we discuss design considerations and technologies for expanding the genetic code. The knowledge obtained by rewriting the genetic code will deepen our understanding of how genomes are designed and how the canonical genetic code evolved.
Yu, Jiun-Hung
2012-01-01
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithms, some of which are not quite standard even when specialized to Reed-Solomon codes.
改进的W-A、W-O+W-A自适应互连诊断算法%Modified W -A . W -O +W -A adaptive interconnect diagnosis algorithm
Institute of Scientific and Technical Information of China (English)
牛春平; 任哲平; 任锐; 杨月婷
2009-01-01
针对电路板线与(W-A)以及线或和线与(W-O+W-A)共存的互连故障诊断问题,提出了针对W-A和W-O+W-A的改进的边界扫描自适应互连诊断算法.借鉴改进的W-O自适应算法研究经验,由改进的W-A抗误判算法+移位"O"序列得到改进的w-A自适应算法;采用同时具备W-O和W-A对角独立性的测试序列得到W-O+W-A的改进的自适应算法.%To study the diagnostic problem of W-A and W-O+W-A interconnect fault of PCB (Printed Circuit Board),moclifiod boundary scan interconnect diagnosis algorithms for W-A and W-O+W-A are put forward.These algorithms take the research experience of modified W-O adaptive algorithm as example,apply modified W-A anti-aliasing algorithm and walking zero sequence,test sequence with both W-O and W-A diagonal independence,modified adaptive algorithms W-A and W-O+W-A are gained.
Generating code adapted for interlinking legacy scalar code and extended vector code
Gschwind, Michael K
2013-06-04
Mechanisms for intermixing code are provided. Source code is received for compilation using an extended Application Binary Interface (ABI) that extends a legacy ABI and uses a different register configuration than the legacy ABI. First compiled code is generated based on the source code, the first compiled code comprising code for accommodating the difference in register configurations used by the extended ABI and the legacy ABI. The first compiled code and second compiled code are intermixed to generate intermixed code, the second compiled code being compiled code that uses the legacy ABI. The intermixed code comprises at least one call instruction that is one of a call from the first compiled code to the second compiled code or a call from the second compiled code to the first compiled code. The code for accommodating the difference in register configurations is associated with the at least one call instruction.
Energy Technology Data Exchange (ETDEWEB)
Visser, B. [Stork Product Eng., Amsterdam (Netherlands)
1996-09-01
To support the discussion on aeroelastic codes, a description of the code FLEXLAST was given and experiences within benchmarks and measurement programmes were summarized. The code FLEXLAST has been developed since 1982 at Stork Product Engineering (SPE). Since 1992 FLEXLAST has been used by Dutch industries for wind turbine and rotor design. Based on the comparison with measurements, it can be concluded that the main shortcomings of wind turbine modelling lie in the field of aerodynamics, wind field and wake modelling. (au)
DEFF Research Database (Denmark)
Steensig, Jakob; Heinemann, Trine
2015-01-01
We welcome Tanya Stivers’s discussion (Stivers, 2015/this issue) of coding social interaction and find that her descriptions of the processes of coding open up important avenues for discussion, among other things of the precise ad hoc considerations that researchers need to bear in mind, both when....... Instead we propose that the promise of coding-based research lies in its ability to open up new qualitative questions....
Shapiro, Wilbur
1996-01-01
This is an overview of new and updated industrial codes for seal design and testing. GCYLT (gas cylindrical seals -- turbulent), SPIRALI (spiral-groove seals -- incompressible), KTK (knife to knife) Labyrinth Seal Code, and DYSEAL (dynamic seal analysis) are covered. CGYLT uses G-factors for Poiseuille and Couette turbulence coefficients. SPIRALI is updated to include turbulence and inertia, but maintains the narrow groove theory. KTK labyrinth seal code handles straight or stepped seals. And DYSEAL provides dynamics for the seal geometry.
National Aeronautics and Space Administration — ACCEPT consists of an overall software infrastructure framework and two main software components. The software infrastructure framework consists of code written to...
Waters, Joe
2012-01-01
Find out how to effectively create, use, and track QR codes QR (Quick Response) codes are popping up everywhere, and businesses are reaping the rewards. Get in on the action with the no-nonsense advice in this streamlined, portable guide. You'll find out how to get started, plan your strategy, and actually create the codes. Then you'll learn to link codes to mobile-friendly content, track your results, and develop ways to give your customers value that will keep them coming back. It's all presented in the straightforward style you've come to know and love, with a dash of humor thrown
Energy Technology Data Exchange (ETDEWEB)
Reid, R.L.; Barrett, R.J.; Brown, T.G.; Gorker, G.E.; Hooper, R.J.; Kalsi, S.S.; Metzler, D.H.; Peng, Y.K.M.; Roth, K.E.; Spampinato, P.T.
1985-03-01
The FEDC Tokamak Systems Code calculates tokamak performance, cost, and configuration as a function of plasma engineering parameters. This version of the code models experimental tokamaks. It does not currently consider tokamak configurations that generate electrical power or incorporate breeding blankets. The code has a modular (or subroutine) structure to allow independent modeling for each major tokamak component or system. A primary benefit of modularization is that a component module may be updated without disturbing the remainder of the systems code as long as the imput to or output from the module remains unchanged.
Energy Technology Data Exchange (ETDEWEB)
Cramer, S.N.
1984-01-01
The MORSE code is a large general-use multigroup Monte Carlo code system. Although no claims can be made regarding its superiority in either theoretical details or Monte Carlo techniques, MORSE has been, since its inception at ORNL in the late 1960s, the most widely used Monte Carlo radiation transport code. The principal reason for this popularity is that MORSE is relatively easy to use, independent of any installation or distribution center, and it can be easily customized to fit almost any specific need. Features of the MORSE code are described.
Kotwal, Ashutosh V.
2016-10-01
The measurement of the W boson mass has been growing in importance as its precision has improved, along with the precision of other electroweak observables and the top quark mass. Over the last decade, the measurement of the W boson mass has been led at hadron colliders. Combined with the precise measurement of the top quark mass at hadron colliders, the W boson mass helped to pin down the mass of the Standard Model Higgs boson through its induced radiative correction on the W boson mass. With the discovery of the Higgs boson and the measurement of its mass, the electroweak sector of the Standard Model is over-constrained. Increasing the precision of the W boson mass probes new physics at the TeV-scale. We summarize an extensive Tevatron (1984-2011) program to measure the W boson mass at the CDF and Dø experiments. We highlight the recent Tevatron measurements and prospects for the final Tevatron measurements.
Kotwal, Ashutosh V
2016-01-01
The measurement of the W boson mass has been growing in importance as its precision has improved, along with the precision of other electroweak observables and the top quark mass. Over the last decade, the measurement of the W boson mass has been led at hadron colliders. Combined with the precise measurement of the top quark mass at hadron colliders, the W boson mass helped to pin down the mass of the Standard Model Higgs boson through its induced radiative correction on the W boson mass. With the discovery of the Higgs boson and the measurement of its mass, the electroweak sector of the Standard Model is over-constrained. Increasing the precision of the W boson mass probes new physics at the TeV-scale. We summarize an extensive Tevatron (1984–2011) program to measure the W boson mass at the CDF and Dø experiments. We highlight the recent Tevatron measurements and prospects for the final Tevatron measurements.
Multiboson production in W' decays
Aguilar-Saavedra, J A
2015-01-01
In models with an extra $\\text{SU}(2)_R$ gauge group and an extended scalar sector, the cascade decays of the $W'$ boson can provide various multiboson signals. In particular, diboson decays $W' \\to WZ$ can be suppressed while $W' \\to WZX$, with $X$ one of the scalars present in the model, can reach branching ratios around 4%. We discuss these multiboson signals focusing on possible interpretations of the ATLAS excess in fat jet pair production.
Proof-Carrying Code with Correct Compilers
Appel, Andrew W.
2009-01-01
In the late 1990s, proof-carrying code was able to produce machine-checkable safety proofs for machine-language programs even though (1) it was impractical to prove correctness properties of source programs and (2) it was impractical to prove correctness of compilers. But now it is practical to prove some correctness properties of source programs, and it is practical to prove correctness of optimizing compilers. We can produce more expressive proof-carrying code, that can guarantee correctness properties for machine code and not just safety. We will construct program logics for source languages, prove them sound w.r.t. the operational semantics of the input language for a proved-correct compiler, and then use these logics as a basis for proving the soundness of static analyses.
Scrap of gloveboxes No. 801-W and No. 802-W
Ohuchi, S; Kurosawa, M; Okane, S; Usui, T
2002-01-01
Both gloveboxes No. 801-W for measuring samples of uranium or plutonium and No. 802-W for analyzing the quantity of uranium or plutonium are established at twenty five years ago in the analyzing room No. 108 of Plutonium Fuel Research Facility. It was planned to scrap the gloveboxes and to establish new gloveboxes. This report describes the technical view of the scrapping works.
Research on universal combinatorial coding.
Lu, Jun; Zhang, Zhuo; Mo, Juan
2014-01-01
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics theory. The combinational and exhaustive property make it closely related with the existing code methods. Universal combinatorial coding does not depend on the probability statistic characteristic of information source, and it has the characteristics across three coding branches. It has analyzed the relationship between the universal combinatorial coding and the variety of coding method and has researched many applications technologies of this coding method. In addition, the efficiency of universal combinatorial coding is analyzed theoretically. The multicharacteristic and multiapplication of universal combinatorial coding are unique in the existing coding methods. Universal combinatorial coding has theoretical research and practical application value.
CP violating observables in e$^{-}$e$^{+}$ --> W$^{-}$W$^{+}$
Chang, D; Phillips, I
1993-01-01
We consider various integrated lepton charge-energy asymmetries and azimuthal asymmetries as tests of CP violation in the process $e^-e^+ \\to W^-W^+$. These asymmetries are sensitive to different linear combinations of the CP violating form factors in the three gauge boson $W^-W^+$ production vertex, and can distinguish dispersive and absorptive parts of the form factors. It makes use of purely hadronic and purely leptonic modes of $W$'s decays as well as the mixed modes. The techniques of using the kinematics of jets or missing momentum to construct CP--odd observables are also employed. These CP violating observables are illustrated in the generalized Left-Right Model and the Charged Higgs Model.
SC Secretariat
2005-01-01
Please note that the Safety Code A12 (Code A12) entitled "THE SAFETY COMMISSION (SC)" is available on the web at the following url: https://edms.cern.ch/document/479423/LAST_RELEASED Paper copies can also be obtained from the SC Unit Secretariat, e-mail: sc.secretariat@cern.ch SC Secretariat
Million, June
2004-01-01
In this article, the author discusses an e-mail survey of principals from across the country regarding whether or not their school had a formal staff dress code. The results indicate that most did not have a formal dress code, but agreed that professional dress for teachers was not only necessary, but showed respect for the school and had a…
Thieren, Michel; Mauron, Alex
2007-01-01
This month marks sixty years since the Nuremberg code – the basic text of modern medical ethics – was issued. The principles in this code were articulated in the context of the Nuremberg trials in 1947. We would like to use this anniversary to examine its ability to address the ethical challenges of our time.
Pseudonoise code tracking loop
Laflame, D. T. (Inventor)
1980-01-01
A delay-locked loop is presented for tracking a pseudonoise (PN) reference code in an incoming communication signal. The loop is less sensitive to gain imbalances, which can otherwise introduce timing errors in the PN reference code formed by the loop.
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
BIALEK, W; RIEKE, F; VANSTEVENINCK, RRD; WARLAND, D
1991-01-01
Traditional approaches to neural coding characterize the encoding of known stimuli in average neural responses. Organisms face nearly the opposite task - extracting information about an unknown time-dependent stimulus from short segments of a spike train. Here the neural code was characterized from
DEFF Research Database (Denmark)
Soon, Winnie
2014-01-01
, Twitter and Facebook). The focus is not to investigate the functionalities and efficiencies of the code, but to study and interpret the program level of code in order to trace the use of various technological methods such as third-party libraries and platforms’ interfaces. These are important...
BVR photometric study of NSVS 2607629. A high mass-ratio W-type W UMa system
Gürol, Birol; Michel, Raul
2017-02-01
We present the results of our investigation of the geometrical and physical parameters of the W UMa-type binary system NSVS 2607629 based on CCD BVRc light curves and their analysis with the Wilson-Devinney code. New times of minima and light elements have been determined. We find that, as seen in eccentric systems, secondary minima do not occur at phase 0.5. According to our solution, the system is found to be a high mass-ratio W-type W UMa system. Combining our photometric solution with the emprical relation obtained for W UMa type systems by Dimitrov and Kjurkchieva (2015) we derive the masses and radii of the components of this eclipsing system as M1 = 0.44M⊙ , M2 = 0.73M⊙ , R1 = 0.57R⊙ and R2 = 0.71R⊙ . The evolutionary state of the system is also discussed.
Resummation of Jet Veto Logarithms at N$^3$LL$_a$ + NNLO for $W^+ W^-$ production at the LHC
Dawson, S; Li, Ye; Ramani, H; Zeng, Mao
2016-01-01
We compute the resummed on-shell $W^+ W^-$ production cross section under a jet-veto at the LHC at the approximate N$^3$LL+NNLO order. Differential NNLO cross sections are obtained from an implementation of $q_T$ subtraction in Sherpa. The two-loop virtual corrections to the $q \\bar q \\rightarrow W^+ W^-$ amplitude, used in both fixed order and resummation predictions, are extracted from the public code qqvvamp. We perform resummation using soft collinear effective theory (SCET), with approximate beam functions where only the logarithmic terms are included at two-loop. In addition to scale uncertainties from the hard matching scale and the factorization scale, rapidity scale variations are obtained within the analytic regulator approach. Our resummation results show a decrease in jet-veto cross-section compared to NNLO fixed order predictions, with reduced scale uncertainties compared to NNLL+NLO resummation predictions.
Transformation invariant sparse coding
DEFF Research Database (Denmark)
Mørup, Morten; Schmidt, Mikkel Nørgaard
2011-01-01
Sparse coding is a well established principle for unsupervised learning. Traditionally, features are extracted in sparse coding in specific locations, however, often we would prefer invariant representation. This paper introduces a general transformation invariant sparse coding (TISC) model....... The model decomposes images into features invariant to location and general transformation by a set of specified operators as well as a sparse coding matrix indicating where and to what degree in the original image these features are present. The TISC model is in general overcomplete and we therefore invoke...... sparse coding to estimate its parameters. We demonstrate how the model can correctly identify components of non-trivial artificial as well as real image data. Thus, the model is capable of reducing feature redundancies in terms of pre-specified transformations improving the component identification....
1983-01-01
The specification of Software Implemented Fault Tolerance (SIFT) consists of two parts, the specifications of the SIFT models and the specifications of the SIFT PASCAL program which actually implements the SIFT system. The code specifications are the last of a hierarchy of models describing the operation of the SIFT system and are related to the SIFT models as well as the PASCAL program. These Specifications serve to link the SIFT models to the running program. The specifications are very large and detailed and closely follow the form and organization of the PASCAL code. In addition to describing each of the components of the SIFT code, the code specifications describe the assumptions of the upper SIFT models which are required to actually prove that the code will work as specified. These constraints are imposed primarily on the schedule tables.
DEFF Research Database (Denmark)
Andersen, Christian Ulrik
2007-01-01
discusses code as the artist’s material and, further, formulates a critique of Cramer. The seductive magic in computer-generated art does not lie in the magical expression, but nor does it lie in the code/material/text itself. It lies in the nature of code to do something – as if it was magic......Computer art is often associated with computer-generated expressions (digitally manipulated audio/images in music, video, stage design, media facades, etc.). In recent computer art, however, the code-text itself – not the generated output – has become the artwork (Perl Poetry, ASCII Art, obfuscated...... avant-garde’. In line with Cramer, the artists Alex McLean and Adrian Ward (aka Slub) declare: “art-oriented programming needs to acknowledge the conditions of its own making – its poesis.” By analysing the Live Coding performances of Slub (where they program computer music live), the presentation...
Combustion chamber analysis code
Przekwas, A. J.; Lai, Y. G.; Krishnan, A.; Avva, R. K.; Giridharan, M. G.
1993-05-01
A three-dimensional, time dependent, Favre averaged, finite volume Navier-Stokes code has been developed to model compressible and incompressible flows (with and without chemical reactions) in liquid rocket engines. The code has a non-staggered formulation with generalized body-fitted-coordinates (BFC) capability. Higher order differencing methodologies such as MUSCL and Osher-Chakravarthy schemes are available. Turbulent flows can be modeled using any of the five turbulent models present in the code. A two-phase, two-liquid, Lagrangian spray model has been incorporated into the code. Chemical equilibrium and finite rate reaction models are available to model chemically reacting flows. The discrete ordinate method is used to model effects of thermal radiation. The code has been validated extensively against benchmark experimental data and has been applied to model flows in several propulsion system components of the SSME and the STME.
Astrophysics Source Code Library
Allen, Alice; Berriman, Bruce; Hanisch, Robert J; Mink, Jessica; Teuben, Peter J
2012-01-01
The Astrophysics Source Code Library (ASCL), founded in 1999, is a free on-line registry for source codes of interest to astronomers and astrophysicists. The library is housed on the discussion forum for Astronomy Picture of the Day (APOD) and can be accessed at http://ascl.net. The ASCL has a comprehensive listing that covers a significant number of the astrophysics source codes used to generate results published in or submitted to refereed journals and continues to grow. The ASCL currently has entries for over 500 codes; its records are citable and are indexed by ADS. The editors of the ASCL and members of its Advisory Committee were on hand at a demonstration table in the ADASS poster room to present the ASCL, accept code submissions, show how the ASCL is starting to be used by the astrophysics community, and take questions on and suggestions for improving the resource.
CHARAKTERYSTYKA HELIOSTATÓW I ICH ZASTOSOWANIE W HELIOELEKTROWNIACH
Directory of Open Access Journals (Sweden)
Paweł WAJSS
Full Text Available Rozwój energetyki słonecznej związany jest z powstawaniem coraz to nowych konstrukcji maksymalizującej wykorzystanie promieniowania słonecznego. Jednym z kierunków jest wysokotemperaturowa konwersja promieniowania na ciepło. Wtedy, z termodynamicznego punktu widzenia otwierają się nam możliwości np. na generację energii elektrycznej. Konwersja wysokotemperaturowa wymaga jednak koncentracji promieniowania słonecznego. Sposobów koncentracji jest wiele, jednak w artykule skupiono się na koncentracji w układzie pole heliostatów- wieża słoneczna. System taki ma szereg zalet w porównaniu do pojedynczych układów koncentrujących, m.in. możliwe jest budowanie pojedynczej elektrowni. Zasadniczym elementem jest tutaj heliostat. Artykuł definiuje pojęcie heliostatu, przedstawia zasadę jego działania oraz przeznaczenie w helioelektrowniach typu wieżowego. Dokonany został podział urządzeń na podgrupy w zależności od technologii w nich zastosowanych. Zaprezentowane zostały poszczególne elementy budowy heliostatów oraz czynniki, które pośrednio lub bezpośrednio wpływają na ich typ, wielkość oraz cenę. Przedstawiono problematykę rentowności przed jaką stoi dziś rynek helioelektrowni oraz stopień istotności jaki stanowi pole heliostatów dla budżetu całej inwestycji. Wymieniono szczegółowe parametry jakie winny spełniać tego typu urządzenia, z wyodrębnieniem trzech grup: wymagania operacyjne, optyczne oraz wytrzymałościowe. Zaprezentowano szczegółowo trzy przykładowe, znacząco różniące co do zasady działania oraz skali, rozwiązania i sparametryzowano je w formie tabelarycznej.
Joint Design of Physical-Layer Network Coding and Channel Coding
Zhang, Shengli
2008-01-01
Physical-layer Network Coding (PNC) can significantly improve the throughput of wireless two way relay channel (TWRC) by allowing the two end nodes to transmit messages to the relay simultaneously. To achieve reliable communication, channel coding could be applied on top of PNC. This paper investigates link-by-link channel-coded PNC, in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes plus noise, Y3=X1+X2+W3, to the network-coded combination of the source packets, S1 XOR S2 . This is in distinct to the traditional multiple-access problem, in which the goal is to obtain S1 and S2 separately. The transformation from Y3 to (S1 XOR S2) is referred to as the Channel-decoding-Network-Coding process (CNC) in that it involves both channel decoding and network coding operations. A contribution of this paper is the insight that in designing CNC, we should first (i) channel-decode Y3 to the superimposed source symbols S1+S2 before (ii) transform...
Embedded foveation image coding.
Wang, Z; Bovik, A C
2001-01-01
The human visual system (HVS) is highly space-variant in sampling, coding, processing, and understanding. The spatial resolution of the HVS is highest around the point of fixation (foveation point) and decreases rapidly with increasing eccentricity. By taking advantage of this fact, it is possible to remove considerable high-frequency information redundancy from the peripheral regions and still reconstruct a perceptually good quality image. Great success has been obtained previously by a class of embedded wavelet image coding algorithms, such as the embedded zerotree wavelet (EZW) and the set partitioning in hierarchical trees (SPIHT) algorithms. Embedded wavelet coding not only provides very good compression performance, but also has the property that the bitstream can be truncated at any point and still be decoded to recreate a reasonably good quality image. In this paper, we propose an embedded foveation image coding (EFIC) algorithm, which orders the encoded bitstream to optimize foveated visual quality at arbitrary bit-rates. A foveation-based image quality metric, namely, foveated wavelet image quality index (FWQI), plays an important role in the EFIC system. We also developed a modified SPIHT algorithm to improve the coding efficiency. Experiments show that EFIC integrates foveation filtering with foveated image coding and demonstrates very good coding performance and scalability in terms of foveated image quality measurement.
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity in the net...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof.......Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...
Energy Technology Data Exchange (ETDEWEB)
Nelson, R.N. (ed.)
1985-05-01
This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.
Application of RS Codes in Decoding QR Code
Institute of Scientific and Technical Information of China (English)
Zhu Suxia(朱素霞); Ji Zhenzhou; Cao Zhiyan
2003-01-01
The QR Code is a 2-dimensional matrix code with high error correction capability. It employs RS codes to generate error correction codewords in encoding and recover errors and damages in decoding. This paper presents several QR Code's virtues, analyzes RS decoding algorithm and gives a software flow chart of decoding the QR Code with RS decoding algorithm.
Evaluation Codes from an Affine Veriety Code Perspective
DEFF Research Database (Denmark)
Geil, Hans Olav
2008-01-01
Evaluation codes (also called order domain codes) are traditionally introduced as generalized one-point geometric Goppa codes. In the present paper we will give a new point of view on evaluation codes by introducing them instead as particular nice examples of affine variety codes. Our study...
Distributed multiple description coding
Bai, Huihui; Zhao, Yao
2011-01-01
This book examines distributed video coding (DVC) and multiple description coding (MDC), two novel techniques designed to address the problems of conventional image and video compression coding. Covering all fundamental concepts and core technologies, the chapters can also be read as independent and self-sufficient, describing each methodology in sufficient detail to enable readers to repeat the corresponding experiments easily. Topics and features: provides a broad overview of DVC and MDC, from the basic principles to the latest research; covers sub-sampling based MDC, quantization based MDC,
2014-01-01
While cracking a code might seem like something few of us would encounter in our daily lives, it is actually far more prevalent than we may realize. Anyone who has had personal information taken because of a hacked email account can understand the need for cryptography and the importance of encryption-essentially the need to code information to keep it safe. This detailed volume examines the logic and science behind various ciphers, their real world uses, how codes can be broken, and the use of technology in this oft-overlooked field.
Li, Songze; Maddah-Ali, Mohammad Ali; Avestimehr, A. Salman
2015-01-01
MapReduce is a commonly used framework for executing data-intensive jobs on distributed server clusters. We introduce a variant implementation of MapReduce, namely "Coded MapReduce", to substantially reduce the inter-server communication load for the shuffling phase of MapReduce, and thus accelerating its execution. The proposed Coded MapReduce exploits the repetitive mapping of data blocks at different servers to create coding opportunities in the shuffling phase to exchange (key,value) pair...
Brehm, Enrico M
2016-01-01
In this work, we introduce classical holographic codes. These can be understood as concatenated probabilistic codes and can be represented as networks uniformly covering hyperbolic space. In particular, classical holographic codes can be interpreted as maps from bulk degrees of freedom to boundary degrees of freedom. Interestingly, they are shown to exhibit features similar to those expected from the AdS/CFT correspondence. Among these are a version of the Ryu-Takayanagi formula and intriguing properties regarding bulk reconstruction and boundary representations of bulk operations. We discuss the relation of our findings with expectations from AdS/CFT and, in particular, with recent results from quantum error correction.
75 FR 38179 - Proposed Collection; Comment Request for Forms W-8BEN, W-8ECI, W-8EXP, and W-8IMY
2010-07-01
... Internal Revenue Service Proposed Collection; Comment Request for Forms W-8BEN, W-8ECI, W- 8EXP, and W-8IMY... 104-13 (44 U.S.C. 3506(c)(2)(A)). Currently, the IRS is soliciting comments concerning Form W-8BEN, Certificate of Foreign Status of Beneficial Owner for United States Tax Withholding, Form W-8ECI,...
The CHEASE code for toroidal MHD equilibria
Energy Technology Data Exchange (ETDEWEB)
Luetjens, H. [Ecole Polytechnique, 91 - Palaiseau (France). Centre de Physique Theorique; Bondeson, A. [Chalmers Univ. of Technology, Goeteborg (Sweden). Inst. for Electromagnetic Field Theory and Plasma Physics; Sauter, O. [ITER-San Diego, La Jolla, CA (United States)
1996-03-01
CHEASE solves the Grad-Shafranov equation for the MHD equilibrium of a Tokamak-like plasma with pressure and current profiles specified by analytic forms or sets of data points. Equilibria marginally stable to ballooning modes or with a prescribed fraction of bootstrap current can be computed. The code provides a mapping to magnetic flux coordinates, suitable for MHD stability calculations or global wave propagation studies. The code computes equilibrium quantities for the stability codes ERATO, MARS, PEST, NOVA-W and XTOR and for the global wave propagation codes LION and PENN. The two-dimensional MHD equilibrium (Grad-Shafranov) equation is solved in variational form. The discretization uses bicubic Hermite finite elements with continuous first order derivates for the poloidal flux function {Psi}. The nonlinearity of the problem is handled by Picard iteration. The mapping to flux coordinates is carried out with a method which conserves the accuracy of the cubic finite elements. The code uses routines from the CRAY libsci.a program library. However, all these routines are included in the CHEASE package itself. If CHEASE computes equilibrium quantities for MARS with fast Fourier transforms, the NAG library is required. CHEASE is written in standard FORTRAN-77, except for the use of the input facility NAMELIST. CHEASE uses variable names with up to 8 characters, and therefore violates the ANSI standard. CHEASE transfers plot quantities through an external disk file to a plot program named PCHEASE using the UNIRAS or the NCAR plot package. (author) figs., tabs., 34 refs.
Energy Technology Data Exchange (ETDEWEB)
Freeman, L.N.; Wilson, R.E. [Oregon State Univ., Dept. of Mechanical Engineering, Corvallis, OR (United States)
1996-09-01
The FAST Code which is capable of determining structural loads on a flexible, teetering, horizontal axis wind turbine is described and comparisons of calculated loads with test data are given at two wind speeds for the ESI-80. The FAST Code models a two-bladed HAWT with degrees of freedom for blade bending, teeter, drive train flexibility, yaw, and windwise and crosswind tower motion. The code allows blade dimensions, stiffnesses, and weights to differ and models tower shadow, wind shear, and turbulence. Additionally, dynamic stall is included as are delta-3 and an underslung rotor. Load comparisons are made with ESI-80 test data in the form of power spectral density, rainflow counting, occurrence histograms, and azimuth averaged bin plots. It is concluded that agreement between the FAST Code and test results is good. (au)
Vermont Center for Geographic Information — (Link to Metadata) A ZIP Code Tabulation Area (ZCTA) is a statistical geographic entity that approximates the delivery area for a U.S. Postal Service five-digit...
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof....
National Research Council Canada - National Science Library
Leslie Hawthorn
2008-01-01
This article examines the Google Summer of Code (GSoC) program, the world's first global initiative to introduce College and University students to free/libre open source software (F/LOSS) development...
Directory of Open Access Journals (Sweden)
Reshmi Banerjee
2015-06-01
Full Text Available A building code, or building control, is a set of rules that specify the minimum standards for constructed objects such as buildings and non building structures. The main purpose of building codes are to protect public health, safety and general welfare as they relate to the construction and occupancy of buildings and structures. The building code becomes law of a particular jurisdiction when formally enacted by the appropriate governmental or private authority. Building codes are generally intended to be applied by architects, engineers, constructors and regulators but are also used for various purposes by safety inspectors, environmental scientists, real estate developers, subcontractors, manufacturers of building products and materials, insurance companies, facility managers, tenants and others.
Anderson, John B
2017-01-01
Bandwidth Efficient Coding addresses the major challenge in communication engineering today: how to communicate more bits of information in the same radio spectrum. Energy and bandwidth are needed to transmit bits, and bandwidth affects capacity the most. Methods have been developed that are ten times as energy efficient at a given bandwidth consumption as simple methods. These employ signals with very complex patterns and are called "coding" solutions. The book begins with classical theory before introducing new techniques that combine older methods of error correction coding and radio transmission in order to create narrowband methods that are as efficient in both spectrum and energy as nature allows. Other topics covered include modulation techniques such as CPM, coded QAM and pulse design.
DEFF Research Database (Denmark)
Paolini, Enrico; Stefanovic, Cedomir; Liva, Gianluigi
2015-01-01
, in which the structure of the access protocol can be mapped to a structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded......The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered...... as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access...
Code Disentanglement: Initial Plan
Energy Technology Data Exchange (ETDEWEB)
Wohlbier, John Greaton [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kelley, Timothy M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Rockefeller, Gabriel M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Calef, Matthew Thomas [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-27
The first step to making more ambitious changes in the EAP code base is to disentangle the code into a set of independent, levelized packages. We define a package as a collection of code, most often across a set of files, that provides a defined set of functionality; a package a) can be built and tested as an entity and b) fits within an overall levelization design. Each package contributes one or more libraries, or an application that uses the other libraries. A package set is levelized if the relationships between packages form a directed, acyclic graph and each package uses only packages at lower levels of the diagram (in Fortran this relationship is often describable by the use relationship between modules). Independent packages permit independent- and therefore parallel|development. The packages form separable units for the purposes of development and testing. This is a proven path for enabling finer-grained changes to a complex code.
Mahdaviani, Kaveh; Tellambura, Chintha
2011-01-01
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the needed overhead at the benchmark block length of 64,520 bits and with the same complexity per information bit.
Yang, Qianli; Pitkow, Xaq
2015-03-01
Most interesting natural sensory stimuli are encoded in the brain in a form that can only be decoded nonlinearly. But despite being a core function of the brain, nonlinear population codes are rarely studied and poorly understood. Interestingly, the few existing models of nonlinear codes are inconsistent with known architectural features of the brain. In particular, these codes have information content that scales with the size of the cortical population, even if that violates the data processing inequality by exceeding the amount of information entering the sensory system. Here we provide a valid theory of nonlinear population codes by generalizing recent work on information-limiting correlations in linear population codes. Although these generalized, nonlinear information-limiting correlations bound the performance of any decoder, they also make decoding more robust to suboptimal computation, allowing many suboptimal decoders to achieve nearly the same efficiency as an optimal decoder. Although these correlations are extremely difficult to measure directly, particularly for nonlinear codes, we provide a simple, practical test by which one can use choice-related activity in small populations of neurons to determine whether decoding is suboptimal or optimal and limited by correlated noise. We conclude by describing an example computation in the vestibular system where this theory applies. QY and XP was supported by a grant from the McNair foundation.
Barbarien, Joeri; Munteanu, Adrian; Verdicchio, Fabio; Andreopoulos, Yiannis; Cornelis, Jan P.; Schelkens, Peter
2004-11-01
Modern video coding applications require transmission of video data over variable-bandwidth channels to a variety of terminals with different screen resolutions and available computational power. Scalable video coding is needed to optimally support these applications. Recently proposed wavelet-based video codecs employing spatial domain motion compensated temporal filtering (SDMCTF) provide quality, resolution and frame-rate scalability while delivering compression performance comparable to that of the state-of-the-art non-scalable H.264-codec. These codecs require scalable coding of the motion vectors in order to support a large range of bit-rates with optimal compression efficiency. Scalable motion vector coding algorithms based on the integer wavelet transform followed by embedded coding of the wavelet coefficients were recently proposed. In this paper, a new and fundamentally different scalable motion vector codec (MVC) using median-based motion vector prediction is proposed. Extensive experimental results demonstrate that the proposed MVC systematically outperforms the wavelet-based state-of-the-art solutions. To be able to take advantage of the proposed scalable MVC, a rate allocation mechanism capable of optimally dividing the available rate among texture and motion information is required. Two rate allocation strategies are proposed and compared. The proposed MVC and rate allocation schemes are incorporated into an SDMCTF-based video codec and the benefits of scalable motion vector coding are experimentally demonstrated.
Wu, Yingquan
2008-01-01
The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix maintains the symbol-wise algebraic structure and thus keeps many important original characteristics. The second purpose of this paper is to identify a class of constant-weight cyclic codes. Specifically, we show that a well-known class of $q$-ary BCH codes excluding the all-zero codeword are constant-weight cyclic codes. Moreover, we show this class of codes achieve the Plotkin bound. The last purpose of the paper is to characterize expanded cyclic codes utilizing the proposed expanded generator matrix and parity check matrix. We analyze the properties of component codewords of a codeword and particularly establish the precise conditions under which a codeword can be represented by a subbasis. With the new insights, we present an improved lower bound on the minimum distance of...
Generation of W atomic states assisted by cavities
Energy Technology Data Exchange (ETDEWEB)
Becerra-Castro, E M; Cardoso, W B; Avelar, A T; Baseia, B [Instituto de Fisica, Universidade Federal de Goias, 74.001-970, Goiania (Brazil)], E-mail: wesleybcardoso@gmail.com
2008-11-14
We present an experimental scheme to generate a class of entangled atomic W states useful for perfect teleportation and superdense coding. It employs three two-level (Rydberg) atoms crossing two nonresonant cavities in such a way that the first and second (the second and third) atoms are entangled via atomic collision in the first (second) cavity. The experimental realization with current technology is discussed.
Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes
Mori, Ryuhei
2010-01-01
Polar codes, introduced by Arikan, achieve symmetric capacity of any discrete memoryless channels under low encoding and decoding complexity. Recently, non-binary polar codes have been investigated. In this paper, we calculate error probability of non-binary polar codes constructed on the basis of Reed-Solomon matrices by numerical simulations. It is confirmed that 4-ary polar codes have significantly better performance than binary polar codes on binary-input AWGN channel. We also discuss an interpretation of polar codes in terms of algebraic geometry codes, and further show that polar codes using Hermitian codes have asymptotically good performance.
Measurements of W Charge Asymmetry
Energy Technology Data Exchange (ETDEWEB)
Holzbauer, J. L. [Mississippi U.
2015-10-06
We discuss W boson and lepton charge asymmetry measurements from W decays in the electron channel, which were made using 9.7 fb$^{-1}$ of RunII data collected by the D0 detector at the Fermilab Tevatron Collider. The electron charge asymmetry is presented as a function of pseudo-rapidity out to |$\\eta$| $\\le$ 3.2, in five symmetric and asymmetric kinematic bins of electron transverse momentum and the missing transverse energy of the event. We also give the W charge asymmetry as a function of W boson rapidity. The asymmetries are compared with next-to-leading order perturbative quantum chromodynamics calculations. These charge asymmetry measurements will allow more accurate determinations of the proton parton distribution functions and are the most precise to date.
Directory of Open Access Journals (Sweden)
Isabel Josa M.
2013-11-01
Full Text Available Recent results on W and Z physics from LHC experiments are presented. Measurements reviewed include total W and Z cross sections, W lepton charge asymmetry, and Z differential cross sections. Production of Z bosons is studied as a function of rapidity, transverse momentum and angular variables. The Drell-Yan differential distribution with the dilepton mass and the double differential distribution with the dilepton mass and rapidity are shown. Finally, measurements of several electroweak observables, the forward-backward Drell-Yan asymmetry and the sin θW are also presented. The measurements are compared with theoretical predictions using the most accurate theoretical predictions and modern part on distribution functions. A general agreement is observed.
Distributed Video Coding: Iterative Improvements
DEFF Research Database (Denmark)
Luong, Huynh Van
Nowadays, emerging applications such as wireless visual sensor networks and wireless video surveillance are requiring lightweight video encoding with high coding efficiency and error-resilience. Distributed Video Coding (DVC) is a new coding paradigm which exploits the source statistics...
Polynomial weights and code constructions
DEFF Research Database (Denmark)
Massey, J; Costello, D; Justesen, Jørn
1973-01-01
polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... that are subcodes of the binary Reed-Muller codes and can be very simply instrumented, 3) a new class of constacyclic codes that are subcodes of thep-ary "Reed-Muller codes," 4) two new classes of binary convolutional codes with large "free distance" derived from known binary cyclic codes, 5) two new classes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm....
Polski nacjonalizm w szerokiej perspektywie
Directory of Open Access Journals (Sweden)
Krzysztof Karczewski
2015-12-01
Full Text Available On Polish nationalism in wide perspective In this book review of “Dylematy polskiego nacjonalizmu” by B. Grott the author argues that B. Grott based on an interdisciplinary comparative shows not only the shape of selected Polish nationalist political doctrines in the two factions: the Catholic faction that is characterized by traditionalism, and the modernizing faction, that is characterized by facing the challenges of modernity, but also shows the compounds between them and their values and practice of life of the nation and its historical success. Polski nacjonalizm w szerokiej perspektywie W niniejszej recenzji książki B. Grotta pt. Dylematy polskiego nacjonalizmu… autor przekonuje, iż B. Grott w oparciu o metodę interdyscyplinarną i porównawczą przedstawia nie tylko kształt wybranych polskich nacjonalistycznych doktryn politycznych w dwóch odłamach: w katolickim odłamie, o charakterze na wskroś tradycjonalistycznym i w modernizacyjnym odłamie, zwróconym frontem do wyzwań nowoczesności, ale także ukazuje związki pomiędzy nimi i lansowanymi tam wartościami a praktyką życia narodu i jego powodzenia dziejowego.
Product Codes for Optical Communication
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
2002-01-01
Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes.......Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes....
Directory of Open Access Journals (Sweden)
Rumen Daskalov
2017-07-01
Full Text Available Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q$. One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].
Algebraic geometric codes with applications
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2007-01-01
The theory of linear error-correcting codes from algebraic geomet-ric curves (algebraic geometric (AG) codes or geometric Goppa codes) has been well-developed since the work of Goppa and Tsfasman, Vladut, and Zink in 1981-1982. In this paper we introduce to readers some recent progress in algebraic geometric codes and their applications in quantum error-correcting codes, secure multi-party computation and the construction of good binary codes.
Neutron spallation source and the Dubna Cascade Code
Indian Academy of Sciences (India)
V Kumar; H Kumawat; Uttam Goel; V S Barashenkov
2003-03-01
Neutron multiplicity per incident proton, /, in collision of high energy proton beam with voluminous Pb and W targets has been estimated from the Dubna Cascade Code and compared with the available experimental data for the purpose of benchmarking of the code. Contributions of various atomic and nuclear processes for heat production and isotopic yield of secondary nuclei are also estimated to assess the heat and radioactivity conditions of the targets. Results obtained from the code show excellent agreement with the experimental data at beam energy, < 1.2 GeV and differ maximum up to 25% at higher energy.
Neutron spallation source and the Dubna cascade code
Kumar, V; Goel, U; Barashenkov, V S
2003-01-01
Neutron multiplicity per incident proton, n/p, in collision of high energy proton beam with voluminous Pb and W targets has been estimated from the Dubna cascade code and compared with the available experimental data for the purpose of benchmarking of the code. Contributions of various atomic and nuclear processes for heat production and isotopic yield of secondary nuclei are also estimated to assess the heat and radioactivity conditions of the targets. Results obtained from the code show excellent agreement with the experimental data at beam energy, E < 1.2 GeV and differ maximum up to 25% at higher energy. (author)
Optical coding theory with Prime
Kwong, Wing C
2013-01-01
Although several books cover the coding theory of wireless communications and the hardware technologies and coding techniques of optical CDMA, no book has been specifically dedicated to optical coding theory-until now. Written by renowned authorities in the field, Optical Coding Theory with Prime gathers together in one volume the fundamentals and developments of optical coding theory, with a focus on families of prime codes, supplemented with several families of non-prime codes. The book also explores potential applications to coding-based optical systems and networks. Learn How to Construct
Algebraic and stochastic coding theory
Kythe, Dave K
2012-01-01
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.
Directory of Open Access Journals (Sweden)
Judyta Krawczyk-Onyibe
2016-01-01
Full Text Available History of Afro-Germans The purpose of article History of Afro-Germans is to shad more light on the history of Afro-Germans of the last eight decades. I raise here issues like: social inclusion and exclusion, national affiliation, acceptance, self-identification and social categorization, stigmatization, discrimination based on racial background. I describe how this group has been perceived by the White majority of Germans, and activities of Afro-Germans that influenced change of their status and image in Germany. Based on a theoretical analysis, the following results reflect an incremental development in the recognition of Afro-Germans in Germany. Whereas the first generation of the 1940’s had been labelled as “occupation kids” not recognized by the majority of German society as member of it, rather as unwanted souvenir of Allies soldiers, the youngest generation in the meantime enjoys almost all rights included in being a German citizen. Historia Afroeuropejczyków Historia Afroeuropejczyków to artykuł, którego celem jest rzucić światło na historię Afroniemców na przestrzeni ostatnich ośmiu dekad. Poruszam w nim takie zagadnienia, jak: inkluzja i ekskluzja społeczna, przynależność narodowa, akceptacja, autoidentyfikacja i kategoryzacja społeczna oraz stygmatyzacja i dyskryminacja na tle rasowym. Opisuję sposób postrzegania Afroniemców przez białą większość Niemców, jak i działania samej mniejszości wpływające na zmianę jej statusu i wizerunku w Niemczech. Na podstawie teoretycznej analizy dostępnych materiałów stwierdzam, iż doszło do stopniowego postępu w kwestii akceptacji Afroniemców. Mam na uwadze, że pierwsza generacja nazywana „dziećmi okupacji” nie była uznawana za część społeczeństwa niemieckiego, raczej za niechcianą „pamiątkę” po alianckich żołnierzach, tymczasem najmłodsza generacja cieszy się prawie pełnią praw, jakie przysługują niemieckiemu obywatelowi.
Golden Coded Multiple Beamforming
Li, Boyu
2010-01-01
The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M^4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M^(2.5)) without performance degradation. When the CSI is known by the transmitter as well as the receiver, beamforming techniques that employ singular value decomposition are commonly used in MIMO systems. In the absence of channel coding, when a single symbol is transmitted, these systems achieve the full diversity order provided by the channel. Whereas this property is lost when multiple symbols are simultaneously transmitted. However, uncoded multiple beamforming can achieve the full div...
Energy Technology Data Exchange (ETDEWEB)
Bingham, Philip R [ORNL; Santos-Villalobos, Hector J [ORNL
2011-01-01
Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100 m) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100um and 10um aperture hole diameters show resolutions matching the hole diameters.
Bingham, Philip; Santos-Villalobos, Hector; Tobin, Ken
2011-03-01
Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100μm) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100μm and 10μm aperture hole diameters show resolutions matching the hole diameters.
Speech coding code- excited linear prediction
Bäckström, Tom
2017-01-01
This book provides scientific understanding of the most central techniques used in speech coding both for advanced students as well as professionals with a background in speech audio and or digital signal processing. It provides a clear connection between the whys hows and whats thus enabling a clear view of the necessity purpose and solutions provided by various tools as well as their strengths and weaknesses in each respect Equivalently this book sheds light on the following perspectives for each technology presented Objective What do we want to achieve and especially why is this goal important Resource Information What information is available and how can it be useful and Resource Platform What kind of platforms are we working with and what are their capabilities restrictions This includes computational memory and acoustic properties and the transmission capacity of devices used. The book goes on to address Solutions Which solutions have been proposed and how can they be used to reach the stated goals and ...
Phase-coded pulse aperiodic transmitter coding
Directory of Open Access Journals (Sweden)
I. I. Virtanen
2009-07-01
Full Text Available Both ionospheric and weather radar communities have already adopted the method of transmitting radar pulses in an aperiodic manner when measuring moderately overspread targets. Among the users of the ionospheric radars, this method is called Aperiodic Transmitter Coding (ATC, whereas the weather radar users have adopted the term Simultaneous Multiple Pulse-Repetition Frequency (SMPRF. When probing the ionosphere at the carrier frequencies of the EISCAT Incoherent Scatter Radar facilities, the range extent of the detectable target is typically of the order of one thousand kilometers – about seven milliseconds – whereas the characteristic correlation time of the scattered signal varies from a few milliseconds in the D-region to only tens of microseconds in the F-region. If one is interested in estimating the scattering autocorrelation function (ACF at time lags shorter than the F-region correlation time, the D-region must be considered as a moderately overspread target, whereas the F-region is a severely overspread one. Given the technical restrictions of the radar hardware, a combination of ATC and phase-coded long pulses is advantageous for this kind of target. We evaluate such an experiment under infinitely low signal-to-noise ratio (SNR conditions using lag profile inversion. In addition, a qualitative evaluation under high-SNR conditions is performed by analysing simulated data. The results show that an acceptable estimation accuracy and a very good lag resolution in the D-region can be achieved with a pulse length long enough for simultaneous E- and F-region measurements with a reasonable lag extent. The new experiment design is tested with the EISCAT Tromsø VHF (224 MHz radar. An example of a full D/E/F-region ACF from the test run is shown at the end of the paper.
Nested Quantum Error Correction Codes
Wang, Zhuo; Fan, Hen; Vedral, Vlatko
2009-01-01
The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties. Our method works for all length and all distance codes, and is quite efficient to construct optimal or near optimal codes. Two main known methods in constructing new codes from old codes in quantum error-correction theory, the concatenating and pasting, can be understood in the framework of nested quantum error correction codes.
Frutos-Alfaro, Francisco
2015-01-01
A program to generate codes in Fortran and C of the full Magnetohydrodynamic equations is shown. The program used the free computer algebra system software REDUCE. This software has a package called EXCALC, which is an exterior calculus program. The advantage of this program is that it can be modified to include another complex metric or spacetime. The output of this program is modified by means of a LINUX script which creates a new REDUCE program to manipulate the MHD equations to obtain a code that can be used as a seed for a MHD code for numerical applications. As an example, we present part of output of our programs for Cartesian coordinates and how to do the discretization.
Autocatalysis, information and coding.
Wills, P R
2001-01-01
Autocatalytic self-construction in macromolecular systems requires the existence of a reflexive relationship between structural components and the functional operations they perform to synthesise themselves. The possibility of reflexivity depends on formal, semiotic features of the catalytic structure-function relationship, that is, the embedding of catalytic functions in the space of polymeric structures. Reflexivity is a semiotic property of some genetic sequences. Such sequences may serve as the basis for the evolution of coding as a result of autocatalytic self-organisation in a population of assignment catalysts. Autocatalytic selection is a mechanism whereby matter becomes differentiated in primitive biochemical systems. In the case of coding self-organisation, it corresponds to the creation of symbolic information. Prions are present-day entities whose replication through autocatalysis reflects aspects of biological semiotics less obvious than genetic coding.
Coded Splitting Tree Protocols
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar
2013-01-01
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....
Institute of Scientific and Technical Information of China (English)
CHENG Qiang; CAO JianWen; WANG Bin; ZHANG HaiBin
2009-01-01
The adjoint code generator (ADG) is developed to produce the adjoint codes, which are used to analytically calculate gradients and the Hessian-vector products with the costs independent of the number of the independent variables. Different from other automatic differentiation tools, the implementation of ADG has advantages of using the least program behavior decomposition method and several static dependence analysis techniques. In this paper we first address the concerned concepts and fundamentals, and then introduce the functionality and the features of ADG. In particular, we also discuss the design architecture of ADG and implementation details including the recomputation and storing strategy and several techniques for code optimization. Some experimental results in several applications are presented at the end.
Vaucouleur, Sebastien
2011-02-01
We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.
Spread codes and spread decoding in network coding
Manganiello, F; Gorla, E.; Rosenthal, J.
2008-01-01
In this paper we introduce the class of spread codes for the use in random network coding. Spread codes are based on the construction of spreads in finite projective geometry. The major contribution of the paper is an efficient decoding algorithm of spread codes up to half the minimum distance.
Graph Codes with Reed-Solomon Component Codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2006-01-01
We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes...
Embedded Stellar Clusters in the W3/W4/W5 Molecular Cloud Complex
Carpenter, J M; Snell, R L; Carpenter, John M.; Heyer, Mark H.; Snell, Ronald L.
2002-01-01
We analyze the embedded stellar content in the vicinity of the W3/W4/W5 HII regions using the FCRAO Outer Galaxy 12CO(J=1-0) Survey, the IRAS Point Source Catalog, published radio continuum surveys, and new near-infrared and molecular line observations. Thirty-four IRAS Point Sources are identified that have far-infrared colors characteristic of embedded star forming regions, and we have obtained K' mosaics and 13CO(J=1-0) maps for 32 of them. Ten of the IRAS sources are associated with an OB star and 19 with a stellar cluster, although three OB stars are not identified with a cluster. Half of the embedded stellar population identified in the K' images is found in just the 5 richest clusters, and 61% is contained in IRAS sources associated with an embedded OB star. Thus rich clusters around OB stars contribute substantially to the stellar population currently forming in the W3/W4/W5 region. Approximately 39% of the cluster population is embedded in small clouds with an average mass of ~130 Mo that are located...
Zastosowanie sztucznych sieci neuronowych podczas rozmieszczania towar?w w magazynie sztukowym
Kudelska, ?.
2016-01-01
Efektywno?? procesu magazynowania wp?ywa na przep?yw materia?owy w przedsi?biorstwie jak r?wnie? na funkcjonowanie ca?ego ?a?cucha dostaw. Jednym z czynnik?w utrudniaj?cych podejmowanie decyzji w sferze magazynowania jest alokacja towar?w w strefie sk?adowania. Dlatego te? celem niniejszego badania jest opisanie zastosowania sztucznej sieci neuronowej w podejmowaniu decyzji rozmieszczenia towar?w w magazynie. Przedmiotem niniejszego badania jest rozmieszczenie towaru w magazynie. Zastosowano ...
Bibliografia w cyfrowej przestrzeni informacyjnej
Directory of Open Access Journals (Sweden)
Jadwiga Woźniak-Kasperek
2014-12-01
Full Text Available Bibliography in a digital information environment The dynamically changing area of the digital, including web, information interacts with the bibliographic universe, bringing new opportunities as well as new problems for both the bibliographers and the users. The article analyzes the following issues: 1 The aim of bibliography. Bibliographies serve utilitarian purposes, they allow, or at the very least facilitate, the access to relevant publications; they connect the information with its potential recipient. But bibliographies fulfil more tasks. They are treasuries of memory, images of a widely understood culture in a certain time and place; documents of archival value meant to be preserved for future generations. 2 Bibliography and library catalogue. The dangers of identifying bibliography as library catalogue. 3 The form of bibliography. The advantages and disadvantages of the paper (printed and the digital forms. Full-text resource as the target standard of bibliographic services and an opportunity of computer-aided indexing. The possibilities and advantages of using Web 2.0 tools in bibliographies. 4 Searching tools. Arrangements and indexes. Bibliografia w cyfrowej przestrzeni informacyjnej Dynamicznie zmieniająca się przestrzeń informacji cyfrowej, w tym sieciowej, oddziałuje na uniwersum bibliograficzne, stając się źródłem zarówno nowych możliwości, jak i trudności, z którymi muszą się zmagać i bibliografowie, i użytkownicy. W artykule poddano analizie cztery grupy zagadnień: 1 Cele i zadania bibliografii. Bibliografie służą celom utylitarnym, umożliwiają, lub co najmniej ułatwiają, osobom zainteresowanym dotarcie do właściwych publikacji. Bibliografie mają też inne zadania. Są skarbnicami pamięci, obrazem stanu szeroko rozumianej kultury w określonym czasie i miejscu, dokumentem, który ma znamiona dokumentu archiwalnego, przeznaczonego do zachowania dla przyszłych pokoleń. 2 Bibliografia a
Ogunfunmi, Tokunbo
2010-01-01
It is becoming increasingly apparent that all forms of communication-including voice-will be transmitted through packet-switched networks based on the Internet Protocol (IP). Therefore, the design of modern devices that rely on speech interfaces, such as cell phones and PDAs, requires a complete and up-to-date understanding of the basics of speech coding. Outlines key signal processing algorithms used to mitigate impairments to speech quality in VoIP networksOffering a detailed yet easily accessible introduction to the field, Principles of Speech Coding provides an in-depth examination of the
Energy Technology Data Exchange (ETDEWEB)
Link, Hamilton E.; Schroeppel, Richard Crabtree; Neumann, William Douglas; Campbell, Philip LaRoche; Beaver, Cheryl Lynn; Pierson, Lyndon George; Anderson, William Erik
2004-10-01
If software is designed so that the software can issue functions that will move that software from one computing platform to another, then the software is said to be 'mobile'. There are two general areas of security problems associated with mobile code. The 'secure host' problem involves protecting the host from malicious mobile code. The 'secure mobile code' problem, on the other hand, involves protecting the code from malicious hosts. This report focuses on the latter problem. We have found three distinct camps of opinions regarding how to secure mobile code. There are those who believe special distributed hardware is necessary, those who believe special distributed software is necessary, and those who believe neither is necessary. We examine all three camps, with a focus on the third. In the distributed software camp we examine some commonly proposed techniques including Java, D'Agents and Flask. For the specialized hardware camp, we propose a cryptographic technique for 'tamper-proofing' code over a large portion of the software/hardware life cycle by careful modification of current architectures. This method culminates by decrypting/authenticating each instruction within a physically protected CPU, thereby protecting against subversion by malicious code. Our main focus is on the camp that believes that neither specialized software nor hardware is necessary. We concentrate on methods of code obfuscation to render an entire program or a data segment on which a program depends incomprehensible. The hope is to prevent or at least slow down reverse engineering efforts and to prevent goal-oriented attacks on the software and execution. The field of obfuscation is still in a state of development with the central problem being the lack of a basis for evaluating the protection schemes. We give a brief introduction to some of the main ideas in the field, followed by an in depth analysis of a technique called &apos
Shchurovskaya, M. V.; Alferov, V. P.; Geraskin, N. I.; Radaev, A. I.
2017-01-01
The results of the validation of a research reactor calculation using Monte Carlo and deterministic codes against experimental data and based on code-to-code comparison are presented. The continuous energy Monte Carlo code MCU-PTR and the nodal diffusion-based deterministic code TIGRIS were used for full 3-D calculation of the IRT MEPhI research reactor. The validation included the investigations for the reactor with existing high enriched uranium (HEU, 90 w/o) fuel and low enriched uranium (LEU, 19.7 w/o, U-9%Mo) fuel.
Integrated Coding and Waveform Design Study.
1980-08-01
Peforanceof TwoStae CDigApoc Outer..... Decoder:...... Reed-Slomo..ode.......5 10ymo - nelae Employed -- --- FigureInnr DecodeefraConvouial CwodSae Coding...9.4DcddPromneoC w-tg oigApoc ...... Outer. Decode. : . eed-Solomo. Cod ... ................ Sybo - nelae Employed -- ---- -- Figue 934Innoe DeoerorConveouial...Smo - nelae Employed--- --- --- 1ne0eoer lc oe 186;2 8-0.05~~~ an No Ers. Ino.to Employed. ... .. .. ..9.-49 . .... 10 B 10 - 10.4 10 I A:RwBi rorRt 10
African Journals Online (AJOL)
4 L of distilled water at room temperature for 72 hours and occasionally stirred. After filtration, the solution obtained ... Following filtration and concentration under vacuum, 20.3 g of ... propulsion of charcoal meal through the small intestine by.
New code match strategy for wideband code division multiple access code tree management
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.
Transverse momentum resummation effects in W^+W^- measurements
Meade, Patrick; Zeng, Mao
2014-01-01
The W^+W^- cross section has remained one of the most consistently discrepant channels compared to SM predictions at the LHC, measured by both ATLAS and CMS at 7 and 8 TeV. Developing a better modeling of this channel is crucial to understanding properties of the Higgs and potential new physics. In this paper we investigate the effects of NNLL transverse momentum resummation in measuring the W^+W^- cross section. In the formalism we employ, transverse momentum resummation does not change the total inclusive cross section, but gives a more accurate prediction for the p_T distribution of the diboson system. By re-weighting the p_T distribution of events produced by Monte Carlo generators, we find a systematic shift that decreases the experimental discrepancy with the SM prediction by approximately 3-7% depending on the MC generator and parton shower used. The primary effect comes from the jet veto cut used by both experiments. We comment on the connections to jet veto resummation, and other methods the experime...
1990-10-01
for "e-winq istructucs -er.,g -in Uta ow - dathering and ma,, n nog he tata needed n.1 -ompiet ng ad eviewing t’ -iecton of tormation Send comments...apparent that a stationary distribution should exist on a nano -second timescale. The stationary distribution thus satisfies the equation 0-L(c)f + 3W-)f
Reed-Solomon convolutional codes
Gluesing-Luerssen, H; Schmale, W
2005-01-01
In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.
Geopolymers in Construction / Zastosowanie Geopolimerów W Budownictwie
Błaszczyński, Tomasz Z.; Król, Maciej R.
2015-03-01
Within the framework of quests of supplementary and "healthier" binders to the production of concrete followed the development of geopolymers in construction. However the practical application of these materials is still very limited. The production of each ton of cement introduces one ton of CO2 into the atmosphere. According to various estimations, the synthesis of geopolymers absorbs 2-3 times less energy than the Portland cement and causes a generation of 4-8 times less of CO2. Geopolymeric concretes possess a high compressive strength, very small shrinkage and small creep, and they possess a high resistance to acid and sulphate corrosion. These concretes are also resistant to carbonate corrosion and possess a very high fire resistance and also a high resistance to UV radiation. W ramach poszukiwania zastępczych i "zdrowszych" spoiw do produkcji betonu nastąpił rozwój geopolimerów w budownictwie. Jednakże praktyczne zastosowanie tych materiałów jest jeszcze nadal bardzo ograniczone. Produkcja każdej tony cementu wprowadza do atmosfery tonę CO2. Według różnych szacunków, synteza geopolimerów pochłania 2-3 razy mniej energii, niż cementu portlandzkiego oraz powoduje wydzielenie 4-8 razy mniejszej ilości CO2. Do tego betony geopolimerowe posiadają wysoką wytrzymałość na ściskanie, bardzo mały skurcz i małe pełzanie oraz dają wysoką odporność na korozję kwasową i siarczanową. Betony te są także odporne na korozję węglanową i posiadają bardzo wysoką odporność ogniową, a także wysoką odporność na promieniowanie UV.
Laëtitia Pedroso
2010-01-01
During his talk to the staff at the beginning of the year, the Director-General mentioned that a new code of conduct was being drawn up. What exactly is it and what is its purpose? Anne-Sylvie Catherin, Head of the Human Resources (HR) Department, talked to us about the whys and wherefores of the project. Drawing by Georges Boixader from the cartoon strip “The World of Particles” by Brian Southworth. A code of conduct is a general framework laying down the behaviour expected of all members of an organisation's personnel. “CERN is one of the very few international organisations that don’t yet have one", explains Anne-Sylvie Catherin. “We have been thinking about introducing a code of conduct for a long time but lacked the necessary resources until now”. The call for a code of conduct has come from different sources within the Laboratory. “The Equal Opportunities Advisory Panel (read also the "Equal opportuni...
DEFF Research Database (Denmark)
Fukui, Hironori; Popovski, Petar; Yomo, Hiroyuki
2014-01-01
Physical layer network coding (PLNC) has been proposed to improve throughput of the two-way relay channel, where two nodes communicate with each other, being assisted by a relay node. Most of the works related to PLNC are focused on a simple three-node model and they do not take into account...
Corporate governance through codes
Haxhi, I.; Aguilera, R.V.; Vodosek, M.; den Hartog, D.; McNett, J.M.
2014-01-01
The UK's 1992 Cadbury Report defines corporate governance (CG) as the system by which businesses are directed and controlled. CG codes are a set of best practices designed to address deficiencies in the formal contracts and institutions by suggesting prescriptions on the preferred role and compositi
1989-09-30
SUMMARY OF POLAR ACHIEVEMENTS ..... .......... 3 3. POLAR CODE PHYSICAL MODELS ..... ............. 5 3.1 PL- ASMA Su ^"ru5 I1LS SH A...of this problem. 1.1. The Charge-2 Rocket The Charge-2 payload was launched on a Black Brant VB from White Sands Mis- sile Range in New Mexico in
Corporate governance through codes
Haxhi, I.; Aguilera, R.V.; Vodosek, M.; den Hartog, D.; McNett, J.M.
2014-01-01
The UK's 1992 Cadbury Report defines corporate governance (CG) as the system by which businesses are directed and controlled. CG codes are a set of best practices designed to address deficiencies in the formal contracts and institutions by suggesting prescriptions on the preferred role and
Khina, Anatoly
2016-08-15
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Directory of Open Access Journals (Sweden)
V.P. Bereznev
2015-10-01
An iterative solution process is used, including external iterations for the fission source and internal iterations for the scattering source. The paper presents the results of a cross-verification against the Monte Carlo MMK code [3] and on a model of the BN-800 reactor core.
Anaïs Schaeffer
2013-01-01
This summer, CERN took part in the Google Summer of Code programme for the third year in succession. Open to students from all over the world, this programme leads to very successful collaborations for open source software projects. Image: GSoC 2013. Google Summer of Code (GSoC) is a global programme that offers student developers grants to write code for open-source software projects. Since its creation in 2005, the programme has brought together some 6,000 students from over 100 countries worldwide. The students selected by Google are paired with a mentor from one of the participating projects, which can be led by institutes, organisations, companies, etc. This year, CERN PH Department’s SFT (Software Development for Experiments) Group took part in the GSoC programme for the third time, submitting 15 open-source projects. “Once published on the Google Summer for Code website (in April), the projects are open to applications,” says Jakob Blomer, one of the o...
Focusing Automatic Code Inspections
Boogerd, C.J.
2010-01-01
Automatic Code Inspection tools help developers in early detection of defects in software. A well-known drawback of many automatic inspection approaches is that they yield too many warnings and require a clearer focus. In this thesis, we provide such focus by proposing two methods to prioritize
Analisi del decadimento $W -> \\tau \
Coscetti, Simone
Questo lavoro di tesi si e' svolto nell'ambito dell'esperimento CMS a LHC, ed in particolare verte sullo studio delle strategie di identificazione off-line del leptone tau, atteso tra i prodotti di decadimento del bosone di Higgs, cosi' come di altre particelle previste in altri modelli teorici. Il canale utilizzato per testare la procedura di identificazione del tau e' il decadimento semileptonico del bosone vettore W. Infine, sulla base dei risultati ottenuti viene presentata una stima quantitativa della sezione d'urto di produzione pp-> W + X
Institute of Scientific and Technical Information of China (English)
丁峰; 李涓子; 王克宏
2004-01-01
@@ 自从Web诞生以来,Web的每一步发展、技术成熟和应用领域的拓展,都离不开成立于1994年10月的W3C(World Wide Web Consortium,万维网联盟)的努力.W3C是专门致力于创建Web相关技术标准并促进Web向更深、更广发展的国际组织.
Role lidera w zespole sportowym
Kuźbik, Paweł
2013-01-01
Modern sport plays a huge role in modern world. However in recent years the phenomenon has intensified the sense undermine competition. Sport needs a new leadership and new leaders in sports teams. The purpose of this article is to show the different roles of a leader of a sports team. Współczesny sport odgrywa ogromną rolę we współczesnym świecie, jednak w ostatnich latach nasiliły się zjawiska, które podważyły sens rywalizacji sportowej. W konsekwencji zaczęto zastanawiać ...
Fundamentals of coding and reimbursement.
Price, Paula
2002-01-01
After completing this introduction to radiology coding and reimbursement, readers will: Understand how health care reimbursement evolved over the past 50 years. Know the importance of documenting the patient's history. Have an overall picture of the standardized numerical coding system. Understand how accurate coding affects reimbursement. Understand coding functions as they pertain to regulatory compliance in the radiology department. Be familiar with the U.S. Justice Department's use of coding in tracking health care fraud.
On Asymmetric Quantum MDS Codes
Ezerman, Martianus Frederic; Ling, San
2010-01-01
Assuming the validity of the MDS Conjecture, the weight distribution of all MDS codes is known. Using a recently-established characterization of asymmetric quantum error-correcting codes, linear MDS codes can be used to construct asymmetric quantum MDS codes with $d_{z} \\geq d_{x}\\geq 2$ for all possible values of length $n$ for which linear MDS codes over $\\F_{q}$ are known to exist.
Rate-adaptive BCH codes for distributed source coding
DEFF Research Database (Denmark)
Salmistraro, Matteo; Larsen, Knud J.; Forchhammer, Søren
2013-01-01
This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its...... strategies for improving the reliability of the decoded result are analyzed, and methods for estimating the performance are proposed. In the analysis, noiseless feedback and noiseless communication are assumed. Simulation results show that rate-adaptive BCH codes achieve better performance than low...... correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario, where the marginal probability of each symbol, Xi in X, given Y is highly skewed (unbalanced). Rate-adaptive BCH codes are presented and applied to distributed source coding. Adaptive and fixed checking...
Rodney, Steven A
2008-01-01
The W40 complex is a nearby site of recent massive star formation composed of a dense molecular cloud adjacent to an HII region that contains an embedded OB star cluster. The HII region is beginning to blister out and break free from its envelope of molecular gas, but our line of sight to the central stars is largely obscured by intervening dust. Several bright OB stars in W40 - visible at optical, infrared, or cm wavelengths - are providing the ionizing flux that heats the HII region. The known stellar component of W40 is dominated by a small number of partly or fully embedded OB stars which have been studied at various wavelengths, but the lower mass stellar population remains largely unexamined. Despite its modest optical appearance, at 600pc W40 is one of the nearest massive star forming regions, and with a UV flux of about 1/10th of the Orion Nebula Cluster, this neglected region deserves detailed investigation.
1987-01-01
This image of the UA1 central detector shows the real tracks left by decay products of a W into a tau and a tau-neutrino. The tau decays into charged particles, as seen by the isolated pencil-jet in the central detector. The UA1 detector ran on the SPS accelerator at CERN between 1981 and 1993.
Energy Technology Data Exchange (ETDEWEB)
Wilkinson, III, Richard Paul [Univ. of Pennsylvania, Philadelphia, PA (United States)
1997-01-01
We present evidence for hadronic W decays in t$\\bar{t}$ → lepton + neutrino + ≥ 4 jet events using a 109 pb ^{-1} data sample of p$\\bar{p}$ collisions at √s = 1.8 TeV collected with the Collider Detector at Fermilab (CDF).
Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes
Kasai, Kenta
2010-01-01
We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a check node in the decoding Tanner graph, the channel with small capacity leads to large decoding complexity. In this paper, we introduce a novel fountain coding scheme with non-binary LDPC codes. The decoding complexity of the proposed fountain code does not depend on the channel. Numerical experiments show that the proposed codes exhibit better performance than conventional fountain codes, especially for small number of information bits.
Quantum codes from linear codes over finite chain rings
Liu, Xiusheng; Liu, Hualu
2017-10-01
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring {\\mathbb {F}}_{p^{2m}}+u{\\mathbb {F}}_{p^{2m}}. The good parameters of quantum codes from cyclic codes over finite chain rings are obtained.
Analysis of Residual Thermal Stress in CVD-W Coating as Plasma Facing Material
Zhu, Dahuan; Wang, Kun; Wang, Xianping; Chen, Junling; Fang, Qianfeng
2012-07-01
Chemical vapor deposition-tungsten (CVD-W) coating covering the surface of the plasma facing component (PFC) is an effective method to implement the tungsten material as plasma facing material (PFM) in fusion devices. Residual thermal stress in CVD-W coating due to thermal mismatch between coating and substrate was successfully simulated by using a finite element method (ANSYS 10.0 code). The deposition parametric effects, i.e., coating thickness and deposition temperature, and interlayer were investigated to get a description of the residual thermal stress in the CVD-W coating-substrate system. And the influence of the substrate materials on the generation of residual thermal stress in the CVD-W coating was analyzed with respect to the CVD-W coating application as PFM. This analysis is beneficial for the preparation and application of CVD-W coating.
Przemiany na rynku napojów alkoholowych w Polsce w latach 1990-2007
Borowska, Agnieszka
2009-01-01
One of the most important industry branches in Poland is the alcohol industry. Beer and vodka are the main part of Polish production and consumption. An analysis of changes in production and consumption of alcoholic products shows their changing trends in the period of 1990-2007. In the last years it shows a distinctly growing trend of production and consumption of beer and a decreasing one of liquor consumption up to 1997 and a small stabilization thereafter. / Synopsis. W Polsce jednymi z w...
On the performance of a 2D unstructured computational rheology code on a GPU
Pereira, S.P.; Vuik, K.; Pinho, F.T.; Nobrega, J.M.
2013-01-01
The present work explores the massively parallel capabilities of the most advanced architecture of graphics processing units (GPUs) code named “Fermi”, on a two-dimensional unstructured cell-centred finite volume code. We use the SIMPLE algorithm to solve the continuity and momentum equations that w
40 CFR Table 1 to Subpart W of... - General Provisions Applicability to Subpart W
2010-07-01
... Subpart W 1 Table 1 to Subpart W of Part 63 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY... Polyamides Production Pt. 63, Subpt. W, Table 1 Table 1 to Subpart W of Part 63—General Provisions Applicability to Subpart W Reference Applies to subpart W BLR WSR WSR alternative standard, and BLR...
UPORZĄDKOWANIE PROCESU BUDOWLANEGO W FAZIE ODBIORÓW
Directory of Open Access Journals (Sweden)
Ziemowit SULIGOWSKI
2016-05-01
Full Text Available Przedstawiono charakterystyczne zagrożenia procesu budowlanego. Wykazano potrzebę uporządkowania tego procesu, do szczególnych problemów należy brak formalnych procedur odbiorowych i lekceważenie odbioru robót. Występujące awarie są efektem błędów popełnianych na wszystkich etapach procesu budowlanego. Szczególne miejsce zajmuje jednak postawa kierownika budowy oraz inspektora nadzoru inwestorskiego. Grupą szczególnego ryzyka okazały się być struktury organizacyjne oraz osoby pochodzące z dawnych struktur melioracji rolnych.
Baer, Michael B
2008-01-01
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of lengths (or, equivalently, no codewords have lengths that lie in a complementary set). This paper introduces a polynomial-time dynamic programming algorithm that finds optimal codes for this reserved-length prefix coding problem. This has applications to quickly encoding and decoding lossless codes. In addition, one modification of the approach solves any quasiarithmetic prefix coding problem, while another finds optimal codes restricted to the set of codes with g codeword lengths for user-specified g (e.g., g=2).
Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon Codes
Senger, Christian; Bossert, Martin; Zyablov, Victor
2008-01-01
Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most frequently used Reed-Solomon codes; as inner code, we assume some linear block code which can be decoded up to half its minimum distance. Decoding up to half the minimum distance of Generalized Concatenated codes is classically achieved by the Blokh-Zyablov-Dumer algorithm, which iteratively decodes by first using the inner decoder to get an estimate of the outer code words and then using an outer error/erasure decoder with a varying number of erasures determined by a set of pre-calculated thresholds. In this paper, a modified version of the Blokh-Zyablov-Dumer algorithm is proposed, which exploits the fact that a number of outer Reed-Solomon codes with average minimum distance d can be grouped into one single Interleaved Reed-Solomon code which can be decoded beyond d/2. This allows to skip a number of decoding iterations on the one...
Schnack, D. D.; Glasser, A. H.
1996-11-01
NIMROD is a new code system that is being developed for the analysis of modern fusion experiments. It is being designed from the beginning to make the maximum use of massively parallel computer architectures and computer graphics. The NIMROD physics kernel solves the three-dimensional, time-dependent two-fluid equations with neo-classical effects in toroidal geometry of arbitrary poloidal cross section. The NIMROD system also includes a pre-processor, a grid generator, and a post processor. User interaction with NIMROD is facilitated by a modern graphical user interface (GUI). The NIMROD project is using Quality Function Deployment (QFD) team management techniques to minimize re-engineering and reduce code development time. This paper gives an overview of the NIMROD project. Operation of the GUI is demonstrated, and the first results from the physics kernel are given.
Epetra developers coding guidelines.
Energy Technology Data Exchange (ETDEWEB)
Heroux, Michael Allen; Sexton, Paul Michael
2003-12-01
Epetra is a package of classes for the construction and use of serial and distributed parallel linear algebra objects. It is one of the base packages in Trilinos. This document describes guidelines for Epetra coding style. The issues discussed here go beyond correct C++ syntax to address issues that make code more readable and self-consistent. The guidelines presented here are intended to aid current and future development of Epetra specifically. They reflect design decisions that were made in the early development stages of Epetra. Some of the guidelines are contrary to more commonly used conventions, but we choose to continue these practices for the purposes of self-consistency. These guidelines are intended to be complimentary to policies established in the Trilinos Developers Guide.
Efficient convolutional sparse coding
Energy Technology Data Exchange (ETDEWEB)
Wohlberg, Brendt
2017-06-20
Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.
Decoding the productivity code
DEFF Research Database (Denmark)
Hansen, David
.e., to be prepared to initiate improvement. The study shows how the effectiveness of the improvement system depends on the congruent fit between the five elements as well as the bridging coherence between the improvement system and the work system. The bridging coherence depends on how improvements are activated...... approach often ends up with demanding intense employee focus to sustain improvement and engagement. Likewise, a single-minded employee development approach often ends up demanding rationalization to achieve the desired financial results. These ineffective approaches make organizations react like pendulums...... that swing between rationalization and employee development. The productivity code is the lack of alternatives to this ineffective approach. This thesis decodes the productivity code based on the results from a 3-year action research study at a medium-sized manufacturing facility. During the project period...
DEFF Research Database (Denmark)
Beck Jørgensen, Torben; Sørensen, Ditte-Lene
2013-01-01
Good governance is a broad concept used by many international organizations to spell out how states or countries should be governed. Definitions vary, but there is a clear core of common public values, such as transparency, accountability, effectiveness, and the rule of law. It is quite likely......, however, that national views of good governance reflect different political cultures and institutional heritages. Fourteen national codes of conduct are analyzed. The findings suggest that public values converge and that they match model codes from the United Nations and the European Council as well...... as conceptions of good governance from other international organizations. While values converge, they are balanced and communicated differently, and seem to some extent to be translated into the national cultures. The set of global public values derived from this analysis include public interest, regime dignity...
Confocal coded aperture imaging
Energy Technology Data Exchange (ETDEWEB)
Tobin, Jr., Kenneth William (Harriman, TN); Thomas, Jr., Clarence E. (Knoxville, TN)
2001-01-01
A method for imaging a target volume comprises the steps of: radiating a small bandwidth of energy toward the target volume; focusing the small bandwidth of energy into a beam; moving the target volume through a plurality of positions within the focused beam; collecting a beam of energy scattered from the target volume with a non-diffractive confocal coded aperture; generating a shadow image of said aperture from every point source of radiation in the target volume; and, reconstructing the shadow image into a 3-dimensional image of the every point source by mathematically correlating the shadow image with a digital or analog version of the coded aperture. The method can comprise the step of collecting the beam of energy scattered from the target volume with a Fresnel zone plate.
W2X and W3X-L: Cost-Effective Approximations to W2 and W4 with kJ mol(-1) Accuracy.
Chan, Bun; Radom, Leo
2015-05-12
We have formulated the W2X and W3X-L protocols as cost-effective alternatives to W2 and W3/W4, respectively, and to supplement our previously developed set of W1X and W3X procedures. The W2X procedure provides an accurate approximation to the all-electron scalar-relativistic CCSD(T)/CBS energy, with a mean absolute deviation (MAD) of 0.6 kJ mol(-1) from benchmark energies provided by the CCSD(T) component in the W4 protocol. Such a performance is comparable to that of W2w (0.5 kJ mol(-1)) but comes at a significantly lower cost. Comparison of computational requirements shows that W2X should be applicable to systems that can be treated by the W1w method. Thus, W2X provides an accurate means for the treatment of medium-sized systems such as naphthalene. For the calculation of post-CCSD(T) effects, we propose a slight modification to the method used in our previously devised W3X procedure. Our new W3-type protocol (W3X-L) combines this new post-CCSD(T) treatment with our new W2X procedure. It has an MAD from benchmark values of 0.8 kJ mol(-1) for the W4-11 set, which is comparable to that for the computationally more demanding W3.2 method (0.6 kJ mol(-1)). However, the use of the even relatively modest post-CCSD(T) calculations in W3X-L still represents a computational bottleneck, and this currently restricts its application to systems up to the size of benzene with our current computing resources.
Price, Daniel; Wurster, James; Nixon, Chris
2016-05-01
I will present the capabilities of the Phantom SPH code for global simulations of dust and gas in protoplanetary discs. I will present our new algorithms for simulating both small and large grains in discs, as well as our progress towards simulating evolving grain populations and coupling with radiation. Finally, I will discuss our recent applications to HL Tau and the physics of dust gap opening.
Scuflaire, R; Théado, S; Bourge, P -O; Miglio, A; Godart, M; Thoul, A; Noels, A
2007-01-01
The Liege Oscillation code can be used as a stand-alone program or as a library of subroutines that the user calls from a Fortran main program of his own to compute radial and non-radial adiabatic oscillations of stellar models. We describe the variables and the equations used by the program and the methods used to solve them. A brief account is given of the use and the output of the program.
Energy Technology Data Exchange (ETDEWEB)
N.V. Mokhov
2003-04-09
Status and recent developments of the MARS 14 Monte Carlo code system for simulation of hadronic and electromagnetic cascades in shielding, accelerator and detector components in the energy range from a fraction of an electronvolt up to 100 TeV are described. these include physics models both in strong and electromagnetic interaction sectors, variance reduction techniques, residual dose, geometry, tracking, histograming. MAD-MARS Beam Line Build and Graphical-User Interface.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
DEFF Research Database (Denmark)
Gal, A.; Hansen, Kristoffer Arnsfelt; Koucky, Michal
2013-01-01
We bound the minimum number w of wires needed to compute any (asymptotically good) error-correcting code C:{0,1}Ω(n)→{0,1}n with minimum distance Ω(n), using unbounded fan-in circuits of depth d with arbitrary gates. Our main results are: 1) if d=2, then w=Θ(n (lgn/lglgn)2); 2) if d=3, then w...
Sundararajan, Jay Kumar; Médard, Muriel
2008-01-01
A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node "seeing" a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is $O(\\frac1{1-\\rho})$ as opposed to $\\Omega(\\frac1{(1-\\rho)^2})$ for the baseline approach...
Energy Technology Data Exchange (ETDEWEB)
Summers, R.M.; Cole, R.K. Jr.; Smith, R.C.; Stuart, D.S.; Thompson, S.L. [Sandia National Labs., Albuquerque, NM (United States); Hodge, S.A.; Hyman, C.R.; Sanders, R.L. [Oak Ridge National Lab., TN (United States)
1995-03-01
MELCOR is a fully integrated, engineering-level computer code that models the progression of severe accidents in light water reactor nuclear power plants. MELCOR is being developed at Sandia National Laboratories for the U.S. Nuclear Regulatory Commission as a second-generation plant risk assessment tool and the successor to the Source Term Code Package. A broad spectrum of severe accident phenomena in both boiling and pressurized water reactors is treated in MELCOR in a unified framework. These include: thermal-hydraulic response in the reactor coolant system, reactor cavity, containment, and confinement buildings; core heatup, degradation, and relocation; core-concrete attack; hydrogen production, transport, and combustion; fission product release and transport; and the impact of engineered safety features on thermal-hydraulic and radionuclide behavior. Current uses of MELCOR include estimation of severe accident source terms and their sensitivities and uncertainties in a variety of applications. This publication of the MELCOR computer code manuals corresponds to MELCOR 1.8.3, released to users in August, 1994. Volume 1 contains a primer that describes MELCOR`s phenomenological scope, organization (by package), and documentation. The remainder of Volume 1 contains the MELCOR Users Guides, which provide the input instructions and guidelines for each package. Volume 2 contains the MELCOR Reference Manuals, which describe the phenomenological models that have been implemented in each package.
low bit rate video coding low bit rate video coding
African Journals Online (AJOL)
eobe
ariable length bit rate (VLBR) broadly encompasses video coding which broadly encompasses ... for motion estimation and compensation to reduce the prediction sation to reduce the ... a special interest among the video coding community ...
Decoding of concatenated codes with interleaved outer codes
DEFF Research Database (Denmark)
Justesen, Jørn; Thommesen, Christian; Høholdt, Tom
2004-01-01
Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved Reed/Solomon codes, which allows close to errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes. (NK) N-K...
Free-boundary ideal MHD modes in W7-AS
Energy Technology Data Exchange (ETDEWEB)
Merkel, P.; Nuehrenberg, C. [Max-Planck-Institut fuer Plasmaphysik, Teilinstitut Greifswald, Greifswald (Germany); Cooper, W.A. [Ecole Polytechnique Federale, Lausanne (Switzerland). Centre de Recherche en Physique des Plasma (CRPP)
1996-09-01
The CAS3D stability code may now be used to analyze the ideal magnetohydrodynamic energy principle for three-dimensional plasmas surrounded by a vacuum region, i.e. for perturbations which may deform the plasma-vacuum interface because of a non-vanishing normal component on this surface. A Green`s function technique is used here to determine the vacuum energy contribution from a surface integral with the plasma-vacuum interface as domain of integration. Assets of this procedure are that it does not require to continue either the coordinate system nor the perturbation functions into the vacuum region. The application of the CAS3D free-boundary stability code to a set of finite-{beta} W7-AS plasma configurations, computationally generated from the W7-AS coil data, shows that unstable, radially extended free-boundary modes exist in equilibria of this set, for which the local Mercier stability criterion detects stability. This is in contrast to the behaviour of the fixed-boundary modes, for which the point of marginal stability approximately coincides with the one given by the local stability analysis. Corresponding results from the TERPSICHORE and CAS3D codes are in good agreement. (author) 6 figs., 16 refs.
Random linear codes in steganography
Directory of Open Access Journals (Sweden)
Kamil Kaczyński
2016-12-01
Full Text Available Syndrome coding using linear codes is a technique that allows improvement in the steganographic algorithms parameters. The use of random linear codes gives a great flexibility in choosing the parameters of the linear code. In parallel, it offers easy generation of parity check matrix. In this paper, the modification of LSB algorithm is presented. A random linear code [8, 2] was used as a base for algorithm modification. The implementation of the proposed algorithm, along with practical evaluation of algorithms’ parameters based on the test images was made.[b]Keywords:[/b] steganography, random linear codes, RLC, LSB
Coding the Assembly of Polyoxotungstates with a Programmable Reaction System.
Ruiz de la Oliva, Andreu; Sans, Victor; Miras, Haralampos N; Long, De-Liang; Cronin, Leroy
2017-05-01
Chemical transformations are normally conducted in batch or flow mode, thereby allowing the chemistry to be temporally or spatially controlled, but these approaches are not normally combined dynamically. However, the investigation of the underlying chemistry masked by the self-assembly processes that often occur in one-pot reactions and exploitation of the potential of complex chemical systems requires control in both time and space. Additionally, maintaining the intermediate constituents of a self-assembled system "off equilibrium" and utilizing them dynamically at specific time intervals provide access to building blocks that cannot coexist under one-pot conditions and ultimately to the formation of new clusters. Herein, we implement the concept of a programmable networked reaction system, allowing us to connect discrete "one-pot" reactions that produce the building block{W11O38} ≡ {W11} under different conditions and control, in real time, the assembly of a series of polyoxometalate clusters {W12O42} ≡ {W12}, {W22O74} ≡ {W22} 1a, {W34O116} ≡ {W34} 2a, and {W36O120} ≡ {W36} 3a, using pH and ultraviolet-visible monitoring. The programmable networked reaction system reveals that is possible to assemble a range of different clusters using {W11}-based building blocks, demonstrating the relationship between the clusters within the family of iso-polyoxotungstates, with the final structural motif being entirely dependent on the building block libraries generated in each separate reaction space within the network. In total, this approach led to the isolation of five distinct inorganic clusters using a "fixed" set of reagents and using a fully automated sequence code, rather than five entirely different reaction protocols. As such, this approach allows us to discover, record, and implement complex one-pot reaction syntheses in a more general way, increasing the yield and reproducibility and potentially giving access to nonspecialists.
Convolutional coding techniques for data protection
Massey, J. L.
1975-01-01
Results of research on the use of convolutional codes in data communications are presented. Convolutional coding fundamentals are discussed along with modulation and coding interaction. Concatenated coding systems and data compression with convolutional codes are described.
Code Flows : Visualizing Structural Evolution of Source Code
Telea, Alexandru; Auber, David
2008-01-01
Understanding detailed changes done to source code is of great importance in software maintenance. We present Code Flows, a method to visualize the evolution of source code geared to the understanding of fine and mid-level scale changes across several file versions. We enhance an existing visual met
Code flows : Visualizing structural evolution of source code
Telea, Alexandru; Auber, David
2008-01-01
Understanding detailed changes done to source code is of great importance in software maintenance. We present Code Flows, a method to visualize the evolution of source code geared to the understanding of fine and mid-level scale changes across several file versions. We enhance an existing visual met
Measurement of W Polarisation at LEP
Achard, P; Aguilar-Benítez, M; Alcaraz, J; Alemanni, G; Allaby, James V; Aloisio, A; Alviggi, M G; Anderhub, H; Andreev, V P; Anselmo, F; Arefev, A; Azemoon, T; Aziz, T; Bagnaia, P; Bajo, A; Baksay, G; Baksay, L; Baldew, S V; Banerjee, S; Barczyk, A; Barillère, R; Bartalini, P; Basile, M; Batalova, N; Battiston, R; Bay, A; Becattini, F; Becker, U; Behner, F; Bellucci, L; Berbeco, R; Berdugo, J; Berges, P; Bertucci, B; Betev, B L; Biasini, M; Biglietti, M; Biland, A; Blaising, J J; Blyth, S C; Bobbink, Gerjan J; Böhm, A; Boldizsar, L; Borgia, B; Bottai, S; Bourilkov, D; Bourquin, Maurice; Braccini, S; Branson, J G; Brochu, F; Burger, J D; Burger, W J; Cai, X D; Capell, M; Cara Romeo, G; Carlino, G; Cartacci, A M; Casaus, J; Cavallari, F; Cavallo, N; Cecchi, C; Cerrada, M; Chamizo-Llatas, M; Chang, Y H; Chemarin, M; Chen, A; Chen, G; Chen, G M; Chen, H F; Chen, H S; Chiefari, G; Cifarelli, Luisa; Cindolo, F; Clare, I; Clare, R; Coignet, G; Colino, N; Costantini, S; de la Cruz, B; Cucciarelli, S; van Dalen, J A; De Asmundis, R; Déglon, P L; Debreczeni, J; Degré, A; Dehmelt, K; Deiters, K; Della Volpe, D; Delmeire, E; Denes, P; De Notaristefani, F; De Salvo, A; Diemoz, M; Dierckxsens, M; Dionisi, C; Dittmar, M; Doria, A; Dova, M T; Duchesneau, D; Duda, M; Echenard, B; Eline, A; El-Hage, A; El-Mamouni, H; Engler, A; Eppling, F J; Extermann, P; Falagán, M A; Falciano, S; Favara, A; Fay, J; Fedin, O; Felcini, M; Ferguson, T; Fesefeldt, H S; Fiandrini, E; Field, J H; Filthaut, Frank; Fisher, P H; Fisher, W; Fisk, I; Forconi, G; Freudenreich, Klaus; Furetta, C; Galaktionov, Yu; Ganguli, S N; García-Abia, P; Gataullin, M; Gentile, S; Giagu, S; Gong, Z F; Grenier, G; Grimm, O; Grünewald, M W; Guida, M; van Gulik, R; Gupta, V K; Gurtu, A; Gutay, L J; Haas, D; Hakobyan, R S; Hatzifotiadou, D; Hebbeker, T; Hervé, A; Hirschfelder, J; Hofer, H; Hohlmann, M; Holzner, G; Hou, S R; Hu, Y; Jin, B N; Jones, L W; de Jong, P; Josa-Mutuberria, I; Käfer, D; Kaur, M; Kienzle-Focacci, M N; Kim, J K; Kirkby, Jasper; Kittel, E W; Klimentov, A; König, A C; Kopal, M; Koutsenko, V F; Kräber, M H; Krämer, R W; Krüger, A; Kunin, A; Ladrón de Guevara, P; Laktineh, I; Landi, G; Lebeau, M; Lebedev, A; Lebrun, P; Lecomte, P; Lecoq, P; Le Coultre, P; Le Goff, J M; Leiste, R; Levtchenko, M; Levchenko, P M; Li, C; Likhoded, S; Lin, C H; Lin, W T; Linde, Frank L; Lista, L; Liu, Z A; Lohmann, W; Longo, E; Lü, Y S; Luci, C; Luminari, L; Lustermann, W; Ma Wen Gan; Malgeri, L; Malinin, A; Maña, C; Mangeol, D J J; Mans, J; Martin, J P; Marzano, F; Mazumdar, K; McNeil, R R; Mele, S; Merola, L; Meschini, M; Metzger, W J; Mihul, A; Milcent, H; Mirabelli, G; Mnich, J; Mohanty, G B; Muanza, G S; Muijs, A J M; Musicar, B; Musy, M; Nagy, S; Natale, S; Napolitano, M; Nessi-Tedaldi, F; Newman, H; Nisati, A; Nowak, H; Ofierzynski, R A; Organtini, G; Palomares, C; Paolucci, P; Paramatti, R; Passaleva, G; Patricelli, S; Paul, T; Pauluzzi, M; Paus, C; Pauss, Felicitas; Pedace, M; Pensotti, S; Perret-Gallix, D; Petersen, B; Piccolo, D; Pierella, F; Pioppi, M; Piroué, P A; Pistolesi, E; Plyaskin, V; Pohl, M; Pozhidaev, V; Pothier, J; Prokofiev, D O; Prokofev, D; Quartieri, J; Rahal-Callot, G; Rahaman, M A; Raics, P; Raja, N; Ramelli, R; Rancoita, P G; Ranieri, R; Raspereza, A V; Razis, P A; Ren, D; Rescigno, M; Reucroft, S; Riemann, S; Riles, K; Roe, B P; Romero, L; Rosca, A; Rosier-Lees, S; Roth, S; Rosenbleck, C; Roux, B; Rubio, J A; Ruggiero, G; Rykaczewski, H; Sakharov, A; Saremi, S; Sarkar, S; Salicio, J; Sánchez, E; Sanders, M P; Schäfer, C; Shchegelskii, V; Schopper, Herwig Franz; Schotanus, D J; Sciacca, C; Servoli, L; Shevchenko, S; Shivarov, N; Shoutko, V; Shumilov, E; Shvorob, A V; Son, D; Souga, C; Spillantini, P; Steuer, M; Stickland, D P; Stoyanov, B; Strässner, A; Sudhakar, K; Sultanov, G G; Sun, L Z; Sushkov, S; Suter, H; Swain, J D; Szillási, Z; Tang, X W; Tarjan, P; Tauscher, Ludwig; Taylor, L; Tellili, B; Teyssier, D; Timmermans, C; Ting, Samuel C C; Ting, S M; Tonwar, S C; Tóth, J; Tully, C; Tung, K L; Ulbricht, J; Valente, E; Van de Walle, R T; Vásquez, R; Veszpremi, V; Vesztergombi, G; Vetlitskii, I; Vicinanza, D; Viertel, Gert M; Villa, S; Vivargent, M; Vlachos, S; Vodopyanov, I; Vogel, H; Vogt, H; Vorobev, I; Vorobyov, A A; Wadhwa, M; Wang, X L; Wang, Z M; Weber, M; Wienemann, P; Wilkens, H; Wynhoff, S; Xia, L; Xu, Z Z; Yamamoto, J; Yang, B Z; Yang, C G; Yang, H J; Yang, M; Yeh, S C; Zalite, A; Zalite, Yu; Zhang, Z P; Zhao, J; Zhu, G Y; Zhu, R Y; Zhuang, H L; Zichichi, A; Zimmermann, B; Zöller, M
2003-01-01
The three different helicity states of W bosons produced in the reaction e+ e- -> W+ W- -> l nu q q~ at LEP are studied using leptonic and hadronic W decays. Data at centre-of-mass energies \\sqrt s = 183-209 GeV are used to measure the polarisation of W bosons, and its dependence on the W boson production angle. The fraction of longitudinally polarised W bosons is measured to be 0.218 \\pm 0.027 \\pm 0.016 where the first uncertainty is statistical and the second systematic, in agreement with the Standard Model expectation.
1982-01-01
The discovery of the W particle in the UA1 detector from the October-December 1982 run of the proton-antiproton collider, producing a high transverse energy electron (arrowed). This particle is produced back-to-back with 'missing energy', indicative of the emission of an invisible neutrino. The UA1 detector ran on the SPS accelerator at CERN between 1981 and 1993.
Zhan, Xiaoliang; Chen, Zhiwei; Zhang, Miaomiao; Song, Chao
2015-01-01
We carried out observations toward the giant molecular cloud W 37 with the $J = 1 - 0$ transitions of $^{12}$CO, $^{13}$CO, and C$^{18}$O using the 13.7 m single-dish telescope at the Delingha station of Purple Mountain Observatory. Based on the three CO lines, we calculated the column densities, cloud masses for the molecular clouds with radial velocities at around $+20 \\mathrm{km s}^{-1}$. The gas mass of W 37, calculated from $^{13}$CO emission, is $1.7\\times10^5 M_\\odot$, above the criteria of giant molecular cloud. The dense ridge of W 37 is a dense filament, which is supercritical in linear mass ratio. Dense clumps found by C$^{18}$O emission are aligned along the dense ridge with a regular interval about 2.8 pc, similar to the clump separation caused by large-scale `sausage instability'. We confirm the identification of the giant molecular filament (GMF) G 18.0-16.8 by \\cite{2014A&A...568A..73R} and find a new giant filament, G16.5-15.8, located in the west 0.8 degree of G 18.0-16.8. Both GMFs are ...
National Research Council Canada - National Science Library
Lluís Ribas de Pouplana; Adrian Gabriel Torres; albert Rafels-Ybern
2017-01-01
The frozen accident theory of the Genetic Code was a proposal by Francis Crick that attempted to explain the universal nature of the Genetic Code and the fact that it only contains information for twenty amino acids...
DEFF Research Database (Denmark)
Nielsen, Rasmus Refslund
2002-01-01
This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.......This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed....
CERN. Geneva
2017-01-01
Join the path of code linting and discover how it can help you reach higher levels of programming enlightenment. Today we will cover how to embrace code linters to offload cognitive strain on preserving style standards in your code base as well as avoiding error-prone constructs. Additionally, I will show you the journey ahead for integrating several code linters in the programming tools your already use with very little effort.
Multiple LDPC decoding for distributed source coding and video coding
DEFF Research Database (Denmark)
Forchhammer, Søren; Luong, Huynh Van; Huang, Xin
2011-01-01
Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...
Benavente, L; Villanueva, M J; Vega, P; Casado, I; Vidal, J A; Castaño, B; Amorín, M; de la Vega, V; Santos, H; Trigo, A; Gómez, M B; Larrosa, D; Temprano, T; González, M; Murias, E; Calleja, S
2016-04-01
Intravenous thrombolysis with alteplase is an effective treatment for ischaemic stroke when applied during the first 4.5 hours, but less than 15% of patients have access to this technique. Mechanical thrombectomy is more frequently able to recanalise proximal occlusions in large vessels, but the infrastructure it requires makes it even less available. We describe the implementation of code stroke in Asturias, as well as the process of adapting various existing resources for urgent stroke care in the region. By considering these resources, and the demographic and geographic circumstances of our region, we examine ways of reorganising the code stroke protocol that would optimise treatment times and provide the most appropriate treatment for each patient. We distributed the 8 health districts in Asturias so as to permit referral of candidates for reperfusion therapies to either of the 2 hospitals with 24-hour stroke units and on-call neurologists and providing IV fibrinolysis. Hospitals were assigned according to proximity and stroke severity; the most severe cases were immediately referred to the hospital with on-call interventional neurology care. Patient triage was provided by pre-hospital emergency services according to the NIHSS score. Modifications to code stroke in Asturias have allowed us to apply reperfusion therapies with good results, while emphasising equitable care and managing the severity-time ratio to offer the best and safest treatment for each patient as soon as possible. Copyright © 2015 Sociedad Española de Neurología. Published by Elsevier España, S.L.U. All rights reserved.
Frutos-Alfaro, Francisco; Carboni-Mendez, Rodrigo
2015-01-01
A program to generate codes in Fortran and C of the full Magnetohydrodynamic equations is shown. The program used the free computer algebra system software REDUCE. This software has a package called EXCALC, which is an exterior calculus program. The advantage of this program is that it can be modified to include another complex metric or spacetime. The output of this program is modified by means of a LINUX script which creates a new REDUCE program to manipulate the MHD equations to obtain a c...
Rijnieks, Krisjanis
2013-01-01
Presented in an easy to follow, tutorial-style format, this book will lead you step-by-step through the multi-faceted uses of Cinder.""Cinder: Begin Creative Coding"" is for people who already have experience in programming. It can serve as a transition from a previous background in Processing, Java in general, JavaScript, openFrameworks, C++ in general or ActionScript to the framework covered in this book, namely Cinder. If you like quick and easy to follow tutorials that will let yousee progress in less than an hour - this book is for you. If you are searching for a book that will explain al
Kuipers, J; Vermaseren, J A M
2013-01-01
We describe the implementation of output code optimization in the open source computer algebra system FORM. This implementation is based on recently discovered techniques of Monte Carlo tree search to find efficient multivariate Horner schemes, in combination with other optimization algorithms, such as common subexpression elimination. For systems for which no specific knowledge is provided it performs significantly better than other methods we could compare with. Because the method has a number of free parameters, we also show some methods by which to tune them to different types of problems.
Fowler, Austin G; McInnes, Angus L; Rabbani, Alimohammad
2012-01-01
Tailoring a fault-tolerant quantum error correction scheme to a specific physical architecture can be a laborious task. We describe a tool Autotune capable of analyzing and optimizing the classical processing for an arbitrary 2-D qubit architecture making use of arbitrary circuits implementing either the surface code or progressively generated slices of a 3-D topological cluster state with arbitrary stochastic error models for each quantum gate. Autotune is designed to facilitate precise study of the performance of real hardware running topological quantum error correction.
Code Generation with Templates
Arnoldus, Jeroen; Serebrenik, A
2012-01-01
Templates are used to generate all kinds of text, including computer code. The last decade, the use of templates gained a lot of popularity due to the increase of dynamic web applications. Templates are a tool for programmers, and implementations of template engines are most times based on practical experience rather than based on a theoretical background. This book reveals the mathematical background of templates and shows interesting findings for improving the practical use of templates. First, a framework to determine the necessary computational power for the template metalanguage is presen
Gómez-Londoño, Ana María
2013-01-01
El proyecto Memory Code© pertenece al ámbito de las cosmopolíticas del arte contemporáneo porque se ocupa de una relación singular de lo humano (mujer) con lo no-humano (caballo y técnicas)5. Específicamente enmarca el estudio del Binomio Ecuestre: caballo-jinete en el marco de una relación afectiva y de adiestramiento (doma clásica). Dicha relación estuvo compuesta por los siguientes operadores : a) Elementos de con-tacto entre jinete-caballo: espuelas, estribus, fustas b) Sistemas rítmicos ...
Wavefront coding with adaptive optics
Agbana, Temitope E.; Soloviev, Oleg; Bezzubik, Vitalii; Patlan, Vsevolod; Verhaegen, Michel; Vdovin, Gleb
2015-03-01
We have implemented an extended depth of field optical system by wavefront coding with a micromachined membrane deformable mirror. This approach provides a versatile extension to standard wavefront coding based on fixed phase mask. First experimental results validate the feasibility of the use of adaptive optics for variable depth wavefront coding in imaging optical systems.
Authorship Attribution of Source Code
Tennyson, Matthew F.
2013-01-01
Authorship attribution of source code is the task of deciding who wrote a program, given its source code. Applications include software forensics, plagiarism detection, and determining software ownership. A number of methods for the authorship attribution of source code have been presented in the past. A review of those existing methods is…
Strongly-MDS convolutional codes
Gluesing-Luerssen, H; Rosenthal, J; Smarandache, R
2006-01-01
Maximum-distance separable (MDS) convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper, a class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earlies
Laflame, D. T.
1980-01-01
Delay-locked loop tracks pseudonoise codes without introducing dc timing errors, because it is not sensitive to gain imbalance between signal processing arms. "Early" and "late" reference codes pass in combined form through both arms, and each arm acts on both codes. Circuit accomodates 1 dB weaker input signals with tracking ability equal to that of tau-dither loops.
Alderson, Tim L.; Svenja Huntemann
2013-01-01
Singleton-type upper bounds on the minimum Lee distance of general (not necessarily linear) Lee codes over ℤq are discussed. Two bounds known for linear codes are shown to also hold in the general case, and several new bounds are established. Codes meeting these bounds are investigated and in some cases characterised.
Coding Issues in Grounded Theory
Moghaddam, Alireza
2006-01-01
This paper discusses grounded theory as one of the qualitative research designs. It describes how grounded theory generates from data. Three phases of grounded theory--open coding, axial coding, and selective coding--are discussed, along with some of the issues which are the source of debate among grounded theorists, especially between its…
Ezerman, Martianus Frederic; Sole, Patrick
2009-01-01
The weights in MDS codes of length n and dimension k over the finite field GF(q) are studied. Up to some explicit exceptional cases, the MDS codes with parameters given by the MDS conjecture are shown to contain all k weights in the range n-k+1 to n. The proof uses the covering radius of the dual code
Coding Issues in Grounded Theory
Moghaddam, Alireza
2006-01-01
This paper discusses grounded theory as one of the qualitative research designs. It describes how grounded theory generates from data. Three phases of grounded theory--open coding, axial coding, and selective coding--are discussed, along with some of the issues which are the source of debate among grounded theorists, especially between its…
Order functions and evaluation codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pellikaan, Ruud; van Lint, Jack
1997-01-01
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geometry codes as wella s the generalized Reed-Muller codes and the parameters are detremined without using the heavy...
Order functions and evaluation codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pellikaan, Ruud; van Lint, Jack
1997-01-01
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geometry codes as wella s the generalized Reed-Muller codes and the parameters are detremined without using the heavy...... machinery of algebraic geometry....
A class of constacyclic BCH codes and new quantum codes
liu, Yang; Li, Ruihu; Lv, Liangdong; Ma, Yuena
2017-03-01
Constacyclic BCH codes have been widely studied in the literature and have been used to construct quantum codes in latest years. However, for the class of quantum codes of length n=q^{2m}+1 over F_{q^2} with q an odd prime power, there are only the ones of distance δ ≤ 2q^2 are obtained in the literature. In this paper, by a detailed analysis of properties of q2-ary cyclotomic cosets, maximum designed distance δ _{max} of a class of Hermitian dual-containing constacyclic BCH codes with length n=q^{2m}+1 are determined, this class of constacyclic codes has some characteristic analog to that of primitive BCH codes over F_{q^2}. Then we can obtain a sequence of dual-containing constacyclic codes of designed distances 2q^2 2q^2 can be constructed from these dual-containing codes via Hermitian Construction. These newly obtained quantum codes have better code rate compared with those constructed from primitive BCH codes.
ON CLASSICAL BCH CODES AND QUANTUM BCH CODES
Institute of Scientific and Technical Information of China (English)
Xu Yajie; Ma Zhi; Zhang Chunyuan
2009-01-01
It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.
New quantum codes constructed from quaternary BCH codes
Xu, Gen; Li, Ruihu; Guo, Luobin; Ma, Yuena
2016-10-01
In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes.
Structured error recovery for code-word-stabilized quantum codes
Li, Yunfan; Dumer, Ilya; Grassl, Markus; Pryadko, Leonid P.
2010-05-01
Code-word-stabilized (CWS) codes are, in general, nonadditive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical nonlinear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less and employs a separate n-qubit measurement in each test. In this article, we suggest an error grouping technique that allows one to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Wachter, Antonia; Bossert, Martin; Zyablov, Victor
2011-01-01
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined analogous to the extended row distance in Hamming metric. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived and an explicit construction of (P)UM codes based on Gabidulin codes is given, achieving the upper bound for the free rank distance.
Karamian, S A; Chaloun, P; Filossofov, D V; Henzl, V; Henzlova, D; Kalinnikov, V G; Korolev, N A; Lebedev, N A; Novgorodov, A F; Collins, C B; Popescu, I I; Ur, C A
2004-01-01
Yields and cross sections of the radioactive nuclide formation have been measured via induced activity gamma-spectra after irradiation of the natural composition W and enriched ^{186)W targets at Dubna synchrocyclotron. Spallation and fission products have been represented among the detected nuclides. The high-spin isomers of Hf and Lu were produced and the isomer-to-ground state ratios could be estimated. The nuclide yields have also been calculated using the LAHET code at 6 values of proton energy in the range from 100 to 800 MeV both for ^{nat)W and for enriched ^{186)W targets. Measured isotope yields are generally in agreement with the calculations, however, the code is incapable to predict the isomer-to-ground state ratios. In experiment, it has been shown that the ^{177m}Lu, ^{178m2}Hf and ^{179m2}Hf high-spin isomers are produced with 2.5 times higher yield in the 97% enriched ^{186)W target as compared to the ^{nat)W target at identical irradiations. This makes significance for the creation of high-a...
First photometric study of W UMa binary star LU Lac
Liao, W.-P.; Qian, S.-B.; Zhao, E.-G.; Jiang, L.-Q.
2014-08-01
LU Lac is a neglected W UMa binary star in photometric investigations. In this paper, we present BVRI CCD photometric light curves obtained on one night in 2012. The first photometric solutions of this system are computed by using the Wilson-Devinney code. It is shown that LU Lac is a marginal contact W-type system with a degree of contact factor of f=8.9%, a mass ratio of q=2.085 and a high inclination of i=82°.20. From the first analyses of orbital period changes, we found the period variation of the system includes an oscillation (A3=0.0125 days and T3=51.92 years). The cyclic change may be attributed to the light-travel time effect through the presence of a third body.
Romni wśród Romów. Kobieta w kulturze romskiej
Adamczyk, Anita
2011-01-01
The paper discusses the position of women in Romani society. The author presents the var- ious roles a romni (Romani for woman) plays. She refers to the rules of the moral and ethical code (romanipen) that significantly affects female behavior, determines the relationship be- tween females and males, and assigns women a lower position in society than men. The paper also discusses the ‘impurities’ that constitute a specific weapon Romani women can wield against men. The autho...
DEFF Research Database (Denmark)
Fukui, Hironori; Yomo, Hironori; Popovski, Petar
2013-01-01
Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause/receive inter......Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause....../receive interference. The way to deal with this problem in distributed wireless networks is usage of MAC-layer mechanisms that make a spatial reservation of the shared wireless medium, similar to the well-known RTS/CTS in IEEE 802.11 wireless networks. In this paper, we investigate two-way relaying in presence...
Ly, Hung D; Blankenship, Yufei
2011-01-01
This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation of the problem is presented. A coding scheme that combines rate splitting, superposition coding, nested binning and channel prefixing is considered and is shown to achieve the secrecy capacity region of the channel in several scenarios. Specifying these results to both scalar and independent parallel Gaussian channels (under an average individual per-subchannel power constraint), it is shown that the high-security message can be embedded into the low-security message at full rate (as if the low-security message does not exist) without incurring any loss on the overall rate of communication (as if both messages are low-security messages). Extensions to the wiretap channel II setting of Ozarow and Wyner are also considered, where it is shown that "perfect" security embedding...
Supervised Transfer Sparse Coding
Al-Shedivat, Maruan
2014-07-27
A combination of the sparse coding and transfer learn- ing techniques was shown to be accurate and robust in classification tasks where training and testing objects have a shared feature space but are sampled from differ- ent underlying distributions, i.e., belong to different do- mains. The key assumption in such case is that in spite of the domain disparity, samples from different domains share some common hidden factors. Previous methods often assumed that all the objects in the target domain are unlabeled, and thus the training set solely comprised objects from the source domain. However, in real world applications, the target domain often has some labeled objects, or one can always manually label a small num- ber of them. In this paper, we explore such possibil- ity and show how a small number of labeled data in the target domain can significantly leverage classifica- tion accuracy of the state-of-the-art transfer sparse cod- ing methods. We further propose a unified framework named supervised transfer sparse coding (STSC) which simultaneously optimizes sparse representation, domain transfer and classification. Experimental results on three applications demonstrate that a little manual labeling and then learning the model in a supervised fashion can significantly improve classification accuracy.
Clustal W and Clustal X version 2.0.
Larkin, M A; Blackshields, G; Brown, N P; Chenna, R; McGettigan, P A; McWilliam, H; Valentin, F; Wallace, I M; Wilm, A; Lopez, R; Thompson, J D; Gibson, T J; Higgins, D G
2007-11-01
The Clustal W and Clustal X multiple sequence alignment programs have been completely rewritten in C++. This will facilitate the further development of the alignment algorithms in the future and has allowed proper porting of the programs to the latest versions of Linux, Macintosh and Windows operating systems. The programs can be run on-line from the EBI web server: http://www.ebi.ac.uk/tools/clustalw2. The source code and executables for Windows, Linux and Macintosh computers are available from the EBI ftp site ftp://ftp.ebi.ac.uk/pub/software/clustalw2/
DEFF Research Database (Denmark)
Hansen, Jonas; Krigslund, Jeppe; Roetter, Daniel Enrique Lucani
2014-01-01
Packet losses in wireless networks dramatically curbs the performance of TCP. This paper introduces a simple coding shim that aids IP-layer traffic in lossy environments while being transparent to transport layer protocols. The proposed coding approach enables erasure correction while being...... oblivious to the congestion control algorithms of the utilised transport layer protocol. Although our coding shim is indifferent towards the transport layer protocol, we focus on the performance of TCP when ran on top of our proposed coding mechanism due to its widespread use. The coding shim provides gains...
Boswell, Dustin
2011-01-01
As programmers, we've all seen source code that's so ugly and buggy it makes our brain ache. Over the past five years, authors Dustin Boswell and Trevor Foucher have analyzed hundreds of examples of "bad code" (much of it their own) to determine why they're bad and how they could be improved. Their conclusion? You need to write code that minimizes the time it would take someone else to understand it-even if that someone else is you. This book focuses on basic principles and practical techniques you can apply every time you write code. Using easy-to-digest code examples from different languag
2015-01-01
Games for teaching coding have been an educational holy grail since at least the early 1980s. Yet for decades, with games more popular than ever and with the need to teach kids coding having been well-recognized, no blockbuster coding games have arisen (see Chapter 2). Over the years, the research community has made various games for teaching computer science: a survey made by shows that most do not teach coding, and of the ones that do teach coding, most are research prototypes (not produc...
Remarks on generalized toric codes
Little, John B
2011-01-01
This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. The main results show that in some cases, over sufficiently large fields, the minimum distance of the code corresponding to a set S will be the same as that of the code corresponding to the convex hull of S. In an example, we will also discuss a [49,12,28] generalized toric code over GF(8), better than any previously known code according to M. Grassl's online tables, as of July 2011.
Rotated and Scaled Alamouti Coding
Willems, Frans M J
2008-01-01
Repetition-based retransmission is used in Alamouti-modulation [1998] for $2\\times 2$ MIMO systems. We propose to use instead of ordinary repetition so-called "scaled repetition" together with rotation. It is shown that the rotated and scaled Alamouti code has a hard-decision performance which is only slightly worse than that of the Golden code [2005], the best known $2\\times 2$ space-time code. Decoding the Golden code requires an exhaustive search over all codewords, while our rotated and scaled Alamouti code can be decoded with an acceptable complexity however.
On constructing disjoint linear codes
Institute of Scientific and Technical Information of China (English)
ZHANG Weiguo; CAI Mian; XIAO Guozhen
2007-01-01
To produce a highly nonlinear resilient function,the disjoint linear codes were originally proposed by Johansson and Pasalic in IEEE Trans.Inform.Theory,2003,49(2):494-501.In this paper,an effective method for finding a set of such disjoint linear codes is presented.When n≥2k,we can find a set of[n,k] disjoint linear codes with joint linear codes exists with cardinality at least 2.We also describe a result on constructing a set of [n,k] disjoint linear codes with minimum distance at least some fixed positive integer.
Energy Technology Data Exchange (ETDEWEB)
Al-abyad, Mogahed; Mohamed, Gehan Y. [Atomic Energy Authority, Cairo (Egypt). Experimental Nuclear Physics Dept.
2017-08-01
Neutron capture cross section (σ{sub 0}) and resonance integral (I{sub 0}) of the reaction {sup 186}W(n,γ){sup 187}W were measured experimentally using the research reactor (ETRR-2) and an Am-Be neutron source, also calculated using TALYS-1.6 code. The present results of σ{sub 0} are (39.08±2.6, 38.75±0.98 and 38.33 barn) and I{sub 0} are (418.5±74, 439.3±36 and 445.5 barn) by using the reactor, neutron source and TALYS-1.6, respectively. The present results are in acceptable agreement with most of the previous experimental and evaluated data as well as the theoretical calculations.
Teles, Patricia Rebello
2015-01-01
We study the possibilities for the measurement of two-photon production of the Higgs boson (in the $b \\bar{b}$ decay channel), and of $W^{+}W^{-}$ pairs (decaying into four jets) in $e^{+}e^{-}$ collisions at the the Future Circular Collider (FCC-ee). The processes are simulated with the PYTHIA and MADGRAPH 5 Monte Carlo codes, using the effective photon approximation for the $e^{+}e^{-}$ photon fluxes, at center-of-mass energies $\\sqrt{s} = $ 160 GeV and 240 GeV. The analyses include electron-positron tagging, realistic acceptance and reconstruction efficiencies for the final-state jets, and selection criteria to remove the backgrounds. Observation of both channels is achievable with the expected few ab$^{-1}$ integrated luminosities at FCC-ee.
Orthogonal coding of object location.
Knutsen, Per Magne; Ahissar, Ehud
2009-02-01
It has been argued whether internal representations are encoded using a universal ('the neural code') or multiple codes. Here, we review a series of experiments that demonstrate that tactile encoding of object location via whisking employs an orthogonal, triple-code scheme. Rats, and other rodents, actively move the whiskers back and forth to localize and identify objects. Neural recordings from primary sensory afferents, along with behavioral observations, demonstrate that vertical coordinates of contacted objects are encoded by the identity of activated afferents, horizontal coordinates by the timing of activation and radial coordinates by the intensity of activation. Because these codes are mutually independent, the three-dimensional location of an object could, in principle, be encoded by individual afferents during single whisker-object contacts. One advantage of such a same-neuron-different-codes scheme over the traditionally assumed same-code-different-neurons scheme is a reduction of code ambiguity that, in turn, simplifies decoding circuits.
Making your code citable with the Astrophysics Source Code Library
Allen, Alice; DuPrie, Kimberly; Schmidt, Judy; Berriman, G. Bruce; Hanisch, Robert J.; Mink, Jessica D.; Nemiroff, Robert J.; Shamir, Lior; Shortridge, Keith; Taylor, Mark B.; Teuben, Peter J.; Wallin, John F.
2016-01-01
The Astrophysics Source Code Library (ASCL, ascl.net) is a free online registry of codes used in astronomy research. With nearly 1,200 codes, it is the largest indexed resource for astronomy codes in existence. Established in 1999, it offers software authors a path to citation of their research codes even without publication of a paper describing the software, and offers scientists a way to find codes used in refereed publications, thus improving the transparency of the research. It also provides a method to quantify the impact of source codes in a fashion similar to the science metrics of journal articles. Citations using ASCL IDs are accepted by major astronomy journals and if formatted properly are tracked by ADS and other indexing services. The number of citations to ASCL entries increased sharply from 110 citations in January 2014 to 456 citations in September 2015. The percentage of code entries in ASCL that were cited at least once rose from 7.5% in January 2014 to 17.4% in September 2015. The ASCL's mid-2014 infrastructure upgrade added an easy entry submission form, more flexible browsing, search capabilities, and an RSS feeder for updates. A Changes/Additions form added this past fall lets authors submit links for papers that use their codes for addition to the ASCL entry even if those papers don't formally cite the codes, thus increasing the transparency of that research and capturing the value of their software to the community.
Resummation of jet veto logarithms at N3LLa+NNLO for W+W- production at the LHC
Dawson, S.; Jaiswal, P.; Li, Ye; Ramani, Harikrishnan; Zeng, Mao
2016-12-01
We compute the resummed on-shell W+W- production cross section under a jet veto at the LHC to partial N3LL order matched to the fixed-order NNLO result. Differential NNLO cross sections are obtained from an implementation of qT subtraction in Sherpa. The two-loop virtual corrections to the q q ¯→W+W- amplitude, used in both fixed-order and resummation predictions, are extracted from the public code qqvvamp. We perform resummation using soft collinear effective theory, with approximate beam functions where only the logarithmic terms are included at two-loop. In addition to scale uncertainties from the hard matching scale and the factorization scale, rapidity scale variations are obtained within the analytic regulator approach. Our resummation results show a decrease in the jet veto cross section compared to NNLO fixed-order predictions, with reduced scale uncertainties compared to NNLL +NLO resummed predictions. We include the loop-induced g g contribution with jet veto resummation to NLL +LO . The prediction shows good agreement with recent LHC measurements.
Resummation of Jet Veto Logarithms at partial N$^3$LL + NNLO for $W^+W^-$ Production at the LHC
Energy Technology Data Exchange (ETDEWEB)
Dawson, S. [Brookhaven Natl. Lab.; Jaiswal, P. [Brown U.; Li, Ye [Fermilab; Ramani, H. [YITP, Stony Brook; Zeng, Mao [UCLA
2016-06-03
We compute the resummed on-shell $W^+ W^-$ production cross section under a jet-veto at the LHC to partial N$^3$LL order matched to the fixed order NNLO result. Differential NNLO cross sections are obtained from an implementation of $q_T$ subtraction in Sherpa. The two-loop virtual corrections to the $q \\bar q \\rightarrow W^+ W^-$ amplitude, used in both fixed order and resummation predictions, are extracted from the public code {\\tt qqvvamp}. We perform resummation using soft collinear effective theory (SCET), with approximate beam functions where only the logarithmic terms are included at two-loop. In addition to scale uncertainties from the hard matching scale and the factorization scale, rapidity scale variations are obtained within the analytic regulator approach. Our resummation results show a decrease in the jet-veto cross-section compared to NNLO fixed order predictions, with reduced scale uncertainties compared to NNLL+NLO resummed predictions. We include the loop-induced $gg$ contribution with jet veto resummation to NLL+LO. The prediction shows good agreement with recent LHC measurements.
Tárkányi, F.; Ditrói, F.; Takács, S.; Hermanne, A.
2017-01-01
New experimental excitation functions for proton induced reactions on natW are presented in the 32-65 MeV energy range. The cross-sections for natW(p,xn)186,184m,184g,183, 182m,182g,181Re, natW(p,x)178W, natW(p,x)183,182, 180m, 177,176,175Ta, 175Hf and 177Lu were measured via an activation method by using a stacked-foil irradiation technique and high resolution gamma-ray spectroscopy. The results were compared with predicted values obtained with the nuclear reaction code TALYS (results taken from the TENDL 2014 and TENDL 2015 on-line libraries). Production routes of the medically relevant radionuclides 186Re, the 178W → 178Ta generator and 181W are discussed.
Energy Technology Data Exchange (ETDEWEB)
Tárkányi, F.; Ditrói, F.; Takács, S. [Institute of Nuclear Research (ATOMKI), Debrecen (Hungary); Hermanne, A., E-mail: aherman@vub.ac.be [Cyclotron Department, Vrije Universiteit Brussel, (VUB), Brussels (Belgium)
2017-01-15
New experimental excitation functions for proton induced reactions on {sup nat}W are presented in the 32–65 MeV energy range. The cross-sections for {sup nat}W(p,xn){sup 186,184m,184g,183,} {sup 182m,182g,181}Re, {sup nat}W(p,x){sup 178}W{sup ,} {sup nat}W(p,x){sup 183,182,} {sup 180m,} {sup 177,176,175}Ta, {sup 175}Hf and {sup 177}Lu were measured via an activation method by using a stacked-foil irradiation technique and high resolution gamma-ray spectroscopy. The results were compared with predicted values obtained with the nuclear reaction code TALYS (results taken from the TENDL 2014 and TENDL 2015 on-line libraries). Production routes of the medically relevant radionuclides {sup 186}Re, the {sup 178}W → {sup 178}Ta generator and {sup 181}W are discussed.
Abdominoplasty by the W technique.
Regnault, P
1975-03-01
The W abdominoplasty is an excellent esthetic operation (Figs. 7-12), based on several important principles. 1. The drawing of the W with its 3 angles gives 3 good landmarks for a symmetrical result. The mid-angle may be cut off by one to two cm at the time of closure, if it seems too sharp. 2. By making the incision inside the hairline, there is no increase in the height of the pubic hair. 3. By removing more tissues laterally than in the midline the traction on the flap is equalized, thus giving a nice draping on the hips. 4. The operation equalizes the wound edges and avoids producing skin folds. 5. Complete removal of the skin and fat between the umbilicus and the pubis is always possible if the operating table is put in a proper position for closure. No vertical scar has ever been necessary in our series. 6. The direction of the final scar, although different from the primary incision due to the traction, remains low-just above the inguinal fold and approximately in the same direction, in the area concealed by small bathing suits. 7. The maximum stretching of the abdominal skin favors a lasting result.
Directory of Open Access Journals (Sweden)
Benjamin Gross
2013-02-01
Full Text Available During the 2000 Presidential election between George H. W. Bush and Al Gore, journalists often used the terms blue states and red states to describe the political landscape within the United States. This article studies the framing of these terms during the years 2004 through 2007. Using latent and manifest qualitative content analyses, six different news media frames were found in a sample of 337 newspaper articles. Two hypotheses were also tested indicating that framing patterns varied slightly by time period and article types. However, the argument that increased levels of political polarization in the United States have been created by predominantly conflict-oriented coverage may not be true. Instead, these terms became journalistic heuristics that were used to organize how people think about politics in a way that fit with contemporary media practices, and there is no single agreed upon interpretation of these terms within this reporting.
W. W. Hansen, Microwave Physics, and Silicon Valley
Leeson, David
2009-03-01
The Stanford physicist W. W. Hansen (b. 1909, AB '29 and PhD '32, MIT post-doc 1933-4, Prof. physics '35-'49, d. 1949) played a seminal role in the development of microwave electronics. His contributions underlay Silicon Valley's postwar ``microwave'' phase, when numerous companies, acknowledging their unique scientific debt to Hansen, flourished around Stanford University. As had the prewar ``radio'' companies, they furthered the regional entrepreneurial culture and prepared the ground for the later semiconductor and computer developments we know as Silicon Valley. In the 1930's, Hansen invented the cavity resonator. He applied this to his concept of the radio-frequency (RF) linear accelerator and, with the Varian brothers, to the invention of the klystron, which made microwave radar practical. As WWII loomed, Hansen was asked to lecture on microwaves to the physicists recruited to the MIT Radiation Laboratory. Hansen's ``Notes on Microwaves,'' the Rad Lab ``bible'' on the subject, had a seminal impact on subsequent works, including the Rad Lab Series. Because of Hansen's failing health, his postwar work, and MIT-Stanford rivalries, the Notes were never published, languishing as an underground classic. I have located remaining copies, and will publish the Notes with a biography honoring the centenary of Hansen's birth. After the war, Hansen founded Stanford's Microwave Laboratory to develop powerful klystrons and linear accelerators. He collaborated with Felix Bloch in the discovery of nuclear magnetic resonance. Hansen experienced first-hand Stanford's evolution from its depression-era physics department to corporate, then government funding. Hansen's brilliant career was cut short by his death in 1949, after his induction in the National Academy of Sciences. His ideas were carried on in Stanford's two-mile long linear accelerator and the development of Silicon Valley.
Homomorphic encryption from codes
Bogdanov, Andrej
2011-01-01
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encryption schemes, where the message is hidden in the noisy part of the ciphertext, our scheme carries the message in the affine part of the transformation and applies noise only to achieve security. Our scheme can tolerate noise of arbitrary magnitude, as long as the noise vector has sufficiently small hamming weight (and its entries are independent). Our design achieves "proto-homomorphic" properties in an elementary manner: message addition and multiplication are emulated by pointwise addition and multiplication of the ciphertext vectors. Moreover, the extremely simple nature of our decryption makes the scheme easily amenable to bootstrapping. However, some complications are caused by the inherent presence of noticeable encryption error. Our main technical contribution is the development of two new techniques for...
LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources
Directory of Open Access Journals (Sweden)
Javier Garcia-Frias
2005-05-01
Full Text Available We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes for channel coding and joint source-channel coding of multiterminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed. Several decoding possibilities are investigated, compared, and evaluated. For different types of noisy channels and correlation models, the resulting performance is very close to the theoretical limits.
Improved lossless intra coding for next generation video coding
Vanam, Rahul; He, Yuwen; Ye, Yan
2016-09-01
Recently, there have been efforts by the ITU-T VCEG and ISO/IEC MPEG to further improve the compression performance of the High Efficiency Video Coding (HEVC) standard for developing a potential next generation video coding standard. The exploratory codec software of this potential standard includes new coding tools for inter and intra coding. In this paper, we present a new intra prediction mode for lossless intra coding. Our new intra mode derives a prediction filter for each input pixel using its neighboring reconstructed pixels, and applies this filter to the nearest neighboring reconstructed pixels to generate a prediction pixel. The proposed intra mode is demonstrated to improve the performance of the exploratory software for lossless intra coding, yielding a maximum and average bitrate savings of 4.4% and 2.11%, respectively.
Selection of Code and Interleaver for Turbo Coding
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
1998-01-01
The selection of component codes for turbo coding has often been based on the performance at high SNR's. However, we will argue that the selection mainly should be based on the performance at low SNR's, i.e. the convergence properties. Further, we will present a way to construct interleavers...... that significantly improve the performance of the turbo coding scheme at high SNR's, i.e. lowers the error floor...
Superimposed Code Theorectic Analysis of DNA Codes and DNA Computing
2010-03-01
Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences ”, 2008 IEEE Proceedings of International Symposium on Information Theory, pp. 2292...5, June 2008, pp. 525-34. 32 28. A. Macula, et al., “Random Coding Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences ”, 2008...combinatorial method of bio-memory design and detection that encodes item or process information as numerical sequences represented in DNA. ComDMem is a
76 FR 72025 - Noise Compatibility Program Notice for W.M. Kellogg Airport, Battle Creek, MI
2011-11-21
... Federal Aviation Administration Noise Compatibility Program Notice for W.M. Kellogg Airport, Battle Creek... Administration (FAA) announces its determination that the noise exposure maps submitted by the City of Battle... Safety and Noise Abatement Act, herein after referred to as ``the Act'') and 14 Code of...
Bit-Interleaved Coded Multiple Beamforming with Perfect Coding
Li, Boyu
2010-01-01
When the channel state information is known by the transmitter as well as the receiver, beamforming techniques that employ Singular Value Decomposition (SVD) are commonly used in Multiple-Input Multiple-Output (MIMO) systems. Without channel coding, when a single symbol is transmitted, these systems achieve the full diversity order. Whereas, this property is lost when multiple symbols are simultaneously transmitted. Full diversity can be restored when channel coding is added, as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS =< 1. Moreover, by adding a proper constellation precoder, full diversity can be achieved for both uncoded and coded SVD systems, e.g., Fully Precoded Multiple Beamforming (FPMB) and Bit-Interleaved Coded Multiple Beamforming with Full Precoding (BICMB-FP). Perfect Space-Time Block Code (PSTBC) is a full-rate full-diversity space-time code, which achieves maximum coding gain for MIMO systems. Previously, Perfect Coded Multiple Beamforming (P...
Practices in Code Discoverability: Astrophysics Source Code Library
Allen, Alice; Nemiroff, Robert J; Shamir, Lior
2012-01-01
Here we describe the Astrophysics Source Code Library (ASCL), which takes an active approach to sharing astrophysical source code. ASCL's editor seeks out both new and old peer-reviewed papers that describe methods or experiments that involve the development or use of source code, and adds entries for the found codes to the library. This approach ensures that source codes are added without requiring authors to actively submit them, resulting in a comprehensive listing that covers a significant number of the astrophysics source codes used in peer-reviewed studies. The ASCL now has over 340 codes in it and continues to grow. In 2011, the ASCL (http://ascl.net) has on average added 19 new codes per month. An advisory committee has been established to provide input and guide the development and expansion of the new site, and a marketing plan has been developed and is being executed. All ASCL source codes have been used to generate results published in or submitted to a refereed journal and are freely available ei...
Measurement of the W boson mass
Energy Technology Data Exchange (ETDEWEB)
Abazov, Victor Mukhamedovich; /Dubna, JINR; Abbott, Braden Keim; /Oklahoma U.; Abolins, Maris A.; /Michigan State U.; Acharya, Bannanje Sripath; /Tata Inst.; Adams, Mark Raymond; /Illinois U., Chicago; Adams, Todd; /Florida State U.; Aguilo, Ernest; /Alberta U. /Simon Fraser U. /York U., Canada /McGill U.; Ahsan, Mahsana; /Kansas State U.; Alexeev, Guennadi D.; /Dubna, JINR; Alkhazov, Georgiy D.; /St. Petersburg, INP; Alton, Andrew K.; /Michigan U. /Augustana Coll., Sioux Falls /Northeastern U.
2009-08-01
The authors present a measurement of the W boson mass in W {yields} e{nu} decays using 1 fb{sup -1} of data collected with the D0 detector during Run II of the Fermilab Tevatron collider. With a sample of 499830 W {yields} e{nu} candidate events, they measure M{sub W} = 80.401 {+-} 0.043 GeV. This is the most precise measurement from a single experiment.
Directory of Open Access Journals (Sweden)
Bogusława Bek-Gaik
2013-04-01
Full Text Available Inne całkowite dochody to nowa kategoria ekonomiczna, dopiero testowana w praktyce gospodarczej. Oczywi-sty wydaje się fakt zapotrzebowania na badanie aspektów praktycznych dotyczących prezentacji innych całkowitych dochodów w sprawozdaniu z dochodów całkowitych. Zasadniczym celem niniejszego artykułu jest zbadanie, jaką formę prezentacji innych całkowitych dochodów w sprawozdaniu z całkowitych dochodów wybrały polskie spółki giełdowe, jaka jest istotność wyniku całkowitego oraz średnia liczba pozycji ujawnia-nych w ramach innych zysków całkowitych przez badane spółki publiczne (struktura innych zysków całko-witych. Metodą badawczą zastosowaną w artykule były studia literaturowe, analiza regulacji dotyczących sprawozdania z całkowitych dochodów (głównie MSR 1 oraz analiza sprawozdań finansowych sporządzo-nych zgodnie z Międzynarodowymi Standardami Sprawozdawczości Finansowej wybranych polskich spółek publicznych w latach 2009–2011. Wyniki badań wskazują, że w praktyce mamy do czynienia z indywidual-nym podejściem do zasad prezentacji informacji o innych całkowitych dochodach. Niewątpliwą wadą takie-go sposobu prezentacji jest brak możliwości porównywania poszczególnych kategorii sprawozdań między spółkami; analiza porównawcza jest pracochłonna i wymaga poszukiwania danych w wielu notach.
Measurement of the W boson mass.
Abazov, V M; Abbott, B; Abolins, M; Acharya, B S; Adams, M; Adams, T; Aguilo, E; Ahsan, M; Alexeev, G D; Alkhazov, G; Alton, A; Alverson, G; Alves, G A; Ancu, L S; Andeen, T; Anzelc, M S; Aoki, M; Arnoud, Y; Arov, M; Arthaud, M; Askew, A; Asman, B; Atramentov, O; Avila, C; Backusmayes, J; Badaud, F; Bagby, L; Baldin, B; Bandurin, D V; Banerjee, S; Barberis, E; Barfuss, A-F; Bargassa, P; Baringer, P; Barreto, J; Bartlett, J F; Bassler, U; Bauer, D; Beale, S; Bean, A; Begalli, M; Begel, M; Belanger-Champagne, C; Bellantoni, L; Bellavance, A; Benitez, J A; Beri, S B; Bernardi, G; Bernhard, R; Bertram, I; Besançon, M; Beuselinck, R; Bezzubov, V A; Bhat, P C; Bhatnagar, V; Blazey, G; Blessing, S; Bloom, K; Boehnlein, A; Boline, D; Bolton, T A; Boos, E E; Borissov, G; Bose, T; Brandt, A; Brock, R; Brooijmans, G; Bross, A; Brown, D; Bu, X B; Buchholz, D; Buehler, M; Buescher, V; Bunichev, V; Burdin, S; Burnett, T H; Buszello, C P; Calfayan, P; Calpas, B; Calvet, S; Cammin, J; Carrasco-Lizarraga, M A; Carrera, E; Carvalho, W; Casey, B C K; Castilla-Valdez, H; Chakrabarti, S; Chakraborty, D; Chan, K M; Chandra, A; Cheu, E; Cho, D K; Cho, S W; Choi, S; Choudhary, B; Christoudias, T; Cihangir, S; Claes, D; Clutter, J; Cooke, M; Cooper, W E; Corcoran, M; Couderc, F; Cousinou, M-C; Cutts, D; Cwiok, M; Das, A; Davies, G; De, K; de Jong, S J; De La Cruz-Burelo, E; Devaughan, K; Déliot, F; Demarteau, M; Demina, R; Denisov, D; Denisov, S P; Desai, S; Diehl, H T; Diesburg, M; Dominguez, A; Dorland, T; Dubey, A; Dudko, L V; Duflot, L; Duggan, D; Duperrin, A; Dutt, S; Dyshkant, A; Eads, M; Edmunds, D; Ellison, J; Elvira, V D; Enari, Y; Eno, S; Escalier, M; Evans, H; Evdokimov, A; Evdokimov, V N; Facini, G; Ferapontov, A V; Ferbel, T; Fiedler, F; Filthaut, F; Fisher, W; Fisk, H E; Fortner, M; Fox, H; Fu, S; Fuess, S; Gadfort, T; Galea, C F; Garcia-Bellido, A; Gavrilov, V; Gay, P; Geist, W; Geng, W; Gerber, C E; Gershtein, Y; Gillberg, D; Ginther, G; Gómez, B; Goussiou, A; Grannis, P D; Greder, S; Greenlee, H; Greenwood, Z D; Gregores, E M; Grenier, G; Gris, Ph; Grivaz, J-F; Grohsjean, A; Grünendahl, S; Grünewald, M W; Guo, F; Guo, J; Gutierrez, G; Gutierrez, P; Haas, A; Haefner, P; Hagopian, S; Haley, J; Hall, I; Hall, R E; Han, L; Harder, K; Harel, A; Hauptman, J M; Hays, J; Hebbeker, T; Hedin, D; Hegeman, J G; Heinson, A P; Heintz, U; Hensel, C; Heredia-De La Cruz, I; Herner, K; Hesketh, G; Hildreth, M D; Hirosky, R; Hoang, T; Hobbs, J D; Hoeneisen, B; Hohlfeld, M; Hossain, S; Houben, P; Hu, Y; Hubacek, Z; Huske, N; Hynek, V; Iashvili, I; Illingworth, R; Ito, A S; Jabeen, S; Jaffré, M; Jain, S; Jakobs, K; Jamin, D; Jesik, R; Johns, K; Johnson, C; Johnson, M; Johnston, D; Jonckheere, A; Jonsson, P; Juste, A; Kajfasz, E; Karmanov, D; Kasper, P A; Katsanos, I; Kaushik, V; Kehoe, R; Kermiche, S; Khalatyan, N; Khanov, A; Kharchilava, A; Kharzheev, Y N; Khatidze, D; Kirby, M H; Kirsch, M; Klima, B; Kohli, J M; Konrath, J-P; Kozelov, A V; Kraus, J; Kuhl, T; Kumar, A; Kupco, A; Kurca, T; Kuzmin, V A; Kvita, J; Lacroix, F; Lam, D; Lammers, S; Landsberg, G; Lebrun, P; Lee, H S; Lee, W M; Leflat, A; Lellouch, J; Li, L; Li, Q Z; Lietti, S M; Lim, J K; Lincoln, D; Linnemann, J; Lipaev, V V; Lipton, R; Liu, Y; Liu, Z; Lobodenko, A; Lokajicek, M; Love, P; Lubatti, H J; Luna-Garcia, R; Lyon, A L; Maciel, A K A; Mackin, D; Mättig, P; Magaña-Villalba, R; Mal, P K; Malik, S; Malyshev, V L; Maravin, Y; Martin, B; McCarthy, R; McGivern, C L; Meijer, M M; Melnitchouk, A; Mendoza, L; Menezes, D; Mercadante, P G; Merkin, M; Merritt, K W; Meyer, A; Meyer, J; Mondal, N K; Montgomery, H E; Moore, R W; Moulik, T; Muanza, G S; Mulhearn, M; Mundal, O; Mundim, L; Nagy, E; Naimuddin, M; Narain, M; Neal, H A; Negret, J P; Neustroev, P; Nilsen, H; Nogima, H; Novaes, S F; Nunnemann, T; Obrant, G; Ochando, C; Onoprienko, D; Orduna, J; Oshima, N; Osman, N; Osta, J; Otec, R; Otero Y Garzón, G J; Owen, M; Padilla, M; Padley, P; Pangilinan, M; Parashar, N; Park, S-J; Park, S K; Parsons, J; Partridge, R; Parua, N; Patwa, A; Penning, B; Perfilov, M; Peters, K; Peters, Y; Pétroff, P; Piegaia, R; Piper, J; Pleier, M-A; Podesta-Lerma, P L M; Podstavkov, V M; Pogorelov, Y; Pol, M-E; Polozov, P; Popov, A V; Prewitt, M; Protopopescu, S; Qian, J; Quadt, A; Quinn, B; Rakitine, A; Rangel, M S; Ranjan, K; Ratoff, P N; Renkel, P; Rich, P; Rijssenbeek, M; Ripp-Baudot, I; Rizatdinova, F; Robinson, S; Rominsky, M; Royon, C; Rubinov, P; Ruchti, R; Safronov, G; Sajot, G; Sánchez-Hernández, A; Sanders, M P; Sanghi, B; Savage, G; Sawyer, L; Scanlon, T; Schaile, D; Schamberger, R D; Scheglov, Y; Schellman, H; Schliephake, T; Schlobohm, S; Schwanenberger, C; Schwienhorst, R; Sekaric, J; Severini, H; Shabalina, E; Shamim, M; Shary, V; Shchukin, A A; Shivpuri, R K; Siccardi, V; Simak, V; Sirotenko, V; Skubic, P; Slattery, P; Smirnov, D; Snow, G R; Snow, J; Snyder, S; Söldner-Rembold, S; Sonnenschein, L; Sopczak, A; Sosebee, M; Soustruznik, K; Spurlock, B; Stark, J; Stolin, V; Stoyanova, D A; Strandberg, J; Strang, M A; Strauss, E; Strauss, M; Ströhmer, R; Strom, D; Stutte, L; Sumowidagdo, S; Svoisky, P; Takahashi, M; Tanasijczuk, A; Taylor, W; Tiller, B; Titov, M; Tokmenin, V V; Torchiani, I; Tsybychev, D; Tuchming, B; Tully, C; Tuts, P M; Unalan, R; Uvarov, L; Uvarov, S; Uzunyan, S; van den Berg, P J; Van Kooten, R; van Leeuwen, W M; Varelas, N; Varnes, E W; Vasilyev, I A; Verdier, P; Vertogradov, L S; Verzocchi, M; Vesterinen, M; Vilanova, D; Vint, P; Vokac, P; Wagner, R; Wahl, H D; Wang, M H L S; Warchol, J; Watts, G; Wayne, M; Weber, G; Weber, M; Welty-Rieger, L; Wenger, A; Wetstein, M; White, A; Wicke, D; Williams, M R J; Wilson, G W; Wimpenny, S J; Wobisch, M; Wood, D R; Wyatt, T R; Xie, Y; Xu, C; Yacoob, S; Yamada, R; Yang, W-C; Yasuda, T; Yatsunenko, Y A; Ye, Z; Yin, H; Yip, K; Yoo, H D; Youn, S W; Yu, J; Zeitnitz, C; Zelitch, S; Zhao, T; Zhou, B; Zhu, J; Zielinski, M; Zieminska, D; Zivkovic, L; Zutshi, V; Zverev, E G
2009-10-02
We present a measurement of the W boson mass in W-->e(nu) decays using 1 fb-1 of data collected with the D0 detector during Run II of the Fermilab Tevatron collider. With a sample of 499830 W-->e(nu) candidate events, we measure M(W)=80.401+/-0.043 GeV. This is the most precise measurement from a single experiment.
Beem, Christopher; van Rees, Balt C
2015-01-01
Six-dimensional conformal field theories with $(2,0)$ supersymmetry are shown to possess a protected sector of operators and observables that are isomorphic to a two-dimensional chiral algebra. We argue that the chiral algebra associated to a $(2,0)$ theory labelled by the simply-laced Lie algebra $\\mathfrak{g}$ is precisely the W algebra of type $\\mathfrak{g}$, for a specific value of the central charge. Simple examples of observables that are made accessible by this correspondence are the three-point functions of half-BPS operators. For the $A_n$ series, we compare our results at large $n$ to those obtained using the holographic dual description and find perfect agreement. We further find protected chiral algebras that appear on the worldvolumes of codimension two defects in $(2,0)$ SCFTs. This construction has likely implications for understanding the microscopic origin of the AGT correspondence.
Elements of algebraic coding systems
Cardoso da Rocha, Jr, Valdemar
2014-01-01
Elements of Algebraic Coding Systems is an introductory textto algebraic coding theory. In the first chapter, you'll gain insideknowledge of coding fundamentals, which is essential for a deeperunderstanding of state-of-the-art coding systems.This book is a quick reference for those who are unfamiliar withthis topic, as well as for use with specific applications such as cryptographyand communication. Linear error-correcting block codesthrough elementary principles span eleven chapters of the text.Cyclic codes, some finite field algebra, Goppa codes, algebraic decodingalgorithms, and applications in public-key cryptography andsecret-key cryptography are discussed, including problems and solutionsat the end of each chapter. Three appendices cover the Gilbertbound and some related derivations, a derivation of the Mac-Williams' identities based on the probability of undetected error,and two important tools for algebraic decoding-namely, the finitefield Fourier transform and the Euclidean algorithm for polynomials.
Applications of Derandomization Theory in Coding
Cheraghchi, Mahdi
2011-01-01
Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate or reduce the need for randomness in such randomized constructions. In this thesis, we explore some applications of the fundamental notions in derandomization theory to problems outside the core of theoretical computer science, and in particular, certain problems related to coding theory. First, we consider the wiretap channel problem which involves a communication system in which an intruder can eavesdrop a limited portion of the transmissions, and construct efficient and information-theoretically optimal communication protocols for this model. Then we consider the combinatorial group testing problem. In this classical problem, one aims to determine a set of defective items within a large population by asking a number of queries, where each query reveals w...
BILINEAR FORMS AND LINEAR CODES
Institute of Scientific and Technical Information of China (English)
高莹
2004-01-01
Abraham Lempel et al[1] made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.
Error correcting coding for OTN
DEFF Research Database (Denmark)
Justesen, Jørn; Larsen, Knud J.; Pedersen, Lars A.
2010-01-01
Forward error correction codes for 100 Gb/s optical transmission are currently receiving much attention from transport network operators and technology providers. We discuss the performance of hard decision decoding using product type codes that cover a single OTN frame or a small number...... of such frames. In particular we argue that a three-error correcting BCH is the best choice for the component code in such systems....
High performance scalable image coding
Institute of Scientific and Technical Information of China (English)
Gan Tao; He Yanmin; Zhu Weile
2007-01-01
A high performance scalable image coding algorithm is proposed. The salient features of this algorithm are the ways to form and locate the significant clusters. Thanks to the list structure, the new coding algorithm achieves fine fractional bit-plane coding with negligible additional complexity. Experiments show that it performs comparably or better than the state-of-the-art coders. Furthermore, the flexible codec supports both quality and resolution scalability, which is very attractive in many network applications.
2015-10-01
UNCLASSIFIED AD-E403 688 Technical Report ARWSE-TR-14025 CODE SPEED MEASURING FOR VC++ Tom Nealis...TYPE Final 3. DATES COVERED (From – To) 4. TITLE AND SUBTITLE CODE SPEED MEASURING FOR VC++ 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c...ABSTRACT It’s often important to know how fast a snippet of code executes. This information allows the coder to make important decisions
Directory of Open Access Journals (Sweden)
Vukobratović Dejan
2006-01-01
Full Text Available Construction of short-length LDPC codes with good, both waterfall and error-floor, behavior is still an attractive research problem. Recently proposed construction algorithms in this field are based on remarkably simple ideas, but yet, their effectiveness can still be questioned. In this paper we investigate a novel measure of goodness of a given LDPC code namely its ACE spectrum, based on a previously introduced ACE metrics associated with each cycle in LDPC code graph.
QR code for medical information uses.
Fontelo, Paul; Liu, Fang; Ducut, Erick G
2008-11-06
We developed QR code online tools, simulated and tested QR code applications for medical information uses including scanning QR code labels, URLs and authentication. Our results show possible applications for QR code in medicine.
Radiative corrections to W+jet production at hadron colliders with a leptonic decay of the W boson
Energy Technology Data Exchange (ETDEWEB)
Kasprzik, Tobias
2009-08-31
integrand level to allow for a stable numerical evaluation. Within this thesis, we extend this method to also enable the consistent treatment of non-collinear-safe observables related to photon radiation off muons. Additionally, the calculation of radiative corrections to processes involving an unstable W boson leads to the problem that a finite particle width has to be consistently introduced in the calculation. If this is done carelessly, gauge invariance might be destroyed even at the leading order of the perturbative series. Thus, we work in the complex-mass scheme to account for a proper inclusion of a finite W-boson width in our calculation. This particular scheme respects gauge invariance and can be applied in all phase-space regions. Our results are implemented into a flexible Monte Carlo code that allows for the calculation of total cross sections and differential distributions, where in principle any event-selection criteria that might be of physical interest can be applied. In the numerical analysis we observe large negative electroweak corrections at large transverse momenta that can be attributed to universal Sudakov logarithms. Moreover, relevant deviations in the shape of the transverse-mass distribution of the final-state lepton pair near the resonance are induced that are important with regard to a precise determination of the W mass. Thus, our code can provide crucial information as a tool for the analysis of LHC data. (orig.)
Astrophysics Source Code Library Enhancements
Hanisch, Robert J; Berriman, G Bruce; DuPrie, Kimberly; Mink, Jessica; Nemiroff, Robert J; Schmidt, Judy; Shamir, Lior; Shortridge, Keith; Taylor, Mark; Teuben, Peter J; Wallin, John
2014-01-01
The Astrophysics Source Code Library (ASCL; ascl.net) is a free online registry of codes used in astronomy research; it currently contains over 900 codes and is indexed by ADS. The ASCL has recently moved a new infrastructure into production. The new site provides a true database for the code entries and integrates the WordPress news and information pages and the discussion forum into one site. Previous capabilities are retained and permalinks to ascl.net continue to work. This improvement offers more functionality and flexibility than the previous site, is easier to maintain, and offers new possibilities for collaboration. This presentation covers these recent changes to the ASCL.
Multiple Beamforming with Perfect Coding
Li, Boyu
2011-01-01
In Singular Value Decomposition (SVD) beamforming, without channel coding, there is a trade-off between full diversity and full multiplexing. Adding channel coding, full diversity and full multiplexing can be both achieved, as long as the code rate Rc and the number of subchannels S satisfy RcS1. Recently discovered Perfect Space-Time Block Codes (PSTBCs) are full-rate full-diversity space-time codes, achieving maximum coding gain. In this paper, two novel techniques, Perfect Coded Multiple Beamforming (PCMB) and Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), are proposed, employing PSTBCs. PCMB achieves full diversity, full multiplexing, and full rate simultaneously, and its performance is close to PSTBC and FPMB, while the decoding complexity is significantly less than PSTBC and much lower than FPMB of dimensions 2 and 4. On the other hand, BICMB-PC achieves both full diversity and full multiplexing, and its performance is similar to BICMB-FP, but provides much lower decoding com...
Automatic code generation in practice
DEFF Research Database (Denmark)
Adam, Marian Sorin; Kuhrmann, Marco; Schultz, Ulrik Pagh
2016-01-01
-specific language to specify those requirements and to allow for generating a safety-enforcing layer of code, which is deployed to the robot. The paper at hand reports experiences in practically applying code generation to mobile robots. For two cases, we discuss how we addressed challenges, e.g., regarding weaving...... code generation into proprietary development environments and testing of manually written code. We find that a DSL based on the same conceptual model can be used across different kinds of hardware modules, but a significant adaptation effort is required in practical scenarios involving different kinds...
Team, The Hyperink
2013-01-01
On May 15, 2012 Jeff Atwood (co-founder of Stack Overflow) published a blog post titled "Please Don't Learn to Code" in response to Mayor Mike Bloomberg's resolution to learn how to code in 2012. In that post he argues against "learning to code just for the sake of learning how to code," a sentiment that sparked an active online debate. This book is a compilation of several different perspectives on that debate. Should programming be taught to every student as part of their core curriculum, similar to mathematics, reading, and writing? Should every working professional take time to learn a
Grassmann codes and Schubert unions
DEFF Research Database (Denmark)
Hansen, Johan Peder; Johnsen, Trygve; Ranestad, Kristian
2009-01-01
We study subsets of Grassmann varieties over a field , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study such sets in detail, and give applications to coding theory, in particular for Grassmann codes. For much is known about such Schubert unions...... with a maximal number of -rational points for a given spanning dimension. We study the case and give a conjecture for general . We also define Schubert union codes in general, and study the parameters and support weights of these codes....
Wang, Jim Jing-Yan
2014-07-06
Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.
Measurement of the $W^{+}W^{-}\\rightarrow \\ell\
Hassani, Samira; The ATLAS collaboration
2016-01-01
The production of opposite-charge $W$-boson pairs in proton-proton collisions at $\\sqrt s~=~8$~TeV and $13$~TeV is measured using data corresponding respectively to 20.3~fb$^{-1}$ and 3.16~fb$^{-1}$ of integrated luminosity collected by the ATLAS detector during 2011-2012 and 2015 at the CERN Large Hadron Collider. The $WW$ pairs are reconstructed using their leptonic decays into an electron and a muon and neutrinos and no hadronic jets. An extension of the measurement is presented, which covers also the $WW+1$~jet production at 8~TeV. The cross-section measurement is performed in a fiducial phase space close to the experimental acceptance and is compared to theoretical predictions. The integrated measurement is corrected for all acceptance effects in order to obtain the total $WW$ production cross-section. Agreement is found between the measurement and the highest order QCD calculations available. Fiducial differential cross-sections are measured as a function of kinematic variables and limits on anomalous t...
Memantyna w leczeniu zaburzeń afektywnych
Directory of Open Access Journals (Sweden)
Dominik Strzelecki
2011-06-01
Full Text Available Celem pracy było przedstawienie właściwości przeciwdepresyjnych i normotymicznych memantyny, leku obecnie zarejestrowanego w leczeniu cięższych postaci otępienia typu alzheimerowskiego. W pracy, oprócz przybliżenia podstawowych informacji na temat tej substancji, skupiliśmy się na przedstawieniu dotychczas opublikowanych wyników jej stosowania w zaburzeniach afektywnych. Dostępne piśmiennictwo klinicznych zastosowań memantyny jest w tym zakresie bardzo ubogie, obejmuje pojedyncze badania w niewielkich grupach pacjentów z zaburzeniami depresyjnymi nawracającymi, w manii w przebiegu choroby afektywnej dwubiegunowej, jak również kilka opisów kazuistycznych, w tym w epizodzie depresyjnym w przebiegu zaburzenia dwubiegunowego. Wstępne wyniki są dość optymistyczne, jakkolwiek nie upoważniają na obecnym etapie do jednoznacznych konkluzji. Podkreślane jest duże bezpieczeństwo stosowania memantyny oraz, co oczywiste, potrzeba przeprowadzenia kolejnych, dobrze zaplanowanych metodologicznie badań, które objęłyby większe grupy pacjentów, a także oceniałyby działanie memantyny u chorych z depresją dwubiegunową czy epizodem mieszanym ChAD. Ze względu na szybkie działanie kliniczne antagonistów glutaminianergicznego receptora NMDA memantyna byłaby interesującą i wygodną alternatywą terapeutyczną, z perspektywy zastosowania w codziennej pracy klinicznej znacznie korzystniejszą, dużo bezpieczniejszą i łatwiejszą w zastosowaniu od ketaminy, innego antagonisty NMDA. Co wydaje się szczególnie ważne, memantyna daje potencjalnie szansę na poprawę funkcjonowania poznawczego, co jest wykorzystywane w terapii otępień, zaś w zaburzeniach afektywnych dotychczas praktycznie nie było badane.
W Boson Mass Measurement at the Tevatron
Hays, C; Abazov, V M; Abolins, M; Acharya, B S; Adams, M; Adams, T; Agelou, M; Agram, J L; Ahn, S H; Ahsan, M; Alexeev, G D; Alkhazov, G; Alton, A; Alverson, G; Alves, G A; Anastasoaie, M; Andeen, T; Anderson, S; Andrieu, B; Arnoud, Y; Askew, A; Åsman, B; Assis-Jesus, A C S; Atramentov, O; Autermann, C; Avila, C; Badaud, F; Baden, A; Baldin, B Yu; Balm, P W; Banerjee, S; Barberis, E; Bargassa, P; Baringer, P; Barnes, C; Barreto, J; Bartlett, J F; Bassler, U; Bauer, D; Bean, A; Beauceron, S; Begel, M; Bellavance, A; Beri, S B; Bernardi, G; Bernhard, R; Bertram, I; Besançon, M; Beuselinck, R; Bezzubov, V A; Bhat, P C; Bhatnagar, V; Binder, M; Biscarat, C; Black, K M; Blackler, I; Blazey, G; Blekman, F; Blessing, S; Bloch, D; Blumenschein, U; Böhnlein, A; Boeriu, O; Bolton, T A; Borcherding, F; Borissov, G; Bos, K; Bose, T; Brandt, A; Brock, R; Brooijmans, G; Bross, A; Buchanan, N J; Buchholz, D; Bühler, M; Büscher, V; Burdin, S; Burnett, T H; Busato, E; Butler, J M; Bystrický, J; Caron, S; Carvalho, W; Casey, B C K; Cason, N M; Castilla-Valdez, H; Chakrabarti, S; Chakraborty, D; Chan, K M; Chandra, A; Chapin, D; Charles, F; Cheu, E; Cho, D K; Choi, S; Choudhary, B; Christiansen, T; Christofek, L; Claes, D; Clement, B; Clément, C; Coadou, Y; Cooke, M; Cooper, W E; Coppage, D; Corcoran, M; Cothenet, A; Cousinou, M C; Cox, B; Crepe-Renaudin, S; Cristetiu, M; Cutts, D; Da Motta, H; Davies, B; Davies, G; Davis, G A; De, K; de Jong, P; De Jong, S J; De La Cruz-Burelo, E; De Oliveira Martins, C; Dean, S; Degenhardt, J D; Déliot, F; Demarteau, M; Demina, R; Demine, P; Denisov, D; Denisov, S P; Desai, S; Diehl, H T; Diesburg, M; Doidge, M; Dong, H; Doulas, S; Dudko, L V; Duflot, L; Dugad, S R; Duperrin, A; Dyer, J; Dyshkant, A; Eads, M; Edmunds, D; Edwards, T; Ellison, J; Elmsheuser, J; Elvira, V D; Eno, S; Ermolov, P; Eroshin, O V; Estrada, J; Evans, D; Evans, H; Evdokimov, A; Evdokimov, V N; Fast, J; Fatakia, S N; Feligioni, L; Ferbel, T; Fiedler, F; Filthaut, F; Fisher, W; Fisk, H E; Fleck, I; Fortner, M; Fox, H; Fu, S; Fuess, S; Gadfort, T; Galea, C F; Gallas, E; Galyaev, E; García, C; García-Bellido, A; Gardner, J; Gavrilov, V; Gay, P; Gelé, D; Gelhaus, R; Genser, K; Gerber, C E; Gershtein, Yu; Ginther, G; Golling, T; Gómez, B; Gounder, K; Goussiou, A; Grannis, P D; Greder, S; Greenlee, H; Greenwood, Z D; Gregores, E M; Gris, P; Grivaz, J F; Groer, L; Grünendahl, S; Grünewald, M W; Gurzhev, S N; Gutíerrez, G; Gutíerrez, P; Haas, A; Hadley, N J; Hagopian, S; Hall, I; Hall, R E; Han, C; Han, L; Hanagaki, K; Harder, K; Harrington, R; Hauptman, J M; Hauser, R; Hebbeker, T; Hedin, D; Heinmiller, J M; Heinson, A P; Heintz, U; Hensel, C; Hesketh, G; Hildreth, M D; Hirosky, R; Hobbs, J D; Hoeneisen, B; Hohlfeld, M; Hong, S J; Hooper, R; Houben, P; Hu, Y; Huang, J; Iashvili, I; Illingworth, R; Ito, A S; Jabeen, S; Jaffré, M; Jain, S; Jain, V; Jakobs, K; Jenkins, A; Jesik, R; Johns, K; Johnson, M; Jonckheere, A; Jonsson, P; Juste, A; Käfer, D; Kahl, W; Kahn, S; Kajfasz, E; Kalinin, A M; Kalk, J; Karmanov, D; Kasper, J; Kau, D; Kaur, R; Kehoe, R; Kermiche, S; Kesisoglou, S; Khanov, A; Kharchilava, A I; Kharzheev, Yu M; Kim, H; Klima, B; Klute, M; Kohli, J M; Kopal, M; Korablev, V M; Kotcher, J; Kothari, B; Koubarovsky, A; Kozelov, A V; Kozminski, J; Kryemadhi, A; Krzywdzinski, S; Kuleshov, S; Kulik, Y; Kumar, A; Kunori, S; Kupco, A; Kurca, T; Kvita, J; Lager, S; Lahrichi, N; Landsberg, G L; Lazoflores, J; Le Bihan, A C; Lebrun, P; Lee, W M; Leflat, A; Lehner, F; Leonidopoulos, C; Lévêque, J; Lewis, P; Li, J; Li, Q Z; Lima, J G R; Lincoln, D; Linn, S L; Linnemann, J T; Lipaev, V V; Lipton, R; Lobo, L; Lobodenko, A; Lokajícek, M; Lounis, A; Love, P; Lubatti, H J; Lueking, L; Lynker, M; Lyon, A L; Maciel, A K A; Madaras, R J; Mättig, P; Magass, C; Magerkurth, A; Magnan, A M; Makovec, N; Mal, P K; Malbouisson, H B; Malik, S; Malyshev, V L; Mao, H S; Maravin, Y; Martens, M; Mattingly, S E K; Mayorov, A A; McCarthy, R; McCroskey, R; Meder, D; Melanson, H L; Melnitchouk, A S; Mendes, A; Merkin, M; Merritt, K W; Meyer, A; Michaut, M; Miettinen, H; Mitrevski, J; Mokhov, N V; Molina, J; Mondal, N K; Moore, R W; Muanza, G S; Mulders, M; Mutaf, Y D; Nagy, E; Narain, M; Naumann, N A; Neal, H A; Negret, J P; Nelson, S; Neustroev, P; Nöding, C; Nomerotski, A; Novaes, S F; Nunnemann, T; Nurse, E; O'Dell, V; O'Neil, D C; Oguri, V; Oliveira, N; Oshima, N; Oteroy-Garzon, G J; Padley, P; Parashar, N; Park, S K; Parsons, J; Partridge, R; Parua, N; Patwa, A; Perea, P M; Pérez, E; Petroff, P; Petteni, M; Phaf, L; Piegaia, R; Pleier, M A; Podesta-Lerma, P L M; Podstavkov, V M; Pogorelov, Y; Pope, B G; Prado da Silva, W L; Prosper, H B; Protopopescu, S D; Qian, J; Quadt, A; Quinn, B; Rani, K J; Ranjan, K; Rapidis, P A; Ratoff, P N; Reay, N W; Reucroft, S; Rijssenbeek, M; Ripp-Baudot, I; Rizatdinova, F K; Rodrigues, R F; Royon, C; Rubinov, P; Ruchti, R; Rud, V I; Sajot, G; Sánchez-Hernández, A; Sanders, M P; Santoro, A F S; Savage, G; Sawyer, L; Scanlon, T; Schaile, A D; Schamberger, R D; Schellman, H; Schieferdecker, P; Schmitt, C; Schwartzman, A; Schwienhorst, R; Sen-Gupta, S; Severini, H; Shabalina, E; Shamim, M; Shary, V; Shchukin, A A; Shephard, W D; Shivpuri, R K; Shpakov, D; Sidwell, R A; Simák, V; Sirotenko, V I; Skubic, P L; Slattery, P F; Smith, R P; Smolek, K; Snow, G R; Snow, J; Snyder, S; Söldner-Rembold, S; Song, X; Sonnenschein, L; Sopczak, A; Sosebee, M; Soustruznik, K; Souza, M; Spurlock, B; Stanton, N R; Stark, J; Steele, J; Stevenson, K; Stolin, V; Stone, A; Stoyanova, D A; Strandberg, J; Strang, M A; Strauss, M; Ströhmer, R; Strom, D; Strovink, M; Stutte, L; Sumowidagdo, S; Sznajder, A; Talby, M; Tamburello, P; Taylor, W; Telford, P; Temple, J; Thomas, E; Thooris, B; Tomoto, M; Toole, T; Torborg, J; Towers, S; Trefzger, T; Trincaz-Duvoid, S; Tuchming, B; Tully, C; Turcot, A S; Tuts, P M; Uvarov, L; Uvarov, S; Uzunyan, S; Vachon, B; Van Kooten, R; Van Leeuwen, W M; Varelas, N; Varnes, E W; Vartapetian, A H; Vasilyev, I A; Vaupel, M; Verdier, P; Vertogradov, L S; Verzocchi, M; Villeneuve-Séguier, F; Vlimant, J R; Von Törne, E; Vreeswijk, M; Vu-Anh, T; Wahl, H D; Walker, R; Wang, L; Wang, Z M; Warchol, J; Watts, G; Wayne, M; Weber, M; Weerts, H; Wegner, M; Wermes, N; White, A; White, V; Wicke, D; Wijngaarden, D A; Wilson, G W; Wimpenny, S J; Wittlin, J; Wobisch, M; Womersley, J; Wood, D R; Wyatt, T R; Xu, Q; Xuan, N; Yacoob, S Y; Yamada, R; Yan, M; Yasuda, T; Yatsunenko, Y A; Yen, Y; Yip, K; Yoo, H D; Youn, S W; Yu, J; Yurkewicz, A; Zabi, A; Zatserklyaniy, A; Zdrazil, M; Zeitnitz, C; Zhang, D; Zhang, X; Zhao, T; Zhao, Z; Zhou, B; Zhu, J; Zielinski, M; Zieminska, D; Zieminski, A; Zitoun, R; Zutshi, V; Zverev, E G; Hays, Chris
2005-01-01
The W boson mass (mW) is a key parameter of the standard model, constraining the mass of the unobserved Higgs boson. Using Tevatron ppbar collision data from 1992-1996, the CDF and D0 collaborations measured mW to a precision of 59 MeV. The ongoing Tevatron Run 2 has produced a factor of 5 more collisions, promising a significant reduction in the W mass uncertainty. CDF has analyzed the first 200/pb of Run 2 data and determined the uncertainty on its W mass measurement to be 76 MeV.
Coding, cryptography and combinatorics
Niederreiter, Harald; Xing, Chaoping
2004-01-01
It has long been recognized that there are fascinating connections between cod ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi natorics (CCC 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the p...
Polymatroids with Network Coding
Han, Te Sun
2010-01-01
The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the celebrated max-flow mini-cut theorem on non-physical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with correlated multiple sources and a single sink from the viewpoint of polymatroidal functions in which a necessary and sufficient condition has been demonstrated for reliable transmission over the network. This paper presents an attempt to unify both cases, which leads to establish a necessary and sufficient condition for reliable transmission over a noisy network for multicasting all the correlated multiple sources to all the multiple sinks. Furthermore, we address also the problem of transmitting "independent" sources over a multiple-access-type of network as well as over a broadcast-type of network, which reveals that the (co-) polymatroidal structures are intrinsical...
Consensus Convolutional Sparse Coding
Choudhury, Biswarup
2017-04-11
Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaickingand 4D light field view synthesis.
Coded optical time domain reflectometry: principle and applications
Park, Namkyoo; Lee, Jeonghwan; Park, Jonghan; Shim, Jae Gwang; Yoon, Hosung; Kim, Jin Hee; Kim, Kyoungmin; Byun, Jae-Oh; Bolognini, Gabriele; Lee, Duckey; Di Pasquale, Fabrizio
2007-11-01
In this paper, we will briefly outline our contributions for the physical realization of coded OTDR, along with its principles and also highlight recent key results related with its applications. For the communication network application, we report a multi-port / multi-wavelength, high-speed supervisory system for the in-service monitoring of a bidirectional WDM-PON system transmission line up to 16 ports x 32 nodes (512 users) capacity. Monitoring of individual branch traces up to 60 km was achieved with the application of a 127-bit simplex code, corresponding to a 7.5dB SNR coding gain effectively reducing the measurement time about 30 times when compared to conventional average mode OTDR. Transmission experiments showed negligible penalty from the monitoring system to the transmission signal quality, at a 2.5Gbps / 125Mbps (down / up stream) data rate. As an application to sensor network, a Raman scattering based coded-OTDR distributed temperature sensor system will be presented. Utilizing a 255-bit Simplex coded OTDR together with optimized sensing link (composed of cascaded fibers with different Raman coefficients), significant enhancement in the interrogation distance (19.5km from coding gain, and 9.6km from link-combination optimization) was achieved to result a total sensing range of 37km (at 17m/3K spatial/temperature resolution), employing a conventional off-shelf low power (80mW) laser diode.
Decoding of concatenated codes with interleaved outer codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom; Thommesen, Christian
2004-01-01
Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes....
The KIDTALK Behavior and Language Code: Manual and Coding Protocol.
Delaney, Elizabeth M.; Ezell, Sara S.; Solomon, Ned A.; Hancock, Terry B.; Kaiser, Ann P.
Developed as part of the Milieu Language Teaching Project at the John F. Kennedy Center at Vanderbilt University in Nashville, Tennessee, this KIDTALK Behavior-Language Coding Protocol and manual measures behavior occurring during adult-child interactions. The manual is divided into 5 distinct sections: (1) the adult behavior codes describe…
Ratio method of measuring W boson mass
Energy Technology Data Exchange (ETDEWEB)
Guo, Feng [Stony Brook Univ., NY (United States)
2010-08-01
This dissertation describes an alternative method of measuring the W boson mass in DØ experiment. Instead of extracting M_{W} from the fitting of W → ev fast Monte Carlo simulations to W → ev data as in the standard method, we make the direct fit of transverse mass between W → ev data and Z → ee data. One of the two electrons from Z boson is treated as a neutrino in the calculation of transverse mass. In ratio method, the best fitted scale factor corresponds to the ratio of W and Z boson mass (M_{W}/M_{Z}). Given the precisely measured Z boson mass, W mass is directly fitted from W → ev and Z → ee data. This dissertation demonstrates that ratio method is a plausible method of measuring the W boson mass. With the 1 fb^{-1} DØ Run IIa dataset, ratio method gives M_{W} = 80435 ± 43(stat) ± 26(sys) MeV.
Coded Path Protection: Efficient Conversion of Sharing to Coding
Avci, Serhat Nazim
2011-01-01
Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow and require complex signaling. Additionally, real-time reconfiguration of a cross-connect threatens their transmission integrity. On the other hand, coding-based protection schemes are proactive. Therefore, they have higher restoration speed, lower signaling complexity, and higher transmission integrity. This paper introduces a coding-based protection scheme, named Coded Path Protection (CPP). In CPP, a backup copy of the primary data is encoded with other data streams, resulting in capacity savings. This paper presents an optimal and simple capacity placement and coding group formation algorithm. The algorithm converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity. We conducted quantitative and qualitative comparisons of our technique with the SPP and, another tec...
Nikołajczuk, Krystyna
2013-01-01
Artykuł poświęcony jest badaniom znajomości normy w zakresie polskiej frazeologii temporalnej rodzimych użytkowników polszczyzny oraz Ukraińców uczących się tego języka. Ujawniono, jakie odstępstwa od zawartej w słownikach normy frazeologicznej wybranych związków temporalnych są najbardziej charakterystyczne dla polskojęzycznej komunikacji osób ukraińskojęzycznych, native speakerów. Materiałem badawczym są Korpusy tekstów języka polskiego oraz ankiety zawierające polskie związk...
Obituary: Arthur Dodd Code (1923-2009)
Marché, Jordan D., II
2009-12-01
/Smithsonian Institution); remarks made by the late Donald E. Osterbrock at Code's 80th birthday dinner (2003), Frank K. Edmondson's (1997) history of AURA, and previous work published by the author on the WEP. One box of Code's papers (1958-1985) is preserved at the Memorial Library Archives, UW-Madison. Additional contributions toward this essay have come from Robert W. Smith, Robert C. Bless, and the members of Code's family.
Allele coding in genomic evaluation
Directory of Open Access Journals (Sweden)
Christensen Ole F
2011-06-01
Full Text Available Abstract Background Genomic data are used in animal breeding to assist genetic evaluation. Several models to estimate genomic breeding values have been studied. In general, two approaches have been used. One approach estimates the marker effects first and then, genomic breeding values are obtained by summing marker effects. In the second approach, genomic breeding values are estimated directly using an equivalent model with a genomic relationship matrix. Allele coding is the method chosen to assign values to the regression coefficients in the statistical model. A common allele coding is zero for the homozygous genotype of the first allele, one for the heterozygote, and two for the homozygous genotype for the other allele. Another common allele coding changes these regression coefficients by subtracting a value from each marker such that the mean of regression coefficients is zero within each marker. We call this centered allele coding. This study considered effects of different allele coding methods on inference. Both marker-based and equivalent models were considered, and restricted maximum likelihood and Bayesian methods were used in inference. Results Theoretical derivations showed that parameter estimates and estimated marker effects in marker-based models are the same irrespective of the allele coding, provided that the model has a fixed general mean. For the equivalent models, the same results hold, even though different allele coding methods lead to different genomic relationship matrices. Calculated genomic breeding values are independent of allele coding when the estimate of the general mean is included into the values. Reliabilities of estimated genomic breeding values calculated using elements of the inverse of the coefficient matrix depend on the allele coding because different allele coding methods imply different models. Finally, allele coding affects the mixing of Markov chain Monte Carlo algorithms, with the centered coding being
1988-01-01
Article 162 of this Mexican Code provides, among other things, that "Every person has the right freely, responsibly, and in an informed fashion to determine the number and spacing of his or her children." When a marriage is involved, this right is to be observed by the spouses "in agreement with each other." The civil codes of the following states contain the same provisions: 1) Baja California (Art. 159 of the Civil Code of 28 April 1972 as revised in Decree No. 167 of 31 January 1974); 2) Morelos (Art. 255 of the Civil Code of 26 September 1949 as revised in Decree No. 135 of 29 December 1981); 3) Queretaro (Art. 162 of the Civil Code of 29 December 1950 as revised in the Act of 9 January 1981); 4) San Luis Potosi (Art. 147 of the Civil Code of 24 March 1946 as revised in 13 June 1978); Sinaloa (Art. 162 of the Civil Code of 18 June 1940 as revised in Decree No. 28 of 14 October 1975); 5) Tamaulipas (Art. 146 of the Civil Code of 21 November 1960 as revised in Decree No. 20 of 30 April 1975); 6) Veracruz-Llave (Art. 98 of the Civil Code of 1 September 1932 as revised in the Act of 30 December 1975); and 7) Zacatecas (Art. 253 of the Civil Code of 9 February 1965 as revised in Decree No. 104 of 13 August 1975). The Civil Codes of Puebla and Tlaxcala provide for this right only in the context of marriage with the spouses in agreement. See Art. 317 of the Civil Code of Puebla of 15 April 1985 and Article 52 of the Civil Code of Tlaxcala of 31 August 1976 as revised in Decree No. 23 of 2 April 1984. The Family Code of Hidalgo requires as a formality of marriage a certification that the spouses are aware of methods of controlling fertility, responsible parenthood, and family planning. In addition, Article 22 the Civil Code of the Federal District provides that the legal capacity of natural persons is acquired at birth and lost at death; however, from the moment of conception the individual comes under the protection of the law, which is valid with respect to the
Decay heat calculations for a 500 kW W–Ta spallation target
Energy Technology Data Exchange (ETDEWEB)
Yu, Quanzhi, E-mail: qzhyu@iphy.ac.cn [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China); Lu, Youlian; Hu, Zhiliang; Zhou, Bin [Dongguan Campus, Institute of High Energy Physics, Chinese Academy of Sciences, Dongguan 523800 (China); Dongguan Neutron Science Center, Dongguan 523800 (China); Yin, Wen; Liang, Tianjiao [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China)
2015-05-15
The China Spallation Neutron Source (CSNS) is a short-pulsed neutron scattering facility. The beam power is designed to be 100 kW in Phase I, with the capability of upgrading to 500 kW. Tantalum (Ta)-cladded tungsten (W) was chosen as the spallation target due to its high neutron yield. Ta claddings can solve the problem of the corrosiveness of W plates, although they produce high decay heat after intense irradiation. This paper presents the decay heat distributions and evolutions for the future upgraded 500 kW W–Ta spallation target. The calculations are performed using the MCNPX2.5 Monte Carlo code and the CINDER’90 activation code. The decay heat distributions show that for the W plates, decay heat is mainly produced via the spallation reaction process, whereas for the Ta claddings, it is mainly produced via the neutron capture process. An effective method of reducing the decay heat in the W–Ta target is also presented and discussed.
Dlaczego Korea?czycy z P??nocy akceptuj? w?adz? Kim?w?
Zdenkowska, Marcelina
2016-01-01
Celem artyku?u jest przedstawienie dw?ch popularnych teorii dotycz?cych problemu w?adzy w Korei P??nocnej. Analizie zostan? poddane tezy: konfucjanistyczna i nacjonalistyczna. Podj?te tu rozwa?ania maj? na celu odpowiedzie? na pytanie dlaczego Korea?czycy z P??nocy akceptuj? w?adz? Kim?w? Marcelina Zdenkowska
Yeast Interacting Proteins Database: YBR108W, YGR136W [Yeast Interacting Proteins Database
Lifescience Database Archive (English)
Full Text Available YBR108W AIM3 Protein interacting with Rvs167p; null mutant is viable and displays e...w YBR108W Bait ORF YBR108W Bait gene name AIM3 Bait description Protein interacting with Rvs167p; null mutant is viable and display
Simultaneous genotyping of HPA-17w to -21w by PCR-SSP in Chinese Cantonese.
Zhou, Haojie; Ding, Haoqiang; Chen, Yangkai; Li, Xiaofan; Ye, Xin; Nie, Yongmei
2015-01-01
Studies have reported the polymorphism of human platelet antigen (HPA)-17w, -18w, -19w, -20w, and -21w. However, the distribution of these five antigens in Chinese Cantonese is still unknown. In this study, we designed new sequence-specific primers for HPA-19w to -21w and used published primers for HPA-17w and -18w to develop a polymerase chain reaction with the sequence-specific primers (PCR-SSP) method for simultaneously genotyping HPA-17w to -21w. A total of 820 unrelated Cantonese apheresis platelet donors in Guangzhou were involved in this study. Among the five HPAs, complete a/a homozygosity was observed for HPA-17w to -20w with an allele frequency of 1.0000. For HPA-21w, nine individuals (9/820, 1.10%) were found to be HPA-21a/bw heterozygous and the allele frequencies of HPA-21a and HPA-21bw were 0.9945 (1631/1640) and 0.0055 (9/1640), respectively. The reliability of the PCR-SSP method was determined by comparing with the genotyping results by DNA sequencing, and no inconsistencies were observed between the two methods. This study provides a reliable PCR-SSP method for simultaneously genotyping HPA-17w to -21w and could improve HPA-matched platelet transfusion in Chinese Cantonese.
An algebraic approach to graph codes
DEFF Research Database (Denmark)
Pinero, Fernando
theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four......This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... are optimal or best known for their parameters. In chapter five we study some graph codes with Reed–Solomon component codes. The underlying graph is well known and widely used for its good characteristics. This helps us to compute the dimension of the graph codes. We also introduce a combinatorial concept...
The wind of W Hya as seen by Herschel. II. The molecular envelope of W Hya
Khouri, T; Decin, L; Waters, L B F M; Maercker, M; Lombaert, R; Alcolea, J; Blommaert, J A D L; Bujarrabal, V; Groenewegen, M A T; Justtanont, K; Kerschbaum, F; Matsuura, M; Menten, K M; Olofsson, H; Planesas, P; Royer, P; Schmidt, M R; Szczerba, R; Teyssier, D; Yates, J
2014-01-01
The evolution of low- and intermediate-mass stars on the asymptotic giant branch (AGB) is mainly controlled by the rate at which these stars lose mass in a stellar wind. Understanding the driving mechanism and strength of the stellar winds of AGB stars and the processes enriching their surfaces with products of nucleosynthesis are paramount to constraining AGB evolution and predicting the chemical evolution of galaxies. In a previous paper we have constrained the structure of the outflowing envelope of W Hya using spectral lines of the $^{12}$CO molecule. Here we broaden this study by modelling an extensive set of H$_{2}$O and $^{28}$SiO lines observed by the three instruments on board Herschel using a state-of-the-art molecular excitation and radiative transfer code. The oxygen isotopic ratios and the $^{28}$SiO abundance profile can be connected to the initial stellar mass and to crucial aspects of dust formation at the base of the stellar wind, respectively. The modelling of H$_{2}$O and $^{28}$SiO confirm...
SC Secretariat
2005-01-01
Please note that the revised Safety Code A2 (Code A2 rev.) entitled "REPORTING OF ACCIDENTS AND NEAR MISSES" is available on the web at the following url: https://edms.cern.ch/document/335502/LAST_RELEASED Paper copies can also be obtained from the SC Unit Secretariat, e-mail: sc.secretariat@cern.ch SC Secretariat
Flow Analysis of Code Customizations
DEFF Research Database (Denmark)
Hessellund, Anders; Sestoft, Peter
2008-01-01
Inconsistency between metadata and code customizations is a major concern in modern, configurable enterprise systems. The increasing reliance on metadata, in the form of XML files, and code customizations, in the form of Java files, has led to a hybrid development platform. The expected consisten...
NETWORK CODING BY BEAM FORMING
DEFF Research Database (Denmark)
2013-01-01
Network coding by beam forming in networks, for example, in single frequency networks, can provide aid in increasing spectral efficiency. When network coding by beam forming and user cooperation are combined, spectral efficiency gains may be achieved. According to certain embodiments, a method...... cooperating with the plurality of user equipment to decode the received data....
Grassmann codes and Schubert unions
DEFF Research Database (Denmark)
Hansen, Johan Peder; Johnsen, Trygve; Ranestad, Kristian
2009-01-01
We study subsets of Grassmann varieties over a field , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study such sets in detail, and give applications to coding theory, in particular for Grassmann codes. For much is known about such Schubert unions...
Donovan, Peter
2014-01-01
Covers the historical context and the evolution of the technically complex Allied Signals Intelligence (Sigint) activity against Japan from 1920 to 1945 Describes, explains and analyzes the code breaking techniques developed during the war in the Pacific Exposes the blunders (in code construction and use) made by the Japanese Navy that led to significant US Naval victories
Accelerator Physics Code Web Repository
Energy Technology Data Exchange (ETDEWEB)
Zimmermann, F.; Basset, R.; Bellodi, G.; Benedetto, E.; Dorda, U.; Giovannozzi, M.; Papaphilippou, Y.; Pieloni, T.; Ruggiero, F.; Rumolo, G.; Schmidt, F.; Todesco, E.; Zotter, B.W.; /CERN; Payet, J.; /Saclay; Bartolini, R.; /RAL, Diamond; Farvacque, L.; /ESRF, Grenoble; Sen, T.; /Fermilab; Chin, Y.H.; Ohmi, K.; Oide, K.; /KEK, Tsukuba; Furman, M.; /LBL, Berkeley /Oak Ridge /Pohang Accelerator Lab. /SLAC /TRIUMF /Tech-X, Boulder /UC, San Diego /Darmstadt, GSI /Rutherford /Brookhaven
2006-10-24
In the framework of the CARE HHH European Network, we have developed a web-based dynamic accelerator-physics code repository. We describe the design, structure and contents of this repository, illustrate its usage, and discuss our future plans, with emphasis on code benchmarking.
ACCELERATION PHYSICS CODE WEB REPOSITORY.
Energy Technology Data Exchange (ETDEWEB)
WEI, J.
2006-06-26
In the framework of the CARE HHH European Network, we have developed a web-based dynamic accelerator-physics code repository. We describe the design, structure and contents of this repository, illustrate its usage, and discuss our future plans, with emphasis on code benchmarking.
Jing, Yindi
2014-01-01
Distributed Space-Time Coding (DSTC) is a cooperative relaying scheme that enables high reliability in wireless networks. This brief presents the basic concept of DSTC, its achievable performance, generalizations, code design, and differential use. Recent results on training design and channel estimation for DSTC and the performance of training-based DSTC are also discussed.
Recommendations for ECG diagnostic coding
Bonner, R.E.; Caceres, C.A.; Cuddy, T.E.; Meijler, F.L.; Milliken, J.A.; Rautaharju, P.M.; Robles de Medina, E.O.; Willems, J.L.; Wolf, H.K.; Working Group 'Diagnostic Codes'
1978-01-01
The Oxford dictionary defines code as "a body of laws so related to each other as to avoid inconsistency and overlapping". It is obvious that natural language with its high degree of ambiguity does not qualify as a code in the sense of this definition. Everyday experiences provide ample evidence tha
Bounds on Generalized Huffman Codes
Baer, Michael B
2007-01-01
New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding - which concern the traditional linear code objective of minimizing average codeword length -- these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman coding, some upper bounds can be found using sufficient conditions for the codeword corresponding to the most probable symbol being one bit long. Whereas having probability no less than 0.4 is a tight sufficient condition for this to be the case in Huffman coding, other penalties differ, some having a tighter condition, some a looser condition, and others having no such sufficient condition. The objectives explored here are ones for which optimal codes can be found using a generalized form of Huffman coding. These objectives include one related to queueing (an increasing exponential average), one related to single-shot c...
LFSC - Linac Feedback Simulation Code
Energy Technology Data Exchange (ETDEWEB)
Ivanov, Valentin; /Fermilab
2008-05-01
The computer program LFSC (
Recommendations for ECG diagnostic coding
Bonner, R.E.; Caceres, C.A.; Cuddy, T.E.; Meijler, F.L.; Milliken, J.A.; Rautaharju, P.M.; Robles de Medina, E.O.; Willems, J.L.; Wolf, H.K.; Working Group 'Diagnostic Codes'
1978-01-01
The Oxford dictionary defines code as "a body of laws so related to each other as to avoid inconsistency and overlapping". It is obvious that natural language with its high degree of ambiguity does not qualify as a code in the sense of this definition. Everyday experiences provide ample evidence tha
Indian Academy of Sciences (India)
Manju Pruthi
2001-11-01
In this paper explicit expressions of + 1 idempotents in the ring $R = F_q[X]/\\langle X^{2^m}-1\\rangle$ are given. Cyclic codes of length 2 over the finite field , of odd characteristic, are defined in terms of their generator polynomials. The exact minimum distance and the dimension of the codes are obtained.
Coded continuous wave meteor radar
2015-01-01
The concept of coded continuous wave meteor radar is introduced. The radar uses a continuously transmitted pseudo-random waveform, which has several advantages: coding avoids range aliased echoes, which are often seen with commonly used pulsed specular meteor radars (SMRs); continuous transmissions maximize pulse compression gain, allowing operation with significantly lower peak transmit power; the temporal resolution can be changed after ...
Ultraviolet spectroscopy of hot young stars with infrared excesses - NGC 2264-W46, W90, and W100
Meade, M. R.; Sitko, M. L.; Simon, T.
1984-01-01
New ultraviolet data are combined with optical data to investigate the wavelength-dependent extinction of the stars W46, W90, and W100 in the young galactic cluster NGC 2264. The observations of W90 confirm the existence of anomalous (circumstellar) dust extinction with a ratio of total to selective extinction, R greater than 7. This extinction is most easily explained by a graphite-silicate mixture with larger mean sizes than are present in the diffuse interstellar medium. For W46 and W100, the grains are likely to be gray, but the possibility of nongray extinction cannot be excluded because of uncertainties arising from the very small ultraviolet optical depths of the circumstellar dust.
w-DENSITY AND w-BALANCED PROPERTY OF WEIGHTED GRAPHS
Institute of Scientific and Technical Information of China (English)
ZhangShenggui; SunHao; LiXueliang
2002-01-01
The notion of w-density for the graphs with positive weights on vertices and nonnegative weights on edges is introduced. A weighted graph is called w-balanced if its w-density is no less than the w-density of any subgraph of it. In this paper,a good characterization of w-balanced weighted graphs is given. Applying this characterization ,many large w-balanced weighted graphs are formed by combining smaller ones. In the case where a graph is not w-balanced,a polynomial-time algorithm to find a subgraph of maximum w-density is proposed. It is shown that the w-density theory is closely related to the study of SEW(G,w) games.
W+ W- production at hadron colliders in next to next to leading order QCD.
Gehrmann, T; Grazzini, M; Kallweit, S; Maierhöfer, P; von Manteuffel, A; Pozzorini, S; Rathlev, D; Tancredi, L
2014-11-21
Charged gauge boson pair production at the Large Hadron Collider allows detailed probes of the fundamental structure of electroweak interactions. We present precise theoretical predictions for on-shell W+ W- production that include, for the first time, QCD effects up to next to next to leading order in perturbation theory. As compared to next to leading order, the inclusive W+ W- cross section is enhanced by 9% at 7 TeV and 12% at 14 TeV. The residual perturbative uncertainty is at the 3% level. The severe contamination of the W+ W- cross section due to top-quark resonances is discussed in detail. Comparing different definitions of top-free W+ W- production in the four and five flavor number schemes, we demonstrate that top-quark resonances can be separated from the inclusive W+ W- cross section without a significant loss of theoretical precision.
Distributed source coding of video
DEFF Research Database (Denmark)
Forchhammer, Søren; Van Luong, Huynh
2015-01-01
A foundation for distributed source coding was established in the classic papers of Slepian-Wolf (SW) [1] and Wyner-Ziv (WZ) [2]. This has provided a starting point for work on Distributed Video Coding (DVC), which exploits the source statistics at the decoder side offering shifting processing...... steps, conventionally performed at the video encoder side, to the decoder side. Emerging applications such as wireless visual sensor networks and wireless video surveillance all require lightweight video encoding with high coding efficiency and error-resilience. The video data of DVC schemes differ from...... the assumptions of SW and WZ distributed coding, e.g. by being correlated in time and nonstationary. Improving the efficiency of DVC coding is challenging. This paper presents some selected techniques to address the DVC challenges. Focus is put on pin-pointing how the decoder steps are modified to provide...
Pastawski, Fernando; Wilming, Henrik
2016-01-01
Approximate quantum error-correcting codes are codes with "soft recovery guarantees" wherein information can be approximately recovered. In this article, we propose a complementary "soft code-spaces" wherein a weighted prior distribution is assumed over the possible logical input states. The performance for protecting information from noise is then evaluated in terms of entanglement fidelity. We apply a recent construction for approximate recovery maps, which come with a guaranteed lower-bounds on the decoding performance. These lower bound are straightforwardly obtained by evaluating entropies on marginals of the mixed state which represents the "soft code-space". As an example, we consider thermal states of the transverse field Ising model at criticality and provide numerical evidence that the entanglement fidelity admits non-trivial recoverability from local errors. This provides the first concrete interpretation of a bonafide conformal field theory as a quantum error-correcting code. We further suggest, t...
Distributed source coding of video
DEFF Research Database (Denmark)
Forchhammer, Søren; Van Luong, Huynh
2015-01-01
steps, conventionally performed at the video encoder side, to the decoder side. Emerging applications such as wireless visual sensor networks and wireless video surveillance all require lightweight video encoding with high coding efficiency and error-resilience. The video data of DVC schemes differ from......A foundation for distributed source coding was established in the classic papers of Slepian-Wolf (SW) [1] and Wyner-Ziv (WZ) [2]. This has provided a starting point for work on Distributed Video Coding (DVC), which exploits the source statistics at the decoder side offering shifting processing...... the assumptions of SW and WZ distributed coding, e.g. by being correlated in time and nonstationary. Improving the efficiency of DVC coding is challenging. This paper presents some selected techniques to address the DVC challenges. Focus is put on pin-pointing how the decoder steps are modified to provide...
DEFF Research Database (Denmark)
Blackwell, Alan; Cox, Geoff; Lee, Sang Wong
2016-01-01
This paper is a speculation on the relationship between coding and writing, and the ways in which technical innovations and capabilities enable us to rethink each in terms of the other. As a case study, we draw on recent experiences of preparing a book on live coding, which integrates a wide rang...... of personal, historical, technical and critical perspectives. This book project has been both experimental and reflective, in a manner that allows us to draw on critical understanding of both code and writing, and point to the potential for new practices in the future.......This paper is a speculation on the relationship between coding and writing, and the ways in which technical innovations and capabilities enable us to rethink each in terms of the other. As a case study, we draw on recent experiences of preparing a book on live coding, which integrates a wide range...
Binary Error Correcting Network Codes
Wang, Qiwen; Li, Shuo-Yen Robert
2011-01-01
We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. We propose a new metric for errors under this model. Using this metric, we prove a new Hamming-type upper bound on the network capacity. We also show a commensurate lower bound based on GV-type codes that can be used for error-correction. The codes used to attain the lower bound are non-coherent (do not require prior knowledge of network topology). The end-to-end nature of our design enables our codes to be overlaid on classical distributed random linear network codes. Further, we free internal nodes from having to implement potentially computationally intensive link-by-link error-correction.
Ribas de Pouplana, Lluís; Torres, Adrian Gabriel; Rafels-Ybern, Àlbert
2017-04-05
The frozen accident theory of the Genetic Code was a proposal by Francis Crick that attempted to explain the universal nature of the Genetic Code and the fact that it only contains information for twenty amino acids. Fifty years later, it is clear that variations to the universal Genetic Code exist in nature and that translation is not limited to twenty amino acids. However, given the astonishing diversity of life on earth, and the extended evolutionary time that has taken place since the emergence of the extant Genetic Code, the idea that the translation apparatus is for the most part immobile remains true. Here, we will offer a potential explanation to the reason why the code has remained mostly stable for over three billion years, and discuss some of the mechanisms that allow species to overcome the intrinsic functional limitations of the protein synthesis machinery.
Reliability-Based Code Calibration
DEFF Research Database (Denmark)
Faber, M.H.; Sørensen, John Dalsgaard
2003-01-01
The present paper addresses fundamental concepts of reliability based code calibration. First basic principles of structural reliability theory are introduced and it is shown how the results of FORM based reliability analysis may be related to partial safety factors and characteristic values....... Thereafter the code calibration problem is presented in its principal decision theoretical form and it is discussed how acceptable levels of failure probability (or target reliabilities) may be established. Furthermore suggested values for acceptable annual failure probabilities are given for ultimate...... and serviceability limit states. Finally the paper describes the Joint Committee on Structural Safety (JCSS) recommended procedure - CodeCal - for the practical implementation of reliability based code calibration of LRFD based design codes....
Rodionov, Anatoly
2007-01-01
A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm may be considered as of generalization a popular compression technique - arithmetic coding algorithms. It is shown that for p = 2 the algorithm works as integer variant of arithmetic coding; for a special class of models it gives exactly the same codes as Huffman's algorithm, for another special model and a specific alphabet it gives Golomb-Rice codes.
PARAVT: Parallel Voronoi tessellation code
González, R. E.
2016-10-01
In this study, we present a new open source code for massive parallel computation of Voronoi tessellations (VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several serial Voronoi tessellation codes, however no open source and parallel implementations are available to handle the large number of particles/galaxies in current N-body simulations and sky surveys. Parallelization is implemented under MPI and VT using Qhull library. Domain decomposition takes into account consistent boundary computation between tasks, and includes periodic conditions. In addition, the code computes neighbors list, Voronoi density, Voronoi cell volume, density gradient for each particle, and densities on a regular grid. Code implementation and user guide are publicly available at https://github.com/regonzar/paravt.
Portable code development in C
Energy Technology Data Exchange (ETDEWEB)
Brown, S.A.
1990-11-06
With a new generation of high performance computers appearing around us on a time scale of months, a new challenge for developers of simulation codes is to write and maintain production codes that are both highly portable and maximally efficient. My contention is that C is the language that is both best suited to that goal and is widely available today. GLF is a new code written mainly in C which is intended to have all of the XRASER physics and run on any platform of interest. It demonstrates the power of the C paradigm for code developers and flexibility and ease of use for the users. Three fundamental problems are discussed: the C/UNIX development environment; the supporting tools and libraries which handle data and graphics portability issues; and the advantages of C in numerical simulation code development.
Medical coding in clinical trials
Directory of Open Access Journals (Sweden)
Deven Babre
2010-01-01
Full Text Available Data generated in all clinical trial are recorded on the data collection instrument Case report Form / Electronic Case Report Form by investigators located at various sites in various countries. In multicentric clinical trials since different investigator or medically qualified experts are from different sites / centers recording the medical term(s uniformly is a big challenge. Medical coders from clinical data management team process these terms and perform medical coding. Medical coding is performed to categorize the medical terms reported appropriately so that they can be analyzed/reviewed. This article describes process which is used for medical coding in clinical data management and two most commonly used medical dictionaries MedDRA and WHO-DDE in brief. It is expected to help medical coders to understand the process of medical coding in clinical data management. Few common issues which the medical coder faces while performing medical coding, are also highlighted.
Walter, Nils G; Batey, Robert T
2009-01-01
This book assembles chapters from experts in the Biophysics of RNA to provide a broadly accessible snapshot of the current status of this rapidly expanding field. The 2006 Nobel Prize in Physiology or Medicine was awarded to the discoverers of RNA interference, highlighting just one example of a large number of non-protein coding RNAs. Because non-protein coding RNAs outnumber protein coding genes in mammals and other higher eukaryotes, it is now thought that the complexity of organisms is correlated with the fraction of their genome that encodes non-protein coding RNAs. Essential biological processes as diverse as cell differentiation, suppression of infecting viruses and parasitic transposons, higher-level organization of eukaryotic chromosomes, and gene expression itself are found to largely be directed by non-protein coding RNAs. The biophysical study of these RNAs employs X-ray crystallography, NMR, ensemble and single molecule fluorescence spectroscopy, optical tweezers, cryo-electron microscopy, and ot...
Super Special Codes using Super Matrices
Kandasamy, W B Vasantha; Ilanthenral, K
2010-01-01
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these codes are given in the final chapter.
Detecting non-coding selective pressure in coding regions
Directory of Open Access Journals (Sweden)
Blanchette Mathieu
2007-02-01
Full Text Available Abstract Background Comparative genomics approaches, where orthologous DNA regions are compared and inter-species conserved regions are identified, have proven extremely powerful for identifying non-coding regulatory regions located in intergenic or intronic regions. However, non-coding functional elements can also be located within coding region, as is common for exonic splicing enhancers, some transcription factor binding sites, and RNA secondary structure elements affecting mRNA stability, localization, or translation. Since these functional elements are located in regions that are themselves highly conserved because they are coding for a protein, they generally escaped detection by comparative genomics approaches. Results We introduce a comparative genomics approach for detecting non-coding functional elements located within coding regions. Codon evolution is modeled as a mixture of codon substitution models, where each component of the mixture describes the evolution of codons under a specific type of coding selective pressure. We show how to compute the posterior distribution of the entropy and parsimony scores under this null model of codon evolution. The method is applied to a set of growth hormone 1 orthologous mRNA sequences and a known exonic splicing elements is detected. The analysis of a set of CORTBP2 orthologous genes reveals a region of several hundred base pairs under strong non-coding selective pressure whose function remains unknown. Conclusion Non-coding functional elements, in particular those involved in post-transcriptional regulation, are likely to be much more prevalent than is currently known. With the numerous genome sequencing projects underway, comparative genomics approaches like that proposed here are likely to become increasingly powerful at detecting such elements.
Magnetic Properties of fe Deposited on W(110) Surface: Effects of O Contamination and O2 Adsorption
Malonda-Boungou, B. R.; Okana-Lomanga, A. L.; Moussounda, P. S.; M'Passi-Mabiala, B.; Demangeat, C.
2017-06-01
We have investigated the adsorption sites and the electronic structure correlated with the magnetic properties of ultrathin Fe films on W(110) system using spin-polarized calculations within the density-functional approach with generalized gradient approximation by the pseudopotential plane-wave code. For one Fe monolayer (ML) on W(110) system the Fe atoms prefer to bind on the bridge adsorption sites of the W(110) surface, with an inward relaxation of -12.68%. The top and diagonal bridge sites investigated are energetically less favorable. We have shown that intermixing between Fe and W is unlikely: the surface ordered Fe-W alloy is unstable against the 1-ML Fe on W(110). While the control of oxygen element is known to be an important key to a perfect growth of Fe on W(110), its possible contamination is checked. Performing spin polarized calculations with the optimized geometry, the induced magnetic moments on W subsurface are obtained: the W atoms are always antiferromagnetically coupled to the Fe atoms, one exception being the case of the antiferromagnetic Fe surface where, due to frustration, the induced polarization on the W atoms is zero. The bridge site is the lower adsorption energy one for O2 molecular bonding perpendicular to the surface. In the case of O2 bonding parallel and oblique to the surface, it is always dissociated into two O atoms on Fe/W(110) surface through geometry optimization, for all considered sites.
Linear and nonlinear verification of gyrokinetic microstability codes
Bravenec, R. V.; Candy, J.; Barnes, M.; Holland, C.
2011-12-01
Verification of nonlinear microstability codes is a necessary step before comparisons or predictions of turbulent transport in toroidal devices can be justified. By verification we mean demonstrating that a code correctly solves the mathematical model upon which it is based. Some degree of verification can be accomplished indirectly from analytical instability threshold conditions, nonlinear saturation estimates, etc., for relatively simple plasmas. However, verification for experimentally relevant plasma conditions and physics is beyond the realm of analytical treatment and must rely on code-to-code comparisons, i.e., benchmarking. The premise is that the codes are verified for a given problem or set of parameters if they all agree within a specified tolerance. True verification requires comparisons for a number of plasma conditions, e.g., different devices, discharges, times, and radii. Running the codes and keeping track of linear and nonlinear inputs and results for all conditions could be prohibitive unless there was some degree of automation. We have written software to do just this and have formulated a metric for assessing agreement of nonlinear simulations. We present comparisons, both linear and nonlinear, between the gyrokinetic codes GYRO [J. Candy and R. E. Waltz, J. Comput. Phys. 186, 545 (2003)] and GS2 [W. Dorland, F. Jenko, M. Kotschenreuther, and B. N. Rogers, Phys. Rev. Lett. 85, 5579 (2000)]. We do so at the mid-radius for the same discharge as in earlier work [C. Holland, A. E. White, G. R. McKee, M. W. Shafer, J. Candy, R. E. Waltz, L. Schmitz, and G. R. Tynan, Phys. Plasmas 16, 052301 (2009)]. The comparisons include electromagnetic fluctuations, passing and trapped electrons, plasma shaping, one kinetic impurity, and finite Debye-length effects. Results neglecting and including electron collisions (Lorentz model) are presented. We find that the linear frequencies with or without collisions agree well between codes, as do the time averages of
Stewart, Eric A.; Simons, Ronald L.
2010-01-01
The study outlined in this article drew on Elijah Anderson’s (1999) code of the street perspective to examine the impact of neighborhood street culture on violent delinquency. Using data from more than 700 African American adolescents, we examined 1) whether neighborhood street culture predicts adolescent violence above and beyond an adolescent’s own street code values and 2) whether neighborhood street culture moderates individual-level street code values on adolescent violence. Consistent w...
Fotografia na rynku aukcyjnym w Polsce
Directory of Open Access Journals (Sweden)
Bednarek, Anna
2012-09-01
Full Text Available W artykule podjęta została analiza stanu aukcyjnego rynku fotografii w Polsce w oparciu o wyniki sprzedaży z okresu od pierwszej aukcji fotografii (1996 do końca 2011 roku. Dane te pozwalają czytelnikowi na zapoznanie się z rozmiarami tego rynku (obrót, liczba sprzedanych obiektów, charakterystyką nabywanych obiektów (rekordy cenowe, średnie ceny, popularni twórcy i okresy oraz z trudnościami, które można napotkać podczas badania tego zjawiska. W podsumowaniu znalazły się przewidywania dotyczące dalszego rozwoju rynku.
Measurement of the $W^{+}W^{-}$ charge asymmetry in $W \\rightarrow e \
Da Rold, Alessandro; Rovelli, Chiara Ilaria
2017-01-01
The Standard Model (SM) of particle physics is the most general theory to describe the fundamental constituents and interactions of matter. However, precision meas- urements are needed to further test the consistency of the model or to highlight discrepancies between the theoretical predictions and the experimental results that could lead to new physics. In order to achieve this task, uncertainties connected to the modelling and simulation of the physical event must be studied. One of the main uncertainties in the simulation of a high energy proton-proton collision (such as those studied at the Large Hadron Collider) is due to the choice of the parton distribution functions (PDF). The W boson charge asymmetry is a quantity that is sensitive to the PDF set used in the Monte Carlo events generation. A precise measurement of this quantity can then discriminate between which are the best sets of PDF to be used in a future experiment and hence reduce the uncertainties on the measured quantities. In this work, data...
CYCLIC CODES OVER FORMAL POWER SERIES RINGS
Institute of Scientific and Technical Information of China (English)
Dougherty Steven T.; Liu Hongwei
2011-01-01
In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.
Non-Pauli observables for CWS codes
Santiago, Douglas F. G.; Portugal, Renato; Melo, Nolmar
2013-05-01
It is known that nonadditive quantum codes can have higher code dimensions than stabilizer codes for the same length and minimum distance. The class of codeword stabilized codes (CWS) provides tools to obtain new nonadditive quantum codes by reducing the problem to finding nonlinear classical codes. In this work, we establish some results on the kind of non-Pauli operators that can be used as observables in the decoding scheme of CWS codes and propose a procedure to obtain those observables.
330 W Cryocooler Developments and Testing
Emery, N.; Caughley, A.; Nation, M.; Kimber, A.; Allpress, N.; Reynolds, H.; Boyle, C.; Meier, J.; Tanchon, J.
2015-12-01
Fabrum Solutions in association with Callaghan Innovation and Absolut System has developed a 330 W pulse tube cryocooler based on Callaghan Innovation's novel diaphragm pressure wave generators (DPWG). A cost-effective, long life and robust cryocooler has been achieved due to the pulse tube's lack of moving parts and the DPWG's metal diaphragms separating the working gas from the oil lubricated drive mechanism. A 330 cc DPWG was designed and manufactured to run with an inline pulse tube. Absolut System carried out the pulse tube design; manufacture was by Fabrum Solutions, with integration and testing by Callaghan Innovation. The 330 W pulse tubes were run as cryocoolers mounted to 330 cc DPWG's. 480 W of cooling power at 77 K was achieved (target was 330 W at 77 K) from 7kW PV power and 12 kW of electrical input power. An endurance cryocooler was assembled with the left over parts from the optimization exercise. The endurance cryocooler was assembled to run as a liquefier. Calculation showed that 1 litre per hour of liquid nitrogen production was possible from 91 W of cooling power at 83 K. 1 litre per hour of liquid nitrogen was successfully produced for every 100 W of cooling power at 83 K, in a commercial application. Three more 330 W pulse tubes have been mounted to a single 1000 cc DPWG to produce > 1 kW of cooling power at 77 K. The commercialisation of the 1000 W cryocooler is the topic of another paper presented at this conference. Details of the design, development, testing and integration of the 330 W cryocooler are presented in this paper.
Malberti, Martina
2006-01-01
The precision measurement of the W boson properties, such as its mass and width, constitutes an important consistency check of the Standard Model. This paper, in particular, describes methods to measure the W mass with improved precision at the Large Hadron Collider, exploiting the large number of Z bosons produced. The precision on the W boson mass achievable with an integrated luminosisty of 10~fb^-1 is discussed.
The Flutter Shutter Code Calculator
Directory of Open Access Journals (Sweden)
Yohann Tendero
2015-08-01
Full Text Available The goal of the flutter shutter is to make uniform motion blur invertible, by a"fluttering" shutter that opens and closes on a sequence of well chosen sub-intervals of the exposure time interval. In other words, the photon flux is modulated according to a well chosen sequence calledflutter shutter code. This article provides a numerical method that computes optimal flutter shutter codes in terms of mean square error (MSE. We assume that the observed objects follow a known (or learned random velocity distribution. In this paper, Gaussian and uniform velocity distributions are considered. Snapshots are also optimized taking the velocity distribution into account. For each velocity distribution, the gain of the optimal flutter shutter code with respectto the optimal snapshot in terms of MSE is computed. This symmetric optimization of theflutter shutter and of the snapshot allows to compare on an equal footing both solutions, i.e. camera designs. Optimal flutter shutter codes are demonstrated to improve substantially the MSE compared to classic (patented or not codes. A numerical method that permits to perform a reverse engineering of any existing (patented or not flutter shutter codes is also describedand an implementation is given. In this case we give the underlying velocity distribution fromwhich a given optimal flutter shutter code comes from. The combination of these two numerical methods furnishes a comprehensive study of the optimization of a flutter shutter that includes a forward and a backward numerical solution.
Constructions of Rank Modulation Codes
Mazumdar, Arya; Zémor, Gilles
2011-01-01
Rank modulation is a way of encoding information to correct errors in flash memory devices as well as impulse noise in transmission lines. Modeling rank modulation involves construction of packings of the space of permutations equipped with the Kendall tau distance. We present several general constructions of codes in permutations that cover a broad range of code parameters. In particular, we show a number of ways in which conventional error-correcting codes can be modified to correct errors in the Kendall space. Codes that we construct afford simple encoding and decoding algorithms of essentially the same complexity as required to correct errors in the Hamming metric. For instance, from binary BCH codes we obtain codes correcting $t$ Kendall errors in $n$ memory cells that support the order of $n!/(\\log_2n!)^t$ messages, for any constant $t= 1,2,...$ We also construct families of codes that correct a number of errors that grows with $n$ at varying rates, from $\\Theta(n)$ to $\\Theta(n^{2})$. One of our constr...
Trajectory Codes for Flash Memory
Anxiao,; Langberg, Michael; Schwartz, Moshe; Bruck, Jehoshua
2010-01-01
Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data updates are determined by the data structure and the application, and are independent of the constraints imposed by the storage medium. Thus, an appropriate coding scheme is needed so that the data changes can be updated and stored efficiently under the storage-medium's constraints. In this paper, we define the general rewriting problem using a graph model. It extends many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a new rewriting scheme for flash memories, called the trajectory code, for rewriting the stored data as many times as possible without block erasures. We prove that the trajectory code is asymptotically optimal in a wide range of scenarios. We also present randomized rewriting codes optimized for expected performance (g...
Energy Technology Data Exchange (ETDEWEB)
Barr, W.L.; Bathke, C.G.; Brooks, J.N.; Bulmer, R.H.; Busigin, A.; DuBois, P.F.; Fenstermacher, M.E.; Fink, J.; Finn, P.A.; Galambos, J.D.; Gohar, Y.; Gorker, G.E.; Haines, J.R.; Hassanein, A.M.; Hicks, D.R.; Ho, S.K.; Kalsi, S.S.; Kalyanam, K.M.; Kerns, J.A.; Lee, J.D.; Miller, J.R.; Miller, R.L.; Myall, J.O.; Peng, Y-K.M.; Perkins, L.J.; Spampinato, P.T.; Strickler, D.J.; Thomson, S.L.; Wagner, C.E.; Willms, R.S.; Reid, R.L. (ed.)
1988-04-01
A tokamak systems code capable of modeling experimental test reactors has been developed and is described in this document. The code, named TETRA (for Tokamak Engineering Test Reactor Analysis), consists of a series of modules, each describing a tokamak system or component, controlled by an optimizer/driver. This code development was a national effort in that the modules were contributed by members of the fusion community and integrated into a code by the Fusion Engineering Design Center. The code has been checked out on the Cray computers at the National Magnetic Fusion Energy Computing Center and has satisfactorily simulated the Tokamak Ignition/Burn Experimental Reactor II (TIBER) design. A feature of this code is the ability to perform optimization studies through the use of a numerical software package, which iterates prescribed variables to satisfy a set of prescribed equations or constraints. This code will be used to perform sensitivity studies for the proposed International Thermonuclear Experimental Reactor (ITER). 22 figs., 29 tabs.
CodedStream: live media streaming with overlay coded multicast
Guo, Jiang; Zhu, Ying; Li, Baochun
2003-12-01
Multicasting is a natural paradigm for streaming live multimedia to multiple end receivers. Since IP multicast is not widely deployed, many application-layer multicast protocols have been proposed. However, all of these schemes focus on the construction of multicast trees, where a relatively small number of links carry the multicast streaming load, while the capacity of most of the other links in the overlay network remain unused. In this paper, we propose CodedStream, a high-bandwidth live media distribution system based on end-system overlay multicast. In CodedStream, we construct a k-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied to work around bottlenecks. Simulation results have shown that the combination of k-redundant multicast graph and network coding may indeed bring significant benefits with respect to improving the quality of live media at the end receivers.
Surface code implementation of block code state distillation
Fowler, Austin G.; Devitt, Simon J.; Jones, Cody
2013-01-01
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved |A〉 state given 15 input copies. New block code state distillation methods can produce k improved |A〉 states given 3k + 8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three. PMID:23736868
Coding and decoding for code division multiple user communication systems
Healy, T. J.
1985-01-01
A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.
SYNTEZA ZEOLITÓW DO ADSORPCJI ACETONU
Directory of Open Access Journals (Sweden)
Magdalena WARZYBOK
2016-03-01
Full Text Available Celem prowadzonych badań było uzyskanie efektywnych adsorbentów do usuwania acetonu z gazów odlotowych. Wybrano zeolit typu Y ze względu na jego wysoką termo stabilność umożliwiającą desorpcję zaadsorbowanego acetonu w temperaturach dochodzących do 1000°C. Proces syntezy składał się z czterech etapów: (1 aktywacji termicznej surowego materiału, (2 starzenia mieszanin reakcyjnych w temperaturze otoczenia, (3 krystalizacji (wysokotemperaturowego ogrzewania składników oraz (4 przemywania i suszenia produktu. Jako substraty wykorzystano naturalne materiały ilaste – bentonit (B, haloizyt (H oraz kaolin (K. Aby zapewnić odpowiedni stosunek molowy Na2O:SiO2:Al2O3:H2O do syntezy zastosowano również krzemionkę (SiO2 oraz roztwory chlorku (NaCl oraz wodorotlenku sodu (NaOH. Podczas badań optymalizowano: temperaturę aktywacji, czas starzenia oraz czas i temperaturę etapu krystalizacji. Wpływ optymalizowanych parametrów na właściwości otrzymanych adsorbentów oceniano na podstawie: masy uzyskanego produktu, straty po prażeniu (LOI [%], stężenia jonów Na+ w przesączach poreakcyjnych (CNa [mg/l] oraz pojemności adsorpcyjnej względem acetonu (qe [mg/g]. Optymalna temperatura aktywacji wyjściowych materiałów ilastych wynosi 600°C. Podnoszenie temperatury aktywacji o kolejne 100°C skutkowało pogarszaniem właściwości adsorbentów. Wydłużenie czasu starzenia i krystalizacji, jak również podwyższenie temperatury etapu krystalizacji poprawia właściwości adsorpcyjne otrzymanych zeolitów. Optymalny czas etapu krystalizacji zależy od rodzaju materiału wyjściowego użytego do syntezy, temperatury aktywacji oraz czasu starzenia. Wydłużenie czasu starzenia mieszanin reakcyjnych pozwala na skrócenie czasu krystalizacji.
Nanocrystalline Ni-W coatings on copper
Energy Technology Data Exchange (ETDEWEB)
Panagopoulos, C.N., E-mail: chpanag@metal.ntua.gr [Laboratory of Physical Metallurgy, National Technical University of Athens, Zografos, 15780, Athens (Greece); Plainakis, G.D.; Lagaris, D.A. [Laboratory of Physical Metallurgy, National Technical University of Athens, Zografos, 15780, Athens (Greece)
2011-04-15
Nanocrystalline Ni-W coatings were produced on copper substrates with the aid of electrodeposition technique. The morphology, chemical composition and structure of the produced coatings were examined with the aid of scanning electron microscopy (SEM), electron dispersive spectroscopy (EDS) and X-ray diffraction (XRD) techniques. The microhardness of alloy Ni-W coatings on copper substrate was also studied. The adhesion between the Ni-W coating, having W content 50 wt%, and the copper substrate, was also studied with a scratch testing apparatus. The scratch tests resulted in the coatings suffering an intensive brittle fracture and minor delamination.
Code-Mixing and Code Switchingin The Process of Learning
Directory of Open Access Journals (Sweden)
Diyah Atiek Mustikawati
2016-09-01
Full Text Available This study aimed to describe a form of code switching and code mixing specific form found in the teaching and learning activities in the classroom as well as determining factors influencing events stand out that form of code switching and code mixing in question.Form of this research is descriptive qualitative case study which took place in Al Mawaddah Boarding School Ponorogo. Based on the analysis and discussion that has been stated in the previous chapter that the form of code mixing and code switching learning activities in Al Mawaddah Boarding School is in between the use of either language Java language, Arabic, English and Indonesian, on the use of insertion of words, phrases, idioms, use of nouns, adjectives, clauses, and sentences. Code mixing deciding factor in the learning process include: Identification of the role, the desire to explain and interpret, sourced from the original language and its variations, is sourced from a foreign language. While deciding factor in the learning process of code, includes: speakers (O1, partners speakers (O2, the presence of a third person (O3, the topic of conversation, evoke a sense of humour, and just prestige. The significance of this study is to allow readers to see the use of language in a multilingual society, especially in AL Mawaddah boarding school about the rules and characteristics variation in the language of teaching and learning activities in the classroom. Furthermore, the results of this research will provide input to the ustadz / ustadzah and students in developing oral communication skills and the effectiveness of teaching and learning strategies in boarding schools.
Czynniki prognostyczne progresji radiologicznej w reumatoidalnym zapaleniu stawów
Directory of Open Access Journals (Sweden)
Piotr Wiland
2010-08-01
Full Text Available Możliwość przewidywania odległych konsekwencji reumatoidalnegozapalenia stawów ma zasadnicze znaczenie dla podejmowaniawłaściwych decyzji terapeutycznych u danego chorego. Markeryprognostyczne są pomocne w identyfikacji chorych o dużym ryzykuszybkiej progresji radiologicznej. Utwierdzają one lekarzaw decyzji o rozpoczęciu intensywnego leczenia u chorych z możliwąznaczną destrukcją stawów w ciągu następnych kilku lat.W artykule zaprezentowano pilotażowy model ryzyka dla przewidywaniaszybkiej progresji radiologicznej. W celu stworzenia tegomodelu posłużono się danymi, w tym wynikami badań radiologicznychpochodzącymi z badania ASPIRE, w którym porównywanomonoterapię metotreksatem z leczeniem skojarzonym metotreksatemi infliksymabem. W tym modelu wybrano wyjściowe parametry,które są łatwe do uzyskania w rutynowej praktyce klinicznej,takie jak: stężenie białka C-reaktywnego, wartość odczynuopadania krwinek czerwonych, liczbę obrzękniętych stawów orazmiano czynnika reumatoidalnego. Ten macierzowy model ryzykamoże być przydatny w ocenie ryzyka postępującego uszkodzeniastawów, szczególnie u chorych z wczesnym zapaleniem stawów.
Network Coding Fundamentals and Applications
Medard, Muriel
2011-01-01
Network coding is a field of information and coding theory and is a method of attaining maximum information flow in a network. This book is an ideal introduction for the communications and network engineer, working in research and development, who needs an intuitive introduction to network coding and to the increased performance and reliability it offers in many applications. This book is an ideal introduction for the research and development communications and network engineer who needs an intuitive introduction to the theory and wishes to understand the increased performance and reliabil
State building energy codes status
Energy Technology Data Exchange (ETDEWEB)
NONE
1996-09-01
This document contains the State Building Energy Codes Status prepared by Pacific Northwest National Laboratory for the U.S. Department of Energy under Contract DE-AC06-76RL01830 and dated September 1996. The U.S. Department of Energy`s Office of Codes and Standards has developed this document to provide an information resource for individuals interested in energy efficiency of buildings and the relevant building energy codes in each state and U.S. territory. This is considered to be an evolving document and will be updated twice a year. In addition, special state updates will be issued as warranted.
Neural Decoder for Topological Codes
Torlai, Giacomo; Melko, Roger G.
2017-07-01
We present an algorithm for error correction in topological codes that exploits modern machine learning techniques. Our decoder is constructed from a stochastic neural network called a Boltzmann machine, of the type extensively used in deep learning. We provide a general prescription for the training of the network and a decoding strategy that is applicable to a wide variety of stabilizer codes with very little specialization. We demonstrate the neural decoder numerically on the well-known two-dimensional toric code with phase-flip errors.
Atlas C++ Coding Standard Specification
Albrand, S; Barberis, D; Bosman, M; Jones, B; Stavrianakou, M; Arnault, C; Candlin, D; Candlin, R; Franck, E; Hansl-Kozanecka, Traudl; Malon, D; Qian, S; Quarrie, D; Schaffer, R D
2001-01-01
This document defines the ATLAS C++ coding standard, that should be adhered to when writing C++ code. It has been adapted from the original "PST Coding Standard" document (http://pst.cern.ch/HandBookWorkBook/Handbook/Programming/programming.html) CERN-UCO/1999/207. The "ATLAS standard" comprises modifications, further justification and examples for some of the rules in the original PST document. All changes were discussed in the ATLAS Offline Software Quality Control Group and feedback from the collaboration was taken into account in the "current" version.
Nonlocally Centralized Simultaneous Sparse Coding
Institute of Scientific and Technical Information of China (English)
雷阳; 宋占杰
2016-01-01
The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlo-cal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NC-SSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image resto-ration methods.
Lavieri, Edward D
2013-01-01
A practical guide written in a tutorial-style, ""LiveCode Mobile Development Hotshot"" walks you step-by-step through 10 individual projects. Every project is divided into sub tasks to make learning more organized and easy to follow along with explanations, diagrams, screenshots, and downloadable material.This book is great for anyone who wants to develop mobile applications using LiveCode. You should be familiar with LiveCode and have access to a smartphone. You are not expected to know how to create graphics or audio clips.
PRACTICAL ALGORITHMS FOR TORNADO CODES
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect,two algorithms are introduced: (1) while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; (2) in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.
Directory of Open Access Journals (Sweden)
Jonas Kubilius
2014-02-01
Full Text Available Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF. GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
DEFF Research Database (Denmark)
Gál, Anna; Hansen, Kristoffer Arnsfelt; Koucký, Michal;
2012-01-01
We bound the minimum number w of wires needed to compute any (asymptotically good) error-correcting code C:{0,1}Ω(n) -> {0,1}n with minimum distance Ω(n), using unbounded fan-in circuits of depth d with arbitrary gates. Our main results are: (1) If d=2 then w = Θ(n ({log n/ log log n})2). (2) If d...
Cat codes with optimal decoherence suppression for a lossy bosonic channel
Li, Linshu; Zou, Chang-Ling; Albert, Victor V.; Muralidharan, Sreraman; Girvin, S. M.; Jiang, Liang
2016-01-01
We investigate cat codes that can correct multiple excitation losses and identify two types of logical errors: bit-flip errors due to excessive excitation loss and dephasing errors due to quantum back-action from the environment. We show that selected choices of logical subspace and coherent amplitude can efficiently reduce dephasing errors. The trade-off between the two major errors enables optimized performance of cat codes in terms of minimized decoherence. With high coupling efficiency, w...
Fault-tolerant quantum computing with color codes
Landahl, Andrew J; Rice, Patrick R
2011-01-01
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk analysis to lower-bound the accuracy threshold for two of these noise models. We present and analyze two architectures for fault-tolerantly computing with these codes: one with 2D arrays of qubits are stacked atop each other and one in a single 2D substrate. Our analysis demonstrates that color codes perform slightly better than Kitaev's surface codes when circuit details are ignored. When these details are considered, w...
Introduction to coding and information theory
Roman, Steven
1997-01-01
This book is intended to introduce coding theory and information theory to undergraduate students of mathematics and computer science. It begins with a review of probablity theory as applied to finite sample spaces and a general introduction to the nature and types of codes. The two subsequent chapters discuss information theory: efficiency of codes, the entropy of information sources, and Shannon's Noiseless Coding Theorem. The remaining three chapters deal with coding theory: communication channels, decoding in the presence of errors, the general theory of linear codes, and such specific codes as Hamming codes, the simplex codes, and many others.
Beam-dynamics codes used at DARHT
Energy Technology Data Exchange (ETDEWEB)
Ekdahl, Jr., Carl August [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-02-01
Several beam simulation codes are used to help gain a better understanding of beam dynamics in the DARHT LIAs. The most notable of these fall into the following categories: for beam production – Tricomp Trak orbit tracking code, LSP Particle in cell (PIC) code, for beam transport and acceleration – XTR static envelope and centroid code, LAMDA time-resolved envelope and centroid code, LSP-Slice PIC code, for coasting-beam transport to target – LAMDA time-resolved envelope code, LSP-Slice PIC code. These codes are also being used to inform the design of Scorpius.
Energy Technology Data Exchange (ETDEWEB)
Le Corre, J.M.; Adamsson, C.; Alvarez, P., E-mail: lecorrjm@westinghouse.com, E-mail: carl.adamsson@psi.ch, E-mail: alvarep@westinghouse.com [Westinghouse Electric Sweden AB (Sweden)
2011-07-01
A benchmark analysis of the transient BFBT data [1], measured in an 8x8 fuel assembly design under typical BWR transient conditions, was performed using the VIPRE-W/MEFISTO-T code package. This is a continuation of the BFBT steady-state benchmark activities documented in [2] and [3]. All available transient void and pressure drop experimental data were considered and the measurements were compared with the predictions of the VIPRE-W sub-channel analysis code using various modeling approaches, including the EPRI drift flux void correlation. Detailed analyses of the code results were performed and it was demonstrated that the VIPRE-W transient predictions are generally reliable over the tested conditions. Available transient dryout data were also considered and the measurements were compared with the predictions of the VIPRE-W/ MEFISTO-T film flow calculations. The code calculates the transient multi-film flowrate distributions in the BFBT bundle, including the effect of spacer grids on drop deposition enhancement, and the dryout criterion corresponds to the total liquid film disappearance. After calibration of the grid enhancement effect with a very small subset of the steady-state critical power database, the code could predict the time and location of transient dryout with very good accuracy. (author)
Scheduling Linearly Indexed Assignment Codes
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.
Upper Air Observations - Synoptic Code
National Oceanic and Atmospheric Administration, Department of Commerce — Daily radiosonde and rawinsonde observations at standard and significant levels, recorded in synoptic code. Period of record 1950-1951.
Multimedia signal coding and transmission
Ohm, Jens-Rainer
2015-01-01
This textbook covers the theoretical background of one- and multidimensional signal processing, statistical analysis and modelling, coding and information theory with regard to the principles and design of image, video and audio compression systems. The theoretical concepts are augmented by practical examples of algorithms for multimedia signal coding technology, and related transmission aspects. On this basis, principles behind multimedia coding standards, including most recent developments like High Efficiency Video Coding, can be well understood. Furthermore, potential advances in future development are pointed out. Numerous figures and examples help to illustrate the concepts covered. The book was developed on the basis of a graduate-level university course, and most chapters are supplemented by exercises. The book is also a self-contained introduction both for researchers and developers of multimedia compression systems in industry.
Zip Code Level Enrollment Data
U.S. Department of Health & Human Services — The dataset includes is the number of Qualified Health Plan selections by ZIP code for 36 states that are participating in the Federally-facilitated Marketplace or...
Forms and Linear Network Codes
DEFF Research Database (Denmark)
Hansen, Johan P.
spaces of Veronese varieties. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal......We present a general theory to obtain linear network codes utilizing forms and obtain explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same small dimension. The theory is inspired by the methods of the author utilizing the osculating...... them suitable for linear network coding. The parameters of the resulting linear network codes are determined....
Electronic Code of Federal Regulations
National Archives and Records Administration — The Electronic Code of Federal Regulations (e-CFR) is the codification of the general and permanent rules published in the Federal Register by the executive...
FLYCHK Collisional-Radiative Code
SRD 160 FLYCHK Collisional-Radiative Code (Web, free access) FLYCHK provides a capability to generate atomic level populations and charge state distributions for low-Z to mid-Z elements under NLTE conditions.
Allegheny County Zip Code Boundaries
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — This dataset demarcates the zip code boundaries that lie within Allegheny County. These are not clipped to the Allgeheny County boundary. If viewing this...
Squares of Random Linear Codes
DEFF Research Database (Denmark)
Cascudo Pueyo, Ignacio; Cramer, Ronald; Mirandola, Diego
2015-01-01
a positive answer, for codes of dimension $k$ and length roughly $\\frac{1}{2}k^2$ or smaller. Moreover, the convergence speed is exponential if the difference $k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the precise......Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code ``typically'' fill the whole space? We give...
The Serializability of Network Codes
Blasiak, Anna
2010-01-01
Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of network coding problems aims to reduce the problem to optimization over a polytope of entropic vectors subject to constraints imposed by the network structure. In the case of directed acyclic graphs, these constraints are completely understood, but for general graphs the problem of enumerating them remains open: it is not known how to classify the constraints implied by a property that we call serializability, which refers to the absence of paradoxical circular dependencies in a network code. In this work we initiate the first systematic study of the constraints imposed on a network code by serializability. We find that serializability cannot be detected solely by evaluating the Shannon entropy of edge sets in the graph, but nevertheless, we give a polynomial-time algorithm tha...
Institute of Scientific and Technical Information of China (English)
Qunying LIAO
2011-01-01
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. The main problem is to compute the error distance of a received word.Using the Weil bound for character sum estimate,Li and Wan showed that the error distance can be determined when the degree of the received word as a polynomial is small.In the first part,the result of Li and Wan is improved.On the other hand,one of the important parameters of an error-correcting code is the dimension.In most cases,one can only get bounds for the dinension.In the second part,a formula for the dimension of the generalized trace Reed-Solonon codes in some cases is obtained.
Code properties from holographic geometries
Pastawski, Fernando
2016-01-01
Almheiri, Dong, and Harlow [hep-th/1411.7041] proposed a highly illuminating connection between the AdS/CFT holographic correspondence and operator algebra quantum error correction (OAQEC). Here we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes which admit a holographic interpretation. We introduce a new quantity called `price', which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit `uberholography', meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for q...
Efficient codes and balanced networks.
Denève, Sophie; Machens, Christian K
2016-03-01
Recent years have seen a growing interest in inhibitory interneurons and their circuits. A striking property of cortical inhibition is how tightly it balances excitation. Inhibitory currents not only match excitatory currents on average, but track them on a millisecond time scale, whether they are caused by external stimuli or spontaneous fluctuations. We review, together with experimental evidence, recent theoretical approaches that investigate the advantages of such tight balance for coding and computation. These studies suggest a possible revision of the dominant view that neurons represent information with firing rates corrupted by Poisson noise. Instead, tight excitatory/inhibitory balance may be a signature of a highly cooperative code, orders of magnitude more precise than a Poisson rate code. Moreover, tight balance may provide a template that allows cortical neurons to construct high-dimensional population codes and learn complex functions of their inputs.
NSGIC Local Govt | GIS Inventory — The WCSZipcode polygon feature class was created by Miami-Dade Enterprise Technology Department to be used in the WCS batch jobs to assign the actual zip code of...
The moving mesh code Shadowfax
Vandenbroucke, Bert
2016-01-01
We introduce the moving mesh code Shadowfax, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public License. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare Shadowfax with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
The moving mesh code SHADOWFAX
Vandenbroucke, B.; De Rijcke, S.
2016-07-01
We introduce the moving mesh code SHADOWFAX, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public Licence. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare SHADOWFAX with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
Ultrasound imaging using coded signals
DEFF Research Database (Denmark)
Misaridis, Athanasios
Modulated (or coded) excitation signals can potentially improve the quality and increase the frame rate in medical ultrasound scanners. The aim of this dissertation is to investigate systematically the applicability of modulated signals in medical ultrasound imaging and to suggest appropriate...... methods for coded imaging, with the goal of making better anatomic and flow images and three-dimensional images. On the first stage, it investigates techniques for doing high-resolution coded imaging with improved signal-to-noise ratio compared to conventional imaging. Subsequently it investigates how...... coded excitation can be used for increasing the frame rate. The work includes both simulated results using Field II, and experimental results based on measurements on phantoms as well as clinical images. Initially a mathematical foundation of signal modulation is given. Pulse compression based...
Facilitating Internet-Scale Code Retrieval
Bajracharya, Sushil Krishna
2010-01-01
Internet-Scale code retrieval deals with the representation, storage, and access of relevant source code from a large amount of source code available on the Internet. Internet-Scale code retrieval systems support common emerging practices among software developers related to finding and reusing source code. In this dissertation we focus on some…
Decoder for Nonbinary CWS Quantum Codes
Melo, Nolmar; Portugal, Renato
2012-01-01
We present a decoder for nonbinary CWS quantum codes using the structure of union codes. The decoder runs in two steps: first we use a union of stabilizer codes to detect a sequence of errors, and second we build a new code, called union code, that allows to correct the errors.
Parametric Coding of Stereo Audio
Directory of Open Access Journals (Sweden)
Erik Schuijers
2005-06-01
Full Text Available Parametric-stereo coding is a technique to efficiently code a stereo audio signal as a monaural signal plus a small amount of parametric overhead to describe the stereo image. The stereo properties are analyzed, encoded, and reinstated in a decoder according to spatial psychoacoustical principles. The monaural signal can be encoded using any (conventional audio coder. Experiments show that the parameterized description of spatial properties enables a highly efficient, high-quality stereo audio representation.
Interleaver Design for Turbo Coding
DEFF Research Database (Denmark)
Andersen, Jakob Dahl; Zyablov, Viktor
1997-01-01
By a combination of construction and random search based on a careful analysis of the low weight words and the distance properties of the component codes, it is possible to find interleavers for turbo coding with a high minimum distance. We have designed a block interleaver with permutations...... of each row, and found a combination of permutations where a tight upper bound to the minimum distance of the complete turbo scheme is 108....
Eklund, Kerri
2016-01-01
The Guide to the Code of Ethics for Nurses is an excellent guideline for all nurses regardless of their area of practice. I greatly enjoyed reading the revisions in place within the 2015 edition and refreshing my nursing conscience. I plan to always keep my Guide to the Code of Ethics for Nurses near in order to keep my moral compass from veering off the path of quality care.
Indian Academy of Sciences (India)
Prathyush Samineni; Debabrata Goswami
2008-12-01
We demonstrate coded self-assembly in nanostructures using the code seeded at the component level through computer simulations. Defects or cavities occur in all natural assembly processes including crystallization and our simulations capture this essential aspect under surface minimization constraints for self-assembly. Our bottom-up approach to nanostructures would provide a new dimension towards nanofabrication and better understanding of defects and crystallization process.
Energy Technology Data Exchange (ETDEWEB)
Chang, Jong Hwa; Lee, Ki Bog; Zee, Sung Kyun; Lee, Chang Ho [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1993-12-01
ONED90 developed by KAERI is a 1-dimensional 2-group diffusion theory code. For nuclear design and reactor simulation, the usage of ONED90 encompasses core follow calculation, load follow calculation, plant power control simulation, xenon oscillation simulation and control rod maneuvering, etc. In order to verify the validity of ONED90 code, two well-known benchmark problems are solved by ONED90 shows very similar result to reference solution. (Author) 11 refs., 5 figs., 13 tabs.
Product Work Classification and Coding
1986-06-01
detail is much more useful in planning steel welding processes. In this regard remember that mild steel , HSLA steel , and high-yield steel (e.g. HY80 ...manufacturing facility. In Figure 2.3-2, a classification and coding system for steel parts is shown. This classification and coding system sorts steel parts...system would provide a shop which produced steel parts with a means of organizing parts. Rather than attempting to manage all of its parts as a single
A Pixel Domain Video Coding based on Turbo code and Arithmetic code
Directory of Open Access Journals (Sweden)
Cyrine Lahsini
2012-05-01
Full Text Available In recent years, with emerging applications such as multimedia sensors networks, wirelesslow-power surveillance and mobile camera phones, the traditional video coding architecture in beingchallenged. In fact, these applications have different requirements than those of the broadcast videodelivery systems: a low power consumption at the encoder side is essential.In this context, we propose a pixel-domain video coding scheme which fits well in these senarios.In this system, both the arithmetic and turbo codes are used to encode the video sequence's frames.Simulations results show significant gains over Pixel-domain Wyner-Ziv video codeingr.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Wet (W). 29.2570 Section 29.2570 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing...-Cured Tobacco (u.s. Types 22, 23, and Foreign Type 96) § 29.2570 Wet (W). Any sound tobacco...
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Wet (W). 29.3567 Section 29.3567 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 95) § 29.3567 Wet (W). Any sound tobacco containing excessive moisture to the extent that it is...
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Wet (W). 29.3077 Section 29.3077 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Wet (W). Any sound tobacco containing excessive moisture to the extent that it is in an unsafe...
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Wet (W). 29.1083 Section 29.1083 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 92) § 29.1083 Wet (W). Any sound tobacco containing excessive moisture to the extent that it is...
Diamond, P. J.; Nyman, L. Å.
The authors report on some preliminary results from a multi-epoch monitoring project of the OH and H2O masers in the source W43A. Their results suggest that W43A is a very young stellar object which has just entered a strong stellar wind stage.
Aad, G.; Abdallah, J.; Abdelalim, A.A.; Abdesselam, A.; Abdinov, O.; Abi, B.; Abolins, M.; Abramowicz, H.; Abreu, H.; Acerbi, E.; Acharya, B.S.; Ackers, M.; Adams, D.L.; Addy, T.N.; Adelman, J.; Aderholz, M.; Adomeit, S.; Adorisio, C.; Adragna, P.; Adye, T.; Aefsky, S.; Aguilar-Saavedra, J.A.; Aharrouche, M.; Ahlen, S.P.; Ahles, F.; Ahmad, A.; Ahmed, H.; Ahsan, M.; Aielli, G.; Akdogan, T.; Akesson, T.P.A.; Akimoto, G.; Akimov, A.V.; Aktas, A.; Alam, M.S.; Alam, M.A.; Albrand, S.; Aleksa, M.; Aleksandrov, I.N.; Aleppo, M.; Alessandria, F.; Alexa, C.; Alexander, G.; Alexandre, G.; Alexopoulos, T.; Alhroob, M.; Aliev, M.; Alimonti, G.; Alison, J.; Aliyev, M.; Allport, P.P.; Allwood-Spiers, S.E.; Almond, J.; Aloisio, A.; Alon, R.; Alonso, A.; Alonso, J.; Alviggi, M.G.; Amako, K.; Amaral, P.; Ambrosio, G.; Amelung, C.; Ammosov, V.V.; Amorim, A.; Amoros, G.; Amram, N.; Anastopoulos, C.; Andeen, T.; Anders, C.F.; Anderson, K.J.; Andreazza, A.; Andrei, V.; Andrieux, M-L.; Anduaga, X.S.; Angerami, A.; Anghinolfi, F.; Anjos, N.; Annovi, A.; Antonaki, A.; Antonelli, M.; Antonelli, S.; Antos, J.; Antunovic, B.; Anulli, F.; Aoun, S.; Apolle, R.; Arabidze, G.; Aracena, I.; Arai, Y.; Arce, A.T.H.; Archambault, J.P.; Arfaoui, S.; Arguin, J-F.; Argyropoulos, T.; Arik, E.; Arik, M.; Armbruster, A.J.; Arms, K.E.; Armstrong, S.R.; Arnaez, O.; Arnault, C.; Artamonov, A.; Arutinov, D.; Asai, M.; Asai, S.; Asfandiyarov, R.; Ask, S.; Asman, B.; Asner, D.; Asquith, L.; Assamagan, K.; Astbury, A.; Astvatsatourov, A.; Atoian, G.; Aubert, B.; Auerbach, B.; Auge, E.; Augsten, K.; Aurousseau, M.; Austin, N.; Avolio, G.; Avramidou, R.; Axen, D.; Ay, C.; Azuelos, G.; Azuma, Y.; Baak, M.A.; Baccaglioni, G.; Bacci, C.; Bach, A.M.; Bachacou, H.; Bachas, K.; Bachy, G.; Backes, M.; Badescu, E.; Bagnaia, P.; Bai, Y.; Bailey, D.C.; Bain, T.; Baines, J.T.; Baker, O.K.; Baker, M.D.; Baker, S; Baltasar Dos Santos Pedrosa, F.; Banas, E.; Banerjee, P.; Banerjee, Sw.; Banfi, D.; Bangert, A.; Bansal, V.; Baranov, S.P.; Baranov, S.; Barashkou, A.; Barbaro Galtieri, A.; Barber, T.; Barberio, E.L.; Barberis, D.; Barbero, M.; Bardin, D.Y.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnett, B.M.; Barnett, R.M.; Baroncelli, A.; Barone, M.; Barr, A.J.; Barreiro, F.; Barreiro Guimaraes da Costa, J.; Barrillon, P.; Bartoldus, R.; Bartsch, D.; Bates, R.L.; Batkova, L.; Batley, J.R.; Battaglia, A.; Battistin, M.; Battistoni, G.; Bauer, F.; Bawa, H.S.; Bazalova, M.; Beare, B.; Beau, T.; Beauchemin, P.H.; Beccherle, R.; Bechtle, P.; Beck, G.A.; Beck, H.P.; Beckingham, M.; Becks, K.H.; Beddall, A.J.; Beddall, A.; Bednyakov, V.A.; Bee, C.; Begel, M.; Behar Harpaz, S.; Behera, P.K.; Beimforde, M.; Belanger-Champagne, C.; Belhorma, B.; Bell, P.J.; Bell, W.H.; Bella, G.; Bellagamba, L.; Bellina, F.; Bellomo, G.; Bellomo, M.; Belloni, A.; Belotskiy, K.; Beltramello, O.; Ben Ami, S.; Benary, O.; Benchekroun, D.; Benchouk, C.; Bendel, M.; Benedict, B.H.; Benekos, N.; Benhammou, Y.; Benincasa, G.P.; Benjamin, D.P.; Benoit, M.; Bensinger, J.R.; Benslama, K.; Bentvelsen, S.; Beretta, M.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Berglund, E.; Beringer, J.; Bernardet, K.; Bernat, P.; Bernhard, R.; Bernius, C.; Berry, T.; Bertin, A.; Bertinelli, F.; Bertolucci, F.; Besana, M.I.; Besson, N.; Bethke, S.; Bhimji, W.; Bianchi, R.M.; Bianco, M.; Biebel, O.; Biesiada, J.; Biglietti, M.; Bilokon, H.; Binder, M.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biscarat, C.; Bischof, R.; Bitenc, U.; Black, K.M.; Blair, R.E.; Blanchard, J-B; Blanchot, G.; Blocker, C.; Blocki, J.; Blondel, A.; Blum, W.; Blumenschein, U.; Boaretto, C.; Bobbink, G.J.; Bobrovnikov, V.B.; Bocci, A.; Bocian, D.; Bock, R.; Boddy, C.R.; Boehler, M.; Boek, J.; Boelaert, N.; Boser, S.; Bogaerts, J.A.; Bogdanchikov, A.; Bogouch, A.; Bohm, C.; Bohm, J.; Boisvert, V.; Bold, T.; Boldea, V.; Bondarenko, V.G.; Bondioli, M.; Boonekamp, M.; Boorman, G.; Booth, C.N.; Booth, P.; Booth, J.R.A.; Bordoni, S.; Borer, C.; Borisov, A.; Borissov, G.; Borjanovic, I.; Borroni, S.; Bos, K.; Boscherini, D.; Bosman, M.; Boterenbrood, H.; Botterill, D.; Bouchami, J.; Boudreau, J.; Bouhova-Thacker, E.V.; Boulahouache, C.; Bourdarios, C.; Boveia, A.; Boyd, J.; Boyko, I.R.; Bozhko, N.I.; Bozovic-Jelisavcic, I.; Braccini, S.; Bracinik, J.; Braem, A.; Brambilla, E.; Branchini, P.; Brandenburg, G.W.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J.E.; Braun, H.M.; Brelier, B.; Bremer, J.; Brenner, R.; Bressler, S.; Breton, D.; Brett, N.D.; Bright-Thomas, P.G.; Britton, D.; Brochu, F.M.; Brock, I.; Brock, R.; Brodbeck, T.J.; Brodet, E.; Broggi, F.; Bromberg, C.; Brooijmans, G.; Brooks, W.K.; Brown, G.; Brubaker, E.; Bruckman de Renstrom, P.A.; Bruncko, D.; Bruneliere, R.; Brunet, S.; Bruni, A.
2010-01-01
First measurements of the W -> lnu and Z/gamma* -> ll (l = e, mu) production cross sections in proton-proton collisions at sqrt(s) = 7 TeV are presented using data recorded by the ATLAS experiment at the LHC. The results are based on 2250 W -> lnu and 179 Z/gamma* -> ll candidate events selected from a data set corresponding to an integrated luminosity of approximately 320 nb-1. The measured total W and Z/gamma*-boson production cross sections times the respective leptonic branching ratios for the combined electron and muon channels are $\\stotW$ * BR(W -> lnu) = 9.96 +- 0.23(stat) +- 0.50(syst) +- 1.10(lumi) nb and $\\stotZg$ * BR(Z/gamma* -> ll) = 0.82 +- 0.06(stat) +- 0.05(syst) +- 0.09(lumi) nb (within the invariant mass window 66 < m_ll < 116 GeV). The W/Z cross-section ratio is measured to be 11.7 +- 0.9(stat) +- 0.4(syst). In addition, measurements of the W+ and W- production cross sections and of the lepton charge asymmetry are reported. Theoretical predictions based on NNLO QCD calculations are f...
Generalized W-algebras and integrable hierarchies
Burroughs, N J; Hollowood, Timothy J; Miramontes, J L
1992-01-01
We report on generalizations of the KdV-type integrable hierarchies of Drinfel'd and Sokolov. These hierarchies lead to the existence of new classical $W$-algebras, which arise as the second Hamiltonian structure of the hierarchies. In particular, we present a construction of the $W_n^{(l)}$ algebras.
De Koraalriffen van Emmahaven (W. Sumatra)
Umbgrove, J.H.F.
1931-01-01
In the bay of Emmahaven near Padang (W. Sumatra) is a small coral reef. On the North side of this reef a small, sandy island occurs called Pasir Ketjil. It has lately been surrounded by brick walls, besides which a stone pier has been built in a S.W. direction (cf. fig. 1, a map of 1899 and fig. 2
De Koraalriffen van Emmahaven (W. Sumatra)
Umbgrove, J.H.F.
1931-01-01
In the bay of Emmahaven near Padang (W. Sumatra) is a small coral reef. On the North side of this reef a small, sandy island occurs called Pasir Ketjil. It has lately been surrounded by brick walls, besides which a stone pier has been built in a S.W. direction (cf. fig. 1, a map of 1899 and fig. 2 a
De Koraalriffen van Emmahaven (W. Sumatra)
Umbgrove, J.H.F.
1931-01-01
In the bay of Emmahaven near Padang (W. Sumatra) is a small coral reef. On the North side of this reef a small, sandy island occurs called Pasir Ketjil. It has lately been surrounded by brick walls, besides which a stone pier has been built in a S.W. direction (cf. fig. 1, a map of 1899 and fig. 2 a
Buchmüller, O L; Thompson, J C
2002-01-01
the status of the measurement of the W boson mass at LEP-2 is reviewed. Properties of the W such as branching ration into quarks and leptons and couplings to other neutral gauge bosons are reported. 4-fermion production cross-sections in e sup + e sup - collisions are also presented. (authors)
Aad, Georges; Abdallah, Jalal; Abdelalim, Ahmed Ali; Abdesselam, Abdelouahab; Abdinov, Ovsat; Abi, Babak; Abolins, Maris; Abramowicz, Halina; Abreu, Henso; Acerbi, Emilio; Acharya, Bobby Samir; Ackers, Mario; Adams, David; Addy, Tetteh; Adelman, Jahred; Aderholz, Michael; Adomeit, Stefanie; Adorisio, Cristina; Adragna, Paolo; Adye, Tim; Aefsky, Scott; Aguilar-Saavedra, Juan Antonio; Aharrouche, Mohamed; Ahlen, Steven; Ahles, Florian; Ahmad, Ashfaq; Ahmed, Hossain; Ahsan, Mahsana; Aielli, Giulio; Akdogan, Taylan; Åkesson, Torsten Paul Ake; Akimoto, Ginga; Akimov , Andrei; Aktas, Adil; Alam, Mohammad; Alam, Muhammad Aftab; Albrand, Solveig; Aleksa, Martin; Aleksandrov, Igor; Aleppo, Mario; Alessandria, Franco; Alexa, Calin; Alexander, Gideon; Alexandre, Gauthier; Alexopoulos, Theodoros; Alhroob, Muhammad; Aliev, Malik; Alimonti, Gianluca; Alison, John; Aliyev, Magsud; Allport, Phillip; Allwood-Spiers, Sarah; Almond, John; Aloisio, Alberto; Alon, Raz; Alonso, Alejandro; Alonso, Jose; Alviggi, Mariagrazia; Amako, Katsuya; Amaral, Pedro; Ambrosio, Giorgio; Amelung, Christoph; Ammosov, Vladimir; Amorim, Antonio; Amorós, Gabriel; Amram, Nir; Anastopoulos, Christos; Andeen, Timothy; Anders, Christoph Falk; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Andrieux, Marie-Laure; Anduaga, Xabier; Angerami, Aaron; Anghinolfi, Francis; Anjos, Nuno; Annovi, Alberto; Antonaki, Ariadni; Antonelli, Mario; Antonelli, Stefano; Antos, Jaroslav; Antunovic, Bijana; Anulli, Fabio; Aoun, Sahar; Apolle, Rudi; Arabidze, Giorgi; Aracena, Ignacio; Arai, Yasuo; Arce, Ayana; Archambault, John-Paul; Arfaoui, Samir; Arguin, Jean-Francois; Argyropoulos, Theodoros; Arik, Engin; Arik, Metin; Armbruster, Aaron James; Arms, Kregg; Armstrong, Stephen Randolph; Arnaez, Olivier; Arnault, Christian; Artamonov, Andrei; Arutinov, David; Asai, Makoto; Asai, Shoji; Silva, José; Asfandiyarov, Ruslan; Ask, Stefan; Åsman, Barbro; Asner, David; Asquith, Lily; Assamagan, Ketevi; Astbury, Alan; Astvatsatourov, Anatoli; Atoian, Grigor; Aubert, Bernard; Auerbach, Benjamin; Auge, Etienne; Augsten, Kamil; Aurousseau, Mathieu; Austin, Nicholas; Avolio, Giuseppe; Avramidou, Rachel Maria; Axen, David; Ay, Cano; Azuelos, Georges; Azuma, Yuya; Baak, Max; Baccaglioni, Giuseppe; Bacci, Cesare; Bach, Andre; Bachacou, Henri; Bachas, Konstantinos; Bachy, Gerard; Backes, Moritz; Badescu, Elisabeta; Bagnaia, Paolo; Bai, Yu; Bailey , David; Bain, Travis; Baines, John; Baker, Mark; Baker, Oliver Keith; Baker, Sarah; Baltasar Dos Santos Pedrosa, Fernando; Banas, Elzbieta; Banerjee, Piyali; Banerjee, Swagato; Banfi, Danilo; Bangert, Andrea Michelle; Bansal, Vikas; Baranov, Sergey; Baranov, Sergei; Barashkou, Andrei; Barbaro Galtieri, Angela; Barber, Tom; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Bardin, Dmitri; Barillari, Teresa; Barisonzi, Marcello; Barklow, Timothy; Barlow, Nick; Barnett, Bruce; Barnett, Michael; Baroncelli, Antonio; Barone , Maura; Barr, Alan; Barreiro, Fernando; Barreiro Guimar˜aes da Costa, Jo˜ao; Barrillon, Pierre; Bartoldus, Rainer; Bartsch, Detlef; Bates, Richard; Batkova, Lucia; Batley, Richard; Battaglia, Andreas; Battistin, Michele; Battistoni, Giuseppe; Bauer, Florian; Bawa, Harinder Singh; Bazalova, Magdalena; Beare, Brian; Beau, Tristan; Beauchemin, Pierre-Hugues; Beccherle, Roberto; Bechtle, Philip; Beck, Graham; Beck, Hans Peter; Beckingham, Matthew; Becks, Karl-Heinz; Beddall, Ayda; Beddall, Andrew; Bednyakov, Vadim; Bee, Christopher; Begel, Michael; Behar Harpaz, Silvia; Behera, Prafulla; Beimforde, Michael; Belanger-Champagne, Camille; Belhorma, Bouchra; Bell, Paul; Bell, William; Bella, Gideon; Bellagamba, Lorenzo; Bellina, Francesco; Bellomo, Giovanni; Bellomo, Massimiliano; Belloni, Alberto; Belotskiy, Konstantin; Beltramello, Olga; Ben Ami, Sagi; Benary, Odette; Benchekroun, Driss; Benchouk, Chafik; Bendel, Markus; Benedict, Brian Hugues; Benekos, Nektarios; Benhammou, Yan; Benincasa, Gianpaolo; Benjamin, Douglas; Benoit, Mathieu; Bensinger, James; Benslama, Kamal; Bentvelsen, Stan; Beretta, Matteo; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Berghaus, Frank; Berglund, Elina; Beringer, Jürg; Bernardet, Karim; Bernat, Pauline; Bernhard, Ralf; Bernius, Catrin; Berry, Tracey; Bertin, Antonio; Bertinelli, Francesco; Bertolucci, Federico; Besana, Maria Ilaria; Besson, Nathalie; Bethke, Siegfried; Bhimji, Wahid; Bianchi, Riccardo-Maria; Bianco, Michele; Biebel, Otmar; Biesiada, Jed; Biglietti, Michela; Bilokon, Halina; Binder , Meta; Bindi, Marcello; Binet, Sebastien; Bingul, Ahmet; Bini, Cesare; Biscarat, Catherine; Bischof, Reinhard; Bitenc, Urban; Black, Kevin; Blair, Robert; Blanchard, Jean-Baptiste; Blanchot, Georges; Blocker, Craig; Blocki, Jacek; Blondel, Alain; Blum, Walter; Blumenschein, Ulrike; Boaretto, Christian; Bobbink, Gerjan; Bobrovnikov, Victor; Bocci, Andrea; Bocian, Dariusz; Bock, Rudolf; Boddy, Christopher Richard; Boehler, Michael; Boek, Jennifer; Boelaert, Nele; Böser, Sebastian; Bogaerts, Joannes Andreas; Bogdanchikov, Alexander; Bogouch, Andrei; Bohm, Christian; Bohm, Jan; Boisvert, Veronique; Bold, Tomasz; Boldea, Venera; Bondarenko, Valery; Bondioli, Mario; Boonekamp, Maarten; Boorman, Gary; Booth, Chris; Booth, Richard; Booth, Peter; Bordoni, Stefania; Borer, Claudia; Borisov, Anatoly; Borissov, Guennadi; Borjanovic, Iris; Borroni, Sara; Bos, Kors; Boscherini, Davide; Bosman, Martine; Boterenbrood, Hendrik; Botterill, David; Bouchami, Jihene; Boudreau, Joseph; Bouhova-Thacker, Evelina Vassileva; Boulahouache, Chaouki; Bourdarios, Claire; Boveia, Antonio; Boyd, James; Boyko, Igor; Bozhko, Nikolay; Bozovic-Jelisavcic, Ivanka; Braccini, Saverio; Bracinik, Juraj; Braem, Andr\\'e; Brambilla, Elena; Branchini, Paolo; Brandenburg, George; Brandt, Andrew; Brandt, Gerhard; Brandt, Oleg; Bratzler, Uwe; Brau, Benjamin; Brau, James; Braun, Helmut; Brelier, Bertrand; Bremer, Johan; Brenner, Richard; Bressler, Shikma; Breton, Dominique; Brett, Nicolas; Bright-Thomas, Paul; Britton, Dave; Brochu, Frederic; Brock, Ian; Brock, Raymond; Brodbeck, Timothy; Brodet, Eyal; Broggi, Francesco; Bromberg, Carl; Brooijmans, Gustaaf; Brooks, William; Brown, Gareth; Brubaker, Erik; Bruckman de Renstrom, Pawel; Bruncko, Dusan; Bruneliere, Renaud; Brunet, Sylvie; Bruni, Alessia; Bruni, Graziano; Bruschi, Marco; Buanes, Trygve; Bucci, Francesca; Buchanan, James; Buchanan, Norman; Buchholz, Peter; Buckingham, Ryan; Buckley, Andrew; Budagov, Ioulian; Budick, Burton; B\\"uscher, Volker; Bugge, Lars; Buira-Clark, Daniel; Buis, Ernst-Jan; Bulekov, Oleg; Bunse, Moritz; Buran, Torleiv; Burckhart, Helfried; Burdin, Sergey; Burgess, Thomas; Burke, Stephen; Busato, Emmanuel; Bussey, Peter; Buszello, Claus-Peter; Butin, Fran\\c cois; Butler, Bart; Butler, John; Buttar, Craig; Butterworth, Jonathan; Byatt, Tom; Caballero, Jose; Cabrera Urb\\'an, Susana; Caccia, Massimo; Caforio, Davide; Cakir, Orhan; Calafiura, Paolo; Calderini, Giovanni; Calfayan, Philippe; Calkins, Robert; Caloba, Luiz; Caloi, Rita; Calvet, David; Calvet, Samuel; Camard, Arnaud; Camarri, Paolo; Cambiaghi, Mario; Cameron, David; Cammin, Jochen; Campana, Simone; Campanelli, Mario; Canale, Vincenzo; Canelli, Florencia; Canepa, Anadi; Cantero, Josu; Capasso, Luciano; Capeans Garrido, Maria Del Mar; Caprini, Irinel; Caprini, Mihai; Caprio, Mario; Capriotti, Daniele; Capua, Marcella; Caputo, Regina; Caramarcu, Costin; Cardarelli, Roberto; Carli, Tancredi; Carlino, Gianpaolo; Carminati, Leonardo; Caron, Bryan; Caron, Sascha; Carpentieri, Carmen; Carrillo Montoya, German D.; Carron Montero, Sebastian; Carter, Antony; Carter, Janet; Carvalho, Jo\\~ao; Casadei, Diego; Casado, Maria Pilar; Cascella, Michele; Caso, Carlo; Castaneda Hernandez, Alfredo Martin; Castaneda-Miranda, Elizabeth; Castillo Gimenez, Victoria; Castro, Nuno Filipe; Cataldi, Gabriella; Cataneo, Fernando; Catinaccio, Andrea; Catmore, James; Cattai, Ariella; Cattani, Giordano; Caughron, Seth; Cauz, Diego; Cavallari, Alvise; Cavalleri, Pietro; Cavalli, Donatella; Cavalli-Sforza, Matteo; Cavasinni, Vincenzo; Cazzato, Antonio; Ceradini, Filippo; Cerna, Cedric; Cerqueira, Augusto Santiago; Cerri, Alessandro; Cerrito, Lucio; Cerutti, Fabio; Cervetto, Mario; Cetin, Serkant Ali; Cevenini, Francesco; Chafaq, Aziz; Chakraborty, Dhiman; Chan, Kevin; Chapman, John Derek; Chapman, John Wehrley; Chareyre, Eve; Charlton, Dave; Chavda, Vikash; Cheatham, Susan; Chekanov, Sergei; Chekulaev, Sergey; Chelkov, Gueorgui; Chen, Hucheng; Chen, Li; Chen, Shenjian; Chen, Tingyang; Chen, Xin; Cheng, Shaochen; Cheplakov, Alexander; Chepurnov, Vladimir; Cherkaoui El Moursli, Rajaa; Tcherniatine, Valeri; Chesneanu, Daniela; Cheu, Elliott; Cheung, Sing-Leung; Chevalier, Laurent; Chevallier, Florent; Chiarella, Vitaliano; Chiefari, Giovanni; Chikovani, Leila; Childers, John Taylor; Chilingarov, Alexandre; Chiodini, Gabriele; Chizhov, Mihail; Choudalakis, Georgios; Chouridou, Sofia; Christidi, Illectra-Athanasia; Christov, Asen; Chromek-Burckhart, Doris; Chu, Ming-Lee; Chudoba, Jiri; Ciapetti, Guido; Ciftci, Abbas Kenan; Ciftci, Rena; Cinca, Diane; Cindro, Vladimir; Ciobotaru, Matei Dan; Ciocca, Claudia; Ciocio, Alessandra; Cirilli, Manuela; Citterio, Mauro; Clark, Allan G.; Clark, Philip James; Cleland, Bill; Clemens, Jean-Claude; Clement, Benoit; Clement, Christophe; Clifft, Roger; Coadou, Yann; Cobal, Marina; Coccaro, Andrea; Cochran, James H.; Coe, Paul; Coelli, Simone; Coggeshall, James; Cogneras, Eric; Cojocaru, Claudiu; Colas, Jacques; Cole, Brian; Colijn, Auke-Pieter; Collard, Caroline; Collins, Neil; Collins-Tooth, Christopher; Collot, Johann; Colon, German; Coluccia, Rita; Comune, Gianluca; Conde Mui\\~no, Patricia; Coniavitis, Elias; Conidi, Maria Chiara; Consonni, Michele; Constantinescu, Serban; Conta, Claudio; Conventi, Francesco; Cook, James; Cooke, Mark; Cooper, Ben; Cooper-Sarkar, Amanda; Cooper-Smith, Neil; Copic, Katherine; Cornelissen, Thijs; Corradi, Massimo; Correard, Sebastien; Corriveau, Francois; Corso-Radu, Alina; Cortes-Gonzalez, Arely; Cortiana, Giorgio; Costa, Giuseppe; Costa, Mar\\'ia Jos\\'e; Costanzo, Davide; Costin, Tudor; C\\^ot\\'e, David; Coura Torres, Rodrigo; Courneyea, Lorraine; Cowan, Glen; Cowden, Christopher; Cox, Brian; Cranmer, Kyle; Cranshaw, Jack; Cristinziani, Markus; Crosetti, Giovanni; Crupi, Roberto; Cr\\'ep\\'e-Renaudin, Sabine; Cuenca Almenar, Crist\\'obal; Cuhadar Donszelmann, Tulay; Cuneo, Stefano; Curatolo, Maria; Curtis, Chris; Cwetanski, Peter; Czirr, Hendrik; Czyczula, Zofia; D'Auria, Saverio; D'Onofrio, Monica; D'Orazio, Alessia; Da Rocha Gesualdi Mello, Aline; Da Silva, Paulo Vitor; Da Via, Cinzia; Dabrowski, Wladyslaw; Dahlhoff, Andrea; Dai, Tiesheng; Dallapiccola, Carlo; Dallison, Steve; Daly, Colin; Dam, Mogens; Dameri, Mauro; Damiani, Daniel; Danielsson, Hans Olof; Dankers, Reinier; Dannheim, Dominik; Dao, Valerio; Darbo, Giovanni; Darlea, Georgiana Lavinia; Daum, Cornelis; Dauvergne , Jean-Pierre; Davey, Will; Davidek, Tomas; Davidson, Nadia; Davidson, Ruth; Davies, Merlin; Davison, Adam; Dawe, Edmund; Dawson, Ian; Dawson, John; Daya, Rozmin; De, Kaushik; de Asmundis, Riccardo; De Castro, Stefano; De Castro Faria Salgado, Pedro; De Cecco, Sandro; de Graat, Julien; De Groot, Nicolo; de Jong, Paul; De La Cruz-Burelo, Eduard; De La Taille, Christophe; De Lotto, Barbara; De Mora, Lee; De Nooij, Lucie; De Oliveira Branco, Miguel; De Pedis, Daniele; de Saintignon, Paul; De Salvo, Alessandro; De Sanctis, Umberto; De Santo, Antonella; De Vivie De Regie, Jean-Baptiste; De Zorzi, Guido; Dean, Simon; Dedes, George; Dedovich, Dmitri; Defay, Pierre Olivier; Degenhardt, James; Dehchar, Mohamed; Deile, Mario; Del Papa, Carlo; Del Peso, Jose; Del Prete, Tarcisio; Dell'Acqua, Andrea; Dell'Asta, Lidia; Della Pietra, Massimo; della Volpe, Domenico; Delmastro, Marco; Delpierre, Pierre; Delruelle, Nicolas; Delsart, Pierre-Antoine; Deluca, Carolina; Demers, Sarah; Demichev, Mikhail; Demirkoz, Bilge; Deng, Jianrong; Deng, Wensheng; Denisov, Sergey; Dennis, Chris; Derkaoui, Jamal Eddine; Derue, Frederic; Dervan, Paul; Desch, Klaus Kurt; Deviveiros, Pier-Olivier; Dewhurst, Alastair; DeWilde, Burton; Dhaliwal, Saminder; Dhullipudi, Ramasudhakar; Di Ciaccio, Anna; Di Ciaccio, Lucia; Di Domenico, Antonio; Di Girolamo, Alessandro; Di Girolamo, Beniamino; Di Luise, Silvestro; Di Mattia, Alessandro; Di Nardo, Roberto; Di Simone, Andrea; Di Sipio, Riccardo; Diaz, Marco Aurelio; Diaz Gomez, Manuel Maria; Diblen, Faruk; Diehl, Edward; Dietl, Hans; Dietrich, Janet; Dietzsch, Thorsten; Diglio, Sara; Dindar Yagci, Kamile; Dingfelder, Jochen; Dionisi, Carlo; Dita, Petre; Dita, Sanda; Dittus, Fridolin; Djama, Fares; Djilkibaev, Rashid; Djobava, Tamar; do Vale, Maria Aline Barros; Do Valle Wemans, Andr\\'e; Doan, Thi Kieu Oanh; Dobbs, Matt; Dobinson , Robert; Dobos, Daniel; Dobson, Ellie; Dobson, Marc; Dodd, Jeremy; Dogan, Ozgen Berkol; Doglioni, Caterina; Doherty, Tom; Doi, Yoshikuni; Dolejsi, Jiri; Dolenc, Irena; Dolezal, Zdenek; Dolgoshein, Boris; Dohmae, Takeshi; Donadelli, Marisilvia; Donega, Mauro; Donini, Julien; Dopke, Jens; Doria, Alessandra; Dos Anjos, Andre; Dosil, Mireia; Dotti, Andrea; Dova, Maria-Teresa; Dowell, John; Doxiadis, Alexander; Doyle, Tony; Drasal, Zbynek; Drees, J\\"urgen; Dressnandt, Nandor; Drevermann, Hans; Driouichi, Chafik; Dris, Manolis; Drohan, Janice; Dubbert, J\\"org; Dubbs, Tim; Dube, Sourabh; Duchovni, Ehud; Duckeck, Guenter; Dudarev, Alexey; Dudziak, Fanny; D\\"uhrssen , Michael; Duerdoth, Ian; Duflot, Laurent; Dufour, Marc-Andre; Dunford, Monica; Duran Yildiz, Hatice; Dushkin, Andrei; Duxfield, Robert; Dwuznik, Michal; Dydak , Friedrich; Dzahini, Daniel; D\\"uren, Michael; Ebenstein, William; Ebke, Johannes; Eckert, Simon; Eckweiler, Sebastian; Edmonds, Keith; Edwards, Clive; Efthymiopoulos, Ilias; Egorov, Kirill; Ehrenfeld, Wolfgang; Ehrich, Thies; Eifert, Till; Eigen, Gerald; Einsweiler, Kevin; Eisenhandler, Eric; Ekelof, Tord; El Kacimi, Mohamed; Ellert, Mattias; Elles, Sabine; Ellinghaus, Frank; Ellis, Katherine; Ellis, Nicolas; Elmsheuser, Johannes; Elsing, Markus; Ely, Robert; Emeliyanov, Dmitry; Engelmann, Roderich; Engl, Albert; Epp, Brigitte; Eppig, Andrew; Erdmann, Johannes; Ereditato, Antonio; Eriksson, Daniel; Ermoline, Iouri; Ernst, Jesse; Ernst, Michael; Ernwein, Jean; Errede, Deborah; Errede, Steven; Ertel, Eugen; Escalier, Marc; Escobar, Carlos; Espinal Curull, Xavier; Esposito, Bellisario; Etienne, Francois; Etienvre, Anne-Isabelle; Etzion, Erez; Evangelakou, Despoina; Evans, Hal; Evdokimov, Valery; Fabbri, Laura; Fabre, Caroline; Facius, Katrine; Fakhrutdinov, Rinat; Falciano, Speranza; Falou, Alain; Fang, Yaquan; Fanti, Marcello; Farbin, Amir; Farilla, Addolorata; Farley, Jason; Farooque, Trisha; Farrington, Sinead; Farthouat, Philippe; Fasching, Damon; Fassnacht, Patrick; Fassouliotis, Dimitrios; Fatholahzadeh, Baharak; Fayard, Louis; Fazio, Salvatore; Febbraro, Renato; Federic, Pavol; Fedin, Oleg; Fedorko, Ivan; Fedorko, Woiciech; Fehling-Kaschek, Mirjam; Feligioni, Lorenzo; Felzmann, Ulrich; Feng, Cunfeng; Feng, Eric; Fenyuk, Alexander; Ferencei, Jozef; Ferguson, Douglas; Ferland, Jonathan; Fernandes, Bruno; Fernando, Waruna; Ferrag, Samir; Ferrando, James; Ferrara, Valentina; Ferrari, Arnaud; Ferrari, Pamela; Ferrari, Roberto; Ferrer, Antonio; Ferrer, Maria Lorenza; Ferrere, Didier; Ferretti, Claudio; Ferretto Parodi, Andrea; Ferro, Fabrizio; Fiascaris, Maria; Fiedler, Frank; Filipcic, Andrej; Filippas, Anastasios; Filthaut, Frank; Fincke-Keeler, Margret; Fiolhais, Miguel; Fiorini, Luca; Firan, Ana; Fischer, Gordon; Fischer , Peter; Fisher, Matthew; Fisher, Steve; Flammer, Joachim; Flechl, Martin; Fleck, Ivor; Fleckner, Johanna; Fleischmann, Philipp; Fleischmann, Sebastian; Flick, Tobias; Flores Castillo, Luis; Flowerdew, Michael; F\\"ohlisch, Florian; Fokitis, Manolis; Fonseca Martin, Teresa; Fopma, Johan; Forbush, David Alan; Formica, Andrea; Forti, Alessandra; Fortin, Dominique; Foster, Joe; Fournier, Daniel; Foussat, Arnaud; Fowler, Andrew; Fowler, Ken; Fox, Harald; Francavilla, Paolo; Franchino, Silvia; Francis, David; Franklin, Melissa; Franz, Sebastien; Fraternali, Marco; Fratina, Sasa; Freestone, Julian; French, Sky; Froeschl, Robert; Froidevaux, Daniel; Frost, James; Fukunaga, Chikara; Fullana Torregrosa, Esteban; Fuster, Juan; Gabaldon, Carolina; Gabizon, Ofir; Gadfort, Thomas; Gadomski, Szymon; Gagliardi, Guido; Gagnon, Pauline; Galea, Cristina; Gallas, Elizabeth; Gallas, Manuel; Gallo, Valentina Santina; Gallop, Bruce; Gallus, Petr; Galyaev, Eugene; Gan, K.K.; Gao, Yongsheng; Gapienko, Vladimir; Gaponenko, Andrei; Garcia-Sciveres, Maurice; Garc\\'ia, Carmen; Garc\\'ia Navarro, Jos\\'e Enrique; Gardner, Robert; Garelli, Nicoletta; Garitaonandia, Hegoi; Garonne, Vincent; Garvey, John; Gatti, Claudio; Gaudio, Gabriella; Gaumer, Olivier; Gaur, Bakul; Gautard, Valerie; Gauzzi, Paolo; Gavrilenko, Igor; Gay, Colin; Gaycken, Goetz; Gayde, Jean-Christophe; Gazis, Evangelos; Ge, Peng; Gee, Norman; Geich-Gimbel, Christoph; Gellerstedt, Karl; Gemme, Claudia; Genest, Marie-H\\'el\\`ene; Gentile, Simonetta; Georgatos, Fotios; George, Simon; Gerlach, Peter; Gershon, Avi; Geweniger, Christoph; Ghazlane, Hamid; Ghez, Philippe; Ghodbane, Nabil; Giacobbe, Benedetto; Giagu, Stefano; Giakoumopoulou, Victoria; Giangiobbe, Vincent; Gianotti, Fabiola; Gibbard, Bruce; Gibson, Adam; Gibson, Stephen; Gieraltowski, Gerry; Gilbert, Laura; Gilchriese, Murdock; Gildemeister, Otto; Gilewsky, Valentin; Gillberg, Dag; Gillman, Tony; Gingrich, Douglas; Ginzburg, Jonatan; Giokaris, Nikos; Giordani, MarioPaolo; Giordano, Raffaele; Giorgi, Francesco Michelangelo; Giovannini, Paola; Giraud, Pierre-Francois; Girtler, Peter; Giugni, Danilo; Giusti, Paolo; Gjelsten, B\\o rge Kile; Gladilin, Leonid; Glasman, Claudia; Glatzer, Julian; Glazov, Alexandre; Glitza, Karl-Walter; Glonti, George; Gnanvo, Kondo; Godfrey, Jennifer; Godlewski, Jan; Goebel, Martin; G\\"opfert, Thomas; Goeringer, Christian; G\\"ossling, Claus; G\\"ottfert, Tobias; Goggi, Virginio; Goldfarb, Steven; Goldin, Daniel; Golling, Tobias; Gollub, Nils Peter; Golovnia, Serguei; Gomes, Agostinho; Gomez Fajardo, Luz Stella; Gon\\c calo, Ricardo; Gonella, Laura; Gong, Chenwei; Gonidec, Allain; Gonzalez, Saul; Gonz\\'alez de la Hoz, Santiago; Gonzalez Silva, Laura; Gonzalez-Pineiro, Beatrice; Gonzalez-Sevilla, Sergio; Goodson, Jeremiah Jet; Goossens, Luc; Gorbounov, Petr Andreevich; Gordon, Howard; Gorelov, Igor; Gorfine, Grant; Gorini, Benedetto; Gorini, Edoardo; Gorisek, Andrej; Gornicki, Edward; Gorokhov, Serguei; Gorski, Boguslaw Tomasz; Goryachev, Vladimir; Gosdzik, Bjoern; Gosselink, Martijn; Gostkin, Mikhail Ivanovitch; Gouan\\`ere, Michel; Gough Eschrich, Ivo; Gouighri, Mohamed; Goujdami, Driss; Goulette, Marc Phillippe; Goussiou, Anna; Goy, Corinne; Grabowska-Bold, Iwona; Grabski, Varlen; Grafstr\\"om, Per; Grah, Christian; Grahn, Karl-Johan; Grancagnolo, Francesco; Grancagnolo, Sergio; Grassi, Valerio; Gratchev, Vadim; Grau, Nathan; Gray, Heather; Gray, Julia Ann; Graziani, Enrico; Grebenyuk, Oleg; Green, Barry; Greenfield, Debbie; Greenshaw, Timothy; Greenwood, Zeno Dixon; Gregor, Ingrid-Maria; Grenier, Philippe; Grewal, Anish; Griesmayer, Erich; Griffiths, Justin; Grigalashvili, Nugzar; Grillo, Alexander; Grimm, Kathryn; Grinstein, Sebastian; Grishkevich, Yaroslav; Grivaz, Jean-Francois; Groer, Leslie; Grognuz, Joel; Groh, Manfred; Gross, Eilam; Grosse-Knetter, Joern; Groth-Jensen, Jacob; Gruwe, Magali; Grybel, Kai; Guarino, Victor; Guicheney, Christophe; Guida, Angelo; Guillemin, Thibault; Guindon, Stefan; Guler, Hulya; Gunther, Jaroslav; Guo, Bin; Gupta, Ambreesh; Gusakov, Yury; Gushchin, Vladimir; Gutierrez, Andrea; Gutierrez, Phillip; Guttman, Nir; Gutzwiller, Olivier; Guyot, Claude; Gwenlan, Claire; Gwilliam, Carl; Haas, Andy; Haas, Stefan; Haber, Carl; Haboubi, Gabriel; Hackenburg, Robert; Hadavand, Haleh Khani; Hadley, David; Haeberli, Christian; Haefner, Petra; H\\"artel, Roland; Hahn, Ferdinand; Haider, Stefan; Hajduk, Zbigniew; Hakobyan, Hrachya; Haller, Johannes; Hallewell, Gregory David; Hamacher, Klaus; Hamilton, Andrew; Hamilton, Samuel; Han, Hongguang; Han, Liang; Hanagaki, Kazunori; Hance, Michael; Handel, Carsten; Hanke, Paul; Hansen, Christian Johan; Hansen, J\\o rgen Beck; Hansen, Jorn Dines; Hansen, John Renner; Hansen, Peter Henrik; Hansl-Kozanecka, Traudl; Hansson, Per; Hara, Kazuhiko; Hare, Gabriel; Harenberg, Torsten; Harper, Robert; Harrington, Robert; Harris, Orin; Harrison, Karl; Hart, John; Hartert, Jochen; Hartjes, Fred; Haruyama, Tomiyoshi; Harvey, Alex; Hasegawa, Satoshi; Hasegawa, Yoji; Hashemi, Kevan; Hassani, Samira; Hatch, Mark; Hauff, Dieter; Haug, Sigve; Hauschild, Michael; Hauser, Reiner; Havranek, Miroslav; Hawes, Brian; Hawkes, Christopher; Hawkings, Richard John; Hawkins, Donovan; Hayakawa, Takashi; Hayward, Helen; Haywood, Stephen; Hazen, Eric; He, Mao; Head, Simon; Hedberg, Vincent; Heelan, Louise; Heim, Sarah; Heinemann, Beate; Heisterkamp, Simon; Helary, Louis; Heldmann, Michael; Heller, Mathieu; Hellman, Sten; Helsens, Clement; Hemperek, Tomasz; Henderson, Robert; Hendriks, Patrick John; Henke, Michael; Henrichs, Anna; Henriques Correia, Ana Maria; Henrot-Versille, Sophie; Henry-Couannier, Fr\\'ed\\'eric; Hensel, Carsten; Hen\\ss, Tobias; Hern\\'andez Jim\\'enez, Yesenia; Hershenhorn, Alon David; Herten, Gregor; Hertenberger, Ralf; Hervas, Luis; Hessey, Nigel; Hidvegi, Attila; Hig\\'on-Rodriguez, Emilio; Hill, Daniel; Hill, John; Hill, Norman; Hiller, Karl Heinz; Hillert, Sonja; Hillier, Stephen; Hinchliffe, Ian; Hindson, Daniel; Hines, Elizabeth; Hirose, Minoru; Hirsch, Florian; Hirschbuehl, Dominic; Hobbs, John; Hod, Noam; Hodgkinson, Mark; Hodgson, Paul; Hoecker, Andreas; Hoeferkamp, Martin; Hoffman, Julia; Hoffmann, Dirk; Hohlfeld, Marc; Holder, Martin; Hollins, Ivan; Holmes, Alan; Holmgren, Sven-Olof; Holy, Tomas; Holzbauer, Jenny; Homer, Jim; Homma, Yasuhiro; Horazdovsky, Tomas; Horn, Claus; Horner, Stephan; Horton, Katherine; Hostachy, Jean-Yves; Hott, Thomas; Hou, Suen; Houlden, Michael; Hoummada, Abdeslam; Howell, David; Hrivnac, Julius; Hruska, Ivan; Hryn'ova, Tetiana; Hsu, Pai-hsien Jennifer; Hsu, Shih-Chieh; Huang, Guang Shun; Hubacek, Zdenek; Hubaut, Fabrice; Huegging, Fabian; Huffman, Todd Brian; Hughes, Emlyn; Hughes, Gareth; Hughes-Jones, Richard; Huhtinen, Mika; Hurst, Peter; Hurwitz, Martina; Husemann, Ulrich; Huseynov, Nazim; Huston, Joey; Huth, John; Iacobucci, Giuseppe; Iakovidis, Georgios; Ibbotson, Michael; Ibragimov, Iskander; Ichimiya, Ryo; Iconomidou-Fayard, Lydia; Idarraga, John; Idzik, Marek; Iengo, Paolo; Igonkina, Olga; Ikegami, Yoichi; Ikeno, Masahiro; Ilchenko, Yuri; Iliadis, Dimitrios; Imbault, Didier; Imhaeuser, Martin; Imori, Masatoshi; Ince, Tayfun; Inigo-Golfin, Joaquin; Ioannou, Pavlos; Iodice, Mauro; Ionescu, Gelu; Irles Quiles, Adrian; Ishii, Koji; Ishikawa, Akimasa; Ishino, Masaya; Ishmukhametov, Renat; Isobe, Tadaaki; Issever, Cigdem; Istin, Serhat; Itoh, Yuki; Ivashin, Anton; Iwanski, Wieslaw; Iwasaki, Hiroyuki; Izen, Joseph; Izzo, Vincenzo; Jackson, Brett; Jackson, John; Jackson, Paul; Jaekel, Martin; Jahoda, Miroslav; Jain, Vivek; Jakobs, Karl; Jakobsen, Sune; Jakubek, Jan; Jana, Dilip; Jankowski, Ernest; Jansen, Eric; Jantsch, Andreas; Janus, Michel; Jared, Richard; Jarlskog, G\\"oran; Jeanty, Laura; Jelen, Kazimierz; Jen-La Plante, Imai; Jenni, Peter; Jeremie, Andrea; Je\\v z, Pavel; J\\'ez\\'equel, St\\'ephane; Ji, Haoshuang; Ji, Weina; Jia, Jiangyong; Jiang, Yi; Jimenez Belenguer, Marcos; Jin, Ge; Jin, Shan; Jinnouchi, Osamu; Joergensen, Morten Dam; Joffe, David; Johansen, Lars; Johansen, Marianne; Johansson, Erik; Johansson, Per; Johnert, Sebastian; Johns, Kenneth; Jon-And, Kerstin; Jones, Graham; Jones, Mark; Jones, Roger; Jones, Tim; Jones, Tegid; Jonsson, Ove; Joo, Kwang; Joos, Dieter; Joram, Christian; Jorge, Pedro; Jorgensen, Sigrid; Joseph, John; Juranek, Vojtech; Jussel, Patrick; Kabachenko, Vasily; Kabana, Sonja; Kaci, Mohammed; Kaczmarska, Anna; Kadlecik, Peter; Kado, Marumi; Kagan, Harris; Kagan, Michael; Kaiser, Steffen; Kajomovitz, Enrique; Kalinin, Sergey; Kalinovskaya, Lidia; Kama, Sami; Kanaya, Naoko; Kaneda, Michiru; Kantserov, Vadim; Kanzaki, Junichi; Kaplan, Benjamin; Kapliy, Anton; Kaplon, Jan; Kar, Deepak; Karagounis, Michael; Karagoz, Muge; Karnevskiy, Mikhail; Karr, Kristo; Kartvelishvili, Vakhtang; Karyukhin, Andrey; Kashif, Lashkar; Kasmi, Azzedine; Kass, Richard; Kastanas, Alex; Kataoka, Mayuko; Kataoka, Yousuke; Katsoufis, Elias; Katzy, Judith; Kaushik, Venkatesh; Kawagoe, Kiyotomo; Kawamoto, Tatsuo; Kawamura, Gen; Kayl, Manuel; Kayumov, Fred; Kazanin, Vassili; Kazarinov, Makhail; Kazi, Sandor Istvan; Keates, James Robert; Keeler, Richard; Keener, Paul; Kehoe, Robert; Keil, Markus; Kekelidze, George; Kelly, Marc; Kennedy, John; Kenney, Christopher John; Kenyon, Mike; Kepka, Oldrich; Kerschen, Nicolas; Kersevan, Borut Paul; Kersten, Susanne; Kessoku, Kohei; Ketterer, Christian; Khakzad, Mohsen; Khalil-zada, Farkhad; Khandanyan, Hovhannes; Khanov, Alexander; Kharchenko, Dmitri; Khodinov, Alexander; Kholodenko, Anatoli; Khomich, Andrei; Khoriauli, Gia; Khovanskiy, Nikolai; Khovanskiy, Valery; Khramov, Evgeniy; Khubua, Jemal; Kilvington, Graham; Kim, Hyeon Jin; Kim, Min Suk; Kim, Peter; Kim, Shinhong; Kimura, Naoki; Kind, Oliver; Kind, Peter; King, Barry; King, Matthew; Kirk, Julie; Kirsch, Guillaume; Kirsch, Lawrence; Kiryunin, Andrey; Kisielewska, Danuta; Kisielewski, Bartlomiej; Kittelmann, Thomas; Kiver, Andrey; Kiyamura, Hironori; Kladiva, Eduard; Klaiber-Lodewigs, Jonas; Klein, Max; Klein, Uta; Kleinknecht, Konrad; Klemetti, Miika; Klier, Amit; Klimentov, Alexei; Klingenberg, Reiner; Klinkby, Esben; Klioutchnikova, Tatiana; Klok, Peter; Klous, Sander; Kluge, Eike-Erik; Kluge, Thomas; Kluit, Peter; Kluth, Stefan; Knecht, Neil; Kneringer, Emmerich; Knobloch, Juergen; Ko, Byeong Rok; Kobayashi, Tomio; Kobel, Michael; Koblitz, Birger; Kocian, Martin; Kocnar, Antonin; Kodys, Peter; K\\"oneke, Karsten; K\\"onig, Adriaan; K\\"onig, Stefan; Koenig, Sebastian; K\\"opke, Lutz; Koetsveld, Folkert; Koevesarki, Peter; Koffas, Thomas; Koffeman, Els; Kohn, Fabian; Kohout, Zdenek; Kohriki, Takashi; Koi, Tatsumi; Kokott, Thomas; Kolachev, Guennady; Kolanoski, Hermann; Kolesnikov, Vladimir; Koletsou, Iro; Koll, James; Kollar, Daniel; Kollefrath, Michael; Kolos, Serguei; Kolya, Scott; Komar, Aston; Komaragiri, Jyothsna Rani; Kondo, Takahiko; Kono, Takanori; Kononov, Anatoly; Konoplich, Rostislav; Konovalov, Serguei; Konstantinidis, Nikolaos; Kootz, Andreas; Koperny, Stefan; Kopikov, Sergey; Korcyl, Krzysztof; Kordas, Kostantinos; Koreshev, Victor; Korn, Andreas; Korol, Aleksandr; Korolkov, Ilya; Korolkova, Elena; Korotkov, Vladislav; Kortner, Oliver; Kortner, Sandra; Kostyukhin, Vadim; Kotam\\"aki, Miikka Juhani; Kotov, Serguei; Kotov, Vladislav; Kotov, Konstantin; Kourkoumelis, Christine; Koutsman, Alex; Kowalewski, Robert Victor; Kowalski, Henri; Kowalski, Tadeusz; Kozanecki, Witold; Kozhin, Anatoly; Kral, Vlastimil; Kramarenko, Viktor; Kramberger, Gregor; Krasel, Olaf; Krasny, Mieczyslaw Witold; Krasznahorkay, Attila; Kraus, James; Kreisel, Arik; Krejci, Frantisek; Kretzschmar, Jan; Krieger, Nina; Krieger, Peter; Krobath, Gernot; Kroeninger, Kevin; Kroha, Hubert; Kroll, Joe; Kroseberg, Juergen; Krstic, Jelena; Kruchonak, Uladzimir; Kr\\"uger, Hans; Krumshteyn, Zinovii; Kruth, Andre; Kubota, Takashi; Kuehn, Susanne; Kugel, Andreas; Kuhl, Thorsten; Kuhn, Dietmar; Kukhtin, Victor; Kulchitsky, Yuri; Kuleshov, Sergey; Kummer, Christian; Kuna, Marine; Kundu, Nikhil; Kunkle, Joshua; Kupco, Alexander; Kurashige, Hisaya; Kurata, Masakazu; Kurchaninov, Leonid; Kurochkin, Yurii; Kus, Vlastimil; Kuykendall, William; Kuze, Masahiro; Kuzhir, Polina; Kvasnicka, Ondrej; Kwee, Regina; La Rosa, Alessandro; La Rotonda, Laura; Labarga, Luis; Labbe, Julien; Lacasta, Carlos; Lacava, Francesco; Lacker, Heiko; Lacour, Didier; Lacuesta, Vicente Ram\\'on; Ladygin, Evgueni; Lafaye, R\\'emi; Laforge, Bertrand; Lagouri, Theodota; Lai, Stanley; Lamanna, Massimo; Lambacher, Marion; Lampen, Caleb; Lampl, Walter; Lancon, Eric; Landgraf, Ulrich; Landon, Murrough; Landsman, Hagar; Lane, Jenna; Lange, Clemens; Lankford, Andrew; Lanni, Francesco; Lantzsch, Kerstin; Lanza, Agostino; Lapin, Vladimir; Laplace, Sandrine; Lapoire, Cecile; Laporte, Jean-Francois; Lari, Tommaso; Larionov , Anatoly; Larner, Aimee; Lasseur, Christian; Lassnig, Mario; Lau, Wing; Laurelli, Paolo; Lavorato, Antonia; Lavrijsen, Wim; Laycock, Paul; Lazarev, Alexandre; Lazzaro, Alfio; Le Dortz, Olivier; Le Guirriec, Emmanuel; Le Maner, Christophe; Le Menedeu, Eve; Le Vine, Micheal; Leahu, Marius; Lebedev, Alexander; Lebel, C\\'eline; Lechowski, Matthieu; LeCompte, Thomas; Ledroit-Guillon, Fabienne Agnes Marie; Lee, Hurng-Chun; Lee, Jason; Lee, Shih-Chang; Lefebvre, Michel; Legendre, Marie; Leger, Annie; LeGeyt, Benjamin; Legger, Federica; Leggett, Charles; Lehmacher, Marc; Lehmann Miotto, Giovanna; Lehto, Mark; Lei, Xiaowen; Leite, Marco Aurelio Lisboa; Leitner, Rupert; Lellouch, Daniel; Lellouch, Jeremie; Leltchouk, Mikhail; Lendermann, Victor; Leney, Katharine; Lenz, Tatiana; Lenzen, Georg; Lenzi, Bruno; Leonhardt, Kathrin; Lepidis , Johannes; Leroy, Claude; Lessard, Jean-Raphael; Lesser, Jonas; Lester, Christopher; Leung Fook Cheong, Annabelle; Lev\\^eque, Jessica; Levin, Daniel; Levinson, Lorne; Levitski, Mikhail; Lewandowska, Marta; Leyton, Michael; Li, Bo; Li, Haifeng; Li, Xuefei; Liang, Zhihua; Liang, Zhijun; Liberti, Barbara; Lichard, Peter; Lichtnecker, Markus; Lie, Ki; Liebig, Wolfgang; Lifshitz, Ronen; Lilley, Joseph; Lim, Heuijin; Limosani, Antonio; Limper, Maaike; Lin, Simon; Linde, Frank; Linnemann, James; Lipeles, Elliot; Lipinsky, Lukas; Lipniacka, Anna; Liss, Tony; Lissauer, David; Lister, Alison; Litke, Alan; Liu, Chuanlei; Liu, Dong; Liu, Hao; Liu, Jianbei; Liu, Minghui; Liu, Shengli; Liu, Tiankuan; Liu, Yanwen; Livan, Michele; Livermore, Sarah; Lleres, Annick; Lloyd, Stephen; Lobodzinska, Ewelina; Loch, Peter; Lockman, William; Lockwitz, Sarah; Loddenkoetter, Thomas; Loebinger, Fred; Loginov, Andrey; Loh, Chang Wei; Lohse, Thomas; Lohwasser, Kristin; Lokajicek, Milos; Loken , James; Long, Robin Eamonn; Lopes, Lourenco; Lopez Mateos, David; Losada, Marta; Loscutoff, Peter; Losty, Michael; Lou, Xinchou; Lounis, Abdenour; Loureiro, Karina; Lovas, Lubomir; Love, Jeremy; Love, Peter; Lowe, Andrew; Lu, Feng; Lu, Jiansen; Lu, Liang; Lubatti, Henry; Luci, Claudio; Lucotte, Arnaud; Ludwig, Andreas; Ludwig, D\\"orthe; Ludwig, Inga; Ludwig, Jens; Luehring, Frederick; Luijckx, Guy; Lumb, Debra; Luminari, Lamberto; Lund, Esben; Lund-Jensen, Bengt; Lundberg, Bj\\"orn; Lundberg, Johan; Lundquist, Johan; Lungwitz, Matthias; Lupi, Anna; Lutz, Gerhard; Lynn, David; Lynn, James; Lys, Jeremy; Lytken, Else; Ma, Hong; Ma, Lian Liang; Maa\\ss en, Michael; Macana Goia, Jorge Andres; Maccarrone, Giovanni; Macchiolo, Anna; Macek, Bostjan; Machado Miguens, Joana; Macina, Daniela; Mackeprang, Rasmus; MacQueen, Daniel; Madaras, Ronald; Mader, Wolfgang; Maenner, Reinhard; Maeno, Tadashi; M\\"attig, Peter; M\\"attig, Stefan; Magalhaes Martins, Paulo Jorge; Magnoni, Luca; Magradze, Erekle; Magrath, Caroline; Mahalalel, Yair; Mahboubi, Kambiz; Mahmood, A.; Mahout, Gilles; Maiani, Camilla; Maidantchik, Carmen; Maio, Am\\'elia; Majewski, Stephanie; Makida, Yasuhiro; Makouski, Mikhail; Makovec, Nikola; Mal, Prolay; Malecki, Piotr; Malecki, Pawel; Maleev, Victor; Malek, Fairouz; Mallik, Usha; Malon, David; Maltezos, Stavros; Malyshev, Vladimir; Malyukov, Sergei; Mambelli, Marco; Mameghani, Raphael; Mamuzic, Judita; Manabe, Atsushi; Manara, Andrea; Mandelli, Luciano; Mandić, Igor; Mandrysch, Rocco; Maneira, Jos\\'e; Mangeard, Pierre-Simon; Mangin-Brinet, Mariane; Manjavidze, Ioseb; Mann, Alexander; Mann, Anthony; Manning, Peter; Manousakis-Katsikakis, Arkadios; Mansoulie, Bruno; Manz, Andreas; Mapelli, Alessandro; Mapelli, Livio; March , Luis; Marchand, Jean-Francois; Marchese, Fabrizio; Marchesotti, Marco; Marchiori, Giovanni; Marcisovsky, Michal; Marin, Alexandru; Marino, Christopher; Marroquim, Fernando; Marshall, Robin; Marshall, Zach; Martens, Kalen; Marti-Garcia, Salvador; Martin, Alex; Martin, Andrew; Martin, Brian; Martin, Brian; Martin, Franck Francois; Martin, Jean-Pierre; Martin, Philippe; Martin, Tim; Martin dit Latour, Bertrand; Martinez, Mario; Martinez Outschoorn, Verena; Martini, Agnese; Martyniuk, Alex; Marzano, Francesco; Marzin, Antoine; Masetti, Lucia; Mashimo, Tetsuro; Mashinistov, Ruslan; Masik, Jiri; Maslennikov, Alexey; Ma\\ss , Martin; Massa, Ignazio; Massaro, Graziano; Massol, Nicolas; Mastroberardino, Anna; Masubuchi, Tatsuya; Mathes, Markus; Matricon, Pierre; Matsumoto, Hiroshi; Matsunaga, Hiroyuki; Matsushita, Takashi; Mattravers, Carly; Maugain, Jean-Marie; Maxfield, Stephen; May, Edward; Mayer, John; Mayne, Anna; Mazini, Rachid; Mazur, Michael; Mazzanti, Marcello; Mazzoni, Enrico; Mc Donald, Jeffrey; Mc Kee, Shawn Patrick; McCarn, Allison; McCarthy, Robert; McCarthy, Tom; McCubbin, Norman; McFarlane, Kenneth; McGarvie, Scott; McGlone, Helen; Mchedlidze, Gvantsa; McLaren, Robert Andrew; McMahon, Steve; McMahon, Tania; McMahon, Tom; McPherson, Robert; Meade, Andrew; Mechnich, Joerg; Mechtel, Markus; Medinnis, Mike; Meera-Lebbai, Razzak; Meguro, Tatsuma; Mehdiyev, Rashid; Mehlhase, Sascha; Mehta, Andrew; Meier, Karlheinz; Meinhardt, Jens; Meirose, Bernhard; Melachrinos, Constantinos; Mellado Garcia, Bruce Rafael; Mendoza Navas, Luis; Meng, Zhaoxia; Mengarelli, Alberto; Menke, Sven; Menot, Claude; Meoni, Evelin; Merkl, Doris; Mermod, Philippe; Merola, Leonardo; Meroni, Chiara; Merritt, Frank; Messina, Andrea; Messmer, Ines; Metcalfe, Jessica; Mete, Alaettin Serhan; Meuser, Stefan; Meyer, Carsten; Meyer, Jean-Pierre; Meyer, Jochen; Meyer, Joerg; Meyer, Thomas Christian; Meyer, W. Thomas; Miao, Jiayuan; Michal, Sebastien; Micu, Liliana; Middleton, Robin; Miele, Paola; Migas, Sylwia; Migliaccio, Agostino; Mijović, Liza; Mikenberg, Giora; Mikestikova, Marcela; Mikulec, Bettina; Mikuz, Marko; Miller, David; Miller, Robert; Mills, Corrinne; Mills, Bill; Milov, Alexander; Milstead, David; Milstein, Dmitry; Mima, Satoru; Minaenko, Andrey; Mi\\~nano, Mercedes; Minashvili, Irakli; Mincer, Allen; Mindur, Bartosz; Mineev, Mikhail; Ming, Yao; Mir, Lluisa-Maria; Mirabelli, Giovanni; Miralles Verge, Lluis; Misawa, Shigeki; Miscetti, Stefano; Misiejuk, Andrzej; Mitra, Ankush; Mitrevski, Jovan; Mitrofanov, Gennady; Mitsou, Vasiliki A.; Mitsui, Shingo; Miyagawa, Paul; Miyazaki, Kazuki; Mj\\"ornmark, Jan-Ulf; Mladenov, Dimitar; Moa, Torbjoern; Moch, Markus; Mockett, Paul; Moed, Shulamit; Moeller, Victoria; M\\"onig, Klaus; M\\"oser, Nicolas; Mohn, Bjarte; Mohr, Wolfgang; Mohrdieck-M\\"ock, Susanne; Moisseev, Artemy; Moles-Valls, Regina; Molina-Perez, Jorge; Moneta, Lorenzo; Monk, James; Monnier, Emmanuel; Montesano, Simone; Monticelli, Fernando; Moore, Roger; Moorhead, Gareth; Mora Herrera, Clemencia; Moraes, Arthur; Morais, Antonio; Morel, Julien; Morello, Gianfranco; Moreno, Deywis; Moreno Ll\\'acer, Mar\\'ia; Morettini, Paolo; Morgan, Debbie; Morii, Masahiro; Morin, Jerome; Morita, Youhei; Morley, Anthony Keith; Mornacchi, Giuseppe; Morone, Maria-Christina; Morozov, Sergey; Morris, John; Moser, Hans-Guenther; Mosidze, Maia; Moss, Josh; Moszczynski, Arkadiusz; Mount, Richard; Mountricha, Eleni; Mouraviev, Sergei; Moye, Tamsin; Moyse, Edward; Mudrinic, Mihajlo; Mueller, Felix; Mueller, James; Mueller, Klemens; M\\"uller, Thomas; Muenstermann, Daniel; Muijs, Sandra; Muir, Alex; Munar, Toni; Munwes, Yonathan; Murakami, Koichi; Murillo Garcia, Raul; Murray, Bill; Mussche, Ido; Musto, Elisa; Myagkov, Alexey; Myska, Miroslav; Nadal, Jordi; Nagai, Koichi; Nagano, Kunihiro; Nagasaka, Yasushi; Nairz, Armin Michael; Naito, Daisuke; Nakamura, Koji; Nakano, Itsuo; Nanava, Gizo; Napier, Austin; Nash, Michael; Nasteva, Irina; Nation, Nigel; Nattermann, Till; Naumann, Thomas; Nauyock, Farah; Navarro, Gabriela; Nderitu, Simon Kirichu; Neal, Homer; Nebot, Eduardo; Nechaeva, Polina; Negri, Andrea; Negri, Guido; Nelson, Andrew; Nelson, Silke; Nelson, Timothy Knight; Nemecek, Stanislav; Nemethy, Peter; Nepomuceno, Andre Asevedo; Nessi, Marzio; Nesterov, Stanislav; Neubauer, Mark; Neukermans, Lionel; Neusiedl, Andrea; Neves, Ricardo; Nevski, Pavel; Newcomer, Mitchel; Nicholson, Caitriana; Nickerson, Richard; Nicolaidou, Rosy; Nicolas, Ludovic; Nicoletti, Giovanni; Nicquevert, Bertrand; Niedercorn, Francois; Nielsen, Jason; Niinikoski, Tapio; Nikiforov, Andriy; Nikolaenko, Vladimir; Nikolaev, Kirill; Nikolic-Audit, Irena; Nikolopoulos, Konstantinos; Nilsen, Henrik; Nilsson, Paul; Ninomiya , Yoichi; Nisati, Aleandro; Nishiyama, Tomonori; Nisius, Richard; Nodulman, Lawrence; Nomachi, Masaharu; Nomidis, Ioannis; Nomoto, Hiroshi; Nordberg, Markus; Nordkvist, Bjoern; Norniella Francisco, Olga; Norton, Peter; Notz, Dieter; Novakova, Jana; Nozaki, Mitsuaki; Nozicka, Miroslav; Nugent, Ian Michael; Nuncio-Quiroz, Adriana-Elizabeth; Nunes Hanninger, Guilherme; Nunnemann, Thomas; Nurse, Emily; Nyman, Tommi; O'Neale, Steve; O'Neil, Dugan; O'Shea, Val; Oakham, Gerald; Oberlack, Horst; Ocariz, Jose; Ochi, Atsuhiko; Oda, Susumu; Odaka, Shigeru; Odier, Jerome; Odino, Gian Andrea; Ogren, Harold; Oh, Alexander; Oh, Seog; Ohm, Christian; Ohshima, Takayoshi; Ohshita, Hidetoshi; Ohska, Tokio Kenneth; Ohsugi, Takashi; Okada, Shogo; Okawa, Hideki; Okumura, Yasuyuki; Okuyama, Toyonobu; Olcese, Marco; Olchevski, Alexander; Oliveira, Miguel Alfonso; Oliveira Damazio, Denis; Oliver, Concepcion; Oliver, John; Oliver Garcia, Elena; Olivito, Dominick; Olszewski, Andrzej; Olszowska, Jolanta; Omachi, Chihiro; Onofre, Ant\\'onio; Onyisi, Peter; Oram, Christopher; Ordonez, Gustavo; Oreglia, Mark; Orellana, Frederik; Oren, Yona; Orestano, Domizia; Orlov, Iliya; Oropeza Barrera, Cristina; Orr, Robert; Ortega, Eduardo; Osculati, Bianca; Ospanov, Rustem; Osuna, Carlos; Otero y Garzon, Gustavo; Ottersbach, John; Ottewell, Brian; Ouchrif, Mohamed; Ould-Saada, Farid; Ouraou, Ahmimed; Ouyang, Qun; Owen, Mark; Owen, Simon; Oyarzun, Alejandro; Øye, Ola; Ozcan, Veysi Erkcan; Ozone, Kenji; Ozturk, Nurcan; Pacheco Pages, Andres; Padilla Aranda, Cristobal; Paganis, Efstathios; Paige, Frank; Pajchel, Katarina; Palestini, Sandro; Palla, Jan; Pallin, Dominique; Palma, Alberto; Palmer, Jody; Palmer, Matt; Pan, Yibin; Panagiotopoulou, Evgenia; Panes, Boris; Panikashvili, Natalia; Panin, Vladimir; Panitkin, Sergey; Pantea, Dan; Panuskova, Monika; Paolone, Vittorio; Paoloni, Alessandro; Papadopoulou, Theodora; Paramonov, Alexander; Park, Su-Jung; Park, Woochun; Parker, Andy; Parker, Sherwood; Parodi, Fabrizio; Parsons, John; Parzefall, Ulrich; Pasqualucci, Enrico; Passeri, Antonio; Pastore, Fernanda; Pastore, Francesca; P\\'asztor , Gabriella; Pataraia, Sophio; Patel, Nikhul; Pater, Joleen; Patricelli, Sergio; Pauly, Thilo; Peak, Lawrence; Pecsy, Martin; Pedraza Morales, Maria Isabel; Peeters, Simon Jan Marie; Peleganchuk, Sergey; Peng, Haiping; Pengo, Ruggero; Penson, Alexander; Penwell, John; Perantoni, Marcelo; Perez, Kerstin; Perez Codina, Estel; P\\'erez Garc\\'ia-Esta\\~n, Mar\\'ia Teresa; Perez Reale, Valeria; Peric, Ivan; Perini, Laura; Pernegger, Heinz; Perrino, Roberto; Perrodo, Pascal; Persembe, Seda; Perus, Antoine; Peshekhonov, Vladimir; Petereit, Emil; Peters, Onne; Petersen, Brian; Petersen, Jorgen; Petersen, Troels; Petit, Elisabeth; Petridis, Andreas; Petridou, Chariclia; Petrolo, Emilio; Petrucci, Fabrizio; Petschull, Dennis; Petteni, Michele; Pezoa, Raquel; Pfeifer, Bernhard; Phan, Anna; Phillips, Alan; Phillips, Peter William; Piacquadio, Giacinto; Piccaro, Elisa; Piccinini, Maurizio; Pickford, Andrew; Piegaia, Ricardo; Pilcher, James; Pilkington, Andrew; Pina, Jo\\~ao Antonio; Pinamonti, Michele; Pinfold, James; Ping, Jialun; Pinto, Belmiro; Pirotte, Olivier; Pizio, Caterina; Placakyte, Ringaile; Plamondon, Mathieu; Plano, Will; Pleier, Marc-Andre; Pleskach, Anatoly; Poblaguev, Andrei; Poddar, Sahill; Podlyski, Fabrice; Poffenberger, Paul; Poggioli, Luc; Poghosyan, Tatevik; Pohl, Martin; Polci, Francesco; Polesello, Giacomo; Policicchio, Antonio; Polini, Alessandro; Poll, James; Polychronakos, Venetios; Pomarede, Daniel Marc; Pomeroy, Daniel; Pomm\\`es, Kathy; Ponsot, Patrick; Pontecorvo, Ludovico; Pope, Bernard; Popeneciu, Gabriel Alexandru; Popescu, Razvan; Popovic, Dragan; Poppleton, Alan; Popule, Jiri; Portell Bueso, Xavier; Porter, Robert; Posch, Christoph; Pospelov, Guennady; Pospisil, Stanislav; Potekhin, Maxim; Potrap, Igor; Potter, Christina; Potter, Christopher; Potter, Keith; Poulard, Gilbert; Poveda, Joaquin; Prabhu, Robindra; Pralavorio, Pascal; Prasad, Srivas; Prata, Michele; Pravahan, Rishiraj; Prell, Soeren; Pretzl, Klaus Peter; Pribyl, Lukas; Price, Darren; Price, Lawrence; Price, Michael John; Prichard, Paul; Prieur, Damien; Primavera, Margherita; Prokofiev, Kirill; Prokoshin, Fedor; Protopopescu, Serban; Proudfoot, James; Prudent, Xavier; Przysiezniak, Helenka; Psoroulas, Serena; Ptacek, Elizabeth; Puigdengoles, Carles; Purdham, John; Purohit, Milind; Puzo, Patrick; Pylypchenko, Yuriy; Qi, Ming; Qian, Jianming; Qian, Weiming; Qian, Zuxuan; Qin, Zhonghua; Qing, Di; Quadt, Arnulf; Quarrie, David; Quayle, William; Quinonez, Fernando; Raas, Marcel; Radeka, Veljko; Radescu, Voica; Radics, Balint; Rador, Tonguc; Ragusa, Francesco; Rahal, Ghita; Rahimi, Amir; Rahm, David; Raine, Colin; Raith, Boris; Rajagopalan, Srinivasan; Rajek, Silke; Rammensee, Michael; Rammes, Marcus; Ramstedt, Magnus; Ratoff, Peter; Rauscher, Felix; Rauter, Emanuel; Raymond, Michel; Read, Alexander Lincoln; Rebuzzi, Daniela; Redelbach, Andreas; Redlinger, George; Reece, Ryan; Reeves, Kendall; Reichold, Armin; Reinherz-Aronis, Erez; Reinsch, Andreas; Reisinger, Ingo; Reljic, Dusan; Rembser, Christoph; Ren, Zhongliang; Renkel, Peter; Rensch, Bertram; Rescia, Sergio; Rescigno, Marco; Resconi, Silvia; Resende, Bernardo; Reznicek, Pavel; Rezvani, Reyhaneh; Richards, Alexander; Richards, Ronald; Richter, Robert; Richter-Was, Elzbieta; Ridel, Melissa; Rieke, Stefan; Rijpstra, Manouk; Rijssenbeek, Michael; Rimoldi, Adele; Rinaldi, Lorenzo; Rios, Ryan Randy; Riu, Imma; Rivoltella, Giancesare; Rizatdinova, Flera; Rizvi, Eram; Roa Romero, Diego Alejandro; Robertson, Steven; Robichaud-Veronneau, Andree; Robinson, Dave; Robinson, James; Robinson, Mary; Robson, Aidan; Rocha de Lima, Jose Guilherme; Roda, Chiara; Roda Dos Santos, Denis; Rodier, Stephane; Rodriguez, Diego; Rodriguez Garcia, Yohany; Roe, Adam; Roe, Shaun; Røhne, Ole; Rojo, Victoria; Rolli, Simona; Romaniouk, Anatoli; Romanov, Victor; Romeo, Gaston; Romero Maltrana, Diego; Roos, Lydia; Ros, Eduardo; Rosati, Stefano; Rosenbaum, Gabriel; Rosenberg, Eli; Rosendahl, Peter Lundgaard; Rosselet, Laurent; Rossetti, Valerio; Rossi, Elvira; Rossi, Lucio; Rossi, Leonardo Paolo; Rotaru, Marina; Rothberg, Joseph; Rottl\\"ander, Iris; Rousseau, David; Royon, Christophe; Rozanov, Alexander; Rozen, Yoram; Ruan, Xifeng; Ruckert, Benjamin; Ruckstuhl, Nicole; Rud, Viacheslav; Rudolph, Gerald; R\\"uhr, Frederik; Ruggieri, Federico; Ruiz-Martinez, Aranzazu; Rulikowska-Zarebska, Elzbieta; Rumiantsev, Viktor; Rumyantsev, Leonid; Runge, Kay; Runolfsson, Ogmundur; Rurikova, Zuzana; Rusakovich, Nikolai; Rust, Dave; Rutherfoord, John; Ruwiedel, Christoph; Ruzicka, Pavel; Ryabov, Yury; Ryadovikov, Vasily; Ryan, Patrick; Rybkin, Grigori; Rzaeva, Sevda; Saavedra, Aldo; Sadeh, Iftach; Sadrozinski, Hartmut; Sadykov, Renat; Safai Tehrani, Francesco; Sakamoto, Hiroshi; Sala, Paola; Salamanna, Giuseppe; Salamon, Andrea; Saleem, Muhammad; Salihagic, Denis; Salnikov, Andrei; Salt, Jos\\'e; Salvachua Ferrando, Bel\\'en; Salvatore, Daniela; Salvatore, Pasquale Fabrizio; Salvucci, Antonio; Salzburger, Andreas; Sampsonidis, Dimitrios; Samset, Bj\\"orn Hallvard; Sandaker, Heidi; Sander, Heinz Georg; Sanders, Michiel; Sandhoff, Marisa; Sandhu, Pawan; Sandoval, Tanya; Sandstroem, Rikard; Sandvoss, Stephan; Sankey, Dave; Sanny, Bernd; Sansoni, Andrea; Santamarina Rios, Cibran; Santoni, Claudio; Santonico, Rinaldo; Santos, Helena; Saraiva, Jo\\~ao; Sarangi, Tapas; Sarkisyan-Grinbaum, Edward; Sarri, Francesca; Sartisohn, Georg; Sasaki, Osamu; Sasaki, Takashi; Sasao, Noboru; Satsounkevitch, Igor; Sauvage, Gilles; Savard, Pierre; Savine, Alexandre; Savinov, Vladimir; Savva , Panagiota; Sawyer, Lee; Saxon, David; Says, Louis-Pierre; Sbarra, Carla; Sbrizzi, Antonio; Scallon, Olivia; Scannicchio, Diana; Schaarschmidt, Jana; Schacht, Peter; Sch\\"afer, Uli; Schaetzel, Sebastian; Schaffer, Arthur; Schaile, Dorothee; Schaller, Martin; Schamberger, R.~Dean; Schamov, Andrey; Scharf, Veit; Schegelsky, Valery; Scheirich, Daniel; Schernau, Michael; Scherzer, Max; Schiavi, Carlo; Schieck, Jochen; Schioppa, Marco; Schlenker, Stefan; Schlereth, James; Schmidt, Evelyn; Schmidt, Michael; Schmieden, Kristof; Schmitt, Christian; Schmitz, Martin; Scholte, Reinder Cornelis; Sch\\"oning, Andr\\'e; Schott, Matthias; Schouten, Doug; Schovancova, Jaroslava; Schram, Malachi; Schreiner, Alexander; Schroeder, Christian; Schroer, Nicolai; Schroers, Marcel; Schroff, Dietrich; Schuh, Silvia; Schuler, Georges; Schultes, Joachim; Schultz-Coulon, Hans-Christian; Schumacher, Jan; Schumacher, Markus; Schumm, Bruce; Schune, Philippe; Schwanenberger, Christian; Schwartzman, Ariel; Schweiger, Dietmar; Schwemling, Philippe; Schwienhorst, Reinhard; Schwierz, Rainer; Schwindling, Jerome; Scott, Bill; Searcy, Jacob; Sedykh, Evgeny; Segura, Ester; Seidel, Sally; Seiden, Abraham; Seifert, Frank; Seixas, Jos\\'e; Sekhniaidze, Givi; Seliverstov, Dmitry; Sellden, Bjoern; Sellers, Graham; Seman, Michal; Semprini-Cesari, Nicola; Serfon, Cedric; Serin, Laurent; Seuster, Rolf; Severini, Horst; Sevior, Martin; Sfyrla, Anna; Shabalina, Elizaveta; Shamim, Mansoora; Shan, Lianyou; Shank, James; Shao, Qi Tao; Shapiro, Marjorie; Shatalov, Pavel; Shaver, Leif; Shaw, Christian; Shaw, Kate; Sherman, Daniel; Sherwood, Peter; Shibata, Akira; Shield, Pete; Shimizu, Shima; Shimojima, Makoto; Shin, Taeksu; Shmeleva, Alevtina; Shochet, Mel; Shupe, Michael; Sicho, Petr; Sidoti, Antonio; Siebel, Anca-Mirela; Siegert, Frank; Siegrist, James; Sijacki, Djordje; Silbert, Ohad; Silver, Yiftah; Silverstein, Daniel; Silverstein, Samuel; Simak, Vladislav; Simic, Ljiljana; Simion, Stefan; Simmons, Brinick; Simonyan, Margar; Sinervo, Pekka; Sinev, Nikolai; Sipica, Valentin; Siragusa, Giovanni; Sisakyan, Alexei; Sivoklokov, Serguei; Sjölin, Jörgen; Sjursen, Therese; Skinnari, Louise Anastasia; Skovpen, Kirill; Skubic, Patrick; Skvorodnev, Nikolai; Slater, Mark; Slavicek, Tomas; Sliwa, Krzysztof; Sloan, Terrence; Sloper, John erik; Smakhtin, Vladimir; Smirnov, Sergei; Smirnov, Yuri; Smirnova, Lidia; Smirnova, Oxana; Smith, Ben Campbell; Smith, Douglas; Smith, Kenway; Smizanska, Maria; Smolek, Karel; Snesarev, Andrei; Snow, Steve; Snow, Joel; Snuverink, Jochem; Snyder, Scott; Soares, Mara; Sobie, Randall; Sodomka, Jaromir; Soffer, Abner; Solans, Carlos; Solar, Michael; Solc, Jaroslav; Solfaroli Camillocci, Elena; Solodkov, Alexander; Solovyanov, Oleg; Soluk, Richard; Sondericker, John; Soni, Nitesh; Sopko, Vit; Sopko, Bruno; Sorbi, Massimo; Sosebee, Mark; Soukharev, Andrey; Spagnolo, Stefania; Spanò, Francesco; Speckmayer, Peter; Spencer, Edwin; Spighi, Roberto; Spigo, Giancarlo; Spila, Federico; Spiriti, Eleuterio; Spiwoks, Ralf; Spogli, Luca; Spousta, Martin; Spreitzer, Teresa; Spurlock, Barry; St. Denis, Richard Dante; Stahl, Thorsten; Stahlman, Jonathan; Stamen, Rainer; Stancu, Stefan Nicolae; Stanecka, Ewa; Stanek, Robert; Stanescu, Cristian; Stapnes, Steinar; Starchenko, Evgeny; Stark, Jan; Staroba, Pavel; Starovoitov, Pavel; Stastny, Jan; Staude, Arnold; Stavina, Pavel; Stavropoulos, Georgios; Steele, Genevieve; Stefanidis, Efstathios; Steinbach, Peter; Steinberg, Peter; Stekl, Ivan; Stelzer, Bernd; Stelzer, Harald Joerg; Stelzer-Chilton, Oliver; Stenzel, Hasko; Stevenson, Kyle; Stewart, Graeme; Stiller, Wolfram; Stockmanns, Tobias; Stockton, Mark; Stodulski, Marek; Stoerig, Kathrin; Stoicea, Gabriel; Stonjek, Stefan; Strachota, Pavel; Stradling, Alden; Straessner, Arno; Strandberg, Jonas; Strandberg, Sara; Strandlie, Are; Strang, Michael; Strauss, Michael; Strizenec, Pavol; Str\\"ohmer, Raimund; Strom, David; Strong, John; Stroynowski, Ryszard; Strube, Jan; Stugu, Bjarne; Stumer, Iuliu; Stupak, John; Sturm, Philipp; Su, Dong; Soh, Dart-yin; Sugaya, Yorihito; Sugimoto, Takuya; Suhr, Chad; Suita, Koichi; Suk, Michal; Sulin, Vladimir; Sultansoy, Saleh; Sumida, Toshi; Sun, Xiaohu; Sundermann, Jan Erik; Suruliz, Kerim; Sushkov, Serge; Susinno, Giancarlo; Sutton, Mark; Suzuki, Yu; Sviridov, Yuri; Swedish, Stephen; Sykora, Ivan; Sykora, Tomas; Szczygiel, Robert Roman; Szeless, Balazs; Szymocha, Tadeusz; S\\'anchez, Javier; Ta, Duc; Taboada Gameiro, Sonia; Tackmann, Kerstin; Taffard, Anyes; Tafirout, Reda; Taga, Adrian; Takahashi, Yuta; Takai, Helio; Takashima, Ryuichi; Takeda, Hiroshi; Takeshita, Tohru; Talby, Mossadek; Talyshev, Alexey; Tamsett, Matthew; Tanaka, Junichi; Tanaka, Reisaburo; Tanaka, Satoshi; Tanaka, Shuji; Tanaka, Yoshito; Tani, Kazutoshi; Tappern, Geoffrey; Tapprogge, Stefan; Tardif, Dominique; Tarem, Shlomit; Tarrade, Fabien; Tartarelli, Giuseppe Francesco; Tas, Petr; Tasevsky, Marek; Tassi, Enrico; Tatarkhanov, Mous; Taylor, Christopher; Taylor, Frank; Taylor, Gary; Taylor, Geoffrey; Taylor, Ryan P.; Taylor, Wendy; Teixeira Dias Castanheira, Matilde; Teixeira-Dias, Pedro; Temming, Kim Katrin; Ten Kate, Herman; Teng, Ping-Kun; Tennenbaum-Katan, Yaniv-David; Terada, Susumu; Terashi, Koji; Terron, Juan; Terwort, Mark; Testa, Marianna; Teuscher, Richard; Tevlin, Christopher; Thadome, Jocelyn; Therhaag, Jan; Theveneaux-Pelzer, Timoth\\'ee; Thioye, Moustapha; Thoma, Sascha; Thomas, Juergen; Thompson, Stan; Thompson, Emily; Thompson, Peter; Thompson, Paul; Thompson, Ray; Thomson, Evelyn; Thomson, Mark; Thun, Rudolf; Tic, Tomas; Tikhomirov, Vladimir; Tikhonov, Yury; Timmermans, Charles; Tipton, Paul; Tique Aires Viegas, Florbela De Jes; Tisserant, Sylvain; Tobias, J\\"urgen; Toczek, Barbara; Todorov, Theodore; Todorova-Nova, Sharka; Toggerson, Brokk; Tojo, Junji; Tok\\'ar, Stanislav; Tokunaga, Kaoru; Tokushuku, Katsuo; Tollefson, Kirsten; Tomasek, Lukas; Tomasek, Michal; Tomoto, Makoto; Tompkins, Daniel; Tompkins, Lauren; Toms, Konstantin; Tonazzo, Alessandra; Tong, Guoliang; Tonoyan, Arshak; Topfel, Cyril; Topilin, Nikolai; Torchiani, Ingo; Torrence, Eric; Torr\\'o Pastor, Emma; Toth, Jozsef; Touchard, Francois; Tovey, Daniel; Traynor, Daniel; Trefzger, Thomas; Treis, Johannes; Tremblet, Louis; Tricoli, Alesandro; Trigger, Isabel Marian; Trincaz-Duvoid, Sophie; Trinh, Thi Nguyet; Tripiana, Martin; Triplett, Nathan; Trischuk, William; Trivedi, Arjun; Trocm\\'e, Benjamin; Troncon, Clara; Trottier-McDonald, Michel; Trzupek, Adam; Tsarouchas, Charilaos; Tseng, Jeffrey; Tsiakiris, Menelaos; Tsiareshka, Pavel; Tsionou, Dimitra; Tsipolitis, Georgios; Tsiskaridze, Vakhtang; Tskhadadze, Edisher; Tsukerman, Ilya; Tsulaia, Vakhtang; Tsung, Jieh-Wen; Tsuno, Soshi; Tsybychev, Dmitri; Tuggle, Joseph; Turala, Michal; Turecek, Daniel; Turk Cakir, Ilkay; Turlay, Emmanuel; Tuts, Michael; Twomey, Matthew Shaun; Tylmad, Maja; Tyndel, Mike; Typaldos, Dimitrios; Tyrvainen, Harri; Tzamarioudaki, Ekaterini; Tzanakos, George; Uchida, Kirika; Ueda, Ikuo; Ueno, Ryuichi; Ugland, Maren; Uhlenbrock, Mathias; Uhrmacher, Michael; Ukegawa, Fumihiko; Unal, Guillaume; Underwood, David; Undrus, Alexander; Unel, Gokhan; Unno, Yoshinobu; Urbaniec, Dustin; Urkovsky, Evgeny; Urquijo, Phillip; Urrejola, Pedro; Usai, Giulio; Uslenghi, Massimiliano; Vacavant, Laurent; Vacek, Vaclav; Vachon, Brigitte; Vahsen, Sven; Valderanis, Chrysostomos; Valenta, Jan; Valente, Paolo; Valentinetti, Sara; Valkar, Stefan; Valladolid Gallego, Eva; Vallecorsa, Sofia; Valls Ferrer, Juan Antonio; Van Berg, Richard; van der Graaf, Harry; van der Kraaij, Erik; van der Poel, Egge; van der Ster, Daniel; Van Eijk, Bob; van Eldik, Niels; van Gemmeren, Peter; van Kesteren, Zdenko; van Vulpen, Ivo; Vandelli, Wainer; Vandoni, Giovanna; Vaniachine, Alexandre; Vankov, Peter; Vannucci, Francois; Varela Rodriguez, Fernando; Vari, Riccardo; Varnes, Erich; Varouchas, Dimitris; Vartapetian, Armen; Varvell, Kevin; Vasilyeva, Lidia; Vassilakopoulos, Vassilios; Vazeille, Francois; Vegni, Guido; Veillet, Jean-Jacques; Vellidis, Constantine; Veloso, Filipe; Veness, Raymond; Veneziano, Stefano; Ventura, Andrea; Ventura, Daniel; Ventura , Silvia; Venturi, Manuela; Venturi, Nicola; Vercesi, Valerio; Verducci, Monica; Verkerke, Wouter; Vermeulen, Jos; Vertogardov, Leonid; Vetterli, Michel; Vichou, Irene; Vickey, Trevor; Viehhauser, Georg; Viel, Simon; Villa, Mauro; Villani, Giulio; Villaplana Perez, Miguel; Vilucchi, Elisabetta; Vincter, Manuella; Vinek, Elisabeth; Vinogradov, Vladimir; Virchaux, Marc; Viret, Sébastien; Virzi, Joseph; Vitale , Antonio; Vitells, Ofer; Vivarelli, Iacopo; Vives Vaque, Francesc; Vlachos, Sotirios; Vlasak, Michal; Vlasov, Nikolai; Vogel, Adrian; Vokac, Petr; Volpi, Matteo; Volpini, Giovanni; von der Schmitt, Hans; von Loeben, Joerg; von Radziewski, Holger; von Toerne, Eckhard; Vorobel, Vit; Vorobiev, Alexander; Vorwerk, Volker; Vos, Marcel; Voss, Rudiger; Voss, Thorsten Tobias; Vossebeld, Joost; Vovenko, Anatoly; Vranjes, Nenad; Vranjes Milosavljevic, Marija; Vrba, Vaclav; Vreeswijk, Marcel; Vu Anh, Tuan; Vudragovic, Dusan; Vuillermet, Raphael; Vukotic, Ilija; Wagner, Wolfgang; Wagner, Peter; Wahlen, Helmut; Walbersloh, Jorg; Walder, James; Walker, Rodney; Walkowiak, Wolfgang; Wall, Richard; Waller, Peter; Wang, Chiho; Wang, Haichen; Wang, Jin; Wang, Joshua C.; Wang, Song-Ming; Warburton, Andreas; Ward, Patricia; Warsinsky, Markus; Wastie, Roy; Watkins, Peter; Watson, Alan; Watson, Miriam; Watts, Gordon; Watts, Stephen; Waugh, Anthony; Waugh, Ben; Webel, Markus; Weber, Jens; Weber, Marc; Weber, Michele; Weber, Pavel; Weidberg, Anthony; Weingarten, Jens; Weiser, Christian; Wellenstein, Hermann; Wells, Phillippa; Wen, Mei; Wenaus, Torre; Wendler, Shanti; Weng, Zhili; Wengler, Thorsten; Wenig, Siegfried; Wermes, Norbert; Werner, Matthias; Werner, Per; Werth, Michael; Werthenbach, Ulrich; Wessels, Martin; Whalen, Kathleen; Wheeler-Ellis, Sarah Jane; Whitaker, Scott; White, Andrew; White, Martin; White, Sebastian; Whitehead, Samuel Robert; Whiteson, Daniel; Whittington, Denver; Wicek, Francois; Wicke, Daniel; Wickens, Fred; Wiedenmann, Werner; Wielers, Monika; Wienemann, Peter; Wiglesworth, Craig; Wiik, Liv Antje Mari; Wildauer, Andreas; Wildt, Martin Andre; Wilhelm, Ivan; Wilkens, Henric George; Will, Jonas Zacharias; Williams, Eric; Williams, Hugh; Willis, William; Willocq, Stephane; Wilson, John; Wilson, Michael Galante; Wilson, Alan; Wingerter-Seez, Isabelle; Winkelmann, Stefan; Winklmeier, Frank; Wittgen, Matthias; Wolter, Marcin Wladyslaw; Wolters, Helmut; Wosiek, Barbara; Wotschack, Jorg; Woudstra, Martin; Wraight, Kenneth; Wright, Catherine; Wright, Dennis; Wrona, Bozydar; Wu, Sau Lan; Wu, Xin; Wuestenfeld, Jens; Wulf, Evan; Wunstorf, Renate; Wynne, Benjamin; Xaplanteris, Leonidas; Xella, Stefania; Xie, Song; Xie, Yigang; Xu, Chao; Xu, Da; Xu, Guofa; Xu, Neng; Yabsley, Bruce; Yamada, Miho; Yamamoto, Akira; Yamamoto, Kyoko; Yamamoto, Shimpei; Yamamura, Taiki; Yamaoka, Jared; Yamazaki, Takayuki; Yamazaki, Yuji; Yan, Zhen; Yang, Haijun; Yang, Stephanie; Yang, Un-Ki; Yang, Yi; Yang, Yi; Yang, Zhaoyu; Yanush, Serguei; Yao, Weiming; Yao, Yushu; Yasu, Yoshiji; Ye, Jingbo; Ye, Shuwei; Yilmaz, Metin; Yoosoofmiya, Reza; Yorita, Kohei; Yoshida, Hajime; Yoshida, Riktura; Young, Charles; Youssef, Saul; Yu, Dantong; Yu, Jie; Yu, Jaehoon; Yuan, Jianming; Yuan, Li; Yurkewicz, Adam; Zaets , Vassilli; Zaidan, Remi; Zaitsev, Alexander; Zajacova, Zuzana; Zalite , Youris; Zambrano, Valentina; Zanello, Lucia; Zarzhitsky, Pavel; Zaytsev, Alexander; Zdrazil, Marian; Zeitnitz, Christian; Zeller, Michael; Zema, Pasquale Federico; Zemla, Andrzej; Zendler, Carolin; Zenin, Anton; Zenin, Oleg; Ženiš, Tibor; Zenonos, Zenonas; Zenz, Seth; Zerwas, Dirk; Zevi della Porta, Giovanni; Zhan, Zhichao; Zhang, Huaqiao; Zhang, Jinlong; Zhang, Qizhi; Zhang, Xueyao; Zhao, Long; Zhao, Tianchi; Zhao, Zhengguo; Zhemchugov, Alexey; Zheng, Shuchen; Zhong, Jiahang; Zhou, Bing; Zhou, Ning; Zhou, Yue; Zhu, Cheng Guang; Zhu, Hongbo; Zhu, Yingchun; Zhuang, Xuai; Zhuravlov, Vadym; Zilka, Branislav; Zimmermann, Robert; Zimmermann, Simone; Zimmermann, Stephanie; Ziolkowski, Michael; Zitoun, Robert; Živković, Lidija; Zmouchko, Viatcheslav; Zobernig, Georg; Zoccoli, Antonio; Zolnierowski, Yves; Zsenei, Andras; zur Nedden, Martin; Zutshi, Vishnu
2010-01-01
First measurements of the W -> lnu and Z/gamma* -> ll (l = e, mu) production cross sections in proton-proton collisions at sqrt(s) = 7 TeV are presented using data recorded by the ATLAS experiment at the LHC. The results are based on 2250 W -> lnu and 179 Z/gamma* -> ll candidate events selected from a data set corresponding to an integrated luminosity of approximately 320 nb-1. The measured total W and Z/gamma*-boson production cross sections times the respective leptonic branching ratios for the combined electron and muon channels are $\\stotW$ * BR(W -> lnu) = 9.96 +- 0.23(stat) +- 0.50(syst) +- 1.10(lumi) nb and $\\stotZg$ * BR(Z/gamma* -> ll) = 0.82 +- 0.06(stat) +- 0.05(syst) +- 0.09(lumi) nb (within the invariant mass window 66 < m_ll < 116 GeV). The W/Z cross-section ratio is measured to be 11.7 +- 0.9(stat) +- 0.4(syst). In addition, measurements of the W+ and W- production cross sections and of the lepton charge asymmetry are reported. Theoretical predictions based on NNLO QCD calculations are f...
Mele, S
2004-01-01
The high-energy and high-luminosity data-taking campaigns of the LEP e+e- collider provided the four collaborations, ALEPH, DELPHI, L3 and OPAL, with about 50 000 W-boson pairs and about a thousand singly-produced W bosons. This unique data sample has an unprecedented reach in probing some aspects of the Standard Model of the electroweak interactions, and this article reviews several achievements in the understanding of W-boson physics at LEP. The measurements of the cross sections for W-boson production are discussed, together with their implication on the existence of the coupling between Z and W bosons. The precision measurements of the magnitude of triple gauge-boson couplings are presented. The observation of the longitudinal helicity component of the W-boson spin, related to the mechanism of electroweak symmetry breaking, is described together with the techniques used to probe the CP and CPT symmetries in the W-boson system. A discussion on the intricacies of the measurement of the mass of the W boson, ...
Abreu, Everton M C; Wotzasek, C; Abreu, Everton M. C.; Dutra, Alvaro de Souza; Wotzasek, Clovis
2002-01-01
We have devoted an effort to study some nonlinear actions, characteristics of the ${\\cal W}$-theories, in the framework of the soldering formalism. We have disclosed interesting new results concerning the embedding of the original chiral ${\\cal W}$-particles in different metrical spaces in the final soldered action, i.e., the metric gets modified by the soldering interference process. The results are presented in a weak field approximation for the ${\\cal W}_N$ case when N is greater than 3 and also in an exact way for ${\\cal W}_2$. We have promoted a generalization of the interference phenomena to ${\\cal W}_N$-theories of different chiralities and shown that the geometrical features introduced can yield a new understanding about the interference formalism in quantum field theories.
Abbiendi, G; Åkesson, P F; Alexander, G; Allison, J; Amaral, P; Anagnostou, G; Anderson, K J; Arcelli, S; Asai, S; Axen, D A; Azuelos, Georges; Bailey, I; Barberio, E; Barillari, T; Barlow, R J; Batley, J Richard; Bechtle, P; Behnke, T; Bell, K W; Bell, P J; Bella, G; Bellerive, A; Benelli, G; Bethke, Siegfried; Biebel, O; Boeriu, O; Bock, P; Boutemeur, M; Braibant, S; Brigliadori, L; Brown, R M; Büsser, K; Burckhart, H J; Campana, S; Carnegie, R K; Carter, A A; Carter, J R; Chang, C Y; Charlton, D G; Ciocca, C; Couchman, J; Csilling, Akos; Cuffiani, M; Dado, S; de Roeck, A; De Wolf, E A; Desch, Klaus; Dienes, B; Donkers, M; Dubbert, J; Duchovni, E; Duckeck, G; Duerdoth, I P; Etzion, E; Fabbri, Franco Luigi; Feld, L; Ferrari, P; Fiedler, F; Fleck, I; Ford, M; Frey, A; Gagnon, P; Gary, J W; Gaycken, G; Geich-Gimbel, C; Giacomelli, G; Giacomelli, P; Giunta, M; Goldberg, J; Gross, E; Grunhaus, Jacob; Gruwé, M; Günther, P O; Sen-Gupta, A; Hajdu, C; Hamann, M; Hanson, G G; Harel, A; Hauschild, M; Hawkes, C M; Hawkings, R; Hemingway, Richard J; Herten, G; Heuer, R D; Hill, J C; Hoffman, K; Horváth, D; Igo-Kemenes, P; Ishii, K; Jeremie, H; Jovanovic, P; Junk, T R; Kanaya, N; Kanzaki, J; Karlen, Dean A; Kawagoe, K; Kawamoto, T; Keeler, Richard K; Kellogg, R G; Kennedy, B W; Klein, K; Klier, A; Kluth, S; Kobayashi, T; Kobel, M; Komamiya, S; Kramer, T; Krieger, P; Von Krogh, J; Krüger, K; Kühl, T; Kupper, M; Lafferty, G D; Landsman, Hagar Yaël; Lanske, D; Layter, J G; Lellouch, D; Letts, J; Levinson, L; Lillich, J; Lloyd, S L; Loebinger, F K; Lü, J; Ludwig, A; Ludwig, J; Mader, W; Marcellini, S; Martin, A J; Masetti, G; Mashimo, T; Mättig, P; McKenna, J A; McPherson, R A; Meijers, F; Menges, W; Merritt, F S; Mes, H; Michelini, Aldo; Mihara, S; Mikenberg, G; Miller, D J; Moed, S; Mohr, W; Mori, T; Mutter, A; Nagai, K; Nakamura, I; Nanjo, H; Neal, H A; Nisius, R; O'Neale, S W; Oh, A; Okpara, A N; Oreglia, M J; Orito, S; Pahl, C; Pásztor, G; Pater, J R; Pilcher, J E; Pinfold, J L; Plane, D E; Poli, B; Pooth, O; Przybycien, M B; Quadt, A; Rabbertz, K; Rembser, C; Renkel, P; Roney, J M; Rosati, S; Rozen, Y; Runge, K; Sachs, K; Saeki, T; Sarkisyan-Grinbaum, E; Schaile, A D; Schaile, O; Scharff-Hansen, P; Schieck, J; Schörner-Sadenius, T; Schröder, M; Schumacher, M; Scott, W G; Seuster, R; Shears, T G; Shen, B C; Sherwood, P; Skuja, A; Smith, A M; Sobie, R J; Söldner-Rembold, S; Spanó, F; Stahl, A; Strom, D; Ströhmer, R; Tarem, S; Tasevsky, M; Teuscher, R; Thomson, M A; Torrence, E; Toya, D; Tran, P; Trigger, I; Trócsányi, Z L; Tsur, E; Turner-Watson, M F; Ueda, I; Ujvári, B; Vollmer, C F; Vannerem, P; Vertesi, R; Verzocchi, M; Voss, H; Vossebeld, Joost Herman; Waller, D; Ward, C P; Ward, D R; Watkins, P M; Watson, A T; Watson, N K; Wells, P S; Wengler, T; Wermes, N; Wetterling, D; Wilson, G W; Wilson, J A; Wolf, G; Wyatt, T R; Yamashita, S; Zer-Zion, D; Zivkovic, L
2004-01-01
Elements of the spin density matrix for W bosons in e+e- -> W+W- -> qqln events are measured from data recorded by the OPAL detector at LEP. This information is used calculate polarised differential cross-sections and to search for CP-violating effects. Results are presented for W bosons produced in e+e- collisions with centre-of-mass energies between 183 GeV and 209 GeV. The average fraction of W bosons that are longitudinally polarised is found to be (23.9 +- 2.1 +- 1.1)% compared to a Standard Model prediction of (23.9 +- 0.1)%. All results are consistent with CP conservation.
Gruber, R. P.; Gott, R. W.; Haag, T. W.
1989-01-01
The initial design and evaluation of a 5 kW arcjet power electronics breadboard which as been integrated with a modified 1 kW design laboratory arcjet is presented. A single stage, 5 kW full bridge, pulse width modulated (PWM), power converter was developed which was phase shift regulated. The converter used metal oxide semiconductor field effect transistor (MOSFET) power switches and incorporated current mode control and an integral arcjet pulse ignition circuit. The unoptimized power efficiency was 93.5 and 93.9 percent at 5 kW and 50A output at input voltages of 130 and 150V, respectively. Line and load current regulation at 50A output was within one percent. The converter provided up to 6.6 kW to the arcjet with simulated ammonia used as a propellant.
Dynamika rozwoju szpitalnych oddziałów ratunkowych w latach 2004-2014
Tomasz, Łukawski
2015-01-01
Lata 90. ub.w. były okresem poprawy działania systemu ratownictwa medycznego w Polsce, ponieważ nie działał on zbyt dobrze (na co wskazuje : wskaźnik zgonów w okresie przedszpitalnym, czas dotarcia karetki do chorego). Ustawa z dnia 8 września 2006 roku o Państwowym Ratownictwie Medycznym jest aktem regulującym zapisy systemu ratownictwa medycznego w Polsce. Szpitalne oddziały ratunkowe powstały w 1999 roku. W latach 2004-2014 nastąpił rozwój tych oddziałów, dzięki funduszom pochodzącym z Uni...
Yeast Interacting Proteins Database: YGL181W, YIL122W [Yeast Interacting Proteins Database
Lifescience Database Archive (English)
Full Text Available y (0) YIL122W POG1 Putative transcriptional activator that promotes recovery from...YIL122W Prey gene name POG1 Prey description Putative transcriptional activator that promotes recovery from
Energy Technology Data Exchange (ETDEWEB)
DG Horton; VG Johnson
2000-05-18
Three new Resource Conservation and Recovery Act (RCRA) groundwater monitoring wells were installed at the single-shell tank farm Waste Management Area (WMA) S-SX in October 1999 through February 2000 in fulfillment of Tri-Party Agreement (Ecology 1996) milestone M-24-41. The wells are 299-W22-48, 299-W22-49, and 299-W22-50. Well 299-W22-48 is located east of the southeast corner of 241-S tank farm and is a new downgradient well in the monitoring network. Well 299-W22-49 is located on the east side of the 241-SX tank farm, adjacent to well 299-W22-39, which it replaces in the monitoring network. Well 299-W22-50 is located at the southeast corner of the 241-SX tank farm and is a replacement for downgradient monitoring well 299-W22-46, which is going dry. The original assessment monitoring plan for WMA S-SX was issued in 1996 (Caggiano 1996). That plan was updated for the continued assessment at WMA S-SX in 1999 (Johnson and Chou 1999). The updated plan provides justification for the new wells. The new wells were constructed to the specifications and requirements described in Washington Administrative Code (WAC) 173-160 and WAC 173-303, the updated assessment plan for WMA S-SX (Johnson and Chou 1999), and the description of work for well drilling and construction. This document compiles information on the drilling and construction, well development, pump installation, and sediment and groundwater sampling applicable to the installation of wells 299-W22-48, 299-W22-49 and 299-W22-50. Appendix A contains the Well Summary Sheets (as-built diagrams), the Well Construction Summary Reports, and the geologist's logs. Appendix B contains results of laboratory analyses of the physical properties of sediment samples obtained during drilling. Appendix C contains borehole geophysical logs, and Appendix D contains the analytical results from groundwater samples obtained during well drilling and construction.
W-band ARM Cloud Radar (WACR) Handbook
Energy Technology Data Exchange (ETDEWEB)
Widener, KB; Johnson, K
2005-01-05
The W-band Atmospheric Radiation Measurement (ARM) Program Cloud Radar (WACR) systems are zenith pointing Doppler radars that probe the extent and composition of clouds at 95.04 GHz. The main purpose of this radar is to determine cloud boundaries (e.g., cloud bottoms and tops). This radar reports estimates for the first three spectra moments for each range gate up to 15 km. The 0th moment is reflectivity, the 1st moment is radial velocity, and the 2nd moment is spectral width. Also available are the raw spectra files. Unlike the millimeter wavelength cloud radar (MMCR), the WACR does not use pulse coding and operates in only copolarization and cross-polarization modes.
Filterscope edge plasma diagnostic for the W7-X stellarator
Harris, Jeffrey; Unterberg, Ezekial; Lore, Jeremy; Stephey, Laurie; Schmitz, Oliver; Wurden, Glen; Biedermann, Christoph; Krychowiak, Maciej; Koenig, Ralf
2015-11-01
W7-X is a large (R = 5.5m, a = 0.5m, B 10 MW) superconducting stellarator at the Max-Planck Institut für Plasmaphysik in Greifswald, Germany, which will begin plasma operations in the last quarter of 2015. We describe here the first measurements with a 24-channel filterscope diagnostic [E. A. Unterberg et al., Rev. Sci. Instrum. 83, 10D722, (2012)] of edge plasma characteristics and spectral emission from impurities near the test limiters installed for initial plasma experiments. These measurements, together with high resolution IR thermography imaging of the limiter, will be used as inputs for edge transport modeling using the EMC3 code [J. D. Lore et al., Nucl. Fusion 52, 0540 (2012)]. This work is sponsored by DOE Contract No. DE-AC05- 00OR22725 with UT-Battelle.
The Proteomic Code: a molecular recognition code for proteins
Directory of Open Access Journals (Sweden)
Biro Jan C
2007-11-01
Full Text Available Abstract Background The Proteomic Code is a set of rules by which information in genetic material is transferred into the physico-chemical properties of amino acids. It determines how individual amino acids interact with each other during folding and in specific protein-protein interactions. The Proteomic Code is part of the redundant Genetic Code. Review The 25-year-old history of this concept is reviewed from the first independent suggestions by Biro and Mekler, through the works of Blalock, Root-Bernstein, Siemion, Miller and others, followed by the discovery of a Common Periodic Table of Codons and Nucleic Acids in 2003 and culminating in the recent conceptualization of partial complementary coding of interacting amino acids as well as the theory of the nucleic acid-assisted protein folding. Methods and conclusions A novel cloning method for the design and production of specific, high-affinity-reacting proteins (SHARP is presented. This method is based on the concept of proteomic codes and is suitable for large-scale, industrial production of specifically interacting peptides.
Lektury lekarza – książka Leonarda Botalla w Bibliotece Uniwersyteckiej w Poznaniu
Directory of Open Access Journals (Sweden)
Renata Wilgosiewicz – Skutecka
2009-01-01
Full Text Available Wśród druków francuskich Biblioteki Uniwersyteckiej w Poznaniu znajduje się interesujący zbiór (klocek szesnastowiecznych traktatów medycznych, wydany w Lyonie przez Guillaume’a Rouillé oraz Paula Miraillet, zawierający dwa dzieła Galena: De naturalibus facultatibus libri tres (1548 i De bono et malo succo, liber unus (1547 oraz traktat Donato Antonio Altomare De alteratione, concoctione, digestione, praeparatione, ac purgatione: ex Hippocratis et Galeni sententia methodus (1548. Wolumin ten należał do Leonarda Botalla (1519-1587, włoskiego anatoma i chirurga, medyka królów francuskich, i nosi ślady jego lektury – liczne marginalia, podkreślenia i komentarze w języku łacińskim. Pobieżna analiza tego materiału rękopiśmiennego, zwłaszcza wielu krytycznych uwag Botalla wobec poglądów Galena, pozwala widzieć w tych zapiskach świadectwo przemian zachodzących w medycynie w XVI wieku, która dopiero w tym okresie stała się nauką w pełni nowożytną. Przedstawiona w niniejszym artykule ogólna charakterystyka woluminu jest jedynie wprowadzeniem do szczegółowej analizy zapisków Leonarda Botalla, która pozwoliłaby historykom medycyny dokładniej zrekonstruować poglądy lekarza z Asti, będące świadectwem recepcji dzieł Galena w XVI wieku i toczącej się wokół nich dyskusji.
Yeast Interacting Proteins Database: YLR362W, YCL032W [Yeast Interacting Proteins Database
Lifescience Database Archive (English)
Full Text Available YLR362W STE11 Signal transducing MEK kinase involved in pheromone response and pseudohyphal/invasive...ait as prey (1) YCL032W STE50 Protein involved in mating response, invasive/filam...2W Bait gene name STE11 Bait description Signal transducing MEK kinase involved in pheromone response and pseudohyphal/invasive...F YCL032W Prey gene name STE50 Prey description Protein involved in mating response, invasive/filamentous gr
Convolutional Goppa codes defined on fibrations
Curto, J I Iglesias; Martín, F J Plaza; Sotelo, G Serrano
2010-01-01
We define a new class of Convolutional Codes in terms of fibrations of algebraic varieties generalizaing our previous constructions of Convolutional Goppa Codes. Using this general construction we can give several examples of Maximum Distance Separable (MDS) Convolutional Codes.
Directory of Open Access Journals (Sweden)
Dorota Angelika Paśko-Koneczniak
2015-12-01
Full Text Available Stress patterns in loan verb lexemes in the dialect used by the Old Believers living in the Suwałki-Augustów region The aim of the article is to present the stress pattern phenomenon in loan verb lexemes which function in the Russian dialect of the Old Believers from the Suwałki-Augustów Region. In the last decades, the insular dialect, separated from the general Russian language, has been influenced by the Polish language. Such influence is visible, in particular, in the vocabulary, in the form of loan translations and idiomatic expressions. Stress patterns, along with the root vocabulary and the morphological system, still remains one of the indicators of the Russian essence of the dialect. The native vocabulary of the Old Believers’ dialect maintains Russian accentuation patterns. A similar situation is observed in the case of stress patterns in lexemes borrowed from Polish, which undergo a stress accentuation adaptation; that is, they feature a shift in the place of the stress in relation to the source language. In loan verb morphemes, one can notice the pattern of stress which is not fixed and depends upon the morphological form or, sometimes, the paroxitonic stress, which results from the influence of the Polish language. Akcentuacja zapożyczonych leksemów czasownikowych w gwarze staroobrzędowców mieszkających w regionie suwalsko-augustowskim Celem artykułu jest zaprezentowanie zjawiska akcentuacji w zapożyczonych leksemach czasownikowych, funkcjonujących w rosyjskiej gwarze staroobrzędowców z regionu suwalsko-augustowskiego. W ciągu ostatnich kilkudziesięciu lat badana gwara wyspowa, odseparowana od rosyjskiego języka ogólnego, podlega znacznemu wpływowi języka polskiego. Wpływ polszczyzny widoczny jest szczególnie w zasobie leksykalnym w postaci zapożyczeń, kalk i w idiomatyce. Akcentuacja obok rdzennego zasobu leksykalnego i systemu morfologicznego nadal pozostaje jednym z wyznaczników rosyjskości gwary
Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes
Harrington, James William
Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present
Yeast Interacting Proteins Database: YOR264W, YCR086W [Yeast Interacting Proteins Database
Lifescience Database Archive (English)
Full Text Available YOR264W DSE3 Daughter cell-specific protein, may help establish daughter fate Rows ...0 42 - Show YOR264W Bait ORF YOR264W Bait gene name DSE3 Bait description Daughter cell-specific protein, ma
Yeast Interacting Proteins Database: YNL092W, YJR097W [Yeast Interacting Proteins Database
Lifescience Database Archive (English)
Full Text Available ta-strand family; YNL092W is not an essential gene Rows with this bait as bait (6) Rows with this bait as prey (1) YJR097W JJJ...h this bait as prey Rows with this bait as prey (1) Prey ORF YJR097W Prey gene name JJJ3 Prey description Pr
Yeast Interacting Proteins Database: YBR108W, YDR388W [Yeast Interacting Proteins Database
Lifescience Database Archive (English)
Full Text Available YBR108W AIM3 Protein interacting with Rvs167p; null mutant is viable and displays e...l mutant is viable and displays elevated frequency of mitochondrial genome loss R...8 - Show YBR108W Bait ORF YBR108W Bait gene name AIM3 Bait description Protein interacting with Rvs167p; nul
Blind recognition of punctured convolutional codes
Institute of Scientific and Technical Information of China (English)
LU Peizhong; LI Shen; ZOU Yan; LUO Xiangyang
2005-01-01
This paper presents an algorithm for blind recognition of punctured convolutional codes which is an important problem in adaptive modulation and coding. For a given finite sequence of convolutional code, the parity check matrix of the convolutional code is first computed by solving a linear system with adequate error tolerance. Then a minimal basic encoding matrix of the original convolutional code and its puncturing pattern are determined according to the known parity check matrix of the punctured convolutional code.
Wireless Network Coding with Local Network Views: Coded Layer Scheduling
Vahid, Alireza; Avestimehr, A Salman; Sabharwal, Ashutosh
2011-01-01
One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire limited local views of the whole network to design their transmission strategies. In this paper, we study multi-layer wireless networks and assume that each node has only a limited knowledge, namely 1-local view, where each S-D pair has enough information to perform optimally when other pairs do not interfere, along with connectivity information for rest of the network. We investigate the information-theoretic limits of communication with such limited knowledge at the nodes. We develop a novel transmission strategy, namely Coded Layer Scheduling, that solely relies on 1-local view at the nodes and incorporates three different techniques: (1) per layer interference avoidance, (2) repetition coding to allow overhearing of the interference, and (3) network coding to allow inter...
BLAKE - A Thermodynamics Code Based on TIGER: Users’ Guide and Manual
1982-07-01
ATTN: Code G33, J. L. Eaat William Spadie D. McClure Crane, Indiana 47522’ W. Burrell J. Johndrow 2 Superintendent Code DX-21 Tech Lib Naval...Boltzmann. Last but not least, I want to express my appreciation to the authors of the original TIGER code, especially William Zwisler, for their for...Charlottesville, VA 22901 ATTN: ATCD-MA/MAJ Williams Fort Monroe, VA 23651 1 President U.S. Army Artillery Board 2 Commander Ft. Sill, OK 73504 US Army
Scyntygrafia kości w diagnostyce reumatoidalnego zapalenia stawów
Directory of Open Access Journals (Sweden)
Witold Tłustochowicz
2010-04-01
Full Text Available Celem pracy była ocena przydatności trójfazowej dynamicznejscyntygrafii kości w diagnostyce reumatoidalnego zapalenia stawów.Badaniem objęto 39 chorych hospitalizowanych i diagnozowanychz powodu dolegliwości stawowych. Przeprowadzono diagnostykęobejmującą: badanie podmiotowe, przedmiotowe, badania laboratoryjneoraz obrazowe, w tym trójfazową scyntygrafię kości z użyciemtechnetu 99m. Scyntygraficzne cechy zapalenia stawówstwierdzano, gdy obserwowano wzmożone gromadzenie znacznikawe wszystkich trzech fazach badania.Po ukończeniu diagnostyki rozpoznano u 13 chorych wczesne reumatoidalnezapalenie stawów, u 4 reumatoidalne zapalenie stawów(łącznie 17 pacjentów, a u 1 niezróżnicowane zapalenie stawów.Scyntygrafia kości wykazała cechy zapalenia stawów u 13spośród nich (72,2%, u 4 osób (22,2% wzmożone gromadzeniestwierdzono tylko w fazie statycznej, a u 1 pacjenta (5,6% uzyskanoprawidłowy wynik badania. U 21 chorych wykluczono chorobęzapalną stawów (u 19 rozpoznano fibromialgię, u 2 chorobęzwyrodnieniową. W grupie bez zapalenia stawów u 14 pacjentów(66,6% nie stwierdzono istotnych nieprawidłowości w obraziescyntygraficznym, u 6 (28,6% występowało wzmożone gromadzenieznacznika w badaniu statycznym, a u 1 chorego (4,8% opisanoscyntygraficzne cechy zapalenia stawów.Wbadanej grupie czułość scyntygrafii dynamicznej kości w wykrywaniuzapalenia stawów wynosiła 72,2% (95% CI: 57,5–76,8, a swoistość 95,2% (95% CI: 82,8–99,1. Dodatni wynik badaniadynamicznego wskazuje z dużym prawdopodobieństwem naobecność zapalenia stawów [PPV 92,9% (95% CI: 74,2–98,7].Mniej wiarygodny był ujemny wynik badania [NPV 80% (95% CI:69,5–83,3]. Wyniki niniejszej pracy wskazują, że trójfazowa scyntygrafia dynamicznakości może mieć zastosowanie w diagnostyce reumatoidalnegozapalenia stawów.
Requirements of a Better Secure Program Coding
Directory of Open Access Journals (Sweden)
Marius POPA
2012-01-01
Full Text Available Secure program coding refers to how manage the risks determined by the security breaches because of the program source code. The papers reviews the best practices must be doing during the software development life cycle for secure software assurance, the methods and techniques used for a secure coding assurance, the most known and common vulnerabilities determined by a bad coding process and how the security risks are managed and mitigated. As a tool of the better secure program coding, the code review process is presented, together with objective measures for code review assurance and estimation of the effort for the code improvement.
Multiplicatively Repeated Non-Binary LDPC Codes
Kasai, Kenta; Poulliat, Charly; Sakaniwa, Kohichi
2010-01-01
We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.
New multilevel codes over GF(q)
Wu, Jiantian; Costello, Daniel J., Jr.
1992-01-01
Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.
W properties and decays at LEP2
Bella, G
2001-01-01
Preliminary results from W-pair events measured by the four LEP experiments are presented. These results are based on data taken during years 1996-2000 at e/sup +/e/sup -/ centre-of-mass energies between 161-208 GeV and corresponding to a total integrated luminosity of 560 pb/sup -1/. A total number of about 7500 W-pair candidates per experiment is used to determine the W decay branching fractions, which are used to test lepton universality to a 1.6% accuracy level. Hadronic decays of W into charm are identified and the fraction of charm decay is 0.494+or-0.044, corresponding to the CKM matrix element value |V/sub cs/|=0.96+or-0.08. The W mass is measured to be 80.427+or-0.046 GeV, in agreement with other determinations of this value. The measured value of the W width is Gamma /sub W/=2.12+or-0.11 GeV. All results agree with the standard model expectations. (13 refs).
Combinatorial polarization, code loops, and codes of high level
Directory of Open Access Journals (Sweden)
Petr Vojtěchovský
2004-07-01
Full Text Available We first find the combinatorial degree of any map f:VÃ¢Â†Â’F, where F is a finite field and V is a finite-dimensional vector space over F. We then simplify and generalize a certain construction, due to Chein and Goodaire, that was used in characterizing code loops as finite Moufang loops that possess at most two squares. The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.