Generalized H-codes and type II codes over GF(4)
LIN Xin-qi; WEN Xiang-ming; ZHENG Wei
2008-01-01
The type II codes have been studied widely in applications since their appearance. With analysis of the algebraic structure of finite field of order 4 (i.e., GF(4)), some necessary and sufficient conditions that a generalized H-code (i.e., GH-code) is a type II code over GF(4) are given in this article, and an efficient and simple method to generate type II codes from GH-codes over GF(4) is shown. The conclusions further extend the coding theory of type II.
Quantization Skipping Method for H.264/AVC Video Coding
Won-seon SONG; Min-cheol HONG
2010-01-01
This paper presents a quantization skipping method for H.264/AVC video coding standard. In order to reduce the computational-cost of quantization process coming from integer discrete cosine transform of H.264/AVC, a quantization skipping condition is derived by the analysis of integer transform and quantization procedures. The experimental results show that the proposed algorithm has the capability to reduce the computational cost about 10%～25%.
RTP payload format for H.264/SVC scalable video coding
WENGER Stephan; WANG Ye-kui; HANNUKSELA Miska M.
2006-01-01
The scalable extension of H.264/AVC, known as scalable video coding or SVC, is currently the main focus of the Joint Video Team's work. In its present working draft, the higher level syntax of SVC follows the design principles of H.264/AVC.Self-contained network abstraction layer units (NAL units) form natural entities for packetization. The SVC specification is by no means finalized yet, but nevertheless the work towards an optimized RTP payload format has already started. RFC 3984, the RTP payload specification for H.264/AVC has been taken as a starting point, but it became quickly clear that the scalable features of SVC require adaptation in at least the areas of capability/operation point signaling and documentation of the extended NAL unit header. This paper first gives an overview of the history of scalable video coding, and then reviews the video coding layer (VCL)and NAL of the latest SVC draft specification. Finally, it discusses different aspects of the draft SVC RTP payload format, including the design criteria, use cases, signaling and payload structure.
Mode-dependent templates and scan order for H.264/AVC-based intra lossless coding.
Gu, Zhouye; Lin, Weisi; Lee, Bu-Sung; Lau, Chiew Tong; Sun, Ming-Ting
2012-09-01
In H.264/advanced video coding (AVC), lossless coding and lossy coding share the same entropy coding module. However, the entropy coders in the H.264/AVC standard were original designed for lossy video coding and do not yield adequate performance for lossless video coding. In this paper, we analyze the problem with the current lossless coding scheme and propose a mode-dependent template (MD-template) based method for intra lossless coding. By exploring the statistical redundancy of the prediction residual in the H.264/AVC intra prediction modes, more zero coefficients are generated. By designing a new scan order for each MD-template, the scanned coefficients sequence fits the H.264/AVC entropy coders better. A fast implementation algorithm is also designed. With little computation increase, experimental results confirm that the proposed fast algorithm achieves about 7.2% bit saving compared with the current H.264/AVC fidelity range extensions high profile.
Edge-preserving Intra Depth Coding based on Context-coding and H.264/AVC
Zamarin, Marco; Salmistraro, Matteo; Forchhammer, Søren;
2013-01-01
Depth map coding plays a crucial role in 3D Video communication systems based on the “Multi-view Video plus Depth” representation as view synthesis performance is strongly affected by the accuracy of depth information, especially at edges in the depth map image. In this paper an efficient algorithm...... each approximated by a flat surface. Edge information is encoded by means of contextcoding with an adaptive template. As a novel element, the proposed method allows exploiting the edge structure of previously encoded edge macroblocks during the context-coding step to further increase compression...
A fast block mode selection approach for H. Visual coding
LIN Wei-yao; Fang Xiang-zhong; HUANG Xiu-chao; LI Dian; LIU Xiao-feng
2006-01-01
In this paper,a new fast mode-selection approach is proposed.This algorithm combines the proposed approaches of mode pre-decision and precise large-small mode decision,by selecting the best mode efficiently.Experimental results show that the proposed approach can reduce the computational cost of full search and fast multi-block motion estimation by 8% and 45%,respectively,with similar visual quality and bit rate.The proposed algorithm also reduces by 75% the computational cost of the large-small mode isolation algorithm for low-motion sequence coding,and with 0.06 PSNR gain and 3.7% reduction in bit rate.
Operator Design Methodology and Application in H.264 Entropy Coding
Ziyi Hu
2010-11-01
Full Text Available Currently ASIC applications, such as multimedia processing, require shorter time-to-market and lower cost of Non Recurring Engineering (NRE. Also, with the IC manufacturing technology developing continually, from transistor level to logic gate level, the size of design cells in digital circuits is increasing correspondingly. New design methodology is in urgent need to meet the requirement for the developing processing technology and shorter time-to-market in IC industry. This paper proposed the concepts and principles of operator design methodology, then focused on the entropy coding application based on the operators and finally presented the implementation results. The results show that with the proposed methodology, a comparable hardware performance can be obtained against the traditional standard cell based design flow. Furthermore, the design speed can be improved efficiently.
Software Review: "The Secret Codes of C.Y.P.H.E.R.: Operation Wildlife."
Bober, Marcie
1992-01-01
Describes "The Secret Codes of C.Y.P.H.E.R.: Operation Wildlife," a software program for language arts classrooms that joins natural science and communication/cryptography topics in a secret-agent interactive setting. (SR)
UNSAT-H Version 1. 0: unsaturated flow code documentation and applications for the Hanford Site
Fayer, M.J.; Gee, G.W.; Jones, T.L.
1986-08-01
Waste mangement practices at the Hanford Site have relied havily on near-surface burial. Predicting the future performance of any burial site in terms of the migration of buried contaminants requires a model capable of simulating water flow in the unsaturated soils above the buried waste. The model currently being developed to meet this need is UNSAT-H, which was developed at Pacific Northwest Laboratory for assessing the water dynamics of near-surface waste-disposal sites at the Hanfrod Site. The code will primarily be used to predict deep drainage (i.e., recharge) as a function of environmental conditions such as climate, soil type, and vegetation. UNSAT-H will also simulate various waste-management practices such as placing surface barriers over waste sites. UNSAT-H is a one-dimensional model that simulates the dynamics processes of infiltration, drainage, redistribution, surface evaporation, and uptake of water from soil by plants. UNSAT-H is designed to utilize two auxiliary codes. These codes are DATAINH, which is used to process the input data, and DATAOUT, which is used to process the UNSAT-H output. Operation of the code requires three separate steps. First, the problem to be simulated must be conceptualized in terms of boundary conditions, available data, and soil properties. Next, the data must be correctly formatted for input. Finally, the unput data must be processed, UNSAT-H run, and the output data processed for analysis. This report includes three examples of code use. In the first example, a benchmark test case is run in which the results of UNSAT-H simulations of infiltration are compared with an analytical solution and a numerical solution. The comparisons show excellent agreement for the specific test case, and this agreement provides vertification of the infiltration portion of the UNSAT-H code. The other two examples of code use are a simulation of a layered soil and one of plant transpiration.
Depth-based coding of MVD data for 3D video extension of H.264/AVC
Rusanovskyy, Dmytro; Hannuksela, Miska M.; Su, Wenyi
2013-06-01
This paper describes a novel approach of using depth information for advanced coding of associated video data in Multiview Video plus Depth (MVD)-based 3D video systems. As a possible implementation of this conception, we describe two coding tools that have been developed for H.264/AVC based 3D Video Codec as response to Moving Picture Experts Group (MPEG) Call for Proposals (CfP). These tools are Depth-based Motion Vector Prediction (DMVP) and Backward View Synthesis Prediction (BVSP). Simulation results conducted under JCT-3V/MPEG 3DV Common Test Conditions show, that proposed in this paper tools reduce bit rate of coded video data by 15% of average delta bit rate reduction, which results in 13% of bit rate savings on total for the MVD data over the state-of-the-art MVC+D coding. Moreover, presented in this paper conception of depth-based coding of video has been further developed by MPEG 3DV and JCT-3V and this work resulted in even higher compression efficiency, bringing about 20% of delta bit rate reduction on total for coded MVD data over the reference MVC+D coding. Considering significant gains, proposed in this paper coding approach can be beneficial for development of new 3D video coding standards. [Figure not available: see fulltext.
Adaptive Zero-Coefficient Distribution Scan for Inter Block Mode Coding of H.264/AVC
Wang, Jing-Xin; Su, Alvin W. Y.
Scanning quantized transform coefficients is an important tool for video coding. For example, the MPEG-4 video coder adopts three different scans to get better coding efficiency. This paper proposes an adaptive zero-coefficient distribution scan in inter block coding. The proposed method attempts to improve H.264/AVC zero coefficient coding by modifying the scan operation. Since the zero-coefficient distribution is changed by the proposed scan method, new VLC tables for syntax elements used in context-adaptive variable length coding (CAVLC) are also provided. The savings in bit-rate range from 2.2% to 5.1% in the high bit-rate cases, depending on different test sequences.
Design of Multiple Trellis-Coded Multi-h CPM Based on Super Trellis
X. Liu. A. Liu
2012-12-01
Full Text Available It has been shown that the multiple trellis code can perform better than the conventional trellis code over AWGN channels, at the cost of additional computations per trellis branch. Multiple trellis coded multi-h CPM schemes have been shown in the literature to have attractive power-bandwidth performance at the expense of increased receiver complexity. In this method, the multi-h format is made to be associated with the specific pattern and repeated rather than cyclically changed in time for successive symbol intervals, resulting in a longer effective length of the error event with better performance. It is well known that the rate (n-1/n multiple trellis codes combined with 2^n-level CPM have good power-bandwidth performance. In this paper, a scheme combining rate 1/2 and 2/3 multiple trellis codes with 4- and 8-level multi-h CPM is shown to have better power-bandwidth performance over the upper bound than the scheme with single-h.
A Joint Source and Channel Video Coding Algorithmfor H.223 Based Wireless Channel
无
2002-01-01
Robust video streaming through high error-prone wireless channel has attracted much attention.In this paper the authors introduce an effective al gorithm by joining the Unequal Error Protection ability of the channel multiplexing prot ocol H.223 Annex D,and the new H.263++ Annex V Data Partition together. Bas ed on the optimal trade-off of these two technologies,the Joint Source and Channel Coding algorithm can result in stronger error resilience.The simulation results have shown its superiority against separate coding mode and some Unequal Error Protection mode under recommended wireless channel error patterns.
Efficient rate control scheme for low bit rate H.264/AVC video coding
LI Zhi-cheng; ZHANG Yong-jun; LIU Tao; GU Wan-yi
2009-01-01
This article presents an efficient rate control scheme for H.264/AVC video coding in low bit rate environment. In the proposed scheme, an improved rate-distortion (RD) model by both analytical and empirical approaches is developed. It involves an enhanced mean absolute difference estimating method and a more rate-robust distortion model. Based on this RD model, an efficient macroblock-layer rate control scheme for H.264/AVC video coding is proposed. Experimental results show that this model encodes video sequences with higher peak signal-to-noise ratio gains and generates bit stream closer to the target rate.
Performance Comparison of AVS and H.264/AVC Video Coding Standards
Xin-Fu Wang; De-Bin Zhao
2006-01-01
A new audio and video compression standard of China, known as advanced Audio Video coding Standard (AVS),is emerging. This standard provides a technical solution for many applications within the information industry such as digital broadcast, high-density laser-digital storage media, and so on. The basic part of AVS, AVS1-P2, targets standard definition (SD) and high definition (HD) format video compression, and aims to achieve similar coding efficiency as H.264/AVC but with lower computational complexity. In this paper, we first briefly describe the major coding tools in AVS1-P2, and then perform the coding efficiency comparison between AVS1-P2 Jizhun profile and H.264/AVC main profile. The experimental results show that the AVS1-P2 Jizhun profile has an average of 2.96% efficiency loss relative to H.264/AVC main profile in terms of bit-rate saving on HD progressive-scan sequences, and an average of 28.52% coding loss on interlace-scan sequences.Nevertheless, AVS1-P2 possesses a valuable feature of lower computational complexity.
A optimized context-based adaptive binary arithmetic coding algorithm in progressive H.264 encoder
Xiao, Guang; Shi, Xu-li; An, Ping; Zhang, Zhao-yang; Gao, Ge; Teng, Guo-wei
2006-05-01
Context-based Adaptive Binary Arithmetic Coding (CABAC) is a new entropy coding method presented in H.264/AVC that is highly efficient in video coding. In the method, the probability of current symbol is estimated by using the wisely designed context model, which is adaptive and can approach to the statistic characteristic. Then an arithmetic coding mechanism largely reduces the redundancy in inter-symbol. Compared with UVLC method in the prior standard, CABAC is complicated but efficiently reduce the bit rate. Based on thorough analysis of coding and decoding methods of CABAC, This paper proposed two methods, sub-table method and stream-reuse methods, to improve the encoding efficiency implemented in H.264 JM code. In JM, the CABAC function produces bits one by one of every syntactic element. Multiplication operating times after times in the CABAC function lead to it inefficient.The proposed algorithm creates tables beforehand and then produce every bits of syntactic element. In JM, intra-prediction and inter-prediction mode selection algorithm with different criterion is based on RDO(rate distortion optimization) model. One of the parameter of the RDO model is bit rate that is produced by CABAC operator. After intra-prediction or inter-prediction mode selection, the CABAC stream is discard and is recalculated to output stream. The proposed Stream-reuse algorithm puts the stream in memory that is created in mode selection algorithm and reuses it in encoding function. Experiment results show that our proposed algorithm can averagely speed up 17 to 78 MSEL higher speed for QCIF and CIF sequences individually compared with the original algorithm of JM at the cost of only a little memory space. The CABAC was realized in our progressive h.264 encoder.
A review of MAAP4 code structure and core T/H model
Song, Yong Mann; Park, Soo Yong
1998-03-01
The modular accident analysis program (MAAP) version 4 is a computer code that can simulate the response of LWR plants during severe accident sequences and includes models for all of the important phenomena which might occur during accident sequences. In this report, MAAP4 code structure and core thermal hydraulic (T/H) model which models the T/H behavior of the reactor core and the response of core components during all accident phases involving degraded cores are specifically reviewed and then reorganized. This reorganization is performed via getting the related models together under each topic whose contents and order are same with other two reports for MELCOR and SCDAP/RELAP5 to be simultaneously published. Major purpose of the report is to provide information about the characteristics of MAAP4 core T/H models for an integrated severe accident computer code development being performed under the one of on-going mid/long-term nuclear developing project. The basic characteristics of the new integrated severe accident code includes: 1) Flexible simulation capability of primary side, secondary side, and the containment under severe accident conditions, 2) Detailed plant simulation, 3) Convenient user-interfaces, 4) Highly modularization for easy maintenance/improvement, and 5) State-of-the-art model selection. In conclusion, MAAP4 code has appeared to be superior for 3) and 4) items but to be somewhat inferior for 1) and 2) items. For item 5), more efforts should be made in the future to compare separated models in detail with not only other codes but also recent world-wide work. (author). 17 refs., 1 tab., 12 figs.
RNA editing differently affects protein-coding genes in D. melanogaster and H. sapiens.
Grassi, Luigi; Leoni, Guido; Tramontano, Anna
2015-07-14
When an RNA editing event occurs within a coding sequence it can lead to a different encoded amino acid. The biological significance of these events remains an open question: they can modulate protein functionality, increase the complexity of transcriptomes or arise from a loose specificity of the involved enzymes. We analysed the editing events in coding regions that produce or not a change in the encoded amino acid (nonsynonymous and synonymous events, respectively) in D. melanogaster and in H. sapiens and compared them with the appropriate random models. Interestingly, our results show that the phenomenon has rather different characteristics in the two organisms. For example, we confirm the observation that editing events occur more frequently in non-coding than in coding regions, and report that this effect is much more evident in H. sapiens. Additionally, in this latter organism, editing events tend to affect less conserved residues. The less frequently occurring editing events in Drosophila tend to avoid drastic amino acid changes. Interestingly, we find that, in Drosophila, changes from less frequently used codons to more frequently used ones are favoured, while this is not the case in H. sapiens.
TMCalc - A fast code to derive Teff and [Fe/H] for FGK stars
Sousa, Sérgio G; Israelian, Garik; 10.1051/0004-6361/201219260
2012-01-01
We present a new direct spectroscopic calibration for a fast estimation of the stellar metallicity [Fe/H]. These calibrations were computed using a large sample of 451 solar-type stars for which we have precise spectroscopic parameters derived from high quality spectra. The new [Fe/H] calibration is based on weak Fe I lines, which are expected to be less dependent on surface gravity and microturbulence, and require only a pre-determination of the effective temperature. This temperature can be obtained using a previously presented line-ratio calibration. We also present a simple code that uses the calibrations and procedures presented in these works to obtain both the effective temperature and the [Fe/H] estimate. The code, written in C, is freely available for the community and may be used as an extension of the ARES code. We test these calibrations for 582 independent FGK stars. We show that the code can be used as a precise and fast indicator of the spectroscopic temperature and metallicity for dwarf FKG st...
Low Complexity for Scalable Video Coding Extension of H.264 based on the Complexity of Video
Mayada Khairy
2016-12-01
Full Text Available Scalable Video Coding (SVC / H.264 is one type of video compression techniques. Which provided more reality in dealing with video compression to provide an efficient video coding based on H.264/AVC. This ensures higher performance through high compression ratio. SVC/H.264 is a complexity technique whereas the takes considerable time for computation the best mode of macroblock and motion estimation through using the exhaustive search techniques. This work reducing the processing time through matching between the complexity of the video and the method of selection macroblock and motion estimation. The goal of this approach is reducing the encoding time and improving the quality of video stream the efficiency of the proposed approach makes it suitable for are many applications as video conference application and security application.
Sandia National Laboratories environmental fluid dynamics code : pH effects user manual.
Janardhanam, Vijay (University of New Mexico, Albuquerque, NM); James, Scott Carlton
2012-02-01
This document describes the implementation level changes in the source code and input files of Sandia National Laboratories Environmental Fluid Dynamics Code (SNL-EFDC) that are necessary for including pH effects into algae-growth dynamics. The document also gives a brief introduction to how pH effects are modeled into the algae-growth model. The document assumes that the reader is aware of the existing algae-growth model in SNL-EFDC. The existing model is described by James, Jarardhanam and more theoretical considerations behind modeling pH effects are presented therein. This document should be used in conjunction with the original EFDC manual and the original water-quality manual.
Moving object detection method using H.263 video coded data for remote surveillance systems
Kohno, Atsushi; Hata, Toshihiko; Ozaki, Minoru
1998-12-01
This paper describes a moving object detection method using H.263 coded data. For video surveillance systems, it is necessary to detect unusual states because there are a lot of cameras in the system and video surveillance is tedious in normal states. We examine the information extracted from H.263 coded data and propose a method of detecting alarm events from that information. Our method consists of two steps. In the first step, using motion vector information, a moving object can be detected based on the vector's size and the similarities between the vectors in one frame and the two adjoining frames. In the second step, using DCT coefficients, the detection errors caused by the change of the luminous intensity can be eliminated based on the characteristics of the H.263's DCT coefficients. Thus moving objects are detected by analyzing the motion vectors and DCT coefficients, and we present some experimental results that show the effectiveness of our method.
Design and implementation of H.264 based embedded video coding technology
Mao, Jian; Liu, Jinming; Zhang, Jiemin
2016-03-01
In this paper, an embedded system for remote online video monitoring was designed and developed to capture and record the real-time circumstances in elevator. For the purpose of improving the efficiency of video acquisition and processing, the system selected Samsung S5PV210 chip as the core processor which Integrated graphics processing unit. And the video was encoded with H.264 format for storage and transmission efficiently. Based on S5PV210 chip, the hardware video coding technology was researched, which was more efficient than software coding. After running test, it had been proved that the hardware video coding technology could obviously reduce the cost of system and obtain the more smooth video display. It can be widely applied for the security supervision [1].
Artificial viscosity method for the design of supercritical airfoils. [Analysis code H
McFadden, G.B.
1979-07-01
The need for increased efficiency in the use of our energy resources has stimulated applied research in many areas. Recently progress has been made in the field of aerodynamics, where the development of the supercritical wing promises significant savings in the fuel consumption of aircraft operating near the speed of sound. Computational transonic aerodynamics has proved to be a useful tool in the design and evaluation of these wings. A numerical technique for the design of two-dimensional supercritical wing sections with low wave drag is presented. The method is actually a design mode of the analysis code H developed by Bauer, Garabedian, and Korn. This analysis code gives excellent agreement with experimental results and is used widely by the aircraft industry. The addition of a conceptually simple design version should make this code even more useful to the engineering public.
The H19 non-coding RNA is essential for human tumor growth.
Imad J Matouk
Full Text Available BACKGROUND: Mutations and epigenetic aberrant signaling of growth factors pathways contribute to carcinogenesis. Recent studies reveal that non-coding RNAs are controllers of gene expression. H19 is an imprinted gene that demonstrates maternal monoallelic expression without a protein product; although its expression is shut off in most tissues postnatally, it is re-activated during adult tissue regeneration and tumorigenesis. Moreover, H19 is highly expressed in liver metastasis derived from a range of carcinomas. The objective of this study is to explore the role of H19 in carcinogenesis, and to determine its identification as an anti-tumor target. METHODOLOGY/PRINCIPLE FINDINGS: By controlling oxygen pressure during tumor cell growth and H19 expression levels, we investigated the role of H19 expression in vitro and in vivo in hepatocellular (HCC and bladder carcinoma. Hypoxia upregulates the level of H19 RNA. Ablations of tumorigenicity of HCC and bladder carcinomas in vivo are seen by H19 knockdown which also significantly abrogates anchorage-independent growth after hypoxia recovery, while ectopic H19 expression enhances tumorigenic potential of carcinoma cells in vivo. Knocking-down H19 message in hypoxic stress severely diminishes p57(kip2 induction. We identified a number of potential downstream targets of H19 RNA, including angiogenin and FGF18. CONCLUSIONS: H19 RNA harbors pro-tumorigenic properties, thus the H19 gene behaves as an oncogene and may serve as a potential new target for anti-tumor therapy.
Distortion Modeling and Error Robust Coding Scheme for H.26L Video
CHENChuan; YUSongyu; CHENGLianji
2004-01-01
Transmission of hybrid-coded video including motion compensation and spatial prediction over error prone channel results in the well-known problem of error propagation because of the drift in reference frames between encoder and decoder. The prediction loop propa-gates errors and causes substantial degradation in video quality. Especially in H.26L video, both intra and inter prediction strategies are used to improve compression efficiency, however, they make error propagation more serious. This work proposes distortion models for H.26L video to optimally estimate the overall distortion of decoder frame reconstruction due to quantization, error propagation, and error concealment. Based on these statistical distortion models, our error robust coding scheme only integrates the distinct distortion between intra and inter macroblocks into a rate-distortlon based framework to select suitable coding mode for each macroblock, and so,the cost in computation complexity is modest. Simulations under typical 3GPP/3GPP2 channel and Internet channel conditions have shown that our proposed scheme achieves much better performance than those currently used in H.26L. The error propagation estimation and effect at high fractural pixel-level prediction have also been tested. All the results have demonstrated that our proposed scheme achieves a good balance between compression efficiency and error robustness for H.26L video, at the cost of modest additional complexity.
ALEGRA -- A massively parallel h-adaptive code for solid dynamics
Summers, R.M.; Wong, M.K.; Boucheron, E.A.; Weatherby, J.R. [Sandia National Labs., Albuquerque, NM (United States)
1997-12-31
ALEGRA is a multi-material, arbitrary-Lagrangian-Eulerian (ALE) code for solid dynamics designed to run on massively parallel (MP) computers. It combines the features of modern Eulerian shock codes, such as CTH, with modern Lagrangian structural analysis codes using an unstructured grid. ALEGRA is being developed for use on the teraflop supercomputers to conduct advanced three-dimensional (3D) simulations of shock phenomena important to a variety of systems. ALEGRA was designed with the Single Program Multiple Data (SPMD) paradigm, in which the mesh is decomposed into sub-meshes so that each processor gets a single sub-mesh with approximately the same number of elements. Using this approach the authors have been able to produce a single code that can scale from one processor to thousands of processors. A current major effort is to develop efficient, high precision simulation capabilities for ALEGRA, without the computational cost of using a global highly resolved mesh, through flexible, robust h-adaptivity of finite elements. H-adaptivity is the dynamic refinement of the mesh by subdividing elements, thus changing the characteristic element size and reducing numerical error. The authors are working on several major technical challenges that must be met to make effective use of HAMMER on MP computers.
A novel dynamic frame rate control algorithm for H.264 low-bit-rate video coding
Yang Jing; Fang Xiangzhong
2007-01-01
The goal of this paper is to improve human visual perceptual quality as well as coding efficiency of H.264 video at low bit rate conditions by adaptively adjusting the number of skipped frames. The encoding frames ale selected according to the motion activity of each frame and the motion accumulation of successive frames. The motion activity analysis is based on the statistics of motion vectors and with consideration of the characteristics of H. 264 coding standard. A prediction model of motion accumulation is proposed to reduce complex computation of motion estimation. The dynamic encoding frame rate control algorithm is applied to both the frame level and the GOB (Group of Macroblocks) level. Simulation is done to compare the performance of JM76 with the proposed frame level scheme and GOB level scheme.
Complexity modeling for context-based adaptive binary arithmetic coding (CABAC) in H.264/AVC decoder
Lee, Szu-Wei; Kuo, C.-C. Jay
2007-09-01
One way to save the power consumption in the H.264 decoder is for the H.264 encoder to generate decoderfriendly bit streams. By following this idea, a decoding complexity model of context-based adaptive binary arithmetic coding (CABAC) for H.264/AVC is investigated in this research. Since different coding modes will have an impact on the number of quantized transformed coeffcients (QTCs) and motion vectors (MVs) and, consequently, the complexity of entropy decoding, the encoder with a complexity model can estimate the complexity of entropy decoding and choose the best coding mode to yield the best tradeoff between the rate, distortion and decoding complexity performance. The complexity model consists of two parts: one for source data (i.e. QTCs) and the other for header data (i.e. the macro-block (MB) type and MVs). Thus, the proposed CABAC decoding complexity model of a MB is a function of QTCs and associated MVs, which is verified experimentally. The proposed CABAC decoding complexity model can provide good estimation results for variant bit streams. Practical applications of this complexity model will also be discussed.
Long Non-coding RNA H19 Induces Cerebral Ischemia Reperfusion Injury via Activation of Autophagy
Wang, Jue; Cao, Bin; Han, Dong; Sun, Miao; Feng, Juan
2017-01-01
Long non-coding RNA H19 (lncRNA H19) was found to be upregulated by hypoxia, its expression and function have never been tested in cerebral ischemia and reperfusion (I/R) injury. This study intended to investigate the role of lncRNA H19 and H19 gene variation in cerebral I/R injury with focusing on its relationship with autophagy activation. Cerebral I/R was induced in rats by middle cerebral artery occlusion followed by reperfusion. SH-SY5Y cells were subjected to oxygen and glucose deprivation and reperfusion (OGD/R) to simulate I/R injury. Real-time PCR, flow cytometry, immunofluorescence and Western blot were used to evaluate the level of lncRNA H19, apoptosis, autophagy and some related proteins. The modified multiple ligase reaction was used to analyze the gene polymorphism of six SNPs in H19, rs217727, rs2067051, rs2251375, rs492994, rs2839698 and rs10732516 in ischemic stroke patients. We found that the expression of lncRNA H19 was upregulated by cerebral I/R in rats, as well as by OGD/R in vitro in the cells. Inhibition of lncRNA H19 and autophagy protected cells from OGD/R-induced death, respectively. Autophagy activation induced by OGD/R was prevented by H19 siRNA. Autophagy inducer, rapamycin, abolished lncRNA H19 effect. Furthermore, we found that lncRNA H19 inhibited autophagy through DUSP5-ERK1/2 axis. The result from blood samples of ischemic patients revealed that the variation of H19 gene increased the risk of ischemic stroke. Taken together, the results of present study suggest that LncRNA H19 could be a new therapeutic target of ischemic stroke. PMID:28203482
Optimal Rate Control in H.264 Video Coding Based on Video Quality Metric
R. Karthikeyan
2014-05-01
Full Text Available The aim of this research is to find a method for providing better visual quality across the complete video sequence in H.264 video coding standard. H.264 video coding standard with its significantly improved coding efficiency finds important applications in various digital video streaming, storage and broadcast. To achieve comparable quality across the complete video sequence with the constrains on bandwidth availability and buffer fullness, it is important to allocate more bits to frames with high complexity or a scene change and fewer bits to other less complex frames. A frame layer bit allocation scheme is proposed based on the perceptual quality metric as indicator of the frame complexity. The proposed model computes the Quality Index ratio (QIr of the predicted quality index of the current frame to the average quality index of all the previous frames in the group of pictures which is used for bit allocation to the current frame along with bits computed based on buffer availability. The standard deviation of the perceptual quality indicator MOS computed for the proposed model is significantly less which means the quality of the video sequence is identical throughout the full video sequence. Thus the experiment results shows that the proposed model effectively handles the scene changes and scenes with high motion for better visual quality.
Efficient MPEG-2 to H.264/AVC Transcoding of Intra-Coded Video
Yeping Su
2007-01-01
Full Text Available This paper presents an efficient transform-domain architecture and corresponding mode decision algorithms for transcoding intra-coded video from MPEG-2 to H.264/AVC. Low complexity is achieved in several ways. First, our architecture employs direct conversion of the transform coefficients, which eliminates the need for the inverse discrete cosine transform (DCT and forward H.264/AVC transform. Then, within this transform-domain architecture, we perform macroblock-based mode decisions based on H.264/AVC transform coefficients, which is possible using a novel method of calculating distortion in the transform domain. The proposed method for distortion calculation could be used to make rate-distortion optimized mode decisions with lower complexity. Compared to the pixel-domain architecture with rate-distortion optimized mode decision, simulation results show that there is a negligible loss in quality incurred by the direct conversion of transform coefficients and the proposed transform-domain mode decision algorithms, while complexity is significantly reduced. To further reduce the complexity, we also propose two fast mode decision algorithms. The first algorithm ranks modes based on a simple cost function in the transform domain, then computes the rate-distortion optimal mode from a reduced set of ranked modes. The second algorithm exploits temporal correlations in the mode decision between temporally adjacent frames. Simulation results show that these algorithms provide additional computational savings over the proposed transform-domain architecture while maintaining virtually the same coding efficiency.
Efficient MPEG-2 to H.264/AVC Transcoding of Intra-Coded Video
Vetro Anthony
2007-01-01
Full Text Available This paper presents an efficient transform-domain architecture and corresponding mode decision algorithms for transcoding intra-coded video from MPEG-2 to H.264/AVC. Low complexity is achieved in several ways. First, our architecture employs direct conversion of the transform coefficients, which eliminates the need for the inverse discrete cosine transform (DCT and forward H.264/AVC transform. Then, within this transform-domain architecture, we perform macroblock-based mode decisions based on H.264/AVC transform coefficients, which is possible using a novel method of calculating distortion in the transform domain. The proposed method for distortion calculation could be used to make rate-distortion optimized mode decisions with lower complexity. Compared to the pixel-domain architecture with rate-distortion optimized mode decision, simulation results show that there is a negligible loss in quality incurred by the direct conversion of transform coefficients and the proposed transform-domain mode decision algorithms, while complexity is significantly reduced. To further reduce the complexity, we also propose two fast mode decision algorithms. The first algorithm ranks modes based on a simple cost function in the transform domain, then computes the rate-distortion optimal mode from a reduced set of ranked modes. The second algorithm exploits temporal correlations in the mode decision between temporally adjacent frames. Simulation results show that these algorithms provide additional computational savings over the proposed transform-domain architecture while maintaining virtually the same coding efficiency.
Preliminary Development of Thermal Power Calculation Code H-Power for a Supercritical Water Reactor
Fan Zhang
2014-01-01
Full Text Available SCWR (Supercritical Water Reactor is one of the promising Generation IV nuclear systems, which has higher thermal power efficiency than current pressurized water reactor. It is necessary to perform the thermal equilibrium and thermal power calculation for the conceptual design and further monitoring and calibration of the SCWR. One visual software named H-Power was developed to calculate thermal power and its uncertainty of SCWR, in which the advanced IAPWS-IF97 industrial formulation was used to calculate the thermodynamic properties of water and steam. The ISO-5167-4: 2003 standard was incorporated in the code as the basis of orifice plate to compute the flow rate. New heat balance model and uncertainty estimate have also been included in the code. In order to validate H-Power, an assessment was carried out by using data published by US and Qinshan Phase II. The results showed that H-Power was able to estimate the thermal power of SCWR.
Edge-preserving Intra mode for efficient depth map coding based on H.264/AVC
Zamarin, Marco; Forchhammer, Søren
2014-01-01
Depth-image-based-rendering (DIBR) algorithms for 3D video communication systems based on the “multi-view video plus depth” format are very sensitive to the accuracy of depth information. Specifically, edge regions in the depth data should be preserved in the coding/decoding process to ensure good...... targeted to depth macroblocks with arbitrarily shaped edges, which are typically not predicted well by the standard Intra modes of H.264/AVC and result in high rate–distortion costs. The proposed algorithm segments edge macroblocks into two regions each approximated by a flat surface. A binary mask...... texture plus depth rate–distortion performance....
AN ERROR-RESILIENT H.263+ CODING SCHEME FOR VIDEO TRANSMISSION OVER WIRELESS NETWORKS
Li Jian; Bie Hongxia
2006-01-01
Video transmission over wireless networks has received much attention recently for its restricted bandwidth and high bit-error rate. Based on H.263+, by reversing part stream sequences of each Group Of Block (GOB), an error resilient scheme is presented to improve video robustness without additional bandwidth burden. Error patterns are employed to simulate Wideband Code Division Multiple Access(WCDMA) channels to check out error resilience performances. Simulation results show that both subjective and objective qualities of the reconstructed images are improved remarkably. The mean Peak Signal to Noise Ratio (PSNR)is increased by 0.5dB, and the highest increment is 2dB.
Streaming and congestion control using scalable video coding based on H.264/AVC
NGUYEN Dieu Thanh; OSTERMANN Joern
2006-01-01
This paper presents a streaming system using scalable video coding based on H.264/AVC. The system provides a congestion control algorithm supported by channel bandwidth estimation of the client. It uses retransmission only for packets of the base layer to disburden the congested network. The bandwidth estimation allows for adjusting the transmission rate quickly to the current available bandwidth of the network. Compared to binomial congestion control, the proposed system allows for shorter start-up times and data rate adaptation. The paper describes the components of this streaming system and the results of experiments showing that the proposed approach works effectively for streaming video.
On the dual code of points and generators on the Hermitian variety $\\mathcal{H}(2n+1,q^2)$
De Boeck, Maarten; Vandendriessche, Peter
2016-01-01
We study the dual linear code of points and generators on a non-singular Hermitian variety $\\mathcal{H}(2n+1,q^2)$. We improve the earlier results for $n=2$, we solve the minimum distance problem for general $n$, we classify the $n$ smallest types of code words and we characterize the small weight code words as being a linear combination of these $n$ types.
Performance Analysis of Video Frame Transmission on DVB-H 4K Mode System for different code rates
Mitul Prajapati
2012-03-01
Full Text Available DVB-H (Digital Video Broadcasting for Handheld terminals is a digital transmission standard developed by the international DVB-Project. It was standardized in 2004 and enables small battery powered handheld devices to receive IP data services such as low definition TV services. The DVB-H standard is derived from the DVB-T standard which is used to broadcast TV services in Europe. The convolution code is used as error correction code. In this paper, we have implemented physical layer of DVB-H for 4K mode system. Here we had transmitted a JPEG format of frame of movie through AWGN channel and observed the image quality for different code rates used for convolution coding. The code rates used are 1/2, 2/3, 3/4, 5/6 and 7/8.
A High-Throughput Binary Arithmetic Coding Architecture for H.264/AVC CABAC
Liu, Yizhong; Song, Tian; Shimamoto, Takashi
In this paper, we propose a high-throughput binary arithmetic coding architecture for CABAC (Context Adaptive Binary Arithmetic Coding) which is one of the entropy coding tools used in the H.264/AVC main and high profiles. The full CABAC encoding functions, including binarization, context model selection, arithmetic encoding and bits generation, are implemented in this proposal. The binarization and context model selection are implemented in a proposed binarizer, in which a FIFO is used to pack the binarization results and output 4 bins in one clock. The arithmetic encoding and bits generation are implemented in a four-stage pipeline with the encoding ability of 4 bins/clock. In order to improve the processing speed, the context variables access and update for 4 bins are paralleled and the pipeline path is balanced. Also, because of the outstanding bits issue, a bits packing and generation strategy for 4 bins paralleled processing is proposed. After implemented in verilog-HDL and synthesized with Synopsys Design Compiler using 90nm libraries, this proposal can work at the clock frequency of 250MHz and takes up about 58K standard cells, 3.2Kbits register files and 27.6K bits ROM. The throughput of processing 1000M bins per second can be achieved in this proposal for the HDTV applications.
An evaluation of the effect of JPEG, JPEG2000, and H.264/AVC on CQR codes decoding process
Vizcarra Melgar, Max E.; Farias, Mylène C. Q.; Zaghetto, Alexandre
2015-02-01
This paper presents a binarymatrix code based on QR Code (Quick Response Code), denoted as CQR Code (Colored Quick Response Code), and evaluates the effect of JPEG, JPEG2000 and H.264/AVC compression on the decoding process. The proposed CQR Code has three additional colors (red, green and blue), what enables twice as much storage capacity when compared to the traditional black and white QR Code. Using the Reed-Solomon error-correcting code, the CQR Code model has a theoretical correction capability of 38.41%. The goal of this paper is to evaluate the effect that degradations inserted by common image compression algorithms have on the decoding process. Results show that a successful decoding process can be achieved for compression rates up to 0.3877 bits/pixel, 0.1093 bits/pixel and 0.3808 bits/pixel for JPEG, JPEG2000 and H.264/AVC formats, respectively. The algorithm that presents the best performance is the H.264/AVC, followed by the JPEG2000, and JPEG.
50 CFR Table 1 to Subpart H of... - Pacific Salmon EFH Identified by USGS Hydrologic Unit Code (HUC)
2010-10-01
... 50 Wildlife and Fisheries 9 2010-10-01 2010-10-01 false Pacific Salmon EFH Identified by USGS Hydrologic Unit Code (HUC) 1 Table 1 to Subpart H of Part 660 Wildlife and Fisheries FISHERY CONSERVATION AND... 660—Pacific Salmon EFH Identified by USGS Hydrologic Unit Code (HUC) USGS HUC State(s) Hydrologic Unit...
Gat-Viks, Irit; Vingron, Martin
2009-02-01
In eukaryotic organisms, histones are dynamically exchanged independently of DNA replication. Recent reports show that different coding regions differ in their amount of replication-independent histone H3 exchange. The current paradigm is that this histone exchange variability among coding regions is a consequence of transcription rate. Here we put forward the idea that this variability might be also modulated in a gene-specific manner independently of transcription rate. To that end, we study transcription rate-independent replication-independent coding region histone H3 exchange. We term such events relative exchange. Our genome-wide analysis shows conclusively that in yeast, relative exchange is a novel consistent feature of coding regions. Outside of replication, each coding region has a characteristic pattern of histone H3 exchange that is either higher or lower than what was expected by its RNAPII transcription rate alone. Histone H3 exchange in coding regions might be a way to add or remove certain histone modifications that are important for transcription elongation. Therefore, our results that gene-specific coding region histone H3 exchange is decoupled from transcription rate might hint at a new epigenetic mechanism of transcription regulation.
Traffic and Quality Characterization of the H.264/AVC Scalable Video Coding Extension
Geert Van der Auwera
2008-01-01
Full Text Available The recent scalable video coding (SVC extension to the H.264/AVC video coding standard has unprecedented compression efficiency while supporting a wide range of scalability modes, including temporal, spatial, and quality (SNR scalability, as well as combined spatiotemporal SNR scalability. The traffic characteristics, especially the bit rate variabilities, of the individual layer streams critically affect their network transport. We study the SVC traffic statistics, including the bit rate distortion and bit rate variability distortion, with long CIF resolution video sequences and compare them with the corresponding MPEG-4 Part 2 traffic statistics. We consider (i temporal scalability with three temporal layers, (ii spatial scalability with a QCIF base layer and a CIF enhancement layer, as well as (iii quality scalability modes FGS and MGS. We find that the significant improvement in RD efficiency of SVC is accompanied by substantially higher traffic variabilities as compared to the equivalent MPEG-4 Part 2 streams. We find that separately analyzing the traffic of temporal-scalability only encodings gives reasonable estimates of the traffic statistics of the temporal layers embedded in combined spatiotemporal encodings and in the base layer of combined FGS-temporal encodings. Overall, we find that SVC achieves significantly higher compression ratios than MPEG-4 Part 2, but produces unprecedented levels of traffic variability, thus presenting new challenges for the network transport of scalable video.
SPEX (Plasma Code Spectral Fitting Tool). Collisional ionization for atoms and ions of H to Zn.
Urdampilleta, I.; Kaastra, J. S.
2017-03-01
Every observation of astrophysical objects involving a spectrum requires atomic data for the interpretation of line fluxes, ratios and ionization state of the emitting plasma. One of processes which determines it is collisional ionization. In this study an update of the direct ionization (DI) and excitation-autoionization (EA) processes is discussed for the H to Zn-like isoelectronic sequences. The previous assessments were performed by Dere (2007, A&A 466, 771) for H to Zn isoelectronc sequences, Arnaud & Raymond (1992, ApJ. 398, 394) for Fe and Arnaud & Rothenflug (1985, A&AS, 60, 425). However, in the last years new laboratory measurements and theoretical calculations of ionization cross sections have become accessible. We provide a review, extension and update of this previous work and fit the cross sections of all individuals shells of all ions from H to Zn. These data are described using an extension of Younger's formula, suitable for integration over a Maxwellian velocity distribution to derive the subshell ionization rate coefficients. These ionization rate coefficients are included together with the radiative recombination rates data (Mao et al. 2016, A&AS, 27568) and a change-exchange model (Gu et al. 2016, A&A 588, A52, 11) into the high-resolution plasma code and spectral fit tool SPEX V3.0 (Kaastra et al. 1996, UV and X-ray Spectroscopy of Astrophysical and Laboratory Plasmas).
Context adaptive binary arithmetic coding-based data hiding in partially encrypted H.264/AVC videos
Xu, Dawen; Wang, Rangding
2015-05-01
A scheme of data hiding directly in a partially encrypted version of H.264/AVC videos is proposed which includes three parts, i.e., selective encryption, data embedding and data extraction. Selective encryption is performed on context adaptive binary arithmetic coding (CABAC) bin-strings via stream ciphers. By careful selection of CABAC entropy coder syntax elements for selective encryption, the encrypted bitstream is format-compliant and has exactly the same bit rate. Then a data-hider embeds the additional data into partially encrypted H.264/AVC videos using a CABAC bin-string substitution technique without accessing the plaintext of the video content. Since bin-string substitution is carried out on those residual coefficients with approximately the same magnitude, the quality of the decrypted video is satisfactory. Video file size is strictly preserved even after data embedding. In order to adapt to different application scenarios, data extraction can be done either in the encrypted domain or in the decrypted domain. Experimental results have demonstrated the feasibility and efficiency of the proposed scheme.
Video coding standards AVS China, H.264/MPEG-4 PART 10, HEVC, VP6, DIRAC and VC-1
Rao, K R; Hwang, Jae Jeong
2014-01-01
Review by Ashraf A. Kassim, Professor, Department of Electrical & Computer Engineering, and Associate Dean, School of Engineering, National University of Singapore. The book consists of eight chapters of which the first two provide an overview of various video & image coding standards, and video formats. The next four chapters present in detail the Audio & video standard (AVS) of China, the H.264/MPEG-4 Advanced video coding (AVC) standard, High efficiency video coding (HEVC) standard and the VP6 video coding standard (now VP10) respectively. The performance of the wavelet based Dirac video codec is compared with H.264/MPEG-4 AVC in chapter 7. Finally in chapter 8, the VC-1 video coding standard is presented together with VC-2 which is based on the intra frame coding of Dirac and an outline of a H.264/AVC to VC-1 transcoder. The authors also present and discuss relevant research literature such as those which document improved methods & techniques, and also point to other related reso...
Gusti Ayu Yuniati Kencana
2009-03-01
Full Text Available The sequence of the Non-Coding Region (NCR and Coding Region (CR of 5’-terminal cRNA of thepolymerase basic 1 (PB1 gene as a major factor for the species adaptation of avian influenza virussubtype H5N1 (AIV H5N1 has been analysed. The information could be a virological signal for theemergence of a new strain with pandemic potential. Total RNA from twenty six (26 avian influenzasubtype H5N1 isolates were amplified using reverse-transcriptase-polymerase chain reaction (RT-PCRwith a universal forward primer for influenza virus and specifically designed backward primers. Fifteen(15 PB1 gene fragments could be amplified. RT-PCR products were sequenced and analyzed using Mega4software. The length of NCR of PB1 gene was found to be 24 bases and mostly shows conserved sequence,with an exception of Dk/Badung/2006 isolate which has C-7T substitution. A/T composition of PB1 NCRwas 54,2%, while the Dk/Badung/2006 isolate was 58,3%. Species and geographical specificity could not befound in the genetic distance, the amino acid polymorphism, as well as the phylogenetic analysis of t
The Italian experience on T/H best estimate codes: Achievements and perspectives
Alemberti, A.; D`Auria, F.; Fiorino, E. [and others
1997-07-01
Themalhydraulic system codes are complex tools developed to simulate the power plants behavior during off-normal conditions. Among the objectives of the code calculations the evaluation of safety margins, the operator training, the optimization of the plant design and of the emergency operating procedures, are mostly considered in the field of the nuclear safety. The first generation of codes was developed in the United States at the end of `60s. Since that time, different research groups all over the world started the development of their own codes. At the beginning of the `80s, the second generation codes were proposed; these differ from the first generation codes owing to the number of balance equations solved (six instead of three), the sophistication of the constitutive models and of the adopted numerics. The capabilities of available computers have been fully exploited during the years. The authors then summarize some of the major steps in the process of developing, modifying, and advancing the capabilities of the codes. They touch on the fact that Italian, and for that matter non-American, researchers have not been intimately involved in much of this work. They then describe the application of these codes in Italy, even though there are no operating or under construction nuclear power plants at this time. Much of this effort is directed at the general question of plant safety in the face of transient type events.
On the roads to H1N1 pandemic era：drive safe and fearless using colour-coded masks
M Shahid
2012-01-01
ABSTRACT Notwithstanding the end of2009 H1N1 pandemic, the threat for its revisit still persists andWHO has warned to remain vigilant. During that time the situation was more panicky than fatal. In this article, a suggestion to minimize the panic is provided by the usage of colour-coded masks and is proposed hereby as a“population segregation”approach in case of the revisit ofH1N1 or similar threatening respiratory viral infections.
Wu, Mo; Forchhammer, Søren
2007-01-01
This paper considers a method for evaluation of Rate-Distortion-Complexity (R-D-C) performance of video coding. A statistical model of the transformed coefficients is used to estimate the Rate-Distortion (R-D) performance. A model frame work for rate, distortion and slope of the R-D curve for int...... and intra frame is presented. Assumptions are given for analyzing an R-D model for fast R-D-C evaluation. The theoretical expressions are combined with H.264 video coding, and confirmed by experimental results. The complexity frame work is applied to the integer motion estimation....
LEE Tien-hsu; WANG Jong-tzy; CHEN Jhih-bin; CHANG Pao-chi
2006-01-01
Although H.264 video coding standard provides several error resilience tools, the damage caused by error propagation may still be tremendous. This work is aimed at developing a robust and standard-compliant error resilient coding scheme for H.264and uses techniques of mode decision, data hiding, and error concealment to reduce the damage from error propagation. This paper proposes a system with two error resilience techniques that can improve the robustness of H.264 in noisy channels. The first technique is Nearest Neighbor motion compensated Error Concealment (NNEC) that chooses the nearest neighbors in the reference frames for error concealment. The second technique is Distortion Estimated Mode Decision (DEMD) that selects an optimal mode based on stochastically distorted frames. Observed simulation results showed that the rate-distortion performances of the proposed algorithms are better than those of the compared algorithms.
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.
Schoenfelder, Stefan; Smits, Guillaume; Fraser, Peter; Reik, Wolf; Paro, Renato
2007-11-01
The imprinting control region (ICR) upstream of H19 is the key regulatory element conferring monoallelic expression on H19 and Igf2 (insulin-like growth factor 2). Epigenetic marks in the ICR regulate its interaction with the chromatin protein CCCTC-binding factor and with other control factors to coordinate gene silencing in the imprinting cluster. Here, we show that the H19 ICR is biallelically transcribed, producing both sense and antisense RNAs. We analyse the function of the non-coding transcripts in a Drosophila transgenic system in which the H19 upstream region silences the expression of a reporter gene. We show that knockdown of H19 ICR non-coding RNA (ncRNA) by RNA interference leads to the loss of reporter gene silencing. Our results are, to the best of our knowledge, the first to show that ncRNAs in the H19 ICR are functionally significant, and also indicate that they have a role in regulating gene expression and perhaps epigenetic marks at the H19/Igf2 locus.
Altered global histone-trimethylation code and H3F3A-ATRX mutation in pediatric GBM.
Pathak, Pankaj; Jha, Prerana; Purkait, Suvendu; Sharma, Vikas; Suri, Vaishali; Sharma, Mehar C; Faruq, Mohammed; Suri, Ashish; Sarkar, Chitra
2015-02-01
Mutations in H3.3-ATRX-DAXX chromatin remodeling pathway have been reported in pediatric GBMs. H3.3 (H3F3A) mutations may affect transcriptional regulation by altered global histone-methylation. Therefore, we analyzed yet partly understood global histone code (H3K-4/9/27/36) trimethylation pattern in H3F3A-ATRX mutants and wild-type. H3F3A, HIST1H3B, IDH1, ATRX, DAXX and Tp53 mutations were identified by sequencing/immunohistochemistry in 27 pediatric GBMs. Global histone-methylation H3K-4/9/27/36me3 and Polycomb-protein EZH2 expression were evaluated by immunohistochemistry. H3F3A-ATRX mutation was observed in 66.7 % (18/27) of pediatric GBMs. K27M and G34R-H3F3A mutations were found in 37 % (10/27) and 14.8 % (4/27) patients respectively. G34V-H3F3A, HIST1H3B and IDH1 mutations were absent. Notably, commonest global histone-methylation mark lost was H3K27me3 (17/25, 68 %) followed by H3K4me3 (45.5 %, 10/22) and H3K9me3 (18.2 %, 4/22). Global H3K36me3 showed no loss. Most significant observation was loss of one or more histone-trimethylation mark in 80 % (20/25) pediatric GBMs. Notably, simultaneous loss of H3K27me3 and H3K4me3 were present in 7/22 (31.8 %) of pediatric GBMs. Low expression of EZH2 was found in 12/24 (50 %) of cases. However no significant correlation of loss of histone-marks or EZH2 expression with H3F3A-ATRX mutants (loss of at least one histone-marks in 87.5 % (14/16) cases) versus wild-types (loss of at least one histone-marks in 75 % (6/8) cases) was seen. The present study highlights for the first time combinatorial loss of one or more histone-trimethylation marks associated with majority of pediatric GBMs and the finding suggests significant role of histone-code in the molecular biology that underlies pediatric GBMs. Hence therapies for patients with particular combinations of histone modifications present opportunity to design innovative patient-tailored treatment protocols.
Function and coding in the blowfly H1 neuron during naturalistic optic flow
Hateren, J.H. van; Kern, R.; Schwerdtfeger, G.; Egelhaaf, M.
2005-01-01
Naturalistic stimuli, reconstructed from measured eye movements of flying blowflies, were replayed on a panoramic stimulus device. The directional movement-sensitive H1 neuron was recorded from blowflies watching these stimuli. The response of the H1 neuron is dominated by the response to fast
Validation of Printed Circuit Heat Exchanger Design Code KAIST{sub H}XD
Baik, Seungjoon; Kim, Seong Gu; Lee, Jekyoung; Lee, Jeong Ik [KAIST, Daejeon (Korea, Republic of)
2015-05-15
Supercritical carbon dioxide (S-CO{sub 2}) Brayton cycle has been suggested for the SFR due to the relatively mild sodium-CO{sub 2} interaction. The S-CO{sub 2} power conversion cycle can achieve not only high safety but also high efficiency with SFR core thermal condition. However, due to the dramatic property change near the critical point, the inlet pressure and temperature conditions of compressor can have significant effect on the overall cycle efficiency. To maintain the inlet condition of compressor, a sensitive precooler control system is required for stable operation. Therefore understanding the precooler performance is essential for the S-CO{sub 2} power conversion system. According to experimental result, designed PCHE showed high effectiveness in various operating regions. Comparing the experimental and the design data, heat transfer performance estimation showed less than 6% error. On the other hand, the pressure drop estimation showed large gap. The water side pressure drop showed 50-70% under estimation. Because the form losses were not included in the design code, water side pressure drop estimation result seems reliable. However, the CO{sub 2} side showed more than 70% over estimation in the pressure drop from the code. The authors suspect that the differences may have occurred by the channel corner shape. The real channel has round corners and smooth edge, but the correlation is based on the sharp edged zig-zag channel. Further studies are required to understand and interpret the results correctly in the future.
Gusti Ayu Yuniati Kencana
2010-09-01
Full Text Available The knowledge on the species adaptation factor of avian influenza virus of H5N1 subtype (AIV H5N1is very important as a signal for the emergence of a new strain with pandemic potential. This research wasconducted to find out the sequence variation of the Non-Coding Region (NCR and Coding Region (CR of 5’-terminal cRNA of the polymerase acidic (PA. Total RNA from twenty six (26 avian influenza virussubtype H5N1 isolates were amplified using reverse-transcriptase-polymerase chain reaction (RT-PCRwith a universal forward primer for influenza virus and specifically designed backward primers. Nineteen(19 gene fragments of PA could be amplified. RT-PCR products were sequenced and analyzed using Mega4 software. The length of NCR of PA gene was found to be 24 bases and conserved. A/T composition of PANCR was 58.3%. Species and geographical specificity could not be found in the genetic distance, the aminoacid polymorphism, as well as the phylogenetic analysis of the CR. RNA sequencing is discussed andrecomended to be studied further.
Information Entropy Analysis of the H1N1 Genetic Code
Martwick, Andy
2010-03-01
During the current H1N1 pandemic, viral samples are being obtained from large numbers of infected people world-wide and are being sequenced on the NCBI Influenza Virus Resource Database. The information entropy of the sequences was computed from the probability of occurrence of each nucleotide base at every position of each set of sequences using Shannon's definition of information entropy, [ H=∑bpb,2( 1pb ) ] where H is the observed information entropy at each nucleotide position and pb is the probability of the base pair of the nucleotides A, C, G, U. Information entropy of the current H1N1 pandemic is compared to reference human and swine H1N1 entropy. As expected, the current H1N1 entropy is in a low entropy state and has a very large mutation potential. Using the entropy method in mature genes we can identify low entropy regions of nucleotides that generally correlate to critical protein function.
A modified prediction scheme of the H.264 multiview video coding to improve the decoder performance
Hamadan, Ayman M.; Aly, Hussein A.; Fouad, Mohamed M.; Dansereau, Richard M.
2013-02-01
In this paper, we present a modified inter-view prediction scheme for the multiview video coding (MVC).With more inter-view prediction, the number of reference frames required to decode a single view increase. Consequently, the data size of decoding a single view increases, thus impacting the decoder performance. In this paper, we propose an MVC scheme that requires less inter-view prediction than that of the MVC standard scheme. The proposed scheme is implemented and tested on real multiview video sequences. Improvements are shown using the proposed scheme in terms of average data size required either to decode a single view, or to access any frame (i.e., random access), with comparable rate-distortion. It is compared to the MVC standard scheme and another improved techniques from the literature.
Efficient bitstream switching for streaming of H.264/AVC coded video
Khan Ekram
2011-01-01
Full Text Available Abstract In this article, a novel scheme is proposed for switching among multiple bitrate video streams over Internet, to achieve best quality of service (QoS. The research is focused on selecting the best switching points inside the pre-coded variable bit rate video streams, to facilitate bandwidth scalability among the non-scalable multiple bitstreams. With a stepwise monotonically decreasing (downstairs bandwidth reservation scheme, it is shown that if switching occurs at the transition points in the "downstairs", then the best QoS can be achieved. However, insertion of switching pictures at these transition points may change the characteristics of the "downstairs" function and hence the bandwidth requirement. Here, we propose a scheme for proper management of the allocated resources to facilitate the stream switching in the "downstairs" through SP-frames. The performance is measured in terms of the wastage of bits in the receiver buffer and bandwidth utilization at the switching instances.
Free viewpoint video generation based on coding information of H.264/AVC
Lin, Chi-Kun; Hung, Yu-Chen; Tang, Chia-Tong; Hwang, Jenq-Neng; Yang, Jar-Ferr
2010-07-01
Free viewpoint television (FTV) is a new technology that allows viewers to change view angles freely while watching TV programs. FTV requires a strong support of multi-view video codec (MVC), such as H.264/MVC defined by Joint Video Team(JVT). In this paper, we propose an FTV system which can produce videos as perceived in any view angles based on limited number of viewpoint videos decoded from H.264/MVC bitstreams. In this system, the decoded disparity vectors and motion vectors are diffused to produce smooth disparity fields for virtual view reconstruction. Decoded residue data under motion compensation are used as a match criterion. The proposed system not only greatly reduces the computation burden in creating FTV, but also improve the synthesized viewing quality due to the use of quarter pixel precision of H.264.
Heat removal (wetting, heat transfer, T/H, secondary circuit, code validation etc.)
Dury, T.; Siman-Tov, M.
1996-06-01
This working group provided a comprehensive list of feasibility and uncertainty issues. Most of the issues seem to fall into the `needed but can be worked out` category. They feel these can be worked out as the project develops. A few issues can be considered critical or feasibility issues (that must be proven to be feasible). Those include: (1) Thermal shock and its mitigation (>1 MW); how to inject the He bubbles (if used) - back pressure into He lines - mercury traces in He lines; how to maintain proper bubble distribution and size (static and dynamic; if used); vibrations and fatigue (dynamic); possibility of cavitation from thermal shock. (2) Wetting and/or non-wetting of mercury on containment walls with or without gases and its effect on heat transfer (and materials). (3) Prediction capabilities in the CFD code; bubbles behavior in mercury (if used) - cross stream turbulence (ESS only) - wetting/non-wetting effects. (4) Cooling of beam `windows`; concentration of local heat deposition at center, especially if beam is of parabolic profile.
Nightingale, James; Wang, Qi; Grecos, Christos
2011-03-01
Users of the next generation wireless paradigm known as multihomed mobile networks expect satisfactory quality of service (QoS) when accessing streamed multimedia content. The recent H.264 Scalable Video Coding (SVC) extension to the Advanced Video Coding standard (AVC), offers the facility to adapt real-time video streams in response to the dynamic conditions of multiple network paths encountered in multihomed wireless mobile networks. Nevertheless, preexisting streaming algorithms were mainly proposed for AVC delivery over multipath wired networks and were evaluated by software simulation. This paper introduces a practical, hardware-based testbed upon which we implement and evaluate real-time H.264 SVC streaming algorithms in a realistic multihomed wireless mobile networks environment. We propose an optimised streaming algorithm with multi-fold technical contributions. Firstly, we extended the AVC packet prioritisation schemes to reflect the three-dimensional granularity of SVC. Secondly, we designed a mechanism for evaluating the effects of different streamer 'read ahead window' sizes on real-time performance. Thirdly, we took account of the previously unconsidered path switching and mobile networks tunnelling overheads encountered in real-world deployments. Finally, we implemented a path condition monitoring and reporting scheme to facilitate the intelligent path switching. The proposed system has been experimentally shown to offer a significant improvement in PSNR of the received stream compared with representative existing algorithms.
CABAC在H.264/AVC中的应用%Application of Context-bsaed Adaptive Binary Arithmetic Coding in H.264/AVC
闵玲; 李方; 何小海
2006-01-01
H.264/AVC是由国际电信联盟和国际标准化组织共同制定的新一代视频编码标准.在该标准中,规定了两种熵编码的模式,即基于上下文的自适应二进制算术编码(Context-bsaed Adaptive Binary Arithmetic Coding,CABAC)和基于上下文自适应可变长编码(Context-bsaed Adaptive Variable-Length Coding,CAVLC).其中,CABAC作为一种新型的熵编码方法,将自适应技术、上下文模型化和二进制算术编码有地的结合在一起,达到了较高的压缩效率,CABAC的框架中还使用了一些新颖的方法,使得CABAC在软硬件的实现上更加方便.为了验证CABAC的实际效果,笔者应用参考程序对其进行了直观的测试,实验结果表明:在相同图像质量下,CABAC和CAVLC相比的确能节省较大的平均比特率.
García-Jerez, Antonio; Piña-Flores, José; Sánchez-Sesma, Francisco J.; Luzón, Francisco; Perton, Mathieu
2016-12-01
During a quarter of a century, the main characteristics of the horizontal-to-vertical spectral ratio of ambient noise HVSRN have been extensively used for site effect assessment. In spite of the uncertainties about the optimum theoretical model to describe these observations, over the last decade several schemes for inversion of the full HVSRN curve for near surface surveying have been developed. In this work, a computer code for forward calculation of H/V spectra based on the diffuse field assumption (DFA) is presented and tested. It takes advantage of the recently stated connection between the HVSRN and the elastodynamic Green's function which arises from the ambient noise interferometry theory. The algorithm allows for (1) a natural calculation of the Green's functions imaginary parts by using suitable contour integrals in the complex wavenumber plane, and (2) separate calculation of the contributions of Rayleigh, Love, P-SV and SH waves as well. The stability of the algorithm at high frequencies is preserved by means of an adaptation of the Wang's orthonormalization method to the calculation of dispersion curves, surface-waves medium responses and contributions of body waves. This code has been combined with a variety of inversion methods to make up a powerful tool for passive seismic surveying.
Ki, Dae Wook; Kim, Jae Ho
2013-07-01
We propose a fast new multiple run_before decoding method in context-adaptive variable length coding (CAVLC). The transform coefficients are coded using CAVLC, in which the run_before symbols are generated for a 4×4 block input. To speed up the CAVLC decoding, the run_before symbols need to be decoded in parallel. We implemented a new CAVLC table for simultaneous decoding of up to three run_befores. The simulation results show a Total Speed-up Factor of 205%˜144% over various resolutions and quantization steps.
Error-resilient low-delay H.264/802.11 transmission via cross-layer coding with feedback channel
Chiew, Tuan-Kiang; Hill, Paul; Ferre, Pierre; Agrafiotis, Dimitris; Chung-How, James T. H.; Nix, Andy; Bull, David R.
2005-07-01
We propose a method of providing error resilient H.264 video over 802.11 wireless channels by using a feedback mechanism which does not incur an additional delay typically found in ARQ-type feedback. Our system uses the TCP/IP and UDP/IP protocols, located between the medium access control (MAC) layer of 802.11, and the H.264 video application layer. The UDP protocol is used to transfer time sensitive video data without delay; however, packet losses introduce excessive artifacts which propagate to subsequent frames. Error resilience is achieved by a feedback mechanism-the decoder conveys the packet-loss information as small TCP packets to the video source as negative acknowledgements. By using multiple reference frames, slice-based coding and timely intra-refresh, the encoder makes use of this feedback information to perform subsequent temporal prediction without propagating the error to future frames. We take static measurements of the actual channel and use the packet loss and delay patterns to test our algorithms. Simulations show an improvement of 0.5~5 dB in PSNR over plain UDP-based video transmission. Our method improves the overall quality of service of interactive video transmission over wireless LAN; it can be used as a model for future media-aware wireless network protocol designs.
Schmal, H; Mehlhorn, A T; Zwingmann, J
2005-01-01
Human epidermal growth factor (hEGF) and basic fibroblast growth factor (bFGF) influence critical characteristics of chondrocytes. The effects on metabolism and differentiation were evaluated following transfection using specific plasmids coding for both cytokines. Chondrocytes were isolated from...... of recombinant hEGF and bFGF resulted in a significant increase in cell proliferation and glucosaminoglycan production. Chondrocytes were transfected with vectors coding for either hEGF or bFGF and the production of these proteins was measured in supernatants by ELISA. Expression kinetics showed different...... patterns: hEGF was detectable 2.5 days following transfection and peaked at day 5.5, whereas bFGF-production reached its maximum 1.5 days after transfection, declining thereafter. Chondrocytes endogenously produced significant amounts of bFGF within 5 days following isolation. Proliferation of h...
García-Jerez, Antonio; Sánchez-Sesma, Francisco J; Luzón, Francisco; Perton, Mathieu
2016-01-01
During a quarter of a century, the main characteristics of the horizontal-to-vertical spectral ratio of ambient noise HVSRN have been extensively used for site effect assessment. In spite of the uncertainties about the optimum theoretical model to describe these observations, several schemes for inversion of the full HVSRN curve for near surface surveying have been developed over the last decade. In this work, a computer code for forward calculation of H/V spectra based on the diffuse field assumption (DFA) is presented and tested.It takes advantage of the recently stated connection between the HVSRN and the elastodynamic Green's function which arises from the ambient noise interferometry theory. The algorithm allows for (1) a natural calculation of the Green's functions imaginary parts by using suitable contour integrals in the complex wavenumber plane, and (2) separate calculation of the contributions of Rayleigh, Love, P-SV and SH waves as well. The stability of the algorithm at high frequencies is preserv...
Bonnaud, G.; Dussy, S.; Lefebvre, E. [CEA Bruyeres-le-Chatel, 91 (France). Dept. de Physique Theorique et Appliquee; Bouchut, F. [Orleans Univ., 45 (France). Dept. de Mathematiques, UMR CNRS
1998-12-31
This report presents a numerical model to simulate the electromagnetic processes involved by electrically-charged relativistic fluids. The physical model is first given. Second, the numerical methods are explained with the various packages of the code RHEA, with indication methods are explained with the various packages of the code RHEA, with indication of its performances, within a 1.5.- dimensional framework. Results from test-simulations are shown to validate the use of the code, for both academic situations and realistic context of laser-plasma interaction, for which the code has been designed: the non-linear phenomena in the context of inertial confinement fusion and the ultra-intense laser pulses. (author) 25 refs.
Bonnaud, G.; Dussy, S.; Lefebvre, E. [CEA Bruyeres-le-Chatel, 91 (France). Dept. de Physique Theorique et Appliquee; Bouchut, F. [Orleans Univ., 45 (France). Dept. de Mathematiques, UMR CNRS
1998-12-31
This report presents a numerical model to simulate the electromagnetic processes involved by electrically-charged relativistic fluids. The physical model is first given. Second, the numerical methods are explained with the various packages of the code RHEA, with indication methods are explained with the various packages of the code RHEA, with indication of its performances, within a 1.5.- dimensional framework. Results from test-simulations are shown to validate the use of the code, for both academic situations and realistic context of laser-plasma interaction, for which the code has been designed: the non-linear phenomena in the context of inertial confinement fusion and the ultra-intense laser pulses. (author) 25 refs.
Rodríguez-Sánchez, Rafael; Martínez, José Luis; Cock, Jan De; Fernández-Escribano, Gerardo; Pieters, Bart; Sánchez, José L.; Claver, José M.; de Walle, Rik Van
2013-12-01
The H.264/AVC video coding standard introduces some improved tools in order to increase compression efficiency. Moreover, the multi-view extension of H.264/AVC, called H.264/MVC, adopts many of them. Among the new features, variable block-size motion estimation is one which contributes to high coding efficiency. Furthermore, it defines a different prediction structure that includes hierarchical bidirectional pictures, outperforming traditional Group of Pictures patterns in both scenarios: single-view and multi-view. However, these video coding techniques have high computational complexity. Several techniques have been proposed in the literature over the last few years which are aimed at accelerating the inter prediction process, but there are no works focusing on bidirectional prediction or hierarchical prediction. In this article, with the emergence of many-core processors or accelerators, a step forward is taken towards an implementation of an H.264/AVC and H.264/MVC inter prediction algorithm on a graphics processing unit. The results show a negligible rate distortion drop with a time reduction of up to 98% for the complete H.264/AVC encoder.
Arzimanoglou, I.I.; Hansen, L.L.; Chong, D.
2002-01-01
the mismatch DNA repair genes in ovarian cancer (OC), using a sensitive, accurate and reliable protocol we have developed. MATERIALS AND METHODS: A combination of high-resolution GeneScan software analysis and automated DNA cycle sequencing was used. RESULTS: Negligible coding MSI was observed in selected...
Congdon, Lauren M; Sims, Jennifer K; Tuzon, Creighton T; Rice, Judd C
2014-04-01
PR-Set7/Set8/KMT5a is the sole histone H4 lysine 20 monomethyltransferase (H4K20me1) in metazoans and is essential for proper cell division and genomic stability. We unexpectedly discovered that normal cellular levels of monomethylated histone H3 lysine 9 (H3K9me1) were also dependent on PR-Set7, but independent of its catalytic activity. This observation suggested that PR-Set7 interacts with an H3K9 monomethyltransferase to establish the previously reported H4K20me1-H3K9me1 trans-tail 'histone code'. Here we show that PR-Set7 specifically and directly binds the C-terminus of the Riz1/PRDM2/KMT8 tumor suppressor and demonstrate that the N-terminal PR/SET domain of Riz1 preferentially monomethylates H3K9. The PR-Set7 binding domain was required for Riz1 nuclear localization and maintenance of the H4K20me1-H3K9me1 trans-tail 'histone code'. Although Riz1 can function as a repressor, Riz1/H3K9me1 was dispensable for the repression of genes regulated by PR-Set7/H4K20me1. Frameshift mutations resulting in a truncated Riz1 incapable of binding PR-Set7 occur frequently in various aggressive cancers. In these cancer cells, expression of wild-type Riz1 restored tumor suppression by decreasing proliferation and increasing apoptosis. These phenotypes were not observed in cells expressing either the Riz1 PR/SET domain or PR-Set7 binding domain indicating that Riz1 methyltransferase activity and PR-Set7 binding domain are both essential for Riz1 tumor suppressor function.
Vennin, Constance; Spruyt, Nathalie; Dahmani, Fatima; Julien, Sylvain; Bertucci, François; Finetti, Pascal; Chassat, Thierry; Bourette, Roland P; Le Bourhis, Xuefen; Adriaenssens, Eric
2015-10-06
H19 is a long non-coding RNA precursor of miR-675 microRNA. H19 is increasingly described to play key roles in the progression and metastasis of cancers from different tissue origins. We have previously shown that the H19 gene is activated by growth factors and increases breast cancer cell invasion. In this study, we established H19/miR-675 ectopic expression models of MDA-MB-231 breast cancer cells to further investigate the underlying mechanisms of H19 oncogenic action. We showed that overexpression of H19/miR-675 enhanced the aggressive phenotype of breast cancer cells including increased cell proliferation and migration in vitro, and increased tumor growth and metastasis in vivo. Moreover, we identified ubiquitin ligase E3 family (c-Cbl and Cbl-b) as direct targets of miR-675 in breast cancer cells. Using a luciferase assay, we demonstrated that H19, through its microRNA, decreased both c-Cbl and Cbl-b expression in all breast cancer cell lines tested. Thus, by directly binding c-Cbl and Cbl-b mRNA, miR-675 increased the stability and the activation of EGFR and c-Met, leading to sustained activation of Akt and Erk as well as enhanced cell proliferation and migration. Our data describe a novel mechanism of protumoral action of H19 in breast cancer.
Research on Video Coding Technology Based on H.264%基于H.264的视频编码技术研究
赵海国
2011-01-01
H.264标准是目前压缩比率最高的视频压缩标准,但其计算复杂度高,编码效率较低.本文研究了H.264的编码原理及关键技术,引入CPU和GPU并行的编码框架,能有效地提高H.264的编码速度.
The Realization of H.264 Video Coding based on CUDA%基于CUDA的H.264视频编码实现
赵海国
2011-01-01
H.264视频编码压缩比率高,但计算复杂度高,编码效率低.该文通过分析H.264编码器中各模块的编码性能,提出了基于CUDA编程模型的H.264视频编码并行框架实现方法,对H.264视频编码的各个关键模块进行CUDA实现,有效的提高了编码的速度.
Long non-coding RNA H19-mediated mouse cleft palate induced by 2,3,7,8-tetrachlorodibenzo-p-dioxin
GAO, LIYUN; Yin, Jun; Wu, Weidong
2016-01-01
Long non-coding RNAs (lncRNAs) are a novel class of transcripts, which are pervasively transcribed in the genome and a have greatly unknown biological function. Previous studies have identified that lncRNAs serve an important role in embryonic development. However, the function and mechanism of lncRNAs in the development of palate remains unclear. The aim of the present study was to investigate the role of lncRNA H19 in cleft palate (CP) development in mice. 2,3,7,8-Tetrachlorodibenzo-p-dioxi...
Ortuño-Pineda, Carlos; Galindo-Rosales, José Manuel; Calderón-Salinas, José Victor; Villegas-Sepúlveda, Nicolás; Saucedo-Cárdenas, Odila; De Nova-Ocampo, Mónica; Valdés, Jesús
2012-01-01
The splicing of the N exon in the pre-mRNA coding for the RE1-silencing transcription factor (REST) results in a truncated protein that modifies the expression pattern of some of its target genes. A weak 3'ss, three alternative 5'ss (N4-, N50-, and N62-5'ss) and a variety of putative target sites for splicing regulatory proteins are found around the N exon; two GGGG codes (G2-G3) and a poly-Uridine tract (N-PU) are found in front of the N50-5'ss. In this work we analyzed some of the regulatory factors and elements involved in the preferred selection of the N50-5'ss (N50 activation) in the small cell lung cancer cell line H69. Wild type and mutant N exon/β-globin minigenes recapitulated N50 exon splicing in H69 cells, and showed that the N-PU and the G2-G3 elements are required for N50 exon splicing. Biochemical and knockdown experiments identified these elements as U2AF65 and hnRNP H targets, respectively, and that they are also required for N50 exon activation. Compared to normal MRC5 cells, and in keeping with N50 exon activation, U2AF65, hnRNP H and other splicing factors were highly expressed in H69 cells. CLIP experiments revealed that hnRNP H RNA-binding occurs first and is a prerequisite for U2AF65 RNA binding, and EMSA and CLIP experiments suggest that U2AF65-RNA recognition displaces hnRNP H and helps to recruit other splicing factors (at least U1 70K) to the N50-5'ss. Our results evidenced novel hnRNP H and U2AF65 functions: respectively, U2AF65-recruiting to a 5'ss in humans and the hnRNP H-displacing function from two juxtaposed GGGG codes.
Carlos Ortuño-Pineda
Full Text Available The splicing of the N exon in the pre-mRNA coding for the RE1-silencing transcription factor (REST results in a truncated protein that modifies the expression pattern of some of its target genes. A weak 3'ss, three alternative 5'ss (N4-, N50-, and N62-5'ss and a variety of putative target sites for splicing regulatory proteins are found around the N exon; two GGGG codes (G2-G3 and a poly-Uridine tract (N-PU are found in front of the N50-5'ss. In this work we analyzed some of the regulatory factors and elements involved in the preferred selection of the N50-5'ss (N50 activation in the small cell lung cancer cell line H69. Wild type and mutant N exon/β-globin minigenes recapitulated N50 exon splicing in H69 cells, and showed that the N-PU and the G2-G3 elements are required for N50 exon splicing. Biochemical and knockdown experiments identified these elements as U2AF65 and hnRNP H targets, respectively, and that they are also required for N50 exon activation. Compared to normal MRC5 cells, and in keeping with N50 exon activation, U2AF65, hnRNP H and other splicing factors were highly expressed in H69 cells. CLIP experiments revealed that hnRNP H RNA-binding occurs first and is a prerequisite for U2AF65 RNA binding, and EMSA and CLIP experiments suggest that U2AF65-RNA recognition displaces hnRNP H and helps to recruit other splicing factors (at least U1 70K to the N50-5'ss. Our results evidenced novel hnRNP H and U2AF65 functions: respectively, U2AF65-recruiting to a 5'ss in humans and the hnRNP H-displacing function from two juxtaposed GGGG codes.
H.264中二进制算术编码的硬件实现%Hardware Realization of Binary Arithmetic Coding for H.264
陈传东; 陈新
2007-01-01
H.264标准中的二进制算术编码算法复杂,用软件实现起来速度慢,编码一个信号需要多个时钟周期.结合硬件实现特点,对算法流程进行合理优化,采用流水线设计方法,电路结构采用Verilog HDL进行RTL级描述,在Synplify平台上进行FPGA综合,介绍了H.264中二进制算术编码的FPGA实现方案.编码速度达到1 b/cycle,工作频率达到75.7 MHz,完全可以应用于视频图像的实时编码中.
Context-Based Adaptive Binary Arithmetic Coding in H.264/AVC%H.264/AVC中的CABAC编码技术
彭芬
2007-01-01
CABAC是新一代视频压缩算法标准H.264/AVC中采用的新熵编码技术,使用它可以有效提高编码效率,节约码流.这里介绍了CABAC编码中算术编码理论的原理和内容模型的基本类型,并以运动矢量差值MVD的编码方法为例详细分析了CABAC的编码过程.
esign of Binary Arithmetic Coding IP Core for H.264%H.264标准二进制算术编码IP核设计
陈传东; 何明华; 王仁平
2010-01-01
设计了一款基于H.264二进制算术编码算法IP核.针对该算法硬件实现特点,对其算法结构进行特别优化,并在Verilog HDL实现过程中,以JM86源代码为模型进行功能验证.在TSMC 0.18μm工艺下,达到频率200 MHz,面积0.027 m㎡,能够满足实际应用要求.
Kalvas, T.; Tarvainen, O.; Clark, H.; Brinkley, J.; ńrje, J.
2011-09-01
A three dimensional ion optical code IBSimu is being developed at the University of Jyväskylä. So far the plasma modelling of the code has been restricted to positive ion extraction systems, but now a negative ion plasma extraction model has been added. The plasma model has been successfully validated with simulations of the Spallation Neutron Source (SNS) ion source extraction both in cylindrical symmetry and in full 3D, also modelling electron beam dumping and ion beam tilt. A filament-driven multicusp ion source has been installed at the Texas A&M University Cyclotron Institute for production of H- and D- beams as a part of the facility upgrade. The light ion beams, produced by the ion source, are accelerated with the K150 cyclotron for production and reacceleration of rare isotopes. The extraction system for the ion source was designed with IBSimu. The extraction features a water-cooled puller electrode with a permanent magnet dipole field for dumping the co-extracted electrons and a decelerating Einzel lens for adjusting the beam focusing for further beam transport. The ion source and the puller electrode are tilted at 4 degree angle with respect to the beam line. The extraction system can handle H- and D- beams with final beam energies from 5 keV to 15 keV using the same geometry, only adjusting the electrode voltages. So far, 24 μA of H- and 15 μA of D- have been extracted from the cyclotron.
Eun Ji Oh
2016-09-01
Full Text Available Background A long non-coding RNA hox transcript antisense intergenic RNA (HOTAIR is involved in epigenetic regulation through chromatin remodeling by recruiting polycomb repressive complex 2 (PRC2 proteins (EZH2, SUZ12, and EED that induce histone H3 trimethylation at lysine 27 (H3K27me3. Deregulation of c-MYC and interaction between c-MYC and EZH2 are well known in lymphomagenesis; however, little is known about the expression status of HOTAIR in diffuse large B-cell lymphomas (DLBCLs. Methods The expression status of PRC2 (EZH2, SUZ12, and EED, H3K27me3, c-MYC, and BCL2 was analyzed using immunohistochemistry (n = 231, and HOTAIR was investigated by a quantification real-time polymerase chain reaction method (n = 164 in DLBCLs. Results The present study confirmed the positive correlation among PRC2 proteins, H3K27me3, and c-MYC in DLBCLs. Expression level of HOTAIR was also positively correlated to EZH2 (p < .05, respectively. Between c-MYC and HOTAIR, and between c- MYC/BCL2 co-expression and HOTAIR, however, negative correlation was observed in DLBCLs (p < .05, respectively. High level of H3K27me3 was determined as an independent prognostic marker in poor overall survival (hazard ratio, 2.0; p = .023 of DLBCL patients. High expression of HOTAIR, however, was associated with favorable overall survival (p = .004 in the univariate analysis, but the impact was not significant in the multivariate analysis. The favorable outcome of DLBCL with HOTAIR high expression levels may be related to the negative correlation with c- MYC expression or c-MYC/BCL2 co-expression. Conclusions HOTAIR expression could be one of possible mechanisms for inducing H3K27me3 via EZH2-related PRC2 activation, and induced H3K27me3 may be strongly related to aggressive DLBCLs which show poor patient outcome.
Lore, J. D., E-mail: lorejd@ornl.gov [Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831 (United States); Reinke, M. L.; Lipschultz, B. [York Plasma Institute, Department of Physics, University of York, Heslington, York YO10 5DD (United Kingdom); Brunner, D.; LaBombard, B.; Terry, J. [Plasma Science and Fusion Center, MIT, Cambridge, Massachusetts 02139 (United States); Pitts, R. A. [ITER Organization, Route de Vinon-sur-Verdon, CS 90046 - 13067 Saint Paul Lez Durance Cedex (France); Feng, Y. [Max Planck Institute for Plasma Physics, Greifswald (Germany)
2015-05-15
Experiments in Alcator C-Mod to assess the level of toroidal asymmetry in divertor conditions resulting from poloidally and toroidally localized extrinsic impurity gas seeding show a weak toroidal peaking (∼1.1) in divertor electron temperatures for high-power enhanced D-alpha H-mode plasmas. This is in contrast to similar experiments in Ohmically heated L-mode plasmas, which showed a clear toroidal modulation in the divertor electron temperature. Modeling of these experiments using the 3D edge transport code EMC3-EIRENE [Y. Feng et al., J. Nucl. Mater. 241, 930 (1997)] qualitatively reproduces these trends, and indicates that the different response in the simulations is due to the ionization location of the injected nitrogen. Low electron temperatures in the private flux region (PFR) in L-mode result in a PFR plasma that is nearly transparent to neutral nitrogen, while in H-mode the impurities are ionized in close proximity to the injection location, with this latter case yielding a largely axisymmetric radiation pattern in the scrape-off-layer. The consequences for the ITER gas injection system are discussed. Quantitative agreement with the experiment is lacking in some areas, suggesting potential areas for improving the physics model in EMC3-EIRENE.
2010-01-01
Heredad : héritage (12.9) ; terre (13.6). « que son suyas de heredad », qui leur appartiennent par héritage (1.2). Heredamiento : héritage, bien héréditaire (1.2 ; 15.4) ; donation (15.5). « por eredamiento », par héritage (15.5).« dar eredamientos », faire des donations (15.5). Heredar : hériter (14.1) « heredar los reinos », hériter des royaumes (14.1). Hermandad : fraternité (16.3). Honra (ou honrra) : honneur (13.6, 16.2). « fazerles mucho bien e honrra », leur faire grand bien et gra...
2010-01-01
Heredad : héritage (12.9) ; terre (13.6). « que son suyas de heredad », qui leur appartiennent par héritage (1.2). Heredamiento : héritage, bien héréditaire (1.2 ; 15.4) ; donation (15.5). « por eredamiento », par héritage (15.5).« dar eredamientos », faire des donations (15.5). Heredar : hériter (14.1) « heredar los reinos », hériter des royaumes (14.1). Hermandad : fraternité (16.3). Honra (ou honrra) : honneur (13.6, 16.2). « fazerles mucho bien e honrra », leur faire grand bien et gra...
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.
Determination of the δ2H and δ18O of soil water and water in plant matter; RSIL lab code 1700
Revesz, Kinga M.; Buck, Bryan; Coplen, Tyler B.
2012-01-01
The purpose of the Reston Stable Isotope Laboratory lab code 1700 is to determine the δ2H/1H), abbreviated as δ2H, and the δ18O/16O), abbreviated as δ18O, of soil water and water in plant matter. This method is based on the observation that water and toluene form an azeotropic mixture at 84.1 °C. This temperature is substantially lower than the boiling points of water (100 °C) and toluene (110 °C), but water and toluene are immiscible at ambient temperature. The water content of a soil or plant is determined by weighing, drying, and reweighing a small amount of sample. Sufficient sample to collect 3 to 5 milliliters of water after distillation is loaded into a distillation flask. Sufficient toluene is added so that the sample is immersed throughout the entire distillation to minimize evaporation of water, which would affect the δ2H and δ18O values. The mixture of sample and toluene is heated in a flask to its boiling point (84.1 °C) so that water from the sample and toluene can distill together into a specially designed collection funnel. The temperature of 84.1 °C is maintained until the water has been quantitatively transferred to the collection funnel, at which time the temperature is raised to the boiling point of the remaining component (toluene, 110 °C). The collection funnel is maintained at ambient temperature so that the sample water and toluene can be separated physically. After separation, the sample water is purified by addition of paraffin wax to the container with the sample water, capping the container, and heating to approximately 60 °C to melt the wax. Trace amounts of toluene will dissolve in the wax, purifying the sample water for isotopic analysis. The isotopic composition of the purified water is then determined by equilibration with gaseous hydrogen or carbon dioxide, followed by dual-inlet isotope-ratio mass spectrometry. Because laser-absorption spectrometry is sensitive to organic compounds, such as trace toluene remaining in
Jiacai Wang; Yingsong Ouyang; Shaojun Wang; Guoguang Peng; Qin Luo; Side Jiang; Faxiang Wang
2008-01-01
BACKGROUND: The deposition of α-synuclein (α-syn) aggregates is a neuropathological feature of Parkinson's disease. It remains impossible to involve α-syn aggregation in the treatment of Parkinson's disease. A nucleic acid vaccine will provide a new pathway to immunotherapy for Parkinson's disease.OBJECTIVE: To construct a recombinant eukaryotic expression vector pVAX1 coding human α-syn and to observe its expression level in COS-7 cells.DESIGN AND SETTING: The present bioengineering and molecular biology experiment was performed at Department of Neurology, First Affiliated Hospital of Chongqing Medical University & Chongqing Key Laboratory of Neurology.MATERIALS: The eukaryotic expression plasmid pVAX1, human embryonic brain tissue, healthy human blood cells, and COS-7 cells were purchased from Promega Company, USA.METHODS: The full-length CDS sequence of the human α-syn gene was amplified by RT-PCR, which contained restriction sites for the enzymes Kpn I, Xba I and Kozak consensus sequence. Then the PCR products and eukaryotic expression vector pVAX1 were digested with Kpn I and Xba I simultaneously, and were extracted and ligated by T4 ligase. The recombinant constructs pVAXI-hα-S1-14o were transformed into competent E. coli TOP 10 cells and the positive clones were screened and selected using PCR analysis,restriction digestion analysis, and DNA sequencing. The constructs were then tested for protein expression in COS-7 cells by RT-PCR and Western blotting.MAIN OUTCOME MEASURES: Identification of an eukaryotic expression vector containing the human α-syn gene, pVAX1-hα-S1-140, and detection of the expression in mammalian cell COS-7.RESULTS: The pVAXi vector was successfully cloned with human a -syn in the correct orientation and in-frame. The DNA vaccine constructs pVAX1-hα-S1-140 with the human α-syn gene were shown to be expressed in COS-7 cells. Human α-syn was successfully expressed in the mammalian cell line and was detected by RT-PCR and western
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.
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
NONE
1997-03-01
SCALE--a modular code system for Standardized Computer Analyses Licensing Evaluation--has been developed by Oak Ridge National Laboratory at the request of the US Nuclear Regulatory Commission. The SCALE system utilizes well-established computer codes and methods within standard analysis sequences that (1) allow an input format designed for the occasional user and/or novice, (2) automated the data processing and coupling between modules, and (3) provide accurate and reliable results. System development has been directed at problem-dependent cross-section processing and analysis of criticality safety, shielding, heat transfer, and depletion/decay problems. Since the initial release of SCALE in 1980, the code system has been heavily used for evaluation of nuclear fuel facility and package designs. This revision documents Version 4.3 of the system.
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
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....
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.)
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.
Optimal codes as Tanner codes with cyclic component codes
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....
Zhuang, Ming [Department of Oncology, The First Affiliated Hospital of Nanjing Medical University, Nanjing, Jiangsu (China); Department of Oncology, The First People’s Hospital of Lianyungang, Lianyungang, Jiangsu (China); Gao, Wen; Xu, Jing; Wang, Ping [Department of Oncology, The First Affiliated Hospital of Nanjing Medical University, Nanjing, Jiangsu (China); Shu, Yongqian, E-mail: shuyongqian39000@163.com [Department of Oncology, The First Affiliated Hospital of Nanjing Medical University, Nanjing, Jiangsu (China)
2014-06-06
Graphical abstract: - Highlights: • H19 regulates gastric cancer cell proliferation phenotype via miR-675. • MiR-675 modulates cell proliferation of gastric cancer cells by targeting tumor suppressor RUNX1. • The H19/miR-675/RUNX1 axis plays an important role in the tumorigenesis of gastric cancer. - Abstract: The lncRNA H19 has been recently shown to be upregulated and play important roles in gastric cancer tumorigenesis. However, the precise molecular mechanism of H19 and its mature product miR-675 in the carcinogenesis of gastric cancer remains unclear. In this study, we found that miR-675 was positively expressed with H19 and was a pivotal mediator in H19-induced gastric cancer cell growth promotion. Subsequently, the tumor suppressor Runt Domain Transcription Factor1 (RUNX1) was confirmed to be a direct target of miR-675 using a luciferase reporter assay and Western blotting analyses. A series of rescue assays indicated that RUNX1 mediated H19/miR-67-induced gastric cancer cell phenotypic changes. Moreover, the inverse relationship between the expression of RUNX1 and H19/miR-675 was also revealed in gastric cancer tissues and gastric cancer cell lines. Taken together, our study demonstrated that the novel pathway H19/miR-675/RUNX1 regulates gastric cancer development and may serve as a potential target for gastric cancer therapy.
Moon, Yong Ho; Yoon, Kun Su; Ha, Seok Wun
2009-12-01
A fast coeff_token decoding method based on new memory architecture is proposed to implement an efficient context-based adaptive variable length-coding (CAVLC) decoder. The heavy memory access needed in CAVLC decoding is a significant issue in designing a real system, such as digital multimedia broadcasting players, portable media players, and mobile phones with video, because it results in high power consumption and delay in operations. Recently, a new coeff_token variable-length decoding method has been suggested to achieve memory access reduction. However, it still requires a large portion of the total memory access in CAVLC decoding. In this work, an effective memory architecture is designed through careful examination of codewords in variable-length code tables. In addition, a novel fast decoding method is proposed to further reduce the memory accesses required for reconstructing the coeff_token element. Only one memory access is used for reconstructing each coeff_token element in the proposed method.
NOVEL BIPHASE CODE -INTEGRATED SIDELOBE SUPPRESSION CODE
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
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...
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.
Moridis, George; Freeman, Craig
2013-09-30
We developed two new EOS additions to the TOUGH+ family of codes, the RealGasH2O and RealGas . The RealGasH2O EOS option describes the non-isothermal two-phase flow of water and a real gas mixture in gas reservoirs, with a particular focus in ultra-tight (such as tight-sand and shale gas) reservoirs. The gas mixture is treated as either a single-pseudo-component having a fixed composition, or as a multicomponent system composed of up to 9 individual real gases. The RealGas option has the same general capabilities, but does not include water, thus describing a single-phase, dry-gas system. In addition to the standard capabilities of all members of the TOUGH+ family of codes (fully-implicit, compositional simulators using both structured and unstructured grids), the capabilities of the two codes include: coupled flow and thermal effects in porous and/or fractured media, real gas behavior, inertial (Klinkenberg) effects, full micro-flow treatment, Darcy and non-Darcy flow through the matrix and fractures of fractured media, single- and multi-component gas sorption onto the grains of the porous media following several isotherm options, discrete and fracture representation, complex matrix-fracture relationships, and porosity-permeability dependence on pressure changes. The two options allow the study of flow and transport of fluids and heat over a wide range of time frames and spatial scales not only in gas reservoirs, but also in problems of geologic storage of greenhouse gas mixtures, and of geothermal reservoirs with multi-component condensable (H2O and CH4) and non-condensable gas mixtures. The codes are verified against available analytical and semi-analytical solutions. Their capabilities are demonstrated in a series of problems of increasing complexity, ranging from isothermal flow in simpler 1D and 2D conventional gas reservoirs, to non-isothermal gas flow in 3D fractured shale gas reservoirs involving 4 types of fractures, micro-flow, non-Darcy flow and gas
Lor, Maichou; Bowers, Barbara J
2017-08-01
Many older adult immigrants in the US, including Hmong older adults, have limited English proficiency (LEP), and cannot read or have difficulty reading even in their first language (non-literate [NL]). Little has been done to identify feasible data collection approaches to enable inclusion of LEP or NL populations in research, limiting knowledge about their health. This study's purpose was to test the feasibility of culturally and linguistically adapted audio computer-assisted self-interviewing (ACASI) with color-labeled response categories and helper assistance (ACASI-H) for collection of health data with Hmong older adults. Thirty dyads (older adult and a helper) completed an ACASI-H survey with 13 health questions and a face-to-face debriefing interview. ACASI-H survey completion was video-recorded and reviewed with participants. Video review and debriefing interviews were audio-recorded and transcribed. Directed and conventional content analyses were used to analyze the interviews. All respondents reported that ACASI-H survey questions were consistent with their health experience. They lacked computer experience and found ACASI-H's interface user-friendly. All used the pre-recorded Hmong oral translation except for one, whose helper provided translation. Some Hmong older adults struggled with the color labeling at first, but helpers guided them to use the colors correctly. All dyads liked the color-labeled response categories and confirmed that a helper was necessary during the survey process. Findings support use of oral survey question administration with a technologically competent helper and color-labeled response categories when engaging LEP older adults in health-related data collection. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.
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
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.
LFSC - Linac Feedback Simulation Code
Ivanov, Valentin; /Fermilab
2008-05-01
The computer program LFSC (
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…
Zhang, Liwen; Su, Xiaodan; Liu, Shujun; Knapp, Amy R; Parthun, Mark R; Marcucci, Guido; Freitas, Michael A
2007-01-01
Disrupted patterns of acetylation and deacetylation of core histones play an important role in silencing transcription of hematopoietic important genes in acute myeloid leukemia (AML). A thorough investigation of these mechanisms and the response to pharmacologic modifiers will provide a better understanding of the role of histone acetylation in leukemogenesis. We describe here an analytical approach that combines acid urea polyacrylamide gel electrophoresis (AU-PAGE), amino acid coded mass tagging (AACM), and mass spectrometry (MS) for the investigation of histone acetylation patterns. The combined approach was used to follow the dynamics of H4 acetylation in Kasumi-1 cells harboring the fusion gene AML1/ETO shown to aberrantly recruit histone deacetylases (HDACs). The histones in Kasumi-1 cells were labeled by growing the cells in media in which lysine was replaced with stable isotope-labeled lysine (Lys-D4). Labeled and unlabeled cells were treated with depsipeptide and analyzed at different time points (0, 4, 8, 12, 24, and 48 h). The cells were mixed, the histone was extracted, and acetylated H4 isoforms were separated using AU-PAGE before in-gel trypsin digestion. The digests were analyzed by MALDI-TOF MS. Peptides were identified by mass and isotope pattern. LC-MS/MS of Arg-C digests were also performed to verify the acetylation pattern for H4. The major pattern of acetylation was determined as follows: initial acetylation at K16, followed by acetylation at K12, and finally acetylation of either K8 and/or K5.
Zhang, Liwen; Su, Xiaodan; Liu, Shujun; Knapp, Amy R.; Parthun, Mark R.; Marcucci, Guido; Freitas, Michael A.
2008-01-01
Disrupted patterns of acetylation and deacetylation of core histones play an important role in silencing transcription of hematopoietic important genes in acute myeloid leukemia (AML). A thorough investigation of these mechanisms and the response to pharmacologic modifiers will provide a better understanding of the role of histone acetylation in leukemogenesis. We describe here an analytical approach that combines acid urea polyacrylamide gel electrophoresis (AU-PAGE), amino acid coded mass tagging (AACM), and mass spectrometry (MS) for the investigation of histone acetylation patterns. The combined approach was used to follow the dynamics of H4 acetylation in Kasumi-1 cells harboring the fusion gene AML1/ETO shown to aberrantly recruit histone deacetylases (HDACs). The histones in Kasumi-1 cells were labeled by growing the cells in media in which lysine was replaced with stable isotope-labeled lysine (Lys-D4). Labeled and unlabeled cells were treated with depsipeptide and analyzed at different time points (0, 4, 8, 12, 24, and 48 h). The cells were mixed, the histone was extracted, and acetylated H4 isoforms were separated using AU-PAGE before in-gel trypsin digestion. The digests were analyzed by MALDI-TOF MS. Peptides were identified by mass and isotope pattern. LC–MS/MS of Arg-C digests were also performed to verify the acetylation pattern for H4. The major pattern of acetylation was determined as follows: initial acetylation at K16, followed by acetylation at K12, and finally acetylation of either K8 and/or K5. PMID:17203951
H.264/AVC中基于上下文的自适应二进制算术编码%Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC
周名芬; 陈磊
2004-01-01
基于上下文自适应二进制算术编码(CABAC)是H.264/AVC采用的高效熵编码方法之一,它由二进制化、上下文建模、算术编码三个步骤构成.详细阐述了CABAC的整个编码过程,并对它与VLC/CAVLC在编码性能上作了比较.
Zhang, Erbao; Han, Liang; Yin, Dandan; He, Xuezhi; Hong, Linzhi; Si, Xinxin; Qiu, Mantang; Xu, Tongpeng; De, Wei; Xu, Lin; Shu, Yongqian; Chen, Jinfei
2016-12-11
Recently, long non-coding RNAs (lncRNAs) have been shown to have important regulatory roles in human cancer biology. In our study, we found that lncRNA CCAT1, whose expression is significantly increased and is correlated with outcomes in Esophageal Squamous Cell Carcinoma (ESCC). Consecutive experiments confirmed that H3K27-acetylation could activate expression of colon cancer associated transcript-1 (CCAT1). Further experiments revealed that CCAT1 knockdown significantly repressed the proliferation and migration both in vitro and in vivo RNA-seq analysis revealed that CCAT1 knockdown preferentially affected genes that are linked to cell proliferation, cell migration and cell adhesion. Mechanistic investigations found that CCAT1 could serve as a scaffold for two distinct epigenetic modification complexes (5' domain of CCAT1 binding Polycomb Repressive Complex 2 (PRC2) while 3' domain of CCAT1 binding SUV39H1) and modulate the histone methylation of promoter of SPRY4 (sprouty RTK signaling antagonist 4) in nucleus. In cytoplasm, CCAT1 regulates HOXB13 as a molecular decoy for miR-7, a microRNA that targets both CCAT1 and HOXB13, thus facilitating cell growth and migration. Together, our data demonstrated the important roles of CCAT1 in ESCC oncogenesis and might serve as targets for ESCC diagnosis and therapy.
王翾; 陆建华
2006-01-01
在H.264/AVC标准的M Coder[2]基础上提出了一种增加检错能力的快速二进制算术编解码算法.通过合理安排禁用符号在编码区间中的位置,减少禁用符号数目,消除了乘法运算,从而降低了运算复杂度.理论分析和实验结果表明,在编码效率和检错能力变化不大的情况下,本算法提高了编解码器运算速度,具有实际意义.
何俊; 王阳明
2007-01-01
提出一种基于H.264的上下文自适应二进制算术编码器硬件设计方法.本设计中包含一个由二进制化以及上下文模型组成的14组并行上下文对产生器,一个抓取邻近区块数据的三级流水线结构以及一个内含前馈处理且融合三种模式的四级流水线结构的算术编码器.该算术编码器可以一个时钟处理一个位元;整个设计平均每个时钟处理0.77个位元.
付遥; 周东辉
2006-01-01
阐述H.264/AVC二进制算术编码的原理,论述此编码的IP核设计方案及其FPGA验证.整个设计使用VerilogHDL语言描述,在ALDEC的Active_HDL6.2平台上进行时序仿真,在Synplicity的Synplify7.0平台上进行综合.设计充分利用了硬件并行性,并进行关键路径优化和复用器重构算法优化,通过实际验证证明了设计的高效性和可行性.
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....
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
Language Recognition via Sparse Coding
2016-09-08
target language lT ) from the two pipelines. We can also think of more sophis- ticated fusion schemes on logistic regression and neural net - works. Table...vol. 16, no. 5, pp. 980–988, July 2008. [6] G. Sivaram, S. K. Nemala, M. Elhilali, T. D. Tran, and H. Herman- sky , “Sparse Coding for Speech
Locally Orderless Registration Code
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
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…
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.
Turbo Codes Extended with Outer BCH Code
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...
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,...
Sun, Zhiwei; Wang, Xiaoxiang; Cai, Yiping; Fu, Junqing; You, Jinmao
2014-03-01
A new pair of derivatization reagents, d0-4-(1-methyl-1H-phenanthro[9,10-d]imidazol-2-yl)phenlamine (d0-MPIA) and d3-4-(1-methyl-1H-phenanthro[9,10-d]imidazol-2-yl)phenlamine (d3-MPIA) have been designed and synthesized. It was successfully used to label aliphatic aldehydes and the aldehyde derivatives were analyzed by high-performance liquid chromatography-tandem mass spectrometry (HPLC-MS/MS). The new isotope-coded reagents could easily label aldehydes under acidic conditions in the presence of NaCNBH3. The target derivatives exhibited intense [M+H](+) and regular product ions with electrospray ionization source in positive mode. The d0/d3-MPIA-aldehydes were monitored by the transitions of [M+H](+)→m/z 322 and [M+H](+)→m/z 165, and the obtained detection limits were in the range of 0.18-15.9 pg/mL at signal to noise ratio of 3. The global isotope internal standard technology was employed for quantification analysis with d3-MPIA-aldehyde as internal standard for corresponding d0-MPIA-aldehyde. Excellent linear responses for relative quantification were observed in the range of 1/10-10/1 with coefficients >0.998. The developed method has been applied to the quantification of aliphatic aldehydes in selected aquatic products with RSD85.2%. © 2013 Elsevier B.V. All rights reserved.
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.
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.
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
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.
Challenge: Code of environmental law; Herausforderung Umweltgesetzbuch
NONE
2007-07-15
Within the meeting ''Challenge: Code of environmental law'' at 16th February, 2007, in Berlin (Federal Republic of Germany) and organized by the Federal Ministry for the Environment, Nature Conservation and Nuclear Safety (Berlin, Federal Republic of Germany), the following lectures were held: (a) the new code of environmental law as a contribution to more modernness and efficiency in the environmental politics (Sigmar Gabriel); (b) The code of environmental law from the view of the economy (Martin Wansleben); (c) Significance of the code of environmental law from the view of jurisprudence (Michael Kloepfer); (d) Targets, content and utility of the code of environmental law: Summary of the panel discussion (Tanja Goenner, Klaus Mittelbach, Juergen Resch, Hans-Joachim Koch, Alfred Wirtz, Andreas Troge (moderator)); (e) Considerations to the coding of water law in the code of environmental law (Helge Wendenburg); (f) Considerations to the coding of water law: Summary of te discussion; (g) Considerations to the coding of nature conservation law (Jochen Flasbarth); (h) Considerations to the coding of nature conservation law: Summary of the discussion.
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.
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.
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
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.
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.
张爱丽; 刘秀峰; 靳蕃
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.
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
无
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.
One dimensional Convolutional Goppa Codes over the projective line
Pérez, J A Domínguez; Sotelo, G Serrano
2011-01-01
We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions of H. Gluesing-Luerssen and B. Langfeld. Moreover we give a classification of one-dimensional Convolutional Goppa Codes and propose a characterization of MDS codes of this type.
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.
Benchmark studies of BOUT++ code and TPSMBI code on neutral transport during SMBI
Wang, Y.H. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); University of Science and Technology of China, Hefei 230026 (China); Center for Magnetic Fusion Theory, Chinese Academy of Sciences, Hefei 230031 (China); Wang, Z.H., E-mail: zhwang@swip.ac.cn [Southwestern Institute of Physics, Chengdu 610041 (China); Guo, W., E-mail: wfguo@ipp.ac.cn [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); Center for Magnetic Fusion Theory, Chinese Academy of Sciences, Hefei 230031 (China); Ren, Q.L. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); Sun, A.P.; Xu, M.; Wang, A.K. [Southwestern Institute of Physics, Chengdu 610041 (China); Xiang, N. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); Center for Magnetic Fusion Theory, Chinese Academy of Sciences, Hefei 230031 (China)
2017-06-09
SMBI (supersonic molecule beam injection) plays an important role in tokamak plasma fuelling, density control and ELM mitigation in magnetic confinement plasma physics, which has been widely used in many tokamaks. The trans-neut module of BOUT++ code is the only large-scale parallel 3D fluid code used to simulate the SMBI fueling process, while the TPSMBI (transport of supersonic molecule beam injection) code is a recent developed 1D fluid code of SMBI. In order to find a method to increase SMBI fueling efficiency in H-mode plasma, especially for ITER, it is significant to first verify the codes. The benchmark study between the trans-neut module of BOUT++ code and the TPSMBI code on radial transport dynamics of neutral during SMBI has been first successfully achieved in both slab and cylindrical coordinates. The simulation results from the trans-neut module of BOUT++ code and TPSMBI code are consistent very well with each other. Different upwind schemes have been compared to deal with the sharp gradient front region during the inward propagation of SMBI for the code stability. The influence of the WENO3 (weighted essentially non-oscillatory) and the third order upwind schemes on the benchmark results has also been discussed. - Highlights: • A 1D model of SMBI has developed. • Benchmarks of BOUT++ and TPSMBI codes have first been finished. • The influence of the WENO3 and the third order upwind schemes on the benchmark results has also been discussed.
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.
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)
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
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.
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.
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.
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.
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...
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
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...
Transformation invariant sparse coding
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.
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.
Benchmark studies of BOUT++ code and TPSMBI code on neutral transport during SMBI
Wang, Y. H.; Wang, Z. H.; Guo, W.; Ren, Q. L.; Sun, A. P.; Xu, M.; Wang, A. K.; Xiang, N.
2017-06-01
SMBI (supersonic molecule beam injection) plays an important role in tokamak plasma fuelling, density control and ELM mitigation in magnetic confinement plasma physics, which has been widely used in many tokamaks. The trans_neut module of BOUT++ code is the only large-scale parallel 3D fluid code used to simulate the SMBI fueling process, while the TPSMBI (transport of supersonic molecule beam injection) code is a recent developed 1D fluid code of SMBI. In order to find a method to increase SMBI fueling efficiency in H-mode plasma, especially for ITER, it is significant to first verify the codes. The benchmark study between the trans_neut module of BOUT++ code and the TPSMBI code on radial transport dynamics of neutral during SMBI has been first successfully achieved in both slab and cylindrical coordinates. The simulation results from the trans_neut module of BOUT++ code and TPSMBI code are consistent very well with each other. Different upwind schemes have been compared to deal with the sharp gradient front region during the inward propagation of SMBI for the code stability. The influence of the WENO3 (weighted essentially non-oscillatory) and the third order upwind schemes on the benchmark results has also been discussed.
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.
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...
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
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
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.
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...
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....
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...
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.
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
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.
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...
Distributed Video Coding: CODEC Architecture and Implementation
Vijay Kumar Kodavalla
2011-03-01
Full Text Available Distributed Video Coding (DVC is a new coding paradigm for video compression, based on Slepian-Wolf (lossless coding and Wyner-Ziv (lossy coding information theoretic results. DVC is useful foremerging applications such as wireless video cameras, wireless low-power surveillance networks anddisposable video cameras for medical applications etc. The primary objective of DVC is low-complexityvideo encoding, where bulk of computation is shifted to the decoder, as opposed to low-complexitydecoder in conventional video compression standards such as H.264 and MPEG etc. There are couple ofearly architectures and implementations of DVC from Stanford University[2][3] in 2002, BerkeleyUniversity PRISM (Power-efficient, Robust, hIgh-compression, Syndrome-based Multimedia coding[4][5]in 2002 and European project DISCOVER (DIStributed COding for Video SERvices[6] in 2007.Primarily there are two types of DVC techniques namely pixel domain and transform domain based.Transform domain design will have better rate-distortion (RD performance as it exploits spatialcorrelation between neighbouring samples and compacts the block energy into as few transformcoefficients as possible (aka energy compaction. In this paper, architecture, implementation details and“C” model results of our transform domain DVC are presented.
Secure Source Coding with a Helper
Tandon, Ravi; Ramchandran, Kannan
2009-01-01
We consider a secure lossless source coding problem with a rate-limited helper. In particular, Alice observes an i.i.d. source $X^{n}$ and wishes to transmit this source losslessly to Bob at a rate $R_{x}$. A helper, say Helen, observes a correlated source $Y^{n}$ and transmits at a rate $R_{y}$ to Bob. A passive eavesdropper can observe the coded output of Alice. The equivocation $\\Delta$ is measured by the conditional entropy $H(X^{n}|J_{x})/n$, where $J_{x}$ is the coded output of Alice. We first completely characterize the rate-equivocation region for this secure source coding model, where we show that Slepian-Wolf type coding is optimal. We next study two generalizations of this model and provide single-letter characterizations for the respective rate-equivocation regions. In particular, we first consider the case of a two-sided helper where Alice also has access to the coded output of Helen. We show that for this case, Slepian-Wolf type coding is suboptimal and one can further decrease the information l...
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.
Modified symmetrical reversible variable length code and its theoretical bounds
Tsai, Chien-Wu; Wu, Ja-Ling; Liu, Shu-Wei
2000-04-01
The reversible variable length codes (RVLCs) have been adopted in the emerging video coding standards -- H.263+ and MPEG- 4, to enhance their error-resilience capability which is important and essential in the error-prone environments. The most appealing advantage of symmetrical RVLCs compared with asymmetrical RVLCs is that only one code table is required to forward and backward decoding, however, two code tables are required for asymmetrical RVLCs. In this paper, we propose a simple and efficient algorithm that can produce a symmetrical RVLC from a given Huffman code, and we also discuss theoretical bounds of the proposed symmetrical RVLCs.
Distributed Video Coding: Iterative Improvements
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
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....
Product Codes for Optical Communication
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....
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
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.
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.
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...
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.
Fast prediction algorithm for multiview video coding
Abdelazim, Abdelrahman; Mein, Stephen James; Varley, Martin Roy; Ait-Boudaoud, Djamel
2013-03-01
The H.264/multiview video coding (MVC) standard has been developed to enable efficient coding for three-dimensional and multiple viewpoint video sequences. The inter-view statistical dependencies are utilized and an inter-view prediction is employed to provide more efficient coding; however, this increases the overall encoding complexity. Motion homogeneity is exploited here to selectively enable inter-view prediction, and to reduce complexity in the motion estimation (ME) and the mode selection processes. This has been accomplished by defining situations that relate macro-blocks' motion characteristics to the mode selection and the inter-view prediction processes. When comparing the proposed algorithm to the H.264/MVC reference software and other recent work, the experimental results demonstrate a significant reduction in ME time while maintaining similar rate-distortion performance.
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
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.
Introduction to the High-Efficiency Video Coding Standard
Ping Wu; Mina Li
2012-01-01
The high-efficiency video coding （HEVC） standard is the newest video coding standard currently under joint development by ITU-T Video Coding Experts Group （VCEG） and ISO/IEC Moving Picture Experts Group （MPEG）. HEVC is the next-generation video coding standard after H.264/AVC. The goals of the HEVC standardization effort are to double the video coding efficiency of existing H.264/AVC while supporting all the recognized potential applications, such as, video telephony, storage, broadcast, streaming, especially for large picture size video （4k x 2k）. The HEVC standard will be completed as an ISO/iEC and ITU-T standard in January 2013. in February 2012, the HEVC standardization process reached its committee draft （CD） stage. The ever-improving HEVC standard has demonstrated a significant gain in coding efficiency in rate-distortion efficiency relative to the existing H.264/AVC. This paper provides an overview of the technical features of HEVC close to HEVC CD stage, covering high-level structure, coding units, prediction units, transform units, spatial signal transformation and PCM representation, intra-picture prediction, inter-picture prediction, entropy coding and in-loop filtering. The HEVC coding efficiency performances comparing with H.264/AVC are also provided.
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
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....
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
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...
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
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
New code match strategy for wideband code division multiple access code tree management
无
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%.
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.
The natural variation of a neural code.
Kfir, Yoav; Renan, Ittai; Schneidman, Elad; Segev, Ronen
2012-01-01
The way information is represented by sequences of action potentials of spiking neurons is determined by the input each neuron receives, but also by its biophysics, and the specifics of the circuit in which it is embedded. Even the "code" of identified neurons can vary considerably from individual to individual. Here we compared the neural codes of the identified H1 neuron in the visual systems of two families of flies, blow flies and flesh flies, and explored the effect of the sensory environment that the flies were exposed to during development on the H1 code. We found that the two families differed considerably in the temporal structure of the code, its content and energetic efficiency, as well as the temporal delay of neural response. The differences in the environmental conditions during the flies' development had no significant effect. Our results may thus reflect an instance of a family-specific design of the neural code. They may also suggest that individual variability in information processing by this specific neuron, in terms of both form and content, is regulated genetically.
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...
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.
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
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
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...
A comparison of cosmological hydrodynamic codes
Kang, Hyesung; Ostriker, Jeremiah P.; Cen, Renyue; Ryu, Dongsu; Hernquist, Lars; Evrard, August E.; Bryan, Greg L.; Norman, Michael L.
1994-01-01
We present a detailed comparison of the simulation results of various hydrodynamic codes. Starting with identical initial conditions based on the cold dark matter scenario for the growth of structure, with parameters h = 0.5 Omega = Omega(sub b) = 1, and sigma(sub 8) = 1, we integrate from redshift z = 20 to z = O to determine the physical state within a representative volume of size L(exp 3) where L = 64 h(exp -1) Mpc. Five indenpendent codes are compared: three of them Eulerian mesh-based and two variants of the smooth particle hydrodynamics 'SPH' Lagrangian approach. The Eulerian codes were run at N(exp 3) = (32(exp 3), 64(exp 3), 128(exp 3), and 256(exp 3)) cells, the SPH codes at N(exp 3) = 32(exp 3) and 64(exp 3) particles. Results were then rebinned to a 16(exp 3) grid with the exception that the rebinned data should converge, by all techniques, to a common and correct result as N approaches infinity. We find that global averages of various physical quantities do, as expected, tend to converge in the rebinned model, but that uncertainites in even primitive quantities such as (T), (rho(exp 2))(exp 1/2) persists at the 3%-17% level achieve comparable and satisfactory accuracy for comparable computer time in their treatment of the high-density, high-temeprature regions as measured in the rebinned data; the variance among the five codes (at highest resolution) for the mean temperature (as weighted by rho(exp 2) is only 4.5%. Examined at high resolution we suspect that the density resolution is better in the SPH codes and the thermal accuracy in low-density regions better in the Eulerian codes. In the low-density, low-temperature regions the SPH codes have poor accuracy due to statiscal effects, and the Jameson code gives the temperatures which are too high, due to overuse of artificial viscosity in these high Mach number regions. Overall the comparison allows us to better estimate errors; it points to ways of improving this current generation ofhydrodynamic
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
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.
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.
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
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
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...
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
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.
Fixed-Length Error Resilient Code and Its Application in Video Coding
FANChen; YANGMing; CUIHuijuan; TANGKun
2003-01-01
Since popular entropy coding techniques such as Variable-length code (VLC) tend to cause severe error propagation in noisy environments, an error resilient entropy coding technique named Fixed-length error resilient code (FLERC) is proposed to mitigate the problem. It is found that even for a non-stationary source, the probability of error propagation could be minimized through introducing intervals into the codeword space of the fixed-length codes. FLERC is particularly suitable for the entropy coding for video signals in error-prone environments, where a little distortion is tolerable, but severe error propagation would lead to fatal consequences. An iterative construction algorithm for FLERC is presented in this paper. In addition, FLERC is adopted instead of VLC as the entropy coder of the DCT coefficients in H.263++Data partitioning slice (DPS) mode, and tested on noisy channels. The simulation results show that this scheme outperforms the scheme of H.263++ combined with FEC when the channel noise is highly extensive, since the error propagation is effectively suppressed by using FLERC. Moreover, it is observed that the reconstructed video quality degrades gracefully as the bit error rate increases.
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.
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.
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...
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
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
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...
Random linear codes in steganography
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
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
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...
WAVELET－BASED FINE GRANULARITY SCALABLE VIDEO CODING
ZhangJiangshan; ZhuGuangxi
2003-01-01
This letter proposes an efficient wavelet-based fine Granularity Scalable(FGS)coding scheme,where the base layer is encoded with a newly designed wavelet-based coder,and the entancement layer is encoded with Progressive Fins Granularity Scalable(PFGS)coding.This algorithm involves multi-frame motion compensationk,rate-distortion optimizing strategy with Lagrangian cost function and context-based adaptive arithmetic coding.In order to improve efficiency of the enhancenent layer coding,an improved motion estimation scheme that uses both information from the base layer and the enhancement layer is also proposed in this letter.The wavelet-based coder significantly improves the coding efficiency of the base layer compared with MPEG-4 ASP(Advanced Simple Profile)and H.26L TML9.The PFGS coding is a significant improvement over MPEG-4 FGS coding at the enhancement layer.Experiments show that single layer coding efficiency gain of the proposed scheme is about 2.0-3.0dB and 0.3-1.0dB higher than that of MPEG-4 ASP and H.26L TML9,respectively.The overall coding efficiency gain of the proposed scheme is about 4.0-5.0dB higher than that of MPEG04 FGS.
WAVELET-BASED FINE GRANULARITY SCALABLE VIDEO CODING
Zhang Jiangshan; Zhu Guangxi
2003-01-01
This letter proposes an efficient wavelet-based Fine Granularity Scalable (FGS)coding scheme, where the base layer is encoded with a newly designed wavelet-based coder, and the enhancement layer is encoded with Progressive Fine Granularity Scalable (PFGS) coding.This algorithm involves multi-frame motion compensation, rate-distortion optimizing strategy with Lagrangian cost function and context-based adaptive arithmetic coding. In order to improve efficiency of the enhancement layer coding, an improved motion estimation scheme that uses both information from the base layer and the enhancement layer is also proposed in this letter. The wavelet-based coder significantly improves the coding efficiency of the base layer compared with MPEG-4 ASP (Advanced Simple Profile) and H.26L TML9. The PFGS coding is a significant improvement over MPEG-4 FGS coding at the enhancement layer. Experiments show that single layer coding efficiency gain of the proposed scheme is about 2.0-3.0dB and 0.3-1.0dB higher than that of MPEG-4 ASP and H.26L TML9, respectively. The overall coding efficiency gain of the proposed scheme is about 4.0-5.0dB higher than that of MPEG-4 FGS.
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
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.
Plante, Ianik
2011-08-01
The importance of the radiolysis of water in the initial events following irradiation of biological systems has motivated considerable theoretical and experimental work in the field of radiation chemistry of water and aqueous systems. These studies include Monte-Carlo simulations of the radiation track structure and of the non-homogeneous chemical stage, which have been successfully used to calculate the yields of radiolytic species (H(·), (·)OH, H(2), H(2)O(2), e (aq) (-) , …). Most techniques used for the simulation of the non-homogeneous chemical stage such as the independent reaction time (IRT) technique and diffusion kinetics methods do not calculate the time evolution of the positions of the radiolytic species. This is a major limitation to their extension to the simulation of the irradiation of radiobiological systems. Step-by-step (SBS) simulation programs provide such information, but they are very demanding in term of computer power and storage capacity. Recent improvements in computer performance now allow the regular use of the SBS method in radiation chemistry simulations. In the first of a series of two papers, the SBS method has been reviewed in details and the implementation of a SBS code has been discussed. In this second paper, the results of several studies are presented: (1) the time evolution of the radiolytic yields from the formation of the radiation track to 10(-6) s; (2) the effect of pH on yields (pH ~ 0.4-7.0); (3) the effect of proton energy (and LET) on yields (300 MeV-0.1 MeV), and iv) the effect of the ion type ((1)H(+), (4)He(2+), (12)C(6+)) on yields. Nonbiological applications, i.e., the study of the temperature on the yields (about 25-300°C) and the simulation of the time evolution of G(Fe(3+)) in the Fricke dosimeter are also discussed.
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
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
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
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.
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.
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
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.
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.
New Codes for Spectral Amplitude Coding Optical CDMA Systems
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.
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.
A MCTF video coding scheme based on distributed source coding principles
Tagliasacchi, Marco; Tubaro, Stefano
2005-07-01
Motion Compensated Temporal Filtering (MCTF) has proved to be an efficient coding tool in the design of open-loop scalable video codecs. In this paper we propose a MCTF video coding scheme based on lifting where the prediction step is implemented using PRISM (Power efficient, Robust, hIgh compression Syndrome-based Multimedia coding), a video coding framework built on distributed source coding principles. We study the effect of integrating the update step at the encoder or at the decoder side. We show that the latter approach allows to improve the quality of the side information exploited during decoding. We present the analytical results obtained by modeling the video signal along the motion trajectories as a first order auto-regressive process. We show that the update step at the decoder allows to half the contribution of the quantization noise. We also include experimental results with real video data that demonstrate the potential of this approach when the video sequences are coded at low bitrates.
Nonlinear Aspects of Coding and Noncoding DNA Sequences
Stanley, H. Eugene
2001-03-01
One of the most remarkable features of human DNA is that 97 percent is not coding for proteins. Studying this noncoding DNA is important both for practical reasons (to distinguish it from the coding DNA as the human genome is sequenced), and for scientific reasons (why is the noncoding DNA present at all, if it appears to have little if any purpose?). In this talk we discuss new methods of analyzing coding and noncoding DNA in parallel, with a view to uncovering different statistical properties of the two kinds of DNA. We also speculate on possible roles of noncoding DNA. The work reported here was carried out primarily by P. Bernaola-Galvan, S. V. Buldyrev, P. Carpena, N. Dokholyan, A. L. Goldberger, I. Grosse, S. Havlin, H. Herzel, J. L. Oliver, C.-K. Peng, M. Simons, H. E. Stanley, R. H. R. Stanley, and G. M. Viswanathan. [1] For a brief overview in language that physicists can understand, see H. E. Stanley, S. V. Buldyrev, A. L. Goldberger, S. Havlin, C.-K. Peng, and M. Simons, "Scaling Features of Noncoding DNA" [Proc. XII Max Born Symposium, Wroclaw], Physica A 273, 1-18 (1999). [2] I. Grosse, H. Herzel, S. V. Buldyrev, and H. E. Stanley, "Species Independence of Mutual Information in Coding and Noncoding DNA," Phys. Rev. E 61, 5624-5629 (2000). [3] P. Bernaola-Galvan, I. Grosse, P. Carpena, J. L. Oliver, and H. E. Stanley, "Identification of DNA Coding Regions Using an Entropic Segmentation Method," Phys. Rev. Lett. 84, 1342-1345 (2000). [4] N. Dokholyan, S. V. Buldyrev, S. Havlin, and H. E. Stanley, "Distributions of Dimeric Tandem Repeats in Non-coding and Coding DNA Sequences," J. Theor. Biol. 202, 273-282 (2000). [5] R. H. R. Stanley, N. V. Dokholyan, S. V. Buldyrev, S. Havlin, and H. E. Stanley, "Clumping of Identical Oligonucleotides in Coding and Noncoding DNA Sequences," J. Biomol. Structure and Design 17, 79-87 (1999). [6] N. Dokholyan, S. V. Buldyrev, S. Havlin, and H. E. Stanley, "Distribution of Base Pair Repeats in Coding and Noncoding DNA
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.
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
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
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
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...
The Forgotten Women of Pre-Code: An Annotated Filmography and Bibliography
Tang, Jennifer
2010-01-01
In recent years, "pre-code" films have been re-discovered and applauded by film scholars and feminists. The term refers to the period between 1929 and 1934 when many Hollywood studios openly disregarded the censorship restrictions of the Hays Code. Named after censorship czar William H. Hays, the Code forbade nudity, cursing, sexual innuendo,…
Multipoint videoconferencing with scalable video coding
ELEFTHERIADIS Alexandros; CIVANLAR M. Reha; SHAPIRO Ofer
2006-01-01
We describe a system for multipoint videoconferencing that offers extremely low end-to-end delay, low cost and complexity, and high scalability, alongside standard features associated with high-end solutions such as rate matching and personal video layout. The system accommodates heterogeneous receivers and networks based on the Internet Protocol and relies on scalable video coding to provide a coded representation of a source video signal at multiple temporal and spatial resolutions as well as quality levels. These are represented by distinct bitstream components which are created at each end-user encoder. Depending on the specific conferencing environment, some or all of these components are transmitted to a Scalable Video Conferencing Server (SVCS). The SVCS redirects these components to one or more recipients depending on, e.g., the available network conditions and user preferences. The scalable aspect of the video coding technique allows the system to adapt to different network conditions, and also accommodates different end-user requirements (e.g., a user may elect to view another user at a high or low spatial resolution). Performance results concerning flexibility, video quality and delay of the system are presented using the Joint Scalable Video Model (JSVM) of the forthcoming SVC (H.264 Annex G) standard, demonstrating that scalable coding outperforms existing state-of-the-art systems and offers the right platform for building next-generation multipoint videoconferencing systems.
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.
BILINEAR FORMS AND LINEAR CODES
高莹
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
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
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
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.
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
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
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.
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.
Decoding of concatenated codes with interleaved outer codes
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…
Scalable-to-lossless transform domain distributed video coding
Huang, Xin; Ukhanova, Ann; Veselov, Anton;
2010-01-01
Distributed video coding (DVC) is a novel approach providing new features as low complexity encoding by mainly exploiting the source statistics at the decoder based on the availability of decoder side information. In this paper, scalable-tolossless DVC is presented based on extending a lossy...... TransformDomain Wyner-Ziv (TDWZ) distributed video codec with feedback.The lossless coding is obtained by using a reversible integer DCT.Experimental results show that the performance of the proposed scalable-to-lossless TDWZ video codec can outperform alternatives based on the JPEG 2000 standard. The TDWZ...... codec provides frame by frame encoding. Comparing the lossless coding efficiency, the proposed scalable-to-lossless TDWZ video codec can save up to 5%-13% bits compared to JPEG LS and H.264 Intra frame lossless coding and do so as a scalable-to-lossless coding....
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...
Allele coding in genomic evaluation
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
Codes and morals: is there a missing link? (The Nuremberg Code revisited).
Hick, C
1998-01-01
Codes are a well known and popular but weak form of ethical regulation in medical practice. There is, however, a lack of research on the relations between moral judgments and ethical Codes, or on the possibility of morally justifying these Codes. Our analysis begins by showing, given the Nuremberg Code, how a typical reference to natural law has historically served as moral justification. We then indicate, following the analyses of H. T. Engelhardt, Jr., and A. MacIntyre, why such general moral justifications of codes must necessarily fail in a society of "moral strangers." Going beyond Engelhardt we argue, that after the genealogical suspicion in morals raised by Nietzsche, not even Engelhardt's "principle of permission" can be rationally justified in a strong sense--a problem of transcendental argumentation in morals already realized by I. Kant. Therefore, we propose to abandon the project of providing general justifications for moral judgements and to replace it with a hermeneutical analysis of ethical meanings in real-world situations, starting with the archetypal ethical situation, the encounter with the Other (E. Levinas).
An algebraic approach to graph codes
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...
Nishioka, S.; Mochalskyy, S.; Taccogna, F.; Hatayama, A.; Fantz, U.; Minelli, P.
2017-08-01
The development of the kinetic particle model for the extraction region in negative hydrogen ion sources is indispensable and helpful to clarify the H- beam extraction physics. Recently, various 3D kinetic particle codes have been developed to study the extraction mechanism. Direct comparison between each other has not yet been done. Therefore, we have carried out a code-to-code benchmark activity to validate our codes. In the present study, the progress in this benchmark activity is summarized. At present, the reasonable agreement with the result by each code have been obtained using realistic plasma parameters at least for the following items; (1) Potential profile in the case of the vacuum condition (2) Temporal evolution of extracted current densities and profiles of electric potential in the case of the plasma consisting of only electrons and positive ions.
A New Video Coding Method Based on Improving Detail Regions
无
2002-01-01
The Moving Pictures Expert Group (MPEG) and H.263 standard coding method is widely used in video compression. However, the visual quality of detail regions such as eyes and mouth is not content in people at the decoder, as far as the conference telephone or videophone is concerned. A new coding method based on improving detail regions is presented in this paper. Experimental results show that this method can improve the visual quality at the decoder.
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
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
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
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
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.
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...
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
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 ...
New constructions of WOM codes using the Wozencraft ensemble
Shpilka, Amir
2011-01-01
In this paper we give several new constructions of WOM codes. The novelty in our constructions is the use of the so called Wozencraft ensemble of linear codes. Specifically, we obtain the following results. We give an explicit construction of a two-write Write-Once-Memory (WOM for short) code that approaches capacity, over the binary alphabet. More formally, for every \\epsilon>0, 0
code of length n and capacity H(p)+1-p-\\epsilon. Since the capacity of a two-write WOM code is max_p (H(p)+1-p), we get a code that is \\epsilon-close to capacity. Furthermore, encoding and decoding can be done in time O(n^2.poly(log n)) and time O(n.poly(log n)), respectively, and in logarithmic space. We obtain a new encoding scheme for 3-write WOM codes over the binary alphabet. Our scheme achieves rate 1.809-\\epsilon, when the block length is exp(1/\\epsilon). This gives a better rate than what could be achieved using previous techniques. We ...
Performance of Quantization Factor in H.261 Video Coding
无
2001-01-01
The quantizaion factor through buffer pure occupy algorithm isprovided. Through the simulation, firstly the relationship between quantization factor and compression ratio is analyzed, secondly the PSNR of the image with the quantization factor is discussed, and finally the control to the output rate of the coder by adjusting the value of quantization factor is studied.
Distributed source coding of video
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
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...
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
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
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
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...
Patent landscape for royalty-free video coding
Reader, Cliff
2016-09-01
Digital video coding is over 60 years old and the first major video coding standard - H.261 - is over 25 years old, yet today there are more patents than ever related to, or evaluated as essential to video coding standards. This paper examines the historical development of video coding standards, from the perspective of when the significant contributions for video coding technology were made, what performance can be attributed to those contributions and when original patents were filed for those contributions. These patents have now expired, so the main video coding tools, which provide the significant majority of coding performance, are now royalty-free. The deployment of video coding tools in a standard involves several related developments. The tools themselves have evolved over time to become more adaptive, taking advantage of the increased complexity afforded by advances in semiconductor technology. In most cases, the improvement in performance for any given tool has been incremental, although significant improvement has occurred in aggregate across all tools. The adaptivity must be mirrored by the encoder and decoder, and advances have been made in reducing the overhead of signaling adaptive modes and parameters. Efficient syntax has been developed to provide such signaling. Furthermore, efficient ways of implementing the tools with limited precision, simple mathematical operators have been developed. Correspondingly, categories of patents related to video coding can be defined. Without discussing active patents, this paper provides the timeline of the developments of video coding and lays out the landscape of patents related to video coding. This provides a foundation on which royalty free video codec design can take place.
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
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.
Multiple description video coding based on residuum compensation
ZHAO AnBang; YU Yun; SUN GuoCang; LI GuanFang; HUI JunYing
2009-01-01
As one of the focus areas of robust video coding and transmission, multiple description video coding has attracted comprehensive attention. The low coding efficiency of multiple description video coding is always the major challenge in this field. In order to improve the performance of multiple description video coding, this paper proposes a scheme based on residuum compensation. In this scheme, each original video frame is encoded with a traditional encoder first to get the first description. Then the error residuum of each coded frame is added up to the corresponding original frame and the resulting compensated frame is encoded by another traditional encoder to generate the second description successively. This work uses JM10.0 of H.264/AVC as video coding codec to conduct the experiments. The experimental results show that the proposed scheme has good coding performance. Compared to state of art traditional single description encoder, the efficiency can be as high as 90%, i.e. the redundancy Is only 10% to 20%.
CYCLIC CODES OVER FORMAL POWER SERIES RINGS
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.
The Flutter Shutter Code Calculator
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...
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.
Pena-Monferrer, C.; Chiva, S.; Munoz-cobo, J. L.; Vela, E.
2012-07-01
This paper develops participation in benchmark MATIS-H, promoted by the NEA / OECD-KAERI, involving the study of turbulent flow in a rod beam with spacers in an experimental installation. Its aim is the analysis of hydraulic behavior of turbulent flow in the subchannels of the fuel elements, essential for the improvement of safety margins in normal and transient operations and to maximize the use of nuclear energy through an optimal design of grids.
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.
Code-Mixing and Code Switchingin The Process of Learning
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.
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
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
雷阳; 宋占杰
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
无
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.
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.
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
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.
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
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
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...
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
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.
Obituary: Arthur Dodd Code (1923-2009)
Marché, Jordan D., II
2009-12-01
, thereby supporting its possible composition as graphite. Code was the recipient of numerous awards, including the Professional Achievement Award of the University of Chicago Alumni Association (1969), NASA's Public Service Award (1970), and its highest honor, the Distinguished Public Service Medal (1992). He was elected to the National Academy of Sciences (1971), the International Academy of Astronautics (1972), chosen a Fellow of the American Academy of Arts and Sciences (1974), and elected vice president (1976-78) and president (1982-84) of the AAS. He was a member of the Board of Physics and Astronomy of the National Research Council and served for many years on the board of directors (and later was appointed chairman, 1977-80) of AURA, Inc. Code was closely involved with AURA's bid to manage the Space Telescope Science Institute and served as the latter's interim director (15 January - 1 September 1981). He also played a significant role in establishing the WIYN (Wisconsin, Indiana, Yale, and NOAO) consortium and Observatory. Code's numerous achievements reflect his competencies as both a theorist and experimentalist/observer, along with noted administrative skills. During his lengthy career at Wisconsin, Code supervised twenty doctoral dissertations (one of which was co-directed with Robert Bless). Following his retirement in 1995, he and his wife relocated to Tucson, Arizona, where he was appointed adjunct professor at the University of Arizona's Steward Observatory and concurrently WIYN Observatory Scientist. At the time of his death, he was the Joel Stebbins and Hilldale Professor of Astronomy Emeritus at UW-Madison. Code belonged to the First Unitarian Church of Madison. He is survived by his wife of 65 years, Mary Guild Code, their four children, Alan, Douglas, Edith, and David, and six grandchildren. Among other sources, this essay draws upon the 1982 oral history interview with Code, conducted by David H. DeVorkin (National Air and Space Museum
Parametric Coding of Stereo Audio
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
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.
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.
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
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.
Development of Advanced In core Management Codes for Ulchin Unit 1, 2
Lee, Sang Hee; Park, Moon Gyu [Korea Electric Power Research Institute, Taejon (Korea, Republic of)
1996-12-31
As the first case of FRAMATOME`s plants, Ulchin Unit 1 Cycle 8 core was loaded with V5H fuel. Because of the heterogeneity in the axial enrichment of the V5H fuel, FRAMATOME`s 2-D in core management codes, CEDRIC-CARIN-ESTHER, are no longer valid to be used for in core management. In order to analyze Ulchin Unit 1 an 2 cores loaded with V5H fuel exactly, this study substituted them with WH`s In core-3D and Tote code. The previous IN CORE-Tote codes have been utilized on the HP workstation or the IBM mainframe which are not easily accessible by the site engineers and require the complicated manipulation in the computer network system. This study developed the PC-version of IN CORE-3D and Tote codes available in plants, including an interface code linking the data measured by the in core instrument system (RIC-KIT system) to IN CORE code. These codes reduce the time to manage in core and increase the economic benefits. We installed the developed codes in Ulchin Unit 1 and 2 and actually applied them to the core power distribution measurement performed during Cycle 8 power escalation tests. The results satisfied all limits of Technical Specification very well. The major contents of this study can be categorized as follows. 1. Analysis of the in core management codes. (a) Analysis of flux mapping system and measurement reduction algorithm. (b) Analysis of the methodology of in core management codes. 2. Development and verification of PC-version in core management codes. (a) Development of the measured-data processing code (C2I). (b) Development of PC-version IN CORE code. (c) Development of PC-version Tote code (d) Verification of the developed codes. 3. Application to core physics test of Ulchin until cycle 8. (a) Power distribution measurement at 75% and 100%. (author). 14 refs., figs., tabs.
New cross sections for H on H2 collisional transitions
Zou, Qianxia
The cross section for H on H2 collisions is important for astrophysics as well as our understanding of the simple chemical systems. This is the simplest atom-molecule cross section. With a new H3 potential surface by Mielke et al., we have modified the ABC code by Skouteris, Castillo and Manolopoulos to calculate new cross sections. These cross sections are compared to previous cross section calculations.
The Proteomic Code: a molecular recognition code for proteins
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.
Recent developments in standardization of high efficiency video coding (HEVC)
Sullivan, Gary J.; Ohm, Jens-Rainer
2010-08-01
This paper reports on recent developments in video coding standardization, particularly focusing on the Call for Proposals (CfP) on video coding technology made jointly in January 2010 by ITU-T VCEG and ISO/IEC MPEG and the April 2010 responses to that Call. The new standardization initiative is referred to as High Efficiency Video Coding (HEVC) and its development has been undertaken by a new Joint Collaborative Team on Video Coding (JCT-VC) formed by the two organizations. The HEVC standard is intended to provide significantly better compression capability than the existing AVC (ITU-T H.264 | ISO/IEC MPEG-4 Part 10) standard. The results of the CfP are summarized, and the first steps towards the definition of the HEVC standard are described.
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.
Creating Models for the ORIGEN Codes
Louden, G. D.; Mathews, K. A.
1997-10-01
Our research focused on the development of a methodology for creating reactor-specific cross-section libraries for nuclear reactor and nuclear fuel cycle analysis codes available from the Radiation Safety Information Computational Center. The creation of problem-specific models allows more detailed anlaysis than is possible using the generic models provided with ORIGEN2 and ORIGEN-S. A model of the Ohio State University Research Reactor was created using the Coupled 1-D Shielding Analysis (SAS2H) module of the Modular Code System for Performing Standardized Computer Analysis for Licensing Evaluation (SCALE4.3). Six different reactor core models were compared to identify the effect of changing the SAS2H Larger Unit Cell on the predicted isotopic composition of spent fuel. Seven different power histories were then applied to a Core-Average model to determine the ability of ORIGEN-S to distinguish spent fuel produced under varying operating conditions. Several actinide and fission product concentrations were identified which were sensitive to the power history, however the majority of the isotope concentrations were not dependent on operating history.
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
Blind recognition of punctured convolutional codes
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...
Requirements of a Better Secure Program Coding
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.
Combinatorial polarization, code loops, and codes of high level
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.
On the Dimension of Graph Codes with Reed–Solomon Component Codes
Beelen, Peter; Høholdt, Tom; Pinero, Fernando
2013-01-01
We study a class of graph based codes with Reed-Solomon component codes as affine variety codes. We give a formulation of the exact dimension of graph codes in general. We give an algebraic description of these codes which makes the exact computation of the dimension of the graph codes easier....
76 FR 77549 - Lummi Nation-Title 20-Code of Laws-Liquor Code
2011-12-13
... Bureau of Indian Affairs Lummi Nation--Title 20--Code of Laws--Liquor Code AGENCY: Bureau of Indian...--Code of Laws--Liquor Code. The Code regulates and controls the possession, sale and consumption of... this Code allows for the possession and sale of alcoholic beverages within the Lummi...
Index coding via linear programming
Blasiak, Anna; Lubetzky, Eyal
2010-01-01
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. The basic setting of Index Coding encodes the side-information relation, the problem input, as an undirected graph and the fundamental parameter is the broadcast rate $\\beta$, the average communication cost per bit for sufficiently long messages (i.e. the non-linear vector capacity). Recent nontrivial bounds on $\\beta$ were derived from the study of other Index Coding capacities (e.g. the scalar capacity $\\beta_1$) by Bar-Yossef et al (FOCS'06), Lubetzky and Stav (FOCS'07) and Alon et al (FOCS'08). However, these indirect bounds shed little light on the behavior of $\\beta$ and its exact value remained unknown for \\emph{any graph} where Index Coding is nontrivial. Our main contribution is a hierarchy of linear programs whose solutions trap $\\beta$ between them. This enables a direct information-...
Driver Code for Adaptive Optics
Rao, Shanti
2007-01-01
A special-purpose computer code for a deformable-mirror adaptive-optics control system transmits pixel-registered control from (1) a personal computer running software that generates the control data to (2) a circuit board with 128 digital-to-analog converters (DACs) that generate voltages to drive the deformable-mirror actuators. This program reads control-voltage codes from a text file, then sends them, via the computer s parallel port, to a circuit board with four AD5535 (or equivalent) chips. Whereas a similar prior computer program was capable of transmitting data to only one chip at a time, this program can send data to four chips simultaneously. This program is in the form of C-language code that can be compiled and linked into an adaptive-optics software system. The program as supplied includes source code for integration into the adaptive-optics software, documentation, and a component that provides a demonstration of loading DAC codes from a text file. On a standard Windows desktop computer, the software can update 128 channels in 10 ms. On Real-Time Linux with a digital I/O card, the software can update 1024 channels (8 boards in parallel) every 8 ms.
LDPC Codes for Compressed Sensing
Dimakis, Alexandros G; Vontobel, Pascal O
2010-01-01
We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, \\emph{channel coding linear programming decoding (CC-LPD)}, which is a well-known relaxation of maximum-likelihood channel decoding for binary linear codes, and, on the other hand, \\emph{compressed sensing linear programming decoding (CS-LPD)}, also known as basis pursuit, which is a widely used linear programming relaxation for the problem of finding the sparsest solution of an under-determined system of linear equations. More specifically, we establish a tight connection between CS-LPD based on a zero-one measurement matrix over the reals and CC-LPD of the binary linear channel code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows the translation of performance guarantees from one setup to the other. The main message of this paper is that parity-check matrices of "good" channel codes can be used as provably "good" measurement ...
Quantifying the Performance of Quantum Codes
Cafaro, C; Lupo, C; Mancini, S
2011-01-01
We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and characterize the performance of both a repetition code and an error avoiding code in terms of the entanglement fidelity. We also consider the concatenation of such codes and show that it is especially advantageous in the regime of partial correlations. Finally, we characterize the effectiveness of the codes and their concatenation by means of the code entropy and find, in particular, that the effort required for recovering such codes decreases when the error probability decreases and the memory parameter increases. Second, we consider both symmetric and asymmetric depolarizing noisy quantum memory channels and perform quantum error correction via the five qubit stabilizer code. We characterize this code by means of the entanglement fidelity and the code entropy as function of...
Martins, Bo; Forchhammer, Søren
2000-01-01
of a halftone pattern dictionary.The decoder first decodes the gray-scale image. Then for each gray-scale pixel looks up the corresponding halftonepattern in the dictionary and places it in the reconstruction bitmap at the position corresponding to the gray-scale pixel. The coding method is inherently lossy......The emerging international standard for compression of bilevel images and bi-level documents, JBIG2,provides a mode dedicated for lossy coding of halftones. The encoding procedure involves descreening of the bi-levelimage into gray-scale, encoding of the gray-scale image, and construction...... and care must be taken to avoid introducing artifacts in the reconstructed image. We describe how to apply this coding method for halftones created by periodic ordered dithering, by clustered dot screening (offset printing), and by techniques which in effect dithers with blue noise, e.g., error diffusion...
Roadmap to Majorana surface codes
Plugge, S.; Landau, L. A.; Sela, E.; Altland, A.; Flensberg, K.; Egger, R.
2016-11-01
Surface codes offer a very promising avenue towards fault-tolerant quantum computation. We argue that two-dimensional interacting networks of Majorana bound states in topological superconductor/semiconductor heterostructures hold several key advantages in that direction, concerning both the hardware realization and the actual operation of the code. We here discuss how topologically protected logical qubits in this Majorana surface code architecture can be defined, initialized, manipulated, and read out. All physical ingredients needed to implement these operations are routinely used in topologically trivial quantum devices. By means of quantum interference terms in linear conductance measurements, single-electron pumping protocols, and gate-tunable tunnel barriers, the full set of quantum gates required for universal quantum computation can be achieved. In particular, we show that designated multistep pumping sequences via tunnel-coupled quantum dots realize high-fidelity ancilla states for phase gates.
ASME Code Efforts Supporting HTGRs
D.K. Morton
2011-09-01
In 1999, an international collaborative initiative for the development of advanced (Generation IV) reactors was started. The idea behind this effort was to bring nuclear energy closer to the needs of sustainability, to increase proliferation resistance, and to support concepts able to produce energy (both electricity and process heat) at competitive costs. The U.S. Department of Energy has supported this effort by pursuing the development of the Next Generation Nuclear Plant, a high temperature gas-cooled reactor. This support has included research and development of pertinent data, initial regulatory discussions, and engineering support of various codes and standards development. This report discusses the various applicable American Society of Mechanical Engineers (ASME) codes and standards that are being developed to support these high temperature gascooled reactors during construction and operation. ASME is aggressively pursuing these codes and standards to support an international effort to build the next generation of advanced reactors so that all can benefit.
ASME Code Efforts Supporting HTGRs
D.K. Morton
2010-09-01
In 1999, an international collaborative initiative for the development of advanced (Generation IV) reactors was started. The idea behind this effort was to bring nuclear energy closer to the needs of sustainability, to increase proliferation resistance, and to support concepts able to produce energy (both electricity and process heat) at competitive costs. The U.S. Department of Energy has supported this effort by pursuing the development of the Next Generation Nuclear Plant, a high temperature gas-cooled reactor. This support has included research and development of pertinent data, initial regulatory discussions, and engineering support of various codes and standards development. This report discusses the various applicable American Society of Mechanical Engineers (ASME) codes and standards that are being developed to support these high temperature gascooled reactors during construction and operation. ASME is aggressively pursuing these codes and standards to support an international effort to build the next generation of advanced reactors so that all can benefit.
Allele coding in genomic evaluation
Standen, Ismo; Christensen, Ole Fredslund
2011-01-01
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...
Martins, Bo; Forchhammer, Søren
1998-01-01
Presently, sequential tree coders are the best general purpose bilevel image coders and the best coders of halftoned images. The current ISO standard, Joint Bilevel Image Experts Group (JBIG), is a good example. A sequential tree coder encodes the data by feeding estimates of conditional...... probabilities to an arithmetic coder. The conditional probabilities are estimated from co-occurrence statistics of past pixels, the statistics are stored in a tree. By organizing the code length calculations properly, a vast number of possible models (trees) reflecting different pixel orderings can...... is one order of magnitude slower than JBIG, obtains excellent and highly robust compression performance. A multipass free tree coding scheme produces superior compression results for all test images. A multipass free template coding scheme produces significantly better results than JBIG for difficult...
MAGNETOHYDRODYNAMIC EQUATIONS (MHD GENERATION CODE
Francisco Frutos Alfaro
2017-04-01
Full Text Available A program to generate codes in Fortran and C of the full magnetohydrodynamic equations is shown. The program uses 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 magnetohydrodynamic equations to obtain a code that can be used as a seed for a magnetohydrodynamic code for numerical applications. As an example, we present part of the output of our programs for Cartesian coordinates and how to do the discretization.
ASME Code Efforts Supporting HTGRs
D.K. Morton
2012-09-01
In 1999, an international collaborative initiative for the development of advanced (Generation IV) reactors was started. The idea behind this effort was to bring nuclear energy closer to the needs of sustainability, to increase proliferation resistance, and to support concepts able to produce energy (both electricity and process heat) at competitive costs. The U.S. Department of Energy has supported this effort by pursuing the development of the Next Generation Nuclear Plant, a high temperature gas-cooled reactor. This support has included research and development of pertinent data, initial regulatory discussions, and engineering support of various codes and standards development. This report discusses the various applicable American Society of Mechanical Engineers (ASME) codes and standards that are being developed to support these high temperature gascooled reactors during construction and operation. ASME is aggressively pursuing these codes and standards to support an international effort to build the next generation of advanced reactors so that all can benefit.
Enforcing the use of API functions in Linux code
Lawall, Julia; Muller, Gilles; Palix, Nicolas Jean-Michel
2009-01-01
In the Linux kernel source tree, header files typically define many small functions that have a simple behavior but are critical to ensure readability, correctness, and maintainability. We have observed, however, that some Linux code does not use these functions systematically. In this paper, we...... in the header file include/linux/usb.h....
Zigzag Codes: MDS Array Codes with Optimal Rebuilding
Tamo, Itzhak; Bruck, Jehoshua
2011-01-01
MDS array codes are widely used in storage systems to protect data against erasures. We address the \\emph{rebuilding ratio} problem, namely, in the case of erasures, what is the fraction of the remaining information that needs to be accessed in order to rebuild \\emph{exactly} the lost information? It is clear that when the number of erasures equals the maximum number of erasures that an MDS code can correct then the rebuilding ratio is 1 (access all the remaining information). However, the interesting and more practical case is when the number of erasures is smaller than the erasure correcting capability of the code. For example, consider an MDS code that can correct two erasures: What is the smallest amount of information that one needs to access in order to correct a single erasure? Previous work showed that the rebuilding ratio is bounded between 1/2 and 3/4, however, the exact value was left as an open problem. In this paper, we solve this open problem and prove that for the case of a single erasure with ...
Signal Constellations for Multilevel Coded Modulation with Sparse Graph Codes
Cronie, Harm S.
2005-01-01
A method to combine error-correction coding and spectral efficient modulation for transmission over channels with Gaussian noise is presented. The method of modulation leads to a signal constellation in which the constellation symbols have a nonuniform distribution. This gives a so-called shape gain
The stellar atmosphere simulation code Bifrost. Code description and validation
Gudiksen, B. V.; Carlsson, M.; Hansteen, V. H.; Hayek, W.; Leenaarts, J.; Martínez-Sykora, J.
2011-07-01
Context. Numerical simulations of stellar convection and photospheres have been developed to the point where detailed shapes of observed spectral lines can be explained. Stellar atmospheres are very complex, and very different physical regimes are present in the convection zone, photosphere, chromosphere, transition region and corona. To understand the details of the atmosphere it is necessary to simulate the whole atmosphere since the different layers interact strongly. These physical regimes are very diverse and it takes a highly efficient massively parallel numerical code to solve the associated equations. Aims: The design, implementation and validation of the massively parallel numerical code Bifrost for simulating stellar atmospheres from the convection zone to the corona. Methods: The code is subjected to a number of validation tests, among them the Sod shock tube test, the Orzag-Tang colliding shock test, boundary condition tests and tests of how the code treats magnetic field advection, chromospheric radiation, radiative transfer in an isothermal scattering atmosphere, hydrogen ionization and thermal conduction. Results.Bifrost completes the tests with good results and shows near linear efficiency scaling to thousands of computing cores.
Martins, Bo; Forchhammer, Søren
2000-01-01
The emerging international standard for compression of bilevel images and bi-level documents, JBIG2,provides a mode dedicated for lossy coding of halftones. The encoding procedure involves descreening of the bi-levelimage into gray-scale, encoding of the gray-scale image, and construction...... and care must be taken to avoid introducing artifacts in the reconstructed image. We describe how to apply this coding method for halftones created by periodic ordered dithering, by clustered dot screening (offset printing), and by techniques which in effect dithers with blue noise, e.g., error diffusion....... Besides descreening and construction of the dictionary, we address graceful degradationand artifact removal....
Hybrid codes: Methods and applications
Winske, D. (Los Alamos National Lab., NM (USA)); Omidi, N. (California Univ., San Diego, La Jolla, CA (USA))
1991-01-01
In this chapter we discuss hybrid'' algorithms used in the study of low frequency electromagnetic phenomena, where one or more ion species are treated kinetically via standard PIC methods used in particle codes and the electrons are treated as a single charge neutralizing massless fluid. Other types of hybrid models are possible, as discussed in Winske and Quest, but hybrid codes with particle ions and massless fluid electrons have become the most common for simulating space plasma physics phenomena in the last decade, as we discuss in this paper.
An Analysis of Syndrome Coding
Amiruzzaman, Md; Abdullah-Al-Wadud, M.; Chung, Yoojin
In this paper a detail analysis is presented based on BCH syndrome coding for covert channel data hiding methods. The experimented technique is nothing but a syndrome coding algorithm with a coset based approach, analyzed results are showing that the examined method has more flexibility to choose coset, also providing less modification distortion caused by data hiding. Analyzed method presented by clear mathematical way. As it is mathematical equation dependent, hence analyzed results are showing that the analyzed method has fast computation ability and find perfect roots for modification.
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes
Hernando, Fernando; Høholdt, Tom; Ruano, Diego
2012-01-01
A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list...... decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units....
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes
Hernando, Fernando; Høholdt, Tom; Ruano, Diego
2012-01-01
A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units.
An Interactive Concatenated Turbo Coding System
Liu, Ye; Tang, Heng; Lin, Shu; Fossorier, Marc
1999-01-01
This paper presents a concatenated turbo coding system in which a Reed-Solomon outer code is concatenated with a binary turbo inner code. In the proposed system, the outer code decoder and the inner turbo code decoder interact to achieve both good bit error and frame error performances. The outer code decoder helps the inner turbo code decoder to terminate its decoding iteration while the inner turbo code decoder provides soft-output information to the outer code decoder to carry out a reliability-based soft- decision decoding. In the case that the outer code decoding fails, the outer code decoder instructs the inner code decoder to continue its decoding iterations until the outer code decoding is successful or a preset maximum number of decoding iterations is reached. This interaction between outer and inner code decoders reduces decoding delay. Also presented in the paper are an effective criterion for stopping the iteration process of the inner code decoder and a new reliability-based decoding algorithm for nonbinary codes.
Type Ⅱ codes over finite rings
DOUGHERTY; Steven; T
2010-01-01
In this paper,we generalize the concept of Type Ⅱ codes to arbitrary finite rings. We focus on Type Ⅱ codes over finite chain rings and use the Chinese Remainder Theorem on these codes to study Type Ⅱ codes over principal ideal rings.
SPARSE SEQUENCE CONSTRUCTION OF LDPC CODES
无
2005-01-01
This letter proposes a novel and simple construction of regular Low-Density Parity-Check (LDPC) codes using sparse binary sequences. It utilizes the cyclic cross correlation function of sparse sequences to generate codes with girth8. The new codes perform well using the sumproduct decoding. Low encodingcomplexity can also be achieved due to the inherent quasi-cyclic structure of the codes.
TOCAR: a code to interface FOURACES - CARNAVAL
Panini, G.C.; Vaccari, M.
1981-08-01
The TOCAR code, written in FORTRAN-IV for IBM-370 computers, is an interface between the output of the FOURACES code and the CARNAVAL binary format for the multigroup neutron cross-sections, scattering matrices and related quantities. Besides the description of the code and the how to use, the report contains the code listing.
The Minimum Distance of Graph Codes
Høholdt, Tom; Justesen, Jørn
2011-01-01
We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...
Channel coding techniques for wireless communications
Deergha Rao, K
2015-01-01
The book discusses modern channel coding techniques for wireless communications such as turbo codes, low-density parity check (LDPC) codes, space–time (ST) coding, RS (or Reed–Solomon) codes and convolutional codes. Many illustrative examples are included in each chapter for easy understanding of the coding techniques. The text is integrated with MATLAB-based programs to enhance the understanding of the subject’s underlying theories. It includes current topics of increasing importance such as turbo codes, LDPC codes, Luby transform (LT) codes, Raptor codes, and ST coding in detail, in addition to the traditional codes such as cyclic codes, BCH (or Bose–Chaudhuri–Hocquenghem) and RS codes and convolutional codes. Multiple-input and multiple-output (MIMO) communications is a multiple antenna technology, which is an effective method for high-speed or high-reliability wireless communications. PC-based MATLAB m-files for the illustrative examples are provided on the book page on Springer.com for free dow...
A neutron spectrum unfolding code based on iterative procedures
Ortiz R, J. M.; Vega C, H. R., E-mail: morvymm@yahoo.com.mx [Universidad Autonoma de Zacatecas, Unidad Academica de Ingenieria Electrica, Apdo. Postal 336, 98000 Zacatecas (Mexico)
2012-10-15
In this work, the version 3.0 of the neutron spectrum unfolding code called Neutron Spectrometry and Dosimetry from Universidad Autonoma de Zacatecas (NSDUAZ), is presented. This code was designed in a graphical interface under the LabVIEW programming environment and it is based on the iterative SPUNIT iterative algorithm, using as entrance data, only the rate counts obtained with 7 Bonner spheres based on a {sup 6}Lil(Eu) neutron detector. The main features of the code are: it is intuitive and friendly to the user; it has a programming routine which automatically selects the initial guess spectrum by using a set of neutron spectra compiled by the International Atomic Energy Agency. Besides the neutron spectrum, this code calculates the total flux, the mean energy, H(10), h(10), 15 dosimetric quantities for radiation protection porpoises and 7 survey meter responses, in four energy grids, based on the International Atomic Energy Agency compilation. This code generates a full report in html format with all relevant information. In this work, the neutron spectrum of a {sup 241}AmBe neutron source on air, located at 150 cm from detector, is unfolded. (Author)
Overview of CODE V development
Harris, Thomas I.
1991-01-01
This paper is part of a session that is aimed at briefly describing some of today''s optical design software packages with emphasis on the program''s philosophy and technology. CODE V is the ongoing result of a development process that began in the 1960''s it is now the result of many people''s efforts. This paper summarizes the roots of the program some of its history dominant philosophies and technologies that have contributed to its usefulness and some that drive its continued development. ROOTS OF CODE V Conceived in the early 60''s This was at a time when there was skepticism that " automatic design" could design lenses equal or better than " hand" methods. The concepts underlying CODE V and its predecessors were based on ten years of experience and exposure to the problems of a group of lens designers in a design-for-manufacture environment. The basic challenge was to show that lens design could be done better easier and faster by high quality computer-assisted design tools. The earliest development was for our own use as an engineering services organization -an in-house tool for custom design. As a tool it had to make us efficient in providing lens design and engineering services as a self-sustaining business. PHILOSOPHY OF OVTIM!ZATION IN CODE V Error function formation Based on experience as a designer we felt very strongly that there should be a clear separation of
Corden, Jeffry L
2016-01-21
In this issue of Molecular Cell, Schüller et al. (2016) and Suh et al. (2016) describe genetic and mass spectrometry methodologies for mapping phosphorylation sites on the tandem repeats of the RNA polymerase II CTD. The results suggest that the CTD Code may be simpler than expected.
Coding as literacy metalithikum IV
Bühlmann, Vera; Moosavi, Vahid
2015-01-01
Recent developments in computer science, particularly "data-driven procedures" have opened a new level of design and engineering. This has also affected architecture. The publication collects contributions on Coding as Literacy by computer scientists, mathematicians, philosophers, cultural theorists, and architects. "Self-Organizing Maps" (SOM) will serve as the concrete reference point for all further discussions.
CVSscan : Visualization of Code Evolution
Voinea, Lucian; Telea, Alex; Wijk, Jarke J. van
2005-01-01
During the life cycle of a software system, the source code is changed many times. We study how developers can be enabled to get insight in these changes, in order to understand the status, history and structure better, as well as for instance the roles played by various contributors. We present CVS
Corrections to the Vienna Code
Since the publication of the Vienna Code, several errors have been noticed. Most are minor punctuation or cross-referencing errors, or, in the Appendices, inconsistencies in abbreviation, but there was one important omission from Art. 37, the misspelling of two specific epithets and the transpositio...
Coded continuous wave meteor radar
Vierinen, Juha; Chau, Jorge L.; Pfeffer, Nico; Clahsen, Matthias; Stober, Gunter
2016-03-01
The concept of a coded continuous wave specular meteor radar (SMR) is described. The radar uses a continuously transmitted pseudorandom phase-modulated waveform, which has several advantages compared to conventional pulsed SMRs. The coding avoids range and Doppler aliasing, which are in some cases problematic with pulsed radars. Continuous transmissions maximize pulse compression gain, allowing operation at lower peak power than a pulsed system. With continuous coding, the temporal and spectral resolution are not dependent on the transmit waveform and they can be fairly flexibly changed after performing a measurement. The low signal-to-noise ratio before pulse compression, combined with independent pseudorandom transmit waveforms, allows multiple geographically separated transmitters to be used in the same frequency band simultaneously without significantly interfering with each other. Because the same frequency band can be used by multiple transmitters, the same interferometric receiver antennas can be used to receive multiple transmitters at the same time. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large-scale multi-static network of meteor radar transmitters and receivers. Such a system would be useful for increasing the number of meteor detections to obtain improved meteor radar data products.
QR Codes: Taking Collections Further
Ahearn, Caitlin
2014-01-01
With some thought and direction, QR (quick response) codes are a great tool to use in school libraries to enhance access to information. From March through April 2013, Caitlin Ahearn interned at Sanborn Regional High School (SRHS) under the supervision of Pam Harland. As a result of Harland's un-Deweying of the nonfiction collection at SRHS,…
Surgical navigation with QR codes
Katanacho Manuel
2016-09-01
Full Text Available The presented work is an alternative to established measurement systems in surgical navigation. The system is based on camera based tracking of QR code markers. The application uses a single video camera, integrated in a surgical lamp, that captures the QR markers attached to surgical instruments and to the patient.
Continuous Non-malleable Codes
Faust, Sebastian; Mukherjee, Pratyay; Nielsen, Jesper Buus
2014-01-01
is based on the inner product function, collision-resistant hashing and non-interactive zero-knowledge proofs of knowledge and requires an untamperable common reference string. We apply continuous non-malleable codes to protect arbitrary cryptographic primitives against tampering attacks. Previous...
Unconditional Continuous Variable Dense Coding
Ralph, T C
2002-01-01
We investigate the conditions under which unconditional dense coding can be achieved using continuous variable entanglement. We consider the effect of entanglement impurity and detector efficiency and discuss experimental verification. We conclude that the requirements for a strong demonstration are not as stringent as previously thought and are within the reach of present technology.
Network Coded Software Defined Networking
Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani
2015-01-01
Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage buffe...
Reusable State Machine Code Generator
Hoffstadt, A. A.; Reyes, C.; Sommer, H.; Andolfato, L.
2010-12-01
The State Machine model is frequently used to represent the behaviour of a system, allowing one to express and execute this behaviour in a deterministic way. A graphical representation such as a UML State Chart diagram tames the complexity of the system, thus facilitating changes to the model and communication between developers and domain experts. We present a reusable state machine code generator, developed by the Universidad Técnica Federico Santa María and the European Southern Observatory. The generator itself is based on the open source project architecture, and uses UML State Chart models as input. This allows for a modular design and a clean separation between generator and generated code. The generated state machine code has well-defined interfaces that are independent of the implementation artefacts such as the middle-ware. This allows using the generator in the substantially different observatory software of the Atacama Large Millimeter Array and the ESO Very Large Telescope. A project-specific mapping layer for event and transition notification connects the state machine code to its environment, which can be the Common Software of these projects, or any other project. This approach even allows to automatically create tests for a generated state machine, using techniques from software testing, such as path-coverage.
Code Properties from Holographic Geometries
Pastawski, Fernando; Preskill, John
2017-04-01
Almheiri, Dong, and Harlow [J. High Energy Phys. 04 (2015) 163., 10.1007/JHEP04(2015)163] 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 that 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 quantum gravity in AdS space at distance scales that are small compared to the AdS curvature radius.
Code Properties from Holographic Geometries
Fernando Pastawski
2017-05-01
Full Text Available Almheiri, Dong, and Harlow [J. High Energy Phys. 04 (2015 163.JHEPFG1029-847910.1007/JHEP04(2015163] 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 that 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 quantum gravity in AdS space at distance scales that are small compared to the AdS curvature radius.
2D arc-PIC code description: methods and documentation
Timko, Helga
2011-01-01
Vacuum discharges are one of the main limiting factors for future linear collider designs such as that of the Compact LInear Collider. To optimize machine efficiency, maintaining the highest feasible accelerating gradient below a certain breakdown rate is desirable; understanding breakdowns can therefore help us to achieve this goal. As a part of ongoing theoretical research on vacuum discharges at the Helsinki Institute of Physics, the build-up of plasma can be investigated through the particle-in-cell method. For this purpose, we have developed the 2D Arc-PIC code introduced here. We present an exhaustive description of the 2D Arc-PIC code in two parts. In the first part, we introduce the particle-in-cell method in general and detail the techniques used in the code. In the second part, we provide a documentation and derivation of the key equations occurring in the code. The code is original work of the author, written in 2010, and is therefore under the copyright of the author. The development of the code h...
Transversal Clifford gates on folded surface codes
Moussa, Jonathan E.
2016-10-01
Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and correct errors, while color codes have transversal Clifford gates and better code efficiency in the number of physical qubits needed to achieve a given code distance. A formal equivalence exists between color codes and folded surface codes, but it does not guarantee the transferability of any of these favorable properties. However, the equivalence does imply the existence of constant-depth circuit implementations of logical Clifford gates on folded surface codes. We achieve and improve this result by constructing two families of folded surface codes with transversal Clifford gates. This construction is presented generally for qudits of any dimension. The specific application of these codes to universal quantum computation based on qubit fusion is also discussed.
Understanding Code Patterns - Analysis, Interpretation & Measurement
Dundas, Jitesh
2011-01-01
This research paper aims to find, analyze and understand code patterns in any software system and measure its quality by defining standards and proposing a formula for the same. Every code that is written can be divided into different code segments, each having its own impact on the overall system. We can analyze these code segments to get the code quality. The measures used in this paper include Lines of Code, Number of calls made by a module, Execution time, the system knowledge of user and developers, the use of generalization, inheritance, reusability and other object-oriented concepts. The entire software code is divided into code snippets, based on the logic that they implement. Each of these code snippets has an impact. This measure is called Impact Factor and is valued by the software developer and/or other system stakeholders. Efficiency = (Code Area / Execution Time) * Qr
A class of Sudan-decodable codes
Nielsen, Rasmus Refslund
2000-01-01
In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based...... on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made....
On Code Parameters and Coding Vector Representation for Practical RLNC
Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank
2011-01-01
RLNC provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the encoding vector. Increasing the field size and generation size presents a fundamental trade-off between packet-based throughput...... and operational overhead. On the one hand, decreasing the probability of transmitting redundant packets is beneficial for throughput and, consequently, reduces transmission energy. On the other hand, the decoding complexity and amount of header overhead increase with field size and generation length, leading...... to higher energy consumption. Therefore, the optimal trade-off is system and topology dependent, as it depends on the cost in energy of performing coding operations versus transmitting data. We show that moderate field sizes are the correct choice when trade-offs are considered. The results show that sparse...
Code Carnivals: resuscitating Code Blue training with accelerated learning.
Keys, Vicky A; Malone, Peggy; Brim, Carla; Schoonover, Heather; Nordstrom, Cindy; Selzler, Melissa
2009-12-01
Nurses in the hospital setting must be knowledgeable about resuscitation procedures and proficient in the delivery of care during an emergency. They must be ready to implement their knowledge and skills at a moment's notice. A common dilemma for many nurses is that cardiopulmonary emergencies (Code Blues) are infrequent occurrences. Therefore, how do nurses remain competent and confident in their implementation of emergency skills while having limited exposure to the equipment and minimal experience in emergency situations? A team of nurse educators at a regional medical center in Washington State applied adult learning theory and accelerated learning techniques to develop and present a series of learning activities to enhance the staff's familiarity with emergency equipment and procedures. The series began with a carnival venue that provided hands-on practice and review of emergency skills and was reinforced with subsequent random unannounced code drills led by both educators and charge nurses. Copyright 2009, SLACK Incorporated.
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...
Evaluation Codes from an Affine Veriety Code Perspective
Geil, Hans Olav
2008-01-01
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 4.2 Affine variety codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 4.3 Some Gr¨obner basis theoretical tools . . . . . . . . . . . . . . . . . . . . . . . 155 4.4 A bound on the minimum distance of C(I,L) . . . . . . . . . . . . . . . . . . 157 4.5 The Feng-Rao bound...... for C(I,L)? . . . . . . . . . . . . . . . . . . . . . . . . 160 4.6 Using weighted degree orderings . . . . . . . . . . . . . . . . . . . . . . . . . 163 4.7 The order domain conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . 168 4.8 Weight functions and order domains...
A NOVEL VARIABLE-LENGTH CODE FOR ROBUST VIDEO CODING
Ma Linhua; Chang Yilin
2006-01-01
A novel Variable-Length Code (VLC), called Alternate VLC (AVLC), is proposed in this letter,which employs two types of VLC to encode source symbols alternately. Its advantage is that it can not only stop the symbol error propagation effect, but also correct symbol insertion errors and avoid symbol deletion errors, so the original sequence number of symbols can be kept correctly, which is very important in video communication.
Ball, J.; Glowa, G.; Wren, J. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada); Ewig, F. [GRS Koln (Germany); Dickenson, S. [AEAT, (United Kingdom); Billarand, Y.; Cantrel, L. [IPSN (France); Rydl, A. [NRIR (Czech Republic); Royen, J. [OECD/NEA (France)
2001-11-01
This report describes the results of the second phase of International Standard Problem (ISP) 41, an iodine behaviour code comparison exercise. The first phase of the study, which was based on a simple Radioiodine Test Facility (RTF) experiment, demonstrated that all of the iodine behaviour codes had the capability to reproduce iodine behaviour for a narrow range of conditions (single temperature, no organic impurities, controlled pH steps). The current phase, a parametric study, was designed to evaluate the sensitivity of iodine behaviour codes to boundary conditions such as pH, dose rate, temperature and initial I{sup -} concentration. The codes used in this exercise were IODE(IPSN), IODE(NRIR), IMPAIR(GRS), INSPECT(AEAT), IMOD(AECL) and LIRIC(AECL). The parametric study described in this report identified several areas of discrepancy between the various codes. In general, the codes agree regarding qualitative trends, but their predictions regarding the actual amount of volatile iodine varied considerably. The largest source of the discrepancies between code predictions appears to be their different approaches to modelling the formation and destruction of organic iodides. A recommendation arising from this exercise is that an additional code comparison exercise be performed on organic iodide formation, against data obtained front intermediate-scale studies (two RTF (AECL, Canada) and two CAIMAN facility, (IPSN, France) experiments have been chosen). This comparison will allow each of the code users to realistically evaluate and improve the organic iodide behaviour sub-models within their codes. (author)
Code-excited linear predictive coding of multispectral MR images
Hu, Jian-Hong; Wang, Yao; Cahill, Patrick
1996-02-01
This paper reports a multispectral code excited linear predictive coding method for the compression of well-registered multispectral MR images. Different linear prediction models and the adaptation schemes have been compared. The method which uses forward adaptive autoregressive (AR) model has proven to achieve a good compromise between performance, complexity and robustness. This approach is referred to as the MFCELP method. Given a set of multispectral images, the linear predictive coefficients are updated over non-overlapping square macroblocks. Each macro-block is further divided into several micro-blocks and, the best excitation signals for each microblock are determined through an analysis-by-synthesis procedure. To satisfy the high quality requirement for medical images, the error between the original images and the synthesized ones are further specified using a vector quantizer. The MFCELP method has been applied to 26 sets of clinical MR neuro images (20 slices/set, 3 spectral bands/slice, 256 by 256 pixels/image, 12 bits/pixel). It provides a significant improvement over the discrete cosine transform (DCT) based JPEG method, a wavelet transform based embedded zero-tree wavelet (EZW) coding method, as well as the MSARMA method we developed before.
FARO and KROTOS code simulation and analysis at JRC Ispra
Annunziato, A.; Yerkess, A.; Addabbo, C. [European Commission-Joint Research Centre, Inst. for Systems, Informatics and Safety, 21020 Ispra (Italy)
1998-01-01
The paper summarizes relevant results from the pre and post test calculations of fuel coolant interaction and quenching tests performed in the FARO and KROTOS test facilities. The main analytical tools adopted at JRC Ispra are the COMETA and the TEXAS codes. COMETA pre and post test calculations of FARO Test L-20 as well as an application of the code to KROTOS test facility are presented. The analysis provides the need to account for H{sub 2} generation models into the pre-mixing calculations. In addition salient results from the application of TEXAS to FARO and KROTOS tests are shown. (author)
Performance Comparison of Turbo Codes with other Forward Error Correcting Codes
Kapil Narwal
2012-03-01
Full Text Available : In this paper, we compare performance of turbo codes with different FEC codes presented in literatures. Performance and overall coding gain are compared for Convolutional codes, CTC, TPC and LDPC codes. Turbo Codes tend to work best at low code rates and not so well at high code rates. LDPC’s work very well at high code rates and at low code rates LDPC’s Performance can be very close to Shannon capacity. The decoder complexity of TPC is much less than the Convolutional Turbo Codes (CTC. The performance of TPC is close to capacity for higher code rates, but is not great for low code rates where CTC outperforms.Index terms —
Fuel burnup analysis for IRIS reactor using MCNPX and WIMS-D5 codes
Amin, E. A.; Bashter, I. I.; Hassan, Nabil M.; Mustafa, S. S.
2017-02-01
International Reactor Innovative and Secure (IRIS) reactor is a compact power reactor designed with especial features. It contains Integral Fuel Burnable Absorber (IFBA). The core is heterogeneous both axially and radially. This work provides the full core burn up analysis for IRIS reactor using MCNPX and WIMDS-D5 codes. Criticality calculations, radial and axial power distributions and nuclear peaking factor at the different stages of burnup were studied. Effective multiplication factor values for the core were estimated by coupling MCNPX code with WIMS-D5 code and compared with SAS2H/KENO-V code values at different stages of burnup. The two calculation codes show good agreement and correlation. The values of radial and axial powers for the full core were also compared with published results given by SAS2H/KENO-V code (at the beginning and end of reactor operation). The behavior of both radial and axial power distribution is quiet similar to the other data published by SAS2H/KENO-V code. The peaking factor values estimated in the present work are close to its values calculated by SAS2H/KENO-V code.
Adkins, Megan; Wajciechowski, Misti R.; Scantling, Ed
2013-01-01
Quick response codes, better known as QR codes, are small barcodes scanned to receive information about a specific topic. This article explains QR code technology and the utility of QR codes in the delivery of physical education instruction. Consideration is given to how QR codes can be used to accommodate learners of varying ability levels as…