r-MDR CODES AND Pr-MDS CODES ON CARTESIAN PRODUCT CODES%卡氏积码的r-MDR码与P-MDS码
Institute of Scientific and Technical Information of China (English)
唐刚
2012-01-01
In this paper, the r-th generalized Hamming weight with respect to rank and the r-th generalized singleton bound are studied. According to that the subcodes of Cartesian codes are Cartesian codes, we can prove that Cartesian product code of r-MDR(Pr-MDR) code is r-MDR(Pr-MDR) code. Meanwhile the part inverse proposition for the results are given.%本文研究了卡氏积码的r-广义Hamming重量计算公式和广义Singleton界,利用r-卡氏积码的子码仍为卡氏积码,证明了r-MDR码或P-MDR码的卡氏积码仍为r-MDR码或P-MDR码.同时也给出了这一个结果的部分逆命题.
A revisit to the GNSS-R code range precision
Germain, O
2006-01-01
We address the feasibility of a GNSS-R code-altimetry space mission and more specifically a dominant term of its error budget: the reflected-signal range precision. This is the RMS error on the reflected-signal delay, as estimated by waveform retracking. So far, the approach proposed by [Lowe et al., 2002] has been the state of the art to theoretically evaluate this precision, although known to rely on strong assumptions (e.g., no speckle noise). In this paper, we perform a critical review of this model and propose an improvement based on the Cramer-Rao Bound (CRB) approach. We derive closed-form expressions for both the direct and reflected signals. The performance predicted by CRB analysis is about four times worse for typical space mission scenarios. The impact of this result is discussed in the context of two classes of GNSS-R applications: mesoscale oceanography and tsunami detection.
BSR: B-spline atomic R-matrix codes
Zatsarinny, Oleg
2006-02-01
BSR is a general program to calculate atomic continuum processes using the B-spline R-matrix method, including electron-atom and electron-ion scattering, and radiative processes such as bound-bound transitions, photoionization and polarizabilities. The calculations can be performed in LS-coupling or in an intermediate-coupling scheme by including terms of the Breit-Pauli Hamiltonian. New version program summaryTitle of program: BSR Catalogue identifier: ADWY Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWY Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computers on which the program has been tested: Microway Beowulf cluster; Compaq Beowulf cluster; DEC Alpha workstation; DELL PC Operating systems under which the new version has been tested: UNIX, Windows XP Programming language used: FORTRAN 95 Memory required to execute with typical data: Typically 256-512 Mwords. Since all the principal dimensions are allocatable, the available memory defines the maximum complexity of the problem No. of bits in a word: 8 No. of processors used: 1 Has the code been vectorized or parallelized?: no No. of lines in distributed program, including test data, etc.: 69 943 No. of bytes in distributed program, including test data, etc.: 746 450 Peripherals used: scratch disk store; permanent disk store Distribution format: tar.gz Nature of physical problem: This program uses the R-matrix method to calculate electron-atom and electron-ion collision processes, with options to calculate radiative data, photoionization, etc. The calculations can be performed in LS-coupling or in an intermediate-coupling scheme, with options to include Breit-Pauli terms in the Hamiltonian. Method of solution: The R-matrix method is used [P.G. Burke, K.A. Berrington, Atomic and Molecular Processes: An R-Matrix Approach, IOP Publishing, Bristol, 1993; P.G. Burke, W.D. Robb, Adv. At. Mol. Phys. 11 (1975) 143; K.A. Berrington, W.B. Eissner, P.H. Norrington, Comput
有限环上r-MDR码与r-MDS码%r-MDR CODES AND r-MDS CODES OVER FINITE RINGS
Institute of Scientific and Technical Information of China (English)
张晓燕
2011-01-01
本文研究了有限环卜r-MDR码与r-MDS码.利用主理想环CRT(R1,R2,…,R8)上的r-MDR码或Pr-MDS码CRT(C1,C2,…,G),得到了某个链环R2上的码C2也足r-MDR 码或Pr-MDR码.特别地,对于有限链环上的码C,给出了它的挠码Tori(C)为r-MDR码与r-MDS码的条件.
THE RANKS OF CYCLIC AND NEGACYCLIC CODES OVER THE FINITE RING R
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
The ranks of cyclic and negacyclic codes over the finite chain ring R as well as their minimal generating sets are defined, and then the expression forms we presented by studying the structures of cyclic and negacyclic codes over the finite chain ring R. Through the paper, it is assumed that the length of codes n can not be divided by the characteristic of R.
(R, S)-Norm Information Measure and A Relation Between Coding and Questionnaire Theory
Joshi, Rajesh; Kumar, Satish
2016-10-01
In this paper, we introduce a quantity which is called (R, S)-norm entropy and discuss some of its major properties in comparison with Shannon’s and other entropies known in the literature. Further, we give an application of (R, S)-norm entropy in coding theory and a coding theorem analogous to the ordinary coding theorem for a noiseless channel. The theorem states that the proposed entropy is the lower bound of mean code word length. Further, we give an application of (R, S)-norm entropy and noiseless coding theorem in questionnaire theory. We show that the relationship between noiseless coding theorem and questionnaire theory through a charging scheme based on the resolution of questions and lower bound on the measure of the charge can also be obtained.
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)
SAMDIST: A Computer Code for Calculating Statistical Distributions for R-Matrix Resonance Parameters
Energy Technology Data Exchange (ETDEWEB)
Leal, L.C.
1995-01-01
The: SAMDIST computer code has been developed to calculate distribution of resonance parameters of the Reich-Moore R-matrix type. The program assumes the parameters are in the format compatible with that of the multilevel R-matrix code SAMMY. SAMDIST calculates the energy-level spacing distribution, the resonance width distribution, and the long-range correlation of the energy levels. Results of these calculations are presented in both graphic and tabular forms.
SAMDIST A Computer Code for Calculating Statistical Distributions for R-Matrix Resonance Parameters
Leal, L C
1995-01-01
The: SAMDIST computer code has been developed to calculate distribution of resonance parameters of the Reich-Moore R-matrix type. The program assumes the parameters are in the format compatible with that of the multilevel R-matrix code SAMMY. SAMDIST calculates the energy-level spacing distribution, the resonance width distribution, and the long-range correlation of the energy levels. Results of these calculations are presented in both graphic and tabular forms.
speedR: An R Package for Interactive Data Import, Filtering and Ready-to-Use Code Generation
Directory of Open Access Journals (Sweden)
Ilhami Visne
2012-10-01
Full Text Available Emerging technologies in the experimental sciences have opened the way for large-scale experiments. Such experiments generate ever growing amounts of data from which researchers need to extract relevant pieces for subsequent analysis. R offers a great environment for statistical analysis. However, due to the diversity of possible data sources and formats, data preprocessing and import can be time consuming especially with data that require user interaction such as editing, filtering or formatting. Writing a code for these tasks can be time-consuming, error prone and rather complex. We present speedR, an R-package for interactive data import, filtering and code generation in order to address these needs. Using speedR, researchers can import new data, make basic corrections, examine current R session objects, open them in the speedR environment for filtering (subsetting, put the filtered data back into R, and even create new R functions with applied import and filtering constraints to speed up their productivity.
R-Matrix Codes for Charged-particle Induced Reactionsin the Resolved Resonance Region
Energy Technology Data Exchange (ETDEWEB)
Leeb, Helmut [Technical Univ. of Wien, Vienna (Austria); Dimitriou, Paraskevi [Intl Atomic Energy Agency (IAEA), Vienna (Austria); Thompson, Ian J. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2017-01-01
A Consultant’s Meeting was held at the IAEA Headquarters, from 5 to 7 December 2016, to discuss the status of R-matrix codes currently used in calculations of charged-particle induced reaction cross sections at low energies. The meeting was a follow-up to the R-matrix Codes meeting held in December 2015, and served the purpose of monitoring progress in: the development of a translation code to enable exchange of input/output parameters between the various codes in different formats, fitting procedures and treatment of uncertainties, the evaluation methodology, and finally dissemination. The details of the presentations and technical discussions, as well as additional actions that were proposed to achieve all the goals of the meeting are summarized in this report.
miR-148 targets human DNMT3b protein coding region.
Duursma, Anja M; Kedde, Martijn; Schrier, Mariette; le Sage, Carlos; Agami, Reuven
2008-05-01
MicroRNAs (miRNAs) are small noncoding RNA molecules of 20-24 nucleotides that regulate gene expression. In animals, miRNAs form imperfect interactions with sequences in the 3' Untranslated region (3'UTR) of mRNAs, causing translational inhibition and mRNA decay. In contrast, plant miRNAs mostly associate with protein coding regions. Here we show that human miR-148 represses DNA methyltransferase 3b (Dnmt3b) gene expression through a region in its coding sequence. This region is evolutionary conserved and present in the Dnmt3b splice variants Dnmt3b1, Dnmt3b2, and Dnmt3b4, but not in the abundantly expressed Dnmt3b3. Whereas overexpression of miR-148 results in decreased DNMT3b1 expression, short-hairpin RNA-mediated miR-148 repression leads to an increase in DNMT3b1 expression. Interestingly, mutating the putative miR-148 target site in Dnmt3b1 abolishes regulation by miR-148. Moreover, endogenous Dnmt3b3 mRNA, which lacks the putative miR-148 target site, is resistant to miR-148-mediated regulation. Thus, our results demonstrate that the coding sequence of Dnmt3b mediates regulation by the miR-148 family. More generally, we provide evidence that coding regions of human genes can be targeted by miRNAs, and that such a mechanism might play a role in determining the relative abundance of different splice variants.
FRCAMB: An $f(R)$ Code for Anisotropies in the Microwave Background
Xu, Lixin
2015-01-01
An $f(R)$ gravity model is proposed to realize a late time accelerated expansion of our Universe. To test the viability of an $f(R)$ gravity model through cosmic observations, the background evolution and the Einstein-Boltzmann equation should be solved for studying the effects on the cosmic microwave background power spectrum and on the matter power spectrum. In the market, we already have the modified versions of {\\bf CAMB} code, for instance {\\bf EFTCAMB} and {\\bf MGCAMB}. However, in these publicly available Einstein-Boltzmann codes, a specific background cosmology, for example the $\\Lambda$CDM or $w$CDM, is assumed. This assumption would be non-proper for a specific $f(R)$ model where the background evolution may be different from a $\\Lambda$CDM cosmology. Therefore the main task for this paper is to present a code to calculate the anisotropies in the microwave background for any $f(R)$ gravity model based on {\\bf CAMB} code, i.e. {\\bf FRCAMB}, where the background and perturbation evolutions are include...
Verification of the code DYN3D/R with the help of international benchmarks
Energy Technology Data Exchange (ETDEWEB)
Grundmann, U.; Rohde, U.
1997-10-01
Different benchmarks for reactors with quadratic fuel assemblies were calculated with the code DYN3D/R. In this report comparisons with the results of the reference solutions are carried out. The results of DYN3D/R and the reference calculation for the eigenvalue k{sub eff} and the power distribution are shown for the steady-state 3-dimensional IAEA-Benchmark. The results of NEACRP-Benchmarks on control rod ejections in a standard PWR were compared with the reference solutions published by the NEA Data Bank. For assessing the accuracy of DYN3D/R results in comparison to other codes the deviations to the reference solutions are considered. Detailed comparisons with the published reference solutions of the NEA-NSC Benchmarks on uncontrolled withdrawal of control rods are made. The influence of the axial nodalization is also investigated. All in all, a good agreement of the DYN3D/R results with the reference solutions can be seen for the considered benchmark problems. (orig.) [Deutsch] Verschiedene Benchmarks fuer Reaktoren mit quadratischen Brennelementen wurden mit dem Code DYN3D/R berechnet. In diesem Bericht erfolgen Vergleiche mit den Ergebnissen der Referenzloesungen. Die Ergebnisse von DYN3D/R und der Referenzrechnung fuer Eigenwert k{sub eff} und Leistungsverteilung des stationaeren 3-dimensionalen IAEA-Benchmarks werden dargestellt. Die Ergebnisse der NEACRP-Benchmarks fuer die Auswuerfe von Steuerstaeben in einem typischen DWR werden mit den von der NEA Data Bank veroeffentlichten Referenzloesungen verglichen. Zur Einschaetzung der Genauigkeit der DYN3D/R Resultate im Vergleich zu anderen Rechenprogrammen werden die Abweichungen zu den Referenzloesungen betrachtet. Detaillierte Vergleiche mit den Referenzloesungen erfolgen fuer die NEA-NSC Benchmarks zum unkontrollierten Ausfahren von Steuerstaeben. Dabei wird der Einfluss der axialen Nodalisierung untersucht. Insgesamt wird eine gute Uebereinstimmung der DYN3D/R Resultate mit den Referenzloesungen fuer die
miR-148 targets human DNMT3b protein coding region
Duursma, Anja M.; Kedde, Martijn; Schrier, Mariette; le Sage, Carlos; Agami, Reuven
2008-01-01
MicroRNAs (miRNAs) are small noncoding RNA molecules of 20–24 nucleotides that regulate gene expression. In animals, miRNAs form imperfect interactions with sequences in the 3′ Untranslated region (3′UTR) of mRNAs, causing translational inhibition and mRNA decay. In contrast, plant miRNAs mostly associate with protein coding regions. Here we show that human miR-148 represses DNA methyltransferase 3b (Dnmt3b) gene expression through a region in its coding sequence. This region is evolutionary ...
Code R: Redesigning Hospital-wide Peer Review for Academic Hospitals.
Kim, Daniel I; Au, Huy; Fargo, Ramiz; Garrison, Roger C; Thompson, Gary; Yu, Minho; Loo, Lawrence K
2016-09-01
In most health care institutions, physician peer review is the primary method for maintaining and measuring physician competency and quality of care issues. However, many teaching hospitals do not have a method of tracking resident trainees' involvement in adverse cases. At the study institution, Code R was introduced as a measure to capture resident trainee involvement in the hospital-wide peer review process. The authors conducted a retrospective review of all peer review cases from January 2008 to December 2011 in an academic medical center and determined the quantity and type of resident errors that occurred compared to attending faculty. The Accreditation Council for Graduate Medical Education's core competencies served as a framework to categorize quality of care errors. The addition of Code R to the peer review process can be readily adopted by other institutions to help improve resident education, facilitate faculty supervision, and potentially improve patient safety.
DEFF Research Database (Denmark)
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....
MacWillia ms Identities of Linear Codes Over Ring R+vR+v2R%环R＋vR＋v2 R上线性码的Mac Wi lli ams恒等式
Institute of Scientific and Technical Information of China (English)
朱士信; 黄磊
2016-01-01
By constructing gray map,linear codes over ring R+vR+v2 R are studied.The Lee weight and several clas-ses of weight enumerators about linear codes over ring R+vR+v2 R are defined,the MacWilliams identities of weight distri-butions between the linear codes and their dual codes over ring R+vR+v2 R are given.According to these identities,we can get the weight distributions of dual codes directly without obtaining the dual codes of linear codes over ring R+vR+v2 R.%通过构造Gray映射，对环R＋vR＋v2 R上线性码进行了研究。定义了环R＋vR＋v2 R上线性码的Lee重量及其几类重量计数器，给出了环R＋vR＋v2 R上线性码及其对偶码之间的各种重量分布的MacWilliams恒等式。利用这些恒等式，不用求出环R＋vR＋v2 R上线性码的对偶码便可得到对偶码的各种重量分布。
User Guide for the R5EXEC Coupling Interface in the RELAP5-3D Code
Energy Technology Data Exchange (ETDEWEB)
Forsmann, J. Hope [Idaho National Lab. (INL), Idaho Falls, ID (United States); Weaver, Walter L. [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2015-04-01
This report describes the R5EXEC coupling interface in the RELAP5-3D computer code from the users perspective. The information in the report is intended for users who want to couple RELAP5-3D to other thermal-hydraulic, neutron kinetics, or control system simulation codes.
Sensitivity Analysis of Uncertainty Parameter based on MARS-LMR Code on SHRT-45R of EBR II
Energy Technology Data Exchange (ETDEWEB)
Kang, Seok-Ju; Kang, Doo-Hyuk; Seo, Jae-Seung [System Engineering and Technology Co., Daejeon (Korea, Republic of); Bae, Sung-Won [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Jeong, Hae-Yong [Sejong University, Seoul (Korea, Republic of)
2016-10-15
In order to assess the uncertainty quantification of the MARS-LMR code, the code has been improved by modifying the source code to accommodate calculation process required for uncertainty quantification. In the present study, a transient of Unprotected Loss of Flow(ULOF) is selected as typical cases of as Anticipated Transient without Scram(ATWS) which belongs to DEC category. The MARS-LMR input generation for EBR II SHRT-45R and execution works are performed by using the PAPIRUS program. The sensitivity analysis is carried out with Uncertainty Parameter of the MARS-LMR code for EBR-II SHRT-45R. Based on the results of sensitivity analysis, dominant parameters with large sensitivity to FoM are picked out. Dominant parameters selected are closely related to the development process of ULOF event.
Gerber, Florian; Mösinger, Kaspar; Furrer, Reinhard
2017-07-01
Software packages for spatial data often implement a hybrid approach of interpreted and compiled programming languages. The compiled parts are usually written in C, C++, or Fortran, and are efficient in terms of computational speed and memory usage. Conversely, the interpreted part serves as a convenient user-interface and calls the compiled code for computationally demanding operations. The price paid for the user friendliness of the interpreted component is-besides performance-the limited access to low level and optimized code. An example of such a restriction is the 64-bit vector support of the widely used statistical language R. On the R side, users do not need to change existing code and may not even notice the extension. On the other hand, interfacing 64-bit compiled code efficiently is challenging. Since many R packages for spatial data could benefit from 64-bit vectors, we investigate strategies to efficiently pass 64-bit vectors to compiled languages. More precisely, we show how to simply extend existing R packages using the foreign function interface to seamlessly support 64-bit vectors. This extension is shown with the sparse matrix algebra R package spam. The new capabilities are illustrated with an example of GIMMS NDVI3g data featuring a parametric modeling approach for a non-stationary covariance matrix.
Energy Technology Data Exchange (ETDEWEB)
Hainoun, A., E-mail: pscientific2@aec.org.sy [Atomic Energy Commission of Syria (AECS), Nuclear Engineering Department, P.O. Box 6091, Damascus (Syrian Arab Republic); Doval, A. [Nuclear Engineering Department, Av. Cmdt. Luis Piedrabuena 4950, C.P. 8400 S.C de Bariloche, Rio Negro (Argentina); Umbehaun, P. [Centro de Engenharia Nuclear – CEN, IPEN-CNEN/SP, Av. Lineu Prestes 2242-Cidade Universitaria, CEP-05508-000 São Paulo, SP (Brazil); Chatzidakis, S. [School of Nuclear Engineering, Purdue University, West Lafayette, IN 47907 (United States); Ghazi, N. [Atomic Energy Commission of Syria (AECS), Nuclear Engineering Department, P.O. Box 6091, Damascus (Syrian Arab Republic); Park, S. [Research Reactor Design and Engineering Division, Basic Science Project Operation Dept., Korea Atomic Energy Research Institute (Korea, Republic of); Mladin, M. [Institute for Nuclear Research, Campului Street No. 1, P.O. Box 78, 115400 Mioveni, Arges (Romania); Shokr, A. [Division of Nuclear Installation Safety, Research Reactor Safety Section, International Atomic Energy Agency, A-1400 Vienna (Austria)
2014-12-15
Highlights: • A set of advanced system thermal hydraulic codes are benchmarked against IFA of IEA-R1. • Comparative safety analysis of IEA-R1 reactor during LOFA by 7 working teams. • This work covers both experimental and calculation effort and presents new out findings on TH of RR that have not been reported before. • LOFA results discrepancies from 7% to 20% for coolant and peak clad temperatures are predicted conservatively. - Abstract: In the framework of the IAEA Coordination Research Project on “Innovative methods in research reactor analysis: Benchmark against experimental data on neutronics and thermal hydraulic computational methods and tools for operation and safety analysis of research reactors” the Brazilian research reactor IEA-R1 has been selected as reference facility to perform benchmark calculations for a set of thermal hydraulic codes being widely used by international teams in the field of research reactor (RR) deterministic safety analysis. The goal of the conducted benchmark is to demonstrate the application of innovative reactor analysis tools in the research reactor community, validation of the applied codes and application of the validated codes to perform comprehensive safety analysis of RR. The IEA-R1 is equipped with an Instrumented Fuel Assembly (IFA) which provided measurements for normal operation and loss of flow transient. The measurements comprised coolant and cladding temperatures, reactor power and flow rate. Temperatures are measured at three different radial and axial positions of IFA summing up to 12 measuring points in addition to the coolant inlet and outlet temperatures. The considered benchmark deals with the loss of reactor flow and the subsequent flow reversal from downward forced to upward natural circulation and presents therefore relevant phenomena for the RR safety analysis. The benchmark calculations were performed independently by the participating teams using different thermal hydraulic and safety
Energy Technology Data Exchange (ETDEWEB)
Reis, Patricia A.L.; Costa, Antonella L.; Pereira, Claubia; Veloso, Maria A.F.; Scari, Maria E., E-mail: patricialire@yahoo.com.br, E-mail: antonella@nuclear.ufmg.br, E-mail: claubia@nuclear.ufmg.br, E-mail: dora@nuclear.ufmg.br, E-mail: melizabethscari@yahoo.com [Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, MG (Brazil). Departamento de Engenharia Nuclear; Instituto Nacional de Ciencias e Tecnologia de Reatores Nucleares Inovadores (INCT/CNPq), Belo Horizonte (Brazil); Miro, Rafael; Verdu, Gumersindo, E-mail: rmiro@iqn.upv.es, E-mail: gverdu@iqn.upv.es [Universidad Politecnica de Valencia (Spain). Departamento de Ingenieria Quimica y Nuclear
2015-07-01
Simulations and analyses of nuclear reactors have been improved by utilization of coupled thermal-hydraulic (TH) and neutron kinetics (NK) system codes especially to simulate transients that involve strong feedback effects between NK and TH. The TH-NK coupling technique was initially developed and used to simulate the behavior of power reactors; however, several coupling methodologies are now being applied for research reactors. This work presents the coupling methodology application between RELAP5 and PARCS codes using as a model the TRIGA IPR-R1 research reactor. Analyses of steady state and transient conditions and comparisons with results from simulations using only the RELAP5 code are being presented in this paper. (author)
Singh, B.B.; Khatkar, M.S.; Gill, J.P.S.; Dhand, N.K.
2016-01-01
This article contains epidemiological, demographic and other data used for estimating health and economic burden of neurocysticercosis (NCC)-associated active epilepsy in India [1]. Most of the data are embedded in the R-code used for analyses so that the reader is able to replicate the results or adapt the code to their own data. However, data used to conduct sensitivity analyses to evaluate the effect of changing important input values such as prevalence and per capita income on health and economic impact of NCC in India are included in tables. Results from sensitivity analyses are also presented in tables and figures. The paper also includes three scenarios with different age weighting (k) and time discounting (r) values used to estimate health and economic burden of NCC in India. The data for the scenario without any age weighting and time discounting are presented in “Estimation of the health and economic burden of neurocysticercosis in India” [1]. PMID:27054160
Singh, B B; Khatkar, M S; Gill, J P S; Dhand, N K
2016-06-01
This article contains epidemiological, demographic and other data used for estimating health and economic burden of neurocysticercosis (NCC)-associated active epilepsy in India [1]. Most of the data are embedded in the R-code used for analyses so that the reader is able to replicate the results or adapt the code to their own data. However, data used to conduct sensitivity analyses to evaluate the effect of changing important input values such as prevalence and per capita income on health and economic impact of NCC in India are included in tables. Results from sensitivity analyses are also presented in tables and figures. The paper also includes three scenarios with different age weighting (k) and time discounting (r) values used to estimate health and economic burden of NCC in India. The data for the scenario without any age weighting and time discounting are presented in "Estimation of the health and economic burden of neurocysticercosis in India" [1].
Investigate Methods to Decrease Compilation Time-AX-Program Code Group Computer Science R& D Project
Energy Technology Data Exchange (ETDEWEB)
Cottom, T
2003-06-11
Large simulation codes can take on the order of hours to compile from scratch. In Kull, which uses generic programming techniques, a significant portion of the time is spent generating and compiling template instantiations. I would like to investigate methods that would decrease the overall compilation time for large codes. These would be methods which could then be applied, hopefully, as standard practice to any large code. Success is measured by the overall decrease in wall clock time a developer spends waiting for an executable. Analyzing the make system of a slow to build project can benefit all developers on the project. Taking the time to analyze the number of processors used over the life of the build and restructuring the system to maximize the parallelization can significantly reduce build times. Distributing the build across multiple machines with the same configuration can increase the number of available processors for building and can help evenly balance the load. Becoming familiar with compiler options can have its benefits as well. The time improvements of the sum can be significant. Initial compilation time for Kull on OSF1 was {approx} 3 hours. Final time on OSF1 after completion is 16 minutes. Initial compilation time for Kull on AIX was {approx} 2 hours. Final time on AIX after completion is 25 minutes. Developers now spend 3 hours less waiting for a Kull executable on OSF1, and 2 hours less on AIX platforms. In the eyes of many Kull code developers, the project was a huge success.
R&D for Safety Codes and Standards: Materials and Components Compatibility
Energy Technology Data Exchange (ETDEWEB)
Somerday, Brian P. [Sandia National Lab. (SNL-CA), Livermore, CA (United States); LaFleur, Chris [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Marchi, Chris San [Sandia National Lab. (SNL-CA), Livermore, CA (United States)
2015-08-01
This project addresses the following technical barriers from the Safety, Codes and Standards section of the 2012 Fuel Cell Technologies Office Multi-Year Research, Development and Demonstration Plan (section 3.8): (A) Safety data and information: limited access and availability (F) Enabling national and international markets requires consistent RCS (G) Insufficient technical data to revise standards.
VizieR Online Data Catalog: ADAM: 3D asteroid shape reconstruction code (Viikinkoski+, 2015)
Viikinkoski, M.; Kaasalainen, M.; Durech, J.
2015-02-01
About the code: ADAM is a collection of routines for 3D asteroid shape reconstruction from disk-resolved observations. Any combination of lightcurves, adaptive optics images, HST/FGS data, range-Doppler radar images and disk-resolved thermal images may be used as data sources. The routines are implemented in a combination of MATLAB and C. (2 data files).
VizieR Online Data Catalog: Transiting planets search Matlab/Octave source code (Ofir+, 2014)
Ofir, A.
2014-01-01
The Matlab/Octave source code for Optimal BLS is made available here. Detailed descriptions of all inputs and outputs are given by comment lines in the file. Note: Octave does not currently support parallel for loops ("parfor"). Octave users therefore need to change the "parfor" command (line 217 of OptimalBLS.m) to "for". (7 data files).
The codes and the representation of the folk music of Kırşehir’s region
Directory of Open Access Journals (Sweden)
Seyit Yöre
2012-03-01
Full Text Available Folk music is a music genre created by folks' own cultural features. It is associated with other features of culture, so it includes local features. Anatolian folk music, is one of the folk music cultures in the world, has more details in the context of geographical features, ethnicity and locality. So it is need to be examined locally with the various disciplines and approaches. The folk music of Kırşehir’s region, is a type of the Anatolian folk music, was investigated within the framework of the ethnomusicology discipline and the qualitative research model in cultural and analytical context for the problem, the sub-problems and the aim of research, and the findings were encoded and described in this research. 453 works and the other documents were examined and determined the twenty codes which represent the folk music of Kırşehir’s region. These codes were evaluated and it was seen that the folk music Kirsehir's region can be represented with the three main codes as Abdal, Bozlak, and bağlama.
The codes and the representation of the folk music of Kırşehir’s region
Directory of Open Access Journals (Sweden)
Seyit Yöre
2012-03-01
Full Text Available Folk music is a music genre created by folks' own cultural features. It is associated with other features of culture, so it includes local features. Anatolian folk music, is one of the folk music cultures in the world, has more details in the context of geographical features, ethnicity and locality. So it is need to be examined locally with the various disciplines and approaches. The folk music of Kırşehir’s region, is a type of the Anatolian folk music, was investigated within the framework of the ethnomusicology discipline and the qualitative research model in cultural ve analytical context for the problem, the sub-problems and the aim of research, and the findings were encoded and described in this research. 453 works and the other documents were examined and determined the twenty codes which represent the folk music of Kırşehir’s region. These codes were evaluated and it was seen that the folk music Kirsehir's region can be represented with the three main codes as Abdal, Bozlak, and bağlama.
VizieR Online Data Catalog: New code for PCA in spectral analysis (Bu+, 2015)
Bu, Y.; Zhao, G.; Luo, A.-L.; Pan, J.; Chen, Y.
2015-04-01
Source code of RBM algorithm which can be executed in MATLAB 2013. This code is based on the more general code by Hinton and coauthors (Hinton & Salakhutdinov 2006). The supplementary material contains two files. We only need to run file rbm_dimreduction to reduce the dimension of the data. The other file is the function file that will be called when running rbm_dimreduction. Data format. The format of data should be MAT-file format. Each row of the data matrix X=[x1T,x2T,...,xnT]T represents a spectrum vector. Variables in the script file rbm_dimreduction. It needs two inputs to run rbm_dimreduction: variable h, the dimension of the hidden vector; and variable T1, the spectra data. After running rbm_dimreduction, we can get the output variable rbm. Variable rbm.hiddata is the data set of RBM components. Each row of rbm.hiddata represents the low dimensional projection of a spectrum vector. Variable rbm.rec is the data set of the reconstructed spectra (denosied or repaired spectra). (2 data files).
Atucha II NPP full scope simulator modelling with the thermal hydraulic code TRAC{sub R}T
Energy Technology Data Exchange (ETDEWEB)
Alonso, Pablo Rey; Ruiz, Jose Antonio; Rivero, Norberto, E-mail: prey@tecnatom.e, E-mail: jaruiz@tecnatom.e, E-mail: nrivero@tecnatom.e [Tecnatom S.A., Madrid (Spain)
2011-07-01
In February 2010 NA-SA (Nucleoelectrica Argentina S.A.) awarded Tecnatom the Atucha II full scope simulator project. NA-SA is a public company owner of the Argentinean nuclear power plants. Atucha II is due to enter in operation shortly. Atucha II NPP is a PHWR type plant cooled by the water of the Parana River and has the same design as the Atucha I unit, doubling its power capacity. Atucha II will produce 745 MWe utilizing heavy water as coolant and moderator, and natural uranium as fuel. A plant singular feature is the permanent core refueling. TRAC{sub R}T is the first real time thermal hydraulic six-equations code used in the training simulation industry for NSSS modeling. It is the result from adapting to real time the best estimate code TRACG. TRAC{sub R}T is based on first principle conservation equations for mass, energy and momentum for liquid and steam phases, with two phase flows under non homogeneous and non equilibrium conditions. At present, it has been successfully implemented in twelve full scope replica simulators in different training centers throughout the world. To ease the modeling task, TRAC{sub R}T includes a graphical pre-processing tool designed to optimize this process and alleviate the burden of entering alpha numerical data in an input file. (author)
African swine fever virus ORF P1192R codes for a functional type II DNA topoisomerase.
Coelho, João; Martins, Carlos; Ferreira, Fernando; Leitão, Alexandre
2015-01-01
Topoisomerases modulate the topological state of DNA during processes, such as replication and transcription, that cause overwinding and/or underwinding of the DNA. African swine fever virus (ASFV) is a nucleo-cytoplasmic double-stranded DNA virus shown to contain an OFR (P1192R) with homology to type II topoisomerases. Here we observed that pP1192R is highly conserved among ASFV isolates but dissimilar from other viral, prokaryotic or eukaryotic type II topoisomerases. In both ASFV/Ba71V-infected Vero cells and ASFV/L60-infected pig macrophages we detected pP1192R at intermediate and late phases of infection, cytoplasmically localized and accumulating in the viral factories. Finally, we used a Saccharomyces cerevisiae temperature-sensitive strain in order to demonstrate, through complementation and in vitro decatenation assays, the functionality of P1192R, which we further confirmed by mutating its predicted catalytic residue. Overall, this work strengthens the idea that P1192R constitutes a target for studying, and possibly controlling, ASFV transcription and replication.
VizieR Online Data Catalog: Generalised Lomb-Scargle periodogram code (Mortier+, 2015)
Mortier, A.; Faria, J. P.; Correia, C. M.; Santerne, A.; Santos, N. C.
2014-11-01
The BGLS tool calculates the Bayesian Generalized Lomb-Scargle periodogram as described in the paper. It is written in Python (tested on Python 2.7). The code contains the definition of the algorithm, takes as input arrays with a time series, a dataset and errors on those data, and returns arrays with sampled periods and the periodogram values at those periods. In order to run, it requires the following python packages: * numpy (http://www.numpy.org/) * mpmath (http://mpmath.org/) (2 data files).
Thinking beside the box: Should we care about the non-coding strand of the 16S rRNA gene?
Garcia-Mazcorro, Jose F; Barcenas-Walls, Jose R
2016-08-01
The 16S rRNA gene (16S rDNA) codes for RNA that plays a fundamental role during translation in the ribosome and is used extensively as a marker gene to establish relationships among bacteria. However, the complementary non-coding 16S rDNA (nc16S rDNA) has been ignored. An idea emerged in the course of analyzing bacterial 16S rDNA sequences in search for nucleotide composition and substitution patterns: Does the nc16S rDNA code? If so, what does it code for? More importantly: Does 16S rDNA evolution reflect its own evolution or the evolution of its counterpart nc16S rDNA? The objective of this minireview is to discuss these thoughts. nc strands often encode small RNAs (sRNAs), ancient components of gene regulation. nc16S rDNA sequences from different bacterial groups were used to search for possible matches in the Bacterial Small Regulatory RNA Database. Intriguingly, the sequence of one published sRNA obtained from Legionella pneumophila (GenBank: AE0173541) showed high non-random similarity with nc16S rDNA corresponding in part to the V5 region especially from Legionella and relatives. While the target(s) of this sRNA is unclear at the moment, its mere existence might open up a new chapter in the use of the 16S rDNA to study relationships among bacteria.
Long non-coding RNA GAS5 inhibits tumorigenesis via miR-137 in melanoma
Bian, Donghui; Shi, Wen; Shao, Yang; Li, Peilong; Song, Guodong
2017-01-01
Melanoma is the leading cause of death in patients with skin cancer. In the present study, we aimed to prove the functions and molecular mechanisms of lncRNA-GAS5 in melanoma. Herein, we found that the expression of GAS5 was down-regulated in melanoma tissues compared to adjacent normal tissues. GAS5 was significantly associated with distal metastasis and TNM stage in melanoma. Furthermore, we found that GAS5 suppressed melanoma cell proliferation, migration and invasion. Then, we found thatmiR-137 was decreased in melanoma tissues compared to adjacent normal tissues and was correlated with GAS5. Using a luciferase reporter gene assay, we also demonstrated that GAS5 positively regulated miR-137 transcription. Finally, we suggested that GAS5 inhibited the growth of melanoma through miR-137 in vivo. Therefore, our research demonstrated that the GAS5/miR-137 axis could be a potential therapeutic target for the treatment of melanoma.
Analysis of OECD/CSNI ISP-42 phase A PANDA experiment using coupled code R5G (RELAP5-GOTHIC)
Energy Technology Data Exchange (ETDEWEB)
Bencik, V.; Debrecin, N.; Grgic, D. [Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb (Croatia); Bajs, T. [Enconet International Ltd, Miramarska 20, 10000 Zagreb (Croatia)
2010-07-01
In the paper, the results of the analysis of OECD/CSNI ISP-42 Phase A experiment at PANDA facility using stand-alone codes RELAP5/mod3.3 and GOTHIC 7.2b as well as coupled code R5G (RELAP5/mod3.3-GOTHIC 7.2b) are presented. PANDA is a large-scale thermal-hydraulic test facility installed at PSI (Paul Scherrer Institute) in Switzerland. The OECD/CSNI ISP-42 test consists of six sequential phases (Phase A through F). The present work deals with the post-test calculation of the Phase A, including the break of the main steam line and the Passive Containment Cooling (PCC) System Start-Up. The objective of the test is to investigate the start-up phenomenology of passive cooling system when steam is injected into cold vessel filled with air. The calculation was performed using stand-alone RELAP5/mod3.3 and GOTHIC 7.2b models, and then the same calculation was performed using coupled code with RELAP5 being responsible for reactor part of the model and GOTHIC being responsible for containment part of the model. The prediction capability, running time and modeling aspects were discussed for all three cases. (authors)
Scalable coding of depth maps with R-D optimized embedding.
Mathew, Reji; Taubman, David; Zanuttigh, Pietro
2013-05-01
Recent work on depth map compression has revealed the importance of incorporating a description of discontinuity boundary geometry into the compression scheme. We propose a novel compression strategy for depth maps that incorporates geometry information while achieving the goals of scalability and embedded representation. Our scheme involves two separate image pyramid structures, one for breakpoints and the other for sub-band samples produced by a breakpoint-adaptive transform. Breakpoints capture geometric attributes, and are amenable to scalable coding. We develop a rate-distortion optimization framework for determining the presence and precision of breakpoints in the pyramid representation. We employ a variation of the EBCOT scheme to produce embedded bit-streams for both the breakpoint and sub-band data. Compared to JPEG 2000, our proposed scheme enables the same the scalability features while achieving substantially improved rate-distortion performance at the higher bit-rate range and comparable performance at the lower rates.
Xing, Chuanhua; Bitzer, Donald L; Alexander, Winser E; Vouk, Mladen A; Stomp, Anne-Marie
2009-02-01
We introduce a new approach in this article to distinguish protein-coding sequences from non-coding sequences utilizing a period-3, free energy signal that arises from the interactions of the 3'-terminal nucleotides of the 18S rRNA with mRNA. We extracted the special features of the amplitude and the phase of the period-3 signal in protein-coding regions, which is not found in non-coding regions, and used them to distinguish protein-coding sequences from non-coding sequences. We tested on all the experimental genes from Saccharomyces cerevisiae and Schizosaccharomyces pombe. The identification was consistent with the corresponding information from GenBank, and produced better performance compared to existing methods that use a period-3 signal. The primary tests on some fly, mouse and human genes suggests that our method is applicable to higher eukaryotic genes. The tests on pseudogenes indicated that most pseudogenes have no period-3 signal. Some exploration of the 3'-tail of 18S rRNA and pattern analysis of protein-coding sequences supported further our assumption that the 3'-tail of 18S rRNA has a role of synchronization throughout translation elongation process. This, in turn, can be utilized for the identification of protein-coding sequences.
Choudhury, Sayantan; Dasgupta, Arnab
2014-05-01
In this paper we introduce an idea of leptogenesis scenario in higher derivative gravity induced DBI Galileon framework aka Galileogenesis in presence of one-loop R-parity violating couplings in the background of a low energy effective supergravity setup derived from higher dimensional string theory framework. We have studied extensively the detailed feature of reheating constraints and the cosmophenomenological consequences of thermal gravitino dark matter in light of PLANCK and PDG data. Finally, we have also established a direct cosmophenomenological connection among dark matter relic abundance, reheating temperature and tensor-to-scalar ratio in the context of DBI Galileon inflation. Higher order correction terms in the gravity sector are introduced in the effective action as a perturbative correction to the Einstein-Hilbert counterpart coming from the computation of Conformal Field Theory disk amplitude at the two loop level [34-36]. The matter sector encounters the effect of N=1, D=4 supergravity motivated DBI Galileon interaction which is embedded in the D3 brane. Additionally, we have considered the effect of R-parity violating interactions [37-40] in the matter sector which provide a convenient framework for quantifying quark and lepton-flavor violating effects. The low energy UV protective effective action for the proposed cosmophenomenological model is described by [31,32]: S=∫d4x √{-g}[K(Φ,X)-G(Φ,X)□Φ+B1R+(B2RRαβγδ-4B3RRαβ+B4R2)+B5] where the model dependent characteristic functions K(Φ,X) and G(Φ,X) are the implicit functions of Galileon and its kinetic counterpart is X=-1/2 >g∂μΦ∂νΦ. Additionally, Bi∀i are the self-coupling constants of graviton degrees of freedom appearing via dimensional reduction from higher dimensional string theory. Specifically B5 be the effective four dimensional cosmological constant. In general, B2≠B3≠B4 which implies that the quadratic curvature terms originated from two loop correction to the
Energy Technology Data Exchange (ETDEWEB)
Girardi, E.; Guerin, P. [Electricite de France - RandD, 1 av. du General de Gaulle, 92141, Clamart (France); Dulla, S.; Nervo, M.; Ravetto, P. [Dipartimento di Energetica, Politecnico di Torino, 24, c.so Duca degli Abruzzi, 10129, Torino (Italy)
2012-07-01
Quasi-Static (QS) methods are quite popular in the reactor physics community and they exhibit two main advantages. First, these methods overcome both the limits of the Point Kinetic (PK) approach and the issues of the computational effort related to the direct discretization of the time-dependent neutron transport equation. Second, QS methods can be implemented in such a way that they can be easily coupled to very different external spatial solvers. In this paper, the results of the coupling between the QS methods developed by Politecnico di Torino and the EDF R and D core code COCAGNE are presented. The goal of these activities is to evaluate the performances of QS methods (in term of computational cost and precision) with respect to the direct kinetic solver (e.g. {theta}-scheme) already available in COCAGNE. Additionally, they allow to perform an extensive cross-validation of different kinetic models (QS and direct methods). (authors)
Energy Technology Data Exchange (ETDEWEB)
Yokoyama, Kenji; Hazama, Taira; Chiba, Go; Ohki, Shigeo; Ishikawa, Makoto [Japan Nuclear Cycle Development Inst., Oarai, Ibaraki (Japan). Oarai Engineering Center
2002-12-01
In the core design of fast reactors (FRs), it is very important to improve the prediction accuracy of the nuclear characteristics for both reducing cost and ensuring reliability of FR plants. A nuclear reactor analysis code system for FRs has been developed by the Japan Nuclear Cycle Development Institute (JNC). This paper describes the outline of the calculation models and methods in the system consisting of several analysis codes, such as the cell calculation code CASUP, the core calculation code TRITAC and the sensitivity analysis code SAGEP. Some examples of verification results and improvement of the design accuracy are also introduced based on the measurement data from critical assemblies, e.g, the JUPITER experiment (USA/Japan), FCA (Japan), MASURCA (France), and BFS (Russia). Furthermore, application fields and future plans, such as the development of new generation nuclear constants and applications to MA{center_dot}FP transmutation, are described. (author)
Carrier and Clock Recovery in (Turbo-Coded Systems: CramÃƒÂ©r-Rao Bound and Synchronizer Performance
Directory of Open Access Journals (Sweden)
M. Moeneclaey
2005-05-01
Full Text Available In this paper, we derive the CramÃƒÂ©r-Rao bound (CRB for joint carrier phase, carrier frequency, and timing estimation from a noisy linearly modulated signal with encoded data symbols. We obtain a closed-form expression for the CRB in terms of the marginal a posteriori probabilities of the coded symbols, allowing efficient numerical evaluation of the CRB for a wide range of coded systems by means of the BCJR algorithm. Simulation results are presented for a rate 1/2 turbo code combined with QPSK mapping. We point out that the synchronization parameters for the coded system are essentially decoupled. We find that, at the normal (i.e., low operating SNR of the turbo-coded system, the true CRB for coded transmission is (i essentially the same as the modified CRB and (ii considerably smaller than the true CRB for uncoded transmission. Comparison of actual synchronizer performance with the CRB for turbo-coded QPSK reveals that a Ã¢Â€Âœcode-awareÃ¢Â€Â soft-decision-directed synchronizer can perform very closely to this CRB, whereas Ã¢Â€Âœcode-unawareÃ¢Â€Â estimators such as the conventional non-data-aided algorithm are substantially worse; when operating on coded signals, the performance of the latter synchronizers is still limited by the CRB for uncoded transmission.
Karl, Simon J.; Aarseth, Sverre J.; Naab, Thorsten; Haehnelt, Martin G.; Spurzem, Rainer
2015-09-01
We present a hybrid code combining the OpenMP-parallel tree code VINE with an algorithmic chain regularization scheme. The new code, called `rVINE', aims to significantly improve the accuracy of close encounters of massive bodies with supermassive black holes (SMBHs) in galaxy-scale numerical simulations. We demonstrate the capabilities of the code by studying two test problems, the sinking of a single massive black hole to the centre of a gas-free galaxy due to dynamical friction and the hardening of an SMBH binary due to close stellar encounters. We show that results obtained with rVINE compare well with NBODY7 for problems with particle numbers that can be simulated with NBODY7. In particular, in both NBODY7 and rVINE we find a clear N-dependence of the binary hardening rate, a low binary eccentricity and moderate eccentricity evolution, as well as the conversion of the galaxy's inner density profile from a cusp to a core via the ejection of stars at high velocity. The much larger number of particles that can be handled by rVINE will open up exciting opportunities to model stellar dynamics close to SMBHs much more accurately in a realistic galactic context. This will help to remedy the inherent limitations of commonly used tree solvers to follow the correct dynamical evolution of black holes in galaxy-scale simulations.
Hu, Yi; Huo, Zheng-Hao; Liu, Chun-Mei; Liu, Shi-Guo; Zhang, Ning; Yin, Kun-Lun; Qi, Lu; Ma, Xu; Xia, Hong-Fei
2014-01-01
MicroRNAs (miRNAs) are short non-coding RNAs which modulate gene expression by binding to complementary segments present in the 3'UTR of the mRNAs of protein coding genes. MiRNAs play very important roles in maintaining normal human body physiology conditions, meanwhile, abnormal miRNA expressions have been found related to many human diseases spanning from psychiatric disorders to malignant cancers. Recently, emerging reports have indicated that disturbed miRNAs expression contributed to the pathogenesis of recurrent pregnancy loss (RPL). In this study, we identified a new mutation site (+29A>G, position relative to pre-miR-125a) by scanning pri-miR-125a coding region in 389 Chinese Han RPL patients. This site was co-existed with two polymorphisms (rs12976445 and rs41275794) in patients heterogeneously and changed the predicted secondary structures of pri-miR-125a. Subsequent in vitro analysis indicated that the A>G mutation reduced mature miR-125a expression, and further led to less efficient inhibition of verified target genes. Functional analysis showed that mutant pri-mir-125a can enhance endometrial stromal cells (ESCs) invasive capacity and increase the sensitivity of ESCs cells to mifepristone. Moreover, we further analyzed the possible molecular mechanism by RIP-chip assay and found that mutant pri-mir-125a disturbed the expression of miR-125a targetome, the functions of which includes embryonic development, cell proliferation, migration and invasion. These data suggest that A>G mutation in pri-miR-125a coding region contributes to the genetic predisposition to RPL by disordering the production of miR-125a, which consequently meddled in gene regulatory network between mir-125a and mRNA.
Calculs de doses générées par les rayonnements ionisants principes physiques et codes de calcul
Vivier, Alain
2016-01-01
Cet ouvrage et les codes associés s’adressent aux utilisateurs de sources de rayonnements ionisants : techniciens, ingénieurs de sécurité, personnes compétentes en radioprotection, mais aussi médecins, chercheurs, concepteurs, décideurs… Les contraintes croissantes liées à la radioprotection rendent indispensables l’utilisation de codes de calcul permettant d’évaluer les débits de doses générées par ces sources et la façon dont on peut s’en protéger au mieux. De nombreux codes existent, dont certains restent des références incontournables, mais ils sont relativement complexes à mettre en oeuvre et restent en général réservés aux bureaux d’études. En outre, ces codes sont souvent des « boîtes noires » qui ne permettent pas de comprendre la physique sous-jacente. L’objectif de cet ouvrage est double : - Exposer les principes physiques permettant de comprendre les phénomènes à l’oeuvre lorsque la matière est irradiée par des rayonnements ionisants. Il devient al...
Karl, S J; Naab, T; Haehnelt, M G; Spurzem, R
2015-01-01
We present a hybrid code combining the OpenMP-parallel tree code VINE with an algorithmic chain regularization scheme. The new code, called "rVINE", aims to significantly improve the accuracy of close encounters of massive bodies with supermassive black holes in galaxy-scale numerical simulations. We demonstrate the capabilities of the code by studying two test problems, the sinking of a single massive black hole to the centre of a gas-free galaxy due to dynamical friction and the hardening of a supermassive black hole binary due to close stellar encounters. We show that results obtained with rVINE compare well with NBODY7 for problems with particle numbers that can be simulated with NBODY7. In particular, in both NBODY7 and rVINE we find a clear N-dependence of the binary hardening rate, a low binary eccentricity and moderate eccentricity evolution, as well as the conversion of the galaxy's inner density profile from a cusp to a a core via the ejection of stars at high velocity. The much larger number of par...
Energy Technology Data Exchange (ETDEWEB)
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.
Energy Technology Data Exchange (ETDEWEB)
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.
Izumi, Hiroshi; Ogata, Atsushi; Nafie, Laurence A; Dukor, Rina K
2009-01-01
The absolute configuration and solution conformation of (R)-(+)-malathion were determined by using vibrational circular dichroism spectroscopy and a fragment-conformational search with a recently published conformational code. The determination of molecular stereochemistry was carried out without a conformational search using molecular mechanics calculations. Density functional theory calculations of the fragments of (R)-malathion, ethyl propionate, (R)-ethyl 2-(methylthio)propanoate, (R)-diethyl 2-(methylthio)succinate, and O,O,S-trimethyl phosphorodithioate were carried out, and the principal conformational features of the fragments were profiled. This fragment-conformational search reduces the time needed for the selection of the predominant conformations for (R)-malathion and significantly improves the accuracy of the determination of absolute configuration.
Ojha, Sandeep; Singh, Nishant; Bhattacharya, Alok; Bhattacharya, Sudha
2013-01-01
The ribosomal RNA genes in Entamoeba spp. are located on extrachromosomal circular molecules. Unlike model organisms where rRNA transcription stops during growth stress, Entamoeba histolytica continues transcription; but unprocessed pre-rRNA accumulates during stress, along with a novel class of circular transcripts from the 5'-external transcribed spacer (ETS). To determine the fate of rRNA transcription during stage conversion between trophozoite to cyst we analyzed Entamoeba invadens, a model system for differentiation studies in Entamoeba. We characterized the complete rDNA transcription unit by mapping the ends of pre-rRNA and mature rRNAs. The 3' end of mature 28S rRNA was located 321 nt downstream of the end predicted by sequence homology with E. histolytica. The major processing sites were mapped in external and internal transcribed spacers. The promoter located within 146 nt upstream of 5' ETS was used to transcribe the pre-rRNA. On the other hand, a second promoter located at the 3' end of 28S rDNA was used to transcribe almost the entire intergenic spacer into a long non coding (nc) RNA (>10 kb). Interestingly we found that the levels of pre-rRNA and long ncRNA, measured by northern hybridization, decreased initially in cells shifted to encystation medium, after which they began to increase and reached high levels by 72 h when mature cysts were formed. Unlike E. histolytica, no circular transcripts were found in E. invadens. E. histolytica and E. invadens express fundamentally different ncRNAs from the rDNA locus, which may reflect their adaptation to different hosts (human and reptiles, respectively). This is the first description of rDNA organization and transcription in E. invadens, and provides the framework for further studies on regulation of rRNA synthesis during cyst formation.
Turkington, M. D.; Ballance, C. P.; Hibbert, A.; Ramsbottom, C. A.
2016-08-01
In this work we explore the validity of employing a modified version of the nonrelativistic structure code civ3 for heavy, highly charged systems, using Na-like tungsten as a simple benchmark. Consequently, we present radiative and subsequent collisional atomic data compared with corresponding results from a fully relativistic structure and collisional model. Our motivation for this line of study is to benchmark civ3 against the relativistic grasp0 structure code. This is an important study as civ3 wave functions in nonrelativistic R -matrix calculations are computationally less expensive than their Dirac counterparts. There are very few existing data for the W LXIV ion in the literature with which we can compare except for an incomplete set of energy levels available from the NIST database. The overall accuracy of the present results is thus determined by the comparison between the civ3 and grasp0 structure codes alongside collisional atomic data computed by the R -matrix Breit-Pauli and Dirac codes. It is found that the electron-impact collision strengths and effective collision strengths computed by these differing methods are in good general agreement for the majority of the transitions considered, across a broad range of electron temperatures.
Institute of Scientific and Technical Information of China (English)
ZHANG Aili; LIU Xiufeng
2006-01-01
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory.The new type of linear codes take the congruence class in the congruence class ring R/I1 ∩ I2 ∩…∩ In for the information bit,embed R/Ji into R/I1 ∩ I2 ∩…∩ In,and assign the cosets of R/Ji as the subring of R/I1 ∩ I2 ∩…∩ In and the cosets of R/Ji in R/I1 ∩ I2 ∩…∩ In as check lines.Many code classes exist in the Chinese remainder codes that have high code rates.Chinese remainder codes are the essential generalization of Sun Zi codes.
Institute of Scientific and Technical Information of China (English)
张爱丽; 刘秀峰; 靳蕃
2004-01-01
Chinese Remainder Codes are constructed by applying weak block designs and Chinese Remainder Theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I1∩I2∩…∩In for the information bit, embed R/Ji into R/I1∩I2∩…∩In, and asssign the cosets of R/Ji as the subring of R/I1∩I2∩…∩In and the cosets of R/Ji in R/I1∩I2∩…∩In as check lines. There exist many code classes in Chinese Remainder Codes, which have high code rates. Chinese Remainder Codes are the essential generalization of Sun Zi Codes.
Zhao, Baoxiang; Guo, Xiaxia; Liu, Song
2017-01-01
Background and aim The biological functions of non-coding RNAs (ncRNAs) have been widely identified in many human diseases. In the present study, the relationship between long non-coding RNA HOTAIR and microRNA-17-5p (miR-17-5p) and their roles in osteogenic differentiation and proliferation in non-traumatic osteonecrosis of femoral head (ONFH) were investigated. Methods The expression levels of HOTAIR and miR-17-5p in the mesenchymal stem cells (MSCs) derived from patients with non-traumatic ONFH and osteoarthritis (OA) were examined by real-time PCR. BMP-2 induced human MSCs from bone marrow (hMSC-BM) were used for osteogenic differentiation. Results It was observed that the expression level of miR-17-5p was lower and the level of HOTAIR was higher in samples of non-traumatic ONFH compared with OA. HOTAIR downregulation induced by si-HOTAIR led to the increase of miR-17-5p expression and the decrease of miR-17-5p target gene SMAD7 expression. The values of osteogenic differentiation markers, including RUNX2 and COL1A1 mRNA expression and ALP activity, were also elevated by si-HOTAIR. However, the increase of these values was canceled by miR-17-5p inhibitor or SMAD7 upregulation. Conclusion HOTAIR played a role in regulating osteogenic differentiation and proliferation through modulating miR-17-5p and its target gene SMAD7 in non-traumatic ONFH. PMID:28207735
The human long non-coding RNA-RoR is a p53 repressor in response to DNA damage
Institute of Scientific and Technical Information of China (English)
Ali Zhang; Nanjiang Zhou; Jianguo Huang; Qian Liu; Koji Fukuda; Ding Ma; Zhaohui Lu
2013-01-01
It is well known that upon stress,the level of the tumor suppressor p53 is remarkably elevated.However,despite extensive studies,the underlying mechanism involving important inter-players for stress-induced p53 regulation is still not fully understood.We present evidence that the human lincRNA-RoR (RoR) is a strong negative regulator of p53.Unlike MDM2 that causes p53 degradation through the ubiquitin-proteasome pathway,RoR suppresses p53 translation through direct interaction with the heterogeneous nuclear ribonucleoprotein I (hnRNP I).Importantly,a 28-base RoR sequence carrying hnRNP I binding motifs is essential and sufficient for p53 repression.We further show that RoR inhibits p53-mediated cell cycle arrest and apoptosis.Finally,we demonstrate a RoR-p53 autoregulatory feedback loop where p53 transcriptionally induces RoR expression.Together,these results suggest that the RoR-hnRNP I-p53 axis may constitute an additional surveillance network for the cell to better respond to various stresses.
Mangiavacchi, Arianna
2016-08-10
Alterations in genetic programs required for terminal myeloid differentiation and aberrant proliferation characterize acute myeloid leukemia (AML) cells. Here, we identify the host transcript of miR-223, linc-223, as a novel functional long non-coding RNA (lncRNA) in AML. We show that from the primary nuclear transcript, the alternative production of miR-223 and linc-223 is finely regulated during monocytic differentiation. Moreover, linc-223 expression inhibits cell cycle progression and promotes monocytic differentiation of AML cells. We also demonstrate that endogenous linc-223 localizes in the cytoplasm and acts as a competing endogenous RNA for miR-125-5p, an oncogenic microRNA in leukemia. In particular, we show that linc-223 directly binds to miR-125-5p and that its knockdown increases the repressing activity of miR-125-5p resulting in the downregulation of its target interferon regulatory factor 4 (IRF4), which it was previously shown to inhibit the oncogenic activity of miR-125-5p in vivo. Furthermore, data from primary AML samples show significant downregulation of linc-223 in different AML subtypes. Therein, these findings indicate that the newly identified lncRNA linc-223 may have an important role in myeloid differentiation and leukemogenesis, at least in part, by cross-talking with IRF4 mRNA.
Gong, Wei; Zheng, Jian; Liu, Xiaobai; Liu, Yunhui; Guo, Junqing; Gao, Yana; Tao, Wei; Chen, Jiajia; Li, Zhiqing; Ma, Jun; Xue, Yixue
2017-01-01
Accumulating evidence has highlighted the potential role of long non-coding RNAs (lncRNAs) as biomarkers and therapeutic targets in solid tumors. Here, we elucidated the function and possible molecular mechanisms of lncRNA KCNQ1OT1 in human glioma U87 and U251 cells. Quantitative Real-Time polymerase chain reaction (qRT-PCR) demonstrated that KCNQ1OT1 expression was up-regulated in glioma tissues and cells. Knockdown of KCNQ1OT1 exerted tumor-suppressive function in glioma cells. Moreover, a binding region was confirmed between KCNQ1OT1 and miR-370 by dual-luciferase assays. qRT-PCR showed that miR-370 was down-regulated in human glioma tissue and cells. In addition, restoration of miR-370 exerted tumor-suppressive function via inhibiting cell proliferation, migration and invasion, while promoting the apoptosis of human glioma cells. Knockdown of KCNQ1OT1 decreased the expression level of Cyclin E2 (CCNE2) by binding to miR-370. Further, miR-370 bound to CCNE2 3′UTR region and decreased the expression of CCNE2. These results provided a comprehensive analysis of KCNQ1OT1-miR-370-CCNE2 axis in human glioma cells and might provide a novel strategy for glioma treatment.
A critical role for the non-coding 5S rRNA in regulating Mdmx stability
Li, Muyang; Gu, Wei
2013-01-01
Summary Both p53 and Mdmx are ubiquitinated and degraded by the same E3 ligase Mdm2; interestingly, however, while p53 is rapidly degraded by Mdm2, Mdmx is a stable protein in most of cancer cells. Thus, the mechanism by which Mdmx is degraded by Mdm2 needs further elucidation. Here, we identified the noncoding 5S rRNA as a major component of Mdmx-associated complexes from human cells. We show that 5S rRNA acts as a natural inhibitor of Mdmx degradation by Mdm2. RNAi-mediated knockdown of endogenous 5S rRNA, while not affecting p53 levels, significantly induces Mdmx degradation and subsequently, activates p53-dependent growth arrest. Notably, 5S rRNA binds the RING domain of Mdmx and blocks its ubiquitination by Mdm2 whereas Mdm2-mediated p53 ubiquitination remains intact. These results provide insights into the differential effects on p53 and Mdmx by Mdm2 in vivo and reveal an critical role of noncoding 5S rRNA in modulating the p53-Mdmx axis. PMID:21925390
Liu, Rui; Jin, Long; Long, Keren; Chai, Jie; Ma, Jideng; Tang, Qianzi; Tian, Shilin; Hu, Yaodong; Lin, Ling; Wang, Xun; Jiang, Anan; Li, Xuewei; Li, Mingzhou
2016-01-10
Domestication and subsequent selective pressures have produced a large variety of pig coat colors in different regions and breeds. The melanocortin 1 receptor (MC1R) gene plays a crucial role in determining coat color of mammals. Here, we investigated genetic diversity and selection at the coding region of the porcine melanocortin receptor 1 (MC1R) in Tibetan pigs and Landrace pigs. By contrast, genetic variability was much lower in Landrace pigs than in Tibetan pigs. Meanwhile, haplotype analysis showed that Tibetan pigs possessed shared haplotypes, suggesting a possibility of recent introgression event by way of crossbreeding with neighboring domestic pigs or shared ancestral polymorphism. Additionally, we detected positive selection at the MC1R in both Tibetan pigs and Landrace pigs through the dN/dS analysis. These findings suggested that novel phenotypic change (dark coat color) caused by novel mutations may help Tibetan pigs against intensive solar ultraviolet (UV) radiation and camouflage in wild environment, whereas white coat color in Landrace were intentionally selected by human after domestication. Furthermore, both the phylogenetic analysis and the network analysis provided clues that MC1R in Asian and European wild boars may have initially experienced different selective pressures, and MC1R alleles diversified in modern domesticated pigs.
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.
Application of the newly developed 3D transport code r{sup 3}t to selected field cases
Energy Technology Data Exchange (ETDEWEB)
Rubel, A.; Fein, E. [Gesellschaft fuer Anlagen- und Reaktorsicherheit mbH (GRS), Braunschweig (Germany)
2006-07-01
To model the transport of contaminants in connexion with long-term safety analyses of repositories for radioactive waste recently the numerical model r{sup 3}t was developed. In the following first applications of r{sup 3}t are presented. The results of modelling of the transport of zinc at the sewage treatment facility in Cape Cod, Massachusetts, and of trace elements in the frame work of the in-situ diffusion experiments DI-A and DR at the underground laboratory Mont Terri are shown. (authors)
Nakajima, Go; Hayashi, Kazuhiko; Xi, Yaguang; Kudo, Kenji; Uchida, Kazumi; Takasaki, Ken; Yamamoto, Masakazu; Ju, Jingfang
2006-10-01
BACKGROUND: MicroRNAs (miRNAs) are small non-coding RNAs (~22 nucleotides) that regulate gene expression at a post-transcriptional level via imperfect base pairing to the 3'-UTR of their target mRNAs. Previous studies from our group identified a number of deregulated miRNAs due to the loss of p53 tumor suppressor in colon cancer cell lines. To further investigate the in vivo biological significance of these miRNAs, the expressions of hsa-let-7g, hsa-miR-143, hsa-miR-145, hsa-miR-181b and hsa-miR-200c were investigated using formalin-fixed paraffin-embedded (FFPE) colon cancer specimens to evaluate the potential relationship with chemosensitivity and tumorigenesis. PATIENTS AND METHODS: Forty-six patients with recurrent or residual colon cancer lesions were treated with the 5-fluorouracil-based antimetabolite S-1. This includes twenty-one pairs of tumor and normal samples. Total RNAs were isolated and the expression level of each particular miRNA was quantified using real time qRT-PCR analysis. RESULTS: The expression levels of hsa-let-7g, hsa-miR-181b and hsa-miR-200c were over-expressed in tumor tissues compared to normal tissues. The expression levels of hsa-let-7g (p=0.03; Mann-Whitney test) and hsa-miR-181b (p=0.02; Mann-Whitney test) were strongly associated with clinical response to S-1. Although hsa-let-7g and hsa-miR-181b are strongly associated with patient's response to S-1 treatment, they are not significant prognostic factors for predicting survival. CONCLUSION: hsa-let-7g, hsa-miR-181b and hsa-miR-200c may be associated with tumorigenesis in colon cancer. In addition, hsa-let-7g and hsa-miR-181b may be potential indicators for chemoresponse to S-1 based chemotherapy.
Kunieda, Satoshi
2017-09-01
We report the status of the R-matrix code AMUR toward consistent cross-section evaluation and covariance analysis for the light-mass nuclei. The applicable limit of the code is extended by including computational capability for the charged-particle elastic scattering cross-sections and the neutron capture cross-sections as example results are shown in the main texts. A simultaneous analysis is performed on the 17O compound system including the 16O(n,tot) and 13C(α,n)16O reactions together with the 16O(n,n) and 13C(α,α) scattering cross-sections. It is found that a large theoretical background is required for each reaction process to obtain a simultaneous fit with all the experimental cross-sections we analyzed. Also, the hard-sphere radii should be assumed to be different from the channel radii. Although these are technical approaches, we could learn roles and sources of the theoretical background in the standard R-matrix.
Freire-Picos, M A; Landeira-Ameijeiras, V; Mayán, María D
2013-07-01
The correct distribution of nuclear domains is critical for the maintenance of normal cellular processes such as transcription and replication, which are regulated depending on their location and surroundings. The most well-characterized nuclear domain, the nucleolus, is essential for cell survival and metabolism. Alterations in nucleolar structure affect nuclear dynamics; however, how the nucleolus and the rest of the nuclear domains are interconnected is largely unknown. In this report, we demonstrate that RNAP-II is vital for the maintenance of the typical crescent-shaped structure of the nucleolar rDNA repeats and rRNA transcription. When stalled RNAP-II molecules are not bound to the chromatin, the nucleolus loses its typical crescent-shaped structure. However, the RNAP-II interaction with Seh1p, or cryptic transcription by RNAP-II, is not critical for morphological changes.
Cai, Qiang; Wang, Zhenqiang; Wang, Shouhua; Weng, Mingzhe; Zhou, Di; Li, Chen; Wang, Jiandong; Chen, Erzhen
2017-01-01
Long non-coding RNA LINC00152 had been reported as an oncogene in gastric and hepatocellular cancer. In this study, we show that LINC00152 is overexpressed in gallbladder cancer (GBC) tissue samples and cell lines. The high LINC00152 levels correlated negatively with the overall survival time in GBC patients. Functionally, LINC00152 dramatically promoted cell migration, invasion and epithelial–mesenchymal transition (EMT) progression in vitro. In vivo, LINC00152 overexpression significantly promoted tumour peritoneal spreading and metastasis. Mechanistic analyses indicated that LINC00152 functions as a molecular sponge for miR-138, which directly suppresses the expression of hypoxia inducible factor-1α (HIF-1α). We revealed that miR-138 is a suppressor of GBC cell metastasis and EMT progression, and a similar phenomenon was observed in HIF-1α knockdown NOZ cells. Through binding to miR-138, LINC00152 has an oncogenic effect on GBC. Overall, our study suggested that the LINC00152/miR-138/HIF-1α pathway potentiates the progression of GBC, and LINC00152 may be a novel therapeutic target. PMID:28077595
Directory of Open Access Journals (Sweden)
Yih-Horng Shiao
Full Text Available BACKGROUND: Ribosomal RNA (rRNA is a central regulator of cell growth and may control cancer development. A cis noncoding rRNA (nc-rRNA upstream from the 45S rRNA transcription start site has recently been implicated in control of rRNA transcription in mouse fibroblasts. We investigated whether a similar nc-rRNA might be expressed in human cancer epithelial cells, and related to any genomic characteristics. METHODOLOGY/PRINCIPAL FINDINGS: Using quantitative rRNA measurement, we demonstrated that a nc-rRNA is transcribed in human lung epithelial and lung cancer cells, starting from approximately -1000 nucleotides upstream of the rRNA transcription start site (+1 and extending at least to +203. This nc-rRNA was significantly more abundant in the majority of lung cancer cell lines, relative to a nontransformed lung epithelial cell line. Its abundance correlated negatively with total 45S rRNA in 12 of 13 cell lines (P = 0.014. During sequence analysis from -388 to +306, we observed diverse, frequent intercopy single nucleotide polymorphisms (SNPs in rRNA, with a frequency greater than predicted by chance at 12 sites. A SNP at +139 (U/C in the 5' leader sequence varied among the cell lines and correlated negatively with level of the nc-rRNA (P = 0.014. Modelling of the secondary structure of the rRNA 5'-leader sequence indicated a small increase in structural stability due to the +139 U/C SNP and a minor shift in local configuration occurrences. CONCLUSIONS/SIGNIFICANCE: The results demonstrate occurrence of a sense nc-rRNA in human lung epithelial and cancer cells, and imply a role in regulation of the rRNA gene, which may be affected by a +139 SNP in the 5' leader sequence of the primary rRNA transcript.
Qi, Xu; Shao, Ming; Sun, Hongjing; Shen, Yue; Meng, Delong; Huo, Wei
2017-04-21
Activated microglia cells (MCs) are able to release a large amount of inflammatory cytokines after ischemic stroke, which exacerbates neuron damage. In this study, we explored the functional involvement of long non-coding RNA (lncRNA) SNHG14 and its potential regulatory mechanism in the activation of MCs. The mouse model of middle cerebral artery occlusion (MCAO) and microglia cell model of oxygen/glucose deprivation (OGD) were made. The expression of SNHG14, miR-145-5p and PLA2G4A protein expression was determined by quantitative real time PCR and western blot, respectively. Dual-luciferase assay was used to verify the direct binding of miR-145-5p and PLA2G4A. Flow cytometry was applied to measure neurons' apoptosis. SNHG14 highly expressed in ischemic cerebral tissues and BV-2 cells after OGD treatment. SNHG14 knockdown could remarkably inhibit BV-2 cells activation induced by OGD; while SNHG14 overexpression significantly promoted BV-2 cells activation, showing an increase of TNF-α and NO production and neurons' apoptosis rate. Additionally, SNHG14 knockdown promoted the expression of miR-145-5p and reduced PLA2G4A. Contrarily, SNHG14 overexpression inhibited miR-145-5p expression and increased PLA2G4A. Moreover, miR-145-5p overexpression also reversed the effect of OGD on BV-2 cells activation. Bioinformatics analysis and dual-luciferase assay supported that SNHG14 could bind directly to miR-145-5p and miR-145-5p-binding site was existed on 3'-UTR of PLA2G4A. MiR-145-5p mimic reversed the increase of PLA2G4A and reduced the high levels of TNF-α and NO in BV-2 cells induced by SNHG14 overexpression. SNHG14 increased the expression of PLA2G4A by inhibition of miR-145-5p, which resulted in the activation of MCs in cerebral infarction.
Kanamori-Kataoka, Mieko; Seto, Yasuo
2009-02-01
An analytical method for determining paraoxonase activity against sarin, soman and VX was established. We used capillary electrophoresis to measure directly the hydrolysis products: alkyl methylphosphonates. After enzymatic reaction of human serum paraoxonase (PON1) with nerve gas, substrate was removed with dichloromethane, and alkyl methylphoshphonates were quantified by capillary electrophoresis of reversed osmotic flow using cationic detergent and sorbic acid. This method was applied to the characterization of human serum PON1 polymorphism for nerve gas hydrolytic activity in the coding region (Q192R). PON1-192 and PON1-55 genotypes were determined by their gel electrophoretic fragmentation pattern with restriction enzymes after polymerase chain reaction (PCR) of blood leukocyte genomic DNA. Frequencies of genotypes among 63 members of our institutes with PON1-192 and PON1-55 were 9.5% ((192)QQ), 30.1% ((192)QR) and 44.4% ((192)RR), and 82.5% ((55)LL), 17.5% ((55)LM) and 0% ((55)MM), respectively. (192)Q and (192)R enzymes were purified from the respective genotype human plasma, using blue agarose affinity chromatography and diethyl amino ethane (DEAE) anion exchange chromatography. V(max) and K(m) were measured using Lineweaver-Burk plots for hydrolytic activities against sarin, soman and VX at pH 7.4 and 25 degrees C. For sarin and soman, the V(max) for (192)Q PON1 were 3.5- and 1.5-fold higher than those for (192)R PON1; and k(cat)/K(m) for (192)Q PON1 were 1.3- and 2.8-fold higher than those for (192)R PON1. For VX, there was little difference in V(max) and k(cat)/K(m) between (192)Q and (192)R PON1, and VX hydrolyzing activity was significantly lower than those for sarin and soman. PON1 hydrolyzed sarin and soman more effectively than paraoxon.
Gu, Shixin; Xie, Rong; Liu, Xiaodong; Shou, Jiajun; Gu, Wentao; Che, Xiaoming
2017-04-01
Recent evidence has suggested that long non-coding RNAs (lncRNAs) may play a significant role in the pathogenesis of several neurological diseases, including spinal cord injury (SCI). However, little is known about the role of lncRNAs in SCI. The aim of the present study was to evaluate the potential functions of lncRNAs in SCI and to identify the underlying mechanisms of action. We firstly analyzed Gene Expression Omnibus (GEO) datasets to investigate aberrantly-expressed lncRNAs which might be involved in the pathogenesis of SCI. The long non-coding RNA X-inactive specific transcript (XIST) was found to be one of the most significantly upregulated lncRNAs in the GEO dataset analysis, and is associated with apoptosis. We, therefore, selected this as a candidate lncRNA and investigated its function. We found that knockdown of lncRNA-XIST by Lv-shRNA had a prominent protective effect on SCI recovery by suppressing apoptosis through reactivation of the PI3K/AKT signaling pathway in rat spinal cord tissue. In particular, our results suggested that lncRNA-XIST may act as a competitive endogenous RNA, effectively becoming a sink for miR-494, leading to derepression of its target gene, phosphatase and tensin homolog deleted on chromosome ten (PTEN). In addition, an inverse relationship between lncRNA-XIST and miR-494 was observed in spinal cord tissues of SCI rats. Further study demonstrated that antagomiR-494 could reverse the protective effects of lncRNA-XIST knockdown on SCI rats through blocking the PTEN/PI3K/AKT signaling pathway. These results suggested that lncRNA-XIST knockdown may play an important role in limiting neuronal apoptosis in rats following SCI, and that the observed protective effects of lncRNA-XIST knockdown might have been mediated by its regulation on the phosphorylation of AKT by competitively binding miR-494. These findings have revealed, for the first time, the importance of the XIST/miR-494/PTEN/AKT signaling axis in the pathogenesis of SCI
Directory of Open Access Journals (Sweden)
Teresa Milano
2016-01-01
Full Text Available The MocR bacterial transcriptional regulators are characterized by an N-terminal domain, 60 residues long on average, possessing the winged-helix-turn-helix (wHTH architecture responsible for DNA recognition and binding, linked to a large C-terminal domain (350 residues on average that is homologous to fold type-I pyridoxal 5′-phosphate (PLP dependent enzymes like aspartate aminotransferase (AAT. These regulators are involved in the expression of genes taking part in several metabolic pathways directly or indirectly connected to PLP chemistry, many of which are still uncharacterized. A bioinformatics analysis is here reported that studied the features of a distinct group of MocR regulators predicted to be functionally linked to a family of homologous genes coding for integral membrane proteins of unknown function. This group occurs mainly in the Actinobacteria and Gammaproteobacteria phyla. An analysis of the multiple sequence alignments of their wHTH and AAT domains suggested the presence of specificity-determining positions (SDPs. Mapping of SDPs onto a homology model of the AAT domain hinted at possible structural/functional roles in effector recognition. Likewise, SDPs in wHTH domain suggested the basis of specificity of Transcription Factor Binding Site recognition. The results reported represent a framework for rational design of experiments and for bioinformatics analysis of other MocR subgroups.
Milano, Teresa
2016-01-01
The MocR bacterial transcriptional regulators are characterized by an N-terminal domain, 60 residues long on average, possessing the winged-helix-turn-helix (wHTH) architecture responsible for DNA recognition and binding, linked to a large C-terminal domain (350 residues on average) that is homologous to fold type-I pyridoxal 5′-phosphate (PLP) dependent enzymes like aspartate aminotransferase (AAT). These regulators are involved in the expression of genes taking part in several metabolic pathways directly or indirectly connected to PLP chemistry, many of which are still uncharacterized. A bioinformatics analysis is here reported that studied the features of a distinct group of MocR regulators predicted to be functionally linked to a family of homologous genes coding for integral membrane proteins of unknown function. This group occurs mainly in the Actinobacteria and Gammaproteobacteria phyla. An analysis of the multiple sequence alignments of their wHTH and AAT domains suggested the presence of specificity-determining positions (SDPs). Mapping of SDPs onto a homology model of the AAT domain hinted at possible structural/functional roles in effector recognition. Likewise, SDPs in wHTH domain suggested the basis of specificity of Transcription Factor Binding Site recognition. The results reported represent a framework for rational design of experiments and for bioinformatics analysis of other MocR subgroups. PMID:27446613
Zhang, Tong-Han; Liang, Li-Zhong; Liu, Xiao-Ling; Wu, Ji-Nan; Su, Kui; Chen, Jue-Yao; Zheng, Qiao-Yi; Huang, Hong-Zhang; Liao, Gui-Qing
2017-04-01
Metastasis-associated lung adenocarcinoma transcript 1 (MALAT1), a long non-coding RNA (lncRNA), was the earliest discovered to be correlated with cancer and contributes to the initiation and development of several types of tumors. Dysregulation of MALAT1 expression is frequently observed in many types of cancer such as gastric cancer, esophageal squamous cell carcinoma and glioma. To date, the role of MALAT1 and the underlying mechanisms in tongue cancer development remain unclear. In the present study, we studied the influence of MALAT1 on tongue cancer cell lines and clinical tongue cancer samples so as to detect its function and the underlying mechanism. In the present study, lncRNA-MALAT1 was specifically upregulated in tongue cancer cell lines and overexpression promoted tongue cancer cell growth by targeting miR-124. Knockdown of MALAT1 suppressed the growth and invasion of human tongue cancer cells and inhibited metastasis in vitro and in vivo. In addition, miR-124-dependent jagged1 (JAG1) regulation was required for MALAT1-induced tongue cancer cell growth. Our data revealed that MALAT1 inhibited tongue cancer cell growth and metastasis through miR-124-dependent JAG1 regulation. In conclusion, we revealed that MALAT1 may play an oncogenic role by increasing proliferation and metastasis of tongue cancer and is a potential therapeutic target in human tongue cancer.
Energy Technology Data Exchange (ETDEWEB)
Delbecq, J.M
1999-07-01
The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)
Muñoz-Barús, José I; Rodríguez-Calvo, María Sol; Suárez-Peñaranda, José M; Vieira, Duarte N; Cadarso-Suárez, Carmen; Febrero-Bande, Manuel
2010-01-30
In legal medicine the correct determination of the time of death is of utmost importance. Recent advances in estimating post-mortem interval (PMI) have made use of vitreous humour chemistry in conjunction with Linear Regression, but the results are questionable. In this paper we present PMICALC, an R code-based freeware package which estimates PMI in cadavers of recent death by measuring the concentrations of potassium ([K+]), hypoxanthine ([Hx]) and urea ([U]) in the vitreous humor using two different regression models: Additive Models (AM) and Support Vector Machine (SVM), which offer more flexibility than the previously used Linear Regression. The results from both models are better than those published to date and can give numerical expression of PMI with confidence intervals and graphic support within 20 min. The program also takes into account the cause of death. 2009 Elsevier Ireland Ltd. All rights reserved.
Lavrov, Dennis V; Pett, Walker; Voigt, Oliver; Wörheide, Gert; Forget, Lise; Lang, B Franz; Kayal, Ehsan
2013-04-01
Sponges (phylum Porifera) are a large and ancient group of morphologically simple but ecologically important aquatic animals. Although their body plan and lifestyle are relatively uniform, sponges show extensive molecular and genetic diversity. In particular, mitochondrial genomes from three of the four previously studied classes of Porifera (Demospongiae, Hexactinellida, and Homoscleromorpha) have distinct gene contents, genome organizations, and evolutionary rates. Here, we report the mitochondrial genome of Clathrina clathrus (Calcinea, Clathrinidae), a representative of the fourth poriferan class, the Calcarea, which proves to be the most unusual. Clathrina clathrus mitochondrial DNA (mtDNA) consists of six linear chromosomes 7.6-9.4 kb in size and encodes at least 37 genes: 13 protein codings, 2 ribosomal RNAs (rRNAs), and 24 transfer RNAs (tRNAs). Protein genes include atp9, which has now been found in all major sponge lineages, but no atp8. Our analyses further reveal the presence of a novel genetic code that involves unique reassignments of the UAG codons from termination to tyrosine and of the CGN codons from arginine to glycine. Clathrina clathrus mitochondrial rRNAs are encoded in three (srRNA) and ≥6 (lrRNA) fragments distributed out of order and on several chromosomes. The encoded tRNAs contain multiple mismatches in the aminoacyl acceptor stems that are repaired posttranscriptionally by 3'-end RNA editing. Although our analysis does not resolve the phylogenetic position of calcareous sponges, likely due to their high rates of mitochondrial sequence evolution, it confirms mtDNA as a promising marker for population studies in this group. The combination of unusual mitochondrial features in C. clathrus redefines the extremes of mtDNA evolution in animals and further argues against the idea of a "typical animal mtDNA."
Ma, Jianlong; Pan, Hui; Zeng, Yan; Lv, Yehui; Zhang, Heng; Xue, Aimin; Jiang, Jieqing; Ma, Kaijun; Chen, Long
2015-12-01
Precise estimation of postmortem interval (PMI) is crucial in some criminal cases. This study aims to find some optimal markers for PMI estimation and build a mathematical model that could be used in various temperature conditions. Different mRNA and microRNA markers in rat brain samples were detected using real-time fluorescent quantitative PCR at 12 time points within 144 h postmortem and at temperatures of 4, 15, 25, and 35 °C. Samples from 36 other rats were used to verify the animal mathematical model. Brain-specific mir-9 and mir-125b are effective endogenous control markers that are not affected by PMI up to 144 h postmortem under these temperatures, whereas the commonly used U6 is not a suitable endogenous control in this study. Among all the candidate markers, ΔCt (β-actin) has the best correlation coefficient with PMI and was used to build a new model using R software which can simultaneously manage both PMI and temperature parameters. This animal mathematical model is verified using samples from 36 other rats and shows increased accuracy for higher temperatures and longer PMI. In this study, β-actin was found to be an optimal marker to estimate PMI and some other markers were found to be suitable to act as endogenous controls. Additionally, we have used R code software to build a model of PMI estimation that could be used in various temperature conditions.
Polynomial weights and code constructions
DEFF Research Database (Denmark)
Massey, J; Costello, D; Justesen, Jørn
1973-01-01
polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... that are subcodes of the binary Reed-Muller codes and can be very simply instrumented, 3) a new class of constacyclic codes that are subcodes of thep-ary "Reed-Muller codes," 4) two new classes of binary convolutional codes with large "free distance" derived from known binary cyclic codes, 5) two new classes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm....
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2009-01-01
Property testing was initially studied from various motivations in 1990's.A code C (∩)GF(r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector's coordinates.The problem of testing codes was firstly studied by Blum,Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs).How to characterize locally testable codes is a complex and challenge problem.The local tests have been studied for Reed-Solomon (RS),Reed-Muller (RM),cyclic,dual of BCH and the trace subcode of algebraicgeometric codes.In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions).We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Property testing was initially studied from various motivations in 1990’s. A code C GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally testable codes is a complex and challenge problem. The local tests have been studied for Reed-Solomon (RS), Reed-Muller (RM), cyclic, dual of BCH and the trace subcode of algebraicgeometric codes. In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions). We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Energy Technology Data Exchange (ETDEWEB)
Okamura, Nobuo; Sato, Koji [Japan Nuclear Cycle Development Inst., Oarai, Ibaraki (Japan). Oarai Engineering Center
2002-03-01
An analysis code using the object-oriented software EX{center_dot}TD Ver.4 was developed for the estimation of material balance for the system design of the pyrochemical reprocessing plants consisting of batch processes. This code can also estimate the radioactivity balance, decay heat balance and holdup, and easily cope with the improvement of the process flow, and so on. An example of the material balance estimation under the consideration of the solvent (molten salt) recycling time is presented for the oxide electrowinning reprocessing system designed in the feasibility study of the FBR fuel cycle system. The results indicate the possibility of reduction of the vitrified waste form volume due to the extension of the recycling time of the solvent. This paper describes the outline of the code and estimation of the material balance in the oxide electrowinning reprocessing system under consideration of the solvent recycling time. (author)
Directory of Open Access Journals (Sweden)
Fabio Burderi
2007-05-01
Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.
Energy Technology Data Exchange (ETDEWEB)
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.
Directory of Open Access Journals (Sweden)
Yuko Kazumi
2012-01-01
Conclusions: The 16S rRNA gene identification is a rapid and prevalent method but still has some limitations. Therefore, the stepwise combination of rpoB with 16S rRNA gene analysis is an effective system for the identification of Mycobacterium species.
Tew, Roy; Ibrahim, Mounir; Simon, Terry; Mantell, Susan; Gedeon, David; Qiu, Songgang; Wood, Gary
2004-01-01
This paper win report on continuation through the third year of a NASA grant for multi-dimensional Stirling CFD code development and validation; continuation through the third and final year of a Department of Energy, Golden Field Office (DOE), regenerator research effort and a NASA grant for continuation of the effort through two additional years; and a new NASA Research Award for design, microfabrication and testing of a "Next Generation Stirling Engine Regenerator." Cleveland State University (CSU) is the lead organization for all three efforts, with the University of Minnesota (UMN) and Gedeon Associates as subcontractors. The Stirling Technology Company and Sun power, Inc. acted as unfunded consultants or participants through the third years of both the NASA multi-D code development and DOE regenerator research efforts; they win both be subcontractors on the new regenerator microfabrication contract.
Latorre, Jose I
2015-01-01
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical properties of the boundary determine those of the bulk. This H-code is made of an even superposition of states whose relative Hamming distances are exponentially large with the size of the boundary. This property makes H-codes natural states for a quantum memory. H-codes exist on tori of definite sizes and get classified in three different sectors characterized by the sum of their qutrits on cycles wrapped through the boundaries of the system. We construct a parent Hamiltonian for the H-code which is highly non local and finally we compute the topological entanglement entropy of the H-code.
Kubilius, Jonas
2014-01-01
Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF). GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
Energy Technology Data Exchange (ETDEWEB)
Grover, B T
2003-05-05
The main goal of this project was to determine if a tool could be built to test Qt. In determining the feasibility of building a tool the following requirements needed to be researched: (1) Determine if the underlying Qt signal/slot architecture could be leveraged. (2) Research how much impact implementing such a tool would have on existing code, i.e. how much extra code would need to be inserted to use the tool. (3) Determine with the above information if a tool could be built. With the above steps completed, the information needed to make a decision on building a tool could be made. Armed with this information I felt I could make a more educated decision on the possibility of building a tool. This project was divided into two main steps. The first step was to understand the underlying Qt source code much better. The second step was to build a small prototype that I could use to test ideas. The first step was actually much shorter than I had originally anticipated. Understanding the underlying architecture of Qt only took about two weeks. After studying the architecture of qt and working with the support people at Trolltech, the company that develops Qt, I found a way to test Qt. This project was very successful. I accomplished everything I intended to do. I learned and understood the inner workings of the Qt library enough that I could build a simple tool that could leverage some of the information in Qt to test the GUI. I was also able to find a tool that was commercially available to test Qt GUI's. These two things were the main goals of this project. Therefore I consider it a success. In fact I was able to progress farther with my prototype testing then I had originally planned.
Data Qualification Report For: Thermodynamic Data File, DATA0.YMP.R0 For Geochemical Code, EQ3/6
Energy Technology Data Exchange (ETDEWEB)
P.L. Cloke
2001-10-16
The objective of this work is to evaluate the adequacy of chemical thermodynamic data provided by Lawrence Livermore National Laboratory (LLNL) as DataO.ymp.ROA in response to an input request submitted under AP-3.14Q. This request specified that chemical thermodynamic data available in the file, Data0.com.R2, be updated, improved, and augmented for use in geochemical modeling used in Process Model Reports (PMRs) for Engineered Barrier Systems, Waste Form, Waste Package, Unsaturated Zone, and Near Field Environment, as well as for Performance Assessment. The data are qualified in the temperature range 0 to 100 C. Several Data Tracking Numbers (DTNs) associated with Analysis/Model Reports (AMR) addressing various aspects of the post-closure chemical behavior of the waste package and the Engineered Barrier System that rely on EQ316 outputs to which these data are used as input, are Principal Factor affecting. This qualification activity was accomplished in accordance with the AP-SIII.2Q using the Technical Assessment method. A development plan, TDP-EBS-MD-000044, was prepared in accordance with AP-2.13Q and approved by the Responsible Manager. In addition, a Process Control Evaluation was performed in accordance with AP-SV.1Q. The qualification method, selected in accordance with AP-SIII.2Q, was Technical Assessment. The rationale for this approach is that the data in File Data0.com.R2 are considered Handbook data and therefore do not themselves require qualification. Only changes to Data0.com.R2 required qualification. A new file has been produced which contains the database Data0.ymp.R0, which is recommended for qualification as a result of this action. Data0.ymp.R0 will supersede Data0.com.R2 for all Yucca Mountain Project (YMP) activities.
DEFF Research Database (Denmark)
Cox, Geoff
Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and software...
2014-12-01
QPSK Gaussian channels . .......................................................................... 39 vi 1. INTRODUCTION Forward error correction (FEC...Capacity of BSC. 7 Figure 5. Capacity of AWGN channel . 8 4. INTRODUCTION TO POLAR CODES Polar codes were introduced by E. Arikan in [1]. This paper...Under authority of C. A. Wilgenbusch, Head ISR Division EXECUTIVE SUMMARY This report describes the results of the project “More reliable wireless
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.
Quentin, R; Ruimy, R; Rosenau, A; Musser, J M; Christen, R
1996-06-01
Previous genetic analysis of Haemophilus influenzae strains isolated from genital and neonatal infections identified a group of biotype IV that constitutes a cryptic genospecies only distantly related to H. influenzae and H. Haemolyticus. Small-subunit rRNA genes of two representative strains of this genital Haemophilus genospecies (strains 16N and 2406) were sequenced. The analysis indicated that these strains form a monophyletic unit with H. haemolyticus and H. influenzae biogroups Influenzae and Aegyptius and are more closely related to H. haemolyticus than to H. influenzae biogroups Influenzae and Aegyptius. 16S rRNA gene sequences were used to formulate primers for PCR-based identification of cryptic genital Haemophilus organisms. A 242-bp fragment was amplified from strains belonging to the genital Haemophilus genospecies but not from strains of 12 other Haemophilus species, including strains of H. influenzae biotype IV sensu stricto.
Li, Zheng; Jin, Chanyuan; Chen, Si; Zheng, Yunfei; Huang, Yiping; Jia, Lingfei; Ge, Wenshu; Zhou, Yongsheng
2017-04-05
lncRNAs are an emerging class of regulators involved in multiple biological processes. MEG3, an lncRNA, acts as a tumor suppressor, has been reported to be linked with osteogenic differentiation of MSCs. However, limited knowledge is available concerning the roles of MEG3 in the multilineage differentiation of hASCs. The current study demonstrated that MEG3 was downregulated during adipogenesis and upregulated during osteogenesis of hASCs. Further functional analysis showed that knockdown of MEG3 promoted adipogenic differentiation, whereas inhibited osteogenic differentiation of hASCs. Mechanically, MEG3 may execute its role via regulating miR-140-5p. Moreover, miR-140-5p was upregulated during adipogenesis and downregulated during osteogenesis in hASCs, which was negatively correlated with MEG3. In conclusion, MEG3 participated in the balance of adipogenic and osteogenic differentiation of hASCs, and the mechanism may be through regulating miR-140-5p.
Hia, Fabian; Chionh, Yok Hian; Pang, Yan Ling Joy; DeMott, Michael S; McBee, Megan E; Dedon, Peter C
2015-03-11
A major challenge in the study of mycobacterial RNA biology is the lack of a comprehensive RNA isolation method that overcomes the unusual cell wall to faithfully yield the full spectrum of non-coding RNA (ncRNA) species. Here, we describe a simple and robust procedure optimized for the isolation of total ncRNA, including 5S, 16S and 23S ribosomal RNA (rRNA) and tRNA, from mycobacteria, using Mycobacterium bovis BCG to illustrate the method. Based on a combination of mechanical disruption and liquid and solid-phase technologies, the method produces all major species of ncRNA in high yield and with high integrity, enabling direct chemical and sequence analysis of the ncRNA species. The reproducibility of the method with BCG was evident in bioanalyzer electrophoretic analysis of isolated RNA, which revealed quantitatively significant differences in the ncRNA profiles of exponentially growing and non-replicating hypoxic bacilli. The method also overcame an historical inconsistency in 5S rRNA isolation, with direct sequencing revealing a novel post-transcriptional processing of 5S rRNA to its functional form and with chemical analysis revealing seven post-transcriptional ribonucleoside modifications in the 5S rRNA. This optimized RNA isolation procedure thus provides a means to more rigorously explore the biology of ncRNA species in mycobacteria. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.
Wang, Yong; Yang, Tao; Zhang, Zhen; Lu, Ming; Zhao, Wei; Zeng, Xiandong; Zhang, Weiguo
2017-05-01
Long non-coding RNA (lncRNA) have been the focus of increasing attention due to the role they play in many diseases, including osteosarcoma. The function of taurine upregulated gene 1 (TUG1) and its mechanism in osteosarcoma remain unclear. In our research, we found that TUG1 was elevated and correlated with a poor prognosis in osteosarcoma patients. In addition, the following functional experiment showed that decreased TUG1 could remarkably inhibit osteosarcoma cell migration and invasion, indicating that TUG1 functioned as an oncogene in osteosarcoma. Moreover, we revealed that TUG1 and Rho-associated coiled-coil-containing protein kinase 1 (ROCK1), a metastasis-related gene targeted by microRNA-335-5p (miR-335-5p), had the same miR-335-5p combining site. The subsequent luciferase assay verified TUG1 was a target of miR-335-5p. Furthermore, the results of a real-time quantitative PCR showed that TUG1 and miR-335-5p could affect each other's expression. respectively. Finally, we affirmed that TUG1 affected ROCK1 expression and ROCK1-mediated migration/invasion by working as a competitive endogenous RNA (ceRNA) via miR-335-5p. In summary, the findings of this study, based on ceRNA theory, combining the research foundation of miR-335-5p and ROCK1, and taking TUG1 as a new study point, provide new insight into molecular-level reversing migration and invasion of osteosarcoma. © 2017 The Authors. Cancer Science published by John Wiley & Sons Australia, Ltd on behalf of Japanese Cancer Association.
Directory of Open Access Journals (Sweden)
Xiaomin Liu
2016-09-01
Full Text Available Objective: lncRNAs are recently thought to play a significant role in cellular homeostasis during pathological process of diseases by competing inhibiting miRNA function. The aim of present study was to assess the function of long non-coding RNA (lncRNA MEG3 and its functional interaction with microRNA-181b in cerebral ischemic infarct of mice and hypoxia-induced neurons apoptosis. Methods: To address this question, we performed the experiments with in vivo middle cerebral artery occlusion (MCAO mice model and in vitro oxygen-glucose deprivation (OGD-cultured neuronal HT22 cell line. Relative expression of MEG3, miR-181b and 12/15-LOX (lipoxygenase mRNA was determined using quantitative RT-PCR. Western blot was used to evaluate 12/15-LOX protein expression. TUNEL assay was performed to assess cell apoptosis.Results: In both MCAO mice and OGD-cultured HT22 cell, ischemia or hypoxia treatment results in a time-dependent increase in MEG3 and 12/15-LOX expression and decrease in miR-181b expression. Knockdown of MEG3 contributes to attenuation of hypoxia-induced apoptosis of HT22 cell. Also, expression level of MEG3 negatively correlated with miR-181b expression and positively correlated with 12/15-LOX expression. In contrary to MEG3, miR-181b overexpression attenuated hypoxia-induced HT22 cell apoptosis, as well as suppressed hypoxia-induced increase in 12/15-LOX expression. By luciferase reporter assay, we concluded that miR-181b directly binds to 12/15-LOX 3’-UTR, thereby negatively regulates 12/15-LOX expression. Conclusion: Our data suggested that long non-coding RNA MEG3 functions as a competing endogenous RNA for miR-181b to regulate 12/15-LOX expression in middle cerebral artery occlusion-induced ischemic infarct of brain nerve cells.
Indian Academy of Sciences (India)
Manju Pruthi
2001-11-01
In this paper explicit expressions of + 1 idempotents in the ring $R = F_q[X]/\\langle X^{2^m}-1\\rangle$ are given. Cyclic codes of length 2 over the finite field , of odd characteristic, are defined in terms of their generator polynomials. The exact minimum distance and the dimension of the codes are obtained.
Xie, Chu-Hai; Cao, Yan-Ming; Huang, Yan; Shi, Qun-Wei; Guo, Jian-Hong; Fan, Zi-Wen; Li, Ju-Gen; Chen, Bin-Wei; Wu, Bo-Yi
2016-11-01
Recent studies have shown that long non-coding RNAs (lncRNAs) have critical roles in tumorigenesis, including osteosarcoma. The lncRNA taurine-upregulated gene 1 (TUG1) was reported to be involved in the progression of osteosarcoma. Here, we investigated the role of TUG1 in osteosarcoma cells and the underlying mechanism. TUG1 expression was measured in osteosarcoma cell lines and human normal osteoblast cells by quantitative real-time PCR (qRT-PCR). The effects of TUG1 on osteosarcoma cells were studied by RNA interference in vitro and in vivo. The mechanism of competing endogenous RNA (ceRNA) was determined using bioinformatic analysis and luciferase assays. Our data showed that TUG1 knockdown inhibited cell proliferation and colony formation, and induced G0/G1 cell cycle arrest and apoptosis in vitro, and suppressed tumor growth in vivo. Besides, we found that TUG1 acted as an endogenous sponge to directly bind to miR-9-5p and downregulated miR-9-5p expression. Moreover, TUG1 overturned the effect of miR-9-5p on the proliferation, colony formation, cell cycle arrest, and apoptosis in osteosarcoma cells, which involved the derepression of POU class 2 homeobox 1 (POU2F1) expression. In conclusion, our study elucidated a novel TUG1/miR-9-5p/POU2F1 pathway, in which TUG1 acted as a ceRNA by sponging miR-9-5p, leading to downregulation of POU2F1 and facilitating the tumorigenesis of osteosarcoma. These findings may contribute to the lncRNA-targeted therapy for human osteosarcoma.
Energy Technology Data Exchange (ETDEWEB)
Ravishankar, C., Hughes Network Systems, Germantown, MD
1998-05-08
Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the
Energy Technology Data Exchange (ETDEWEB)
Vakhitov, V.A.; Gimalov, F.R.; Nikonorov, Yu.M.
1986-10-01
The number of 5s-rRNA and tRNA genes has been studied in 43 species of wheat and Aegilops differing in ploidy level, genomic composition and origin. It has been demonstrated that the repeatability of the 5s-rRNA and tRNA genes increases in wheat with increasing ploidy level, but not in proportion to the genome size. In Aegilops, in distinction from wheat, the relative as well as absolute number of 5s-RNA genes increases with increasing ploidy level. The proportion of the sequences coding for tRNA in the dipoloid and polyploid Aegilops species is practically similar, while the number of tRNA genes increases almost 2-3 times with increasing ploidy level. Large variability has been recorded between the species with similar genomic composition and ploidy level in respect of the number of the 5s-rRNA and tRNA genes. It has been demonstrated that integration of the initial genomes of the amphidiploids is accompanied by elimination of a particular part of these genomes. It has been concluded that the mechanisms of establishment and evolution of genomes in the intra- and intergeneric allopolyploids are not identical.
DEFF Research Database (Denmark)
Cox, Geoff
; alternatives to mainstream development, from performances of the live-coding scene to the organizational forms of commons-based peer production; the democratic promise of social media and their paradoxical role in suppressing political expression; and the market’s emptying out of possibilities for free...... development, Speaking Code unfolds an argument to undermine the distinctions between criticism and practice, and to emphasize the aesthetic and political aspects of software studies. Not reducible to its functional aspects, program code mirrors the instability inherent in the relationship of speech...... expression in the public realm. The book’s line of argument defends language against its invasion by economics, arguing that speech continues to underscore the human condition, however paradoxical this may seem in an era of pervasive computing....
Directory of Open Access Journals (Sweden)
Asier González
Full Text Available Ptc6 is one of the seven components (Ptc1-Ptc7 of the protein phosphatase 2C family in the yeast Saccharomyces cerevisiae. In contrast to other type 2C phosphatases, the cellular role of this isoform is poorly understood. We present here a comprehensive characterization of this gene product. Cells lacking Ptc6 are sensitive to zinc ions, and somewhat tolerant to cell-wall damaging agents and to Li(+. Ptc6 mutants are sensitive to rapamycin, albeit to lesser extent than ptc1 cells. This phenotype is not rescued by overexpression of PTC1 and mutation of ptc6 does not reproduce the characteristic genetic interactions of the ptc1 mutation with components of the TOR pathway, thus suggesting different cellular roles for both isoforms. We show here that the rapamycin-sensitive phenotype of ptc6 cells is unrelated to the reported role of Pt6 in controlling pyruvate dehydrogenase activity. Lack of Ptc6 results in substantial attenuation of the transcriptional response to rapamycin, particularly in the subset of repressed genes encoding ribosomal proteins or involved in rRNA processing. In contrast, repressed genes involved in translation are Ptc6-independent. These effects cannot be attributed to the regulation of the Sch9 kinase, but they could involve modulation of the binding of the Ifh1 co-activator to specific gene promoters.
Davidson, A; An, W; Tsung, F S; Lu, W; Vieira, J; Fonseca, R A; Silva, L O; Mori, W B
2014-01-01
For many plasma physics problems, three-dimensional and kinetic effects are very important. However, such simulations are very computationally intensive. Fortunately, there is a class of problems for which there is nearly azimuthal symmetry and the dominant three-dimensional physics is captured by the inclusion of only a few azimuthal harmonics. Recently, it was proposed [A. Lifschitz et al., J. Comp. Phys. 228 (5) (2009) 1803-1814] to model one such problem, laser wakefield acceleration, by expanding the fields and currents in azimuthal harmonics and truncating the expansion after only the first harmonic. The complex amplitudes of the fundamental and first harmonic for the fields were solved on an r-z grid and a procedure for calculating the complex current amplitudes for each particle based on its motion in Cartesian geometry was presented using a Marder's correction to maintain the validity of Gauss's law. In this paper, we describe an implementation of this algorithm into OSIRIS using a rigorous charge co...
Directory of Open Access Journals (Sweden)
Valeria Victoria IOVANOV
2014-05-01
Full Text Available A CNC machine makes use of mathematics and various coordinate systems to understand and process the information it receives to determine what to move where and how fast . The most important function of any CNC machine is precise and rigorous control of the movement. All CNC equipment have two or more directions of motion, called axes. CNC machines are driven by computer controlled servo motors and generally guided by a stored program, the type of movement (fast , linear, circular , the moving axes, the distances of movement and the speed of movement ( processing being programmable for most CNC machines . This paper proposes the design and implementation of a G code programming language for the reference point Case R290 - 02IS the short version compared to the classical part of the garland product C3G 1200,1400,1600 , reference points used in all fields that use conveyors .
Optimal codes as Tanner codes with cyclic component codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pinero, Fernando; Zeng, Peng
2014-01-01
In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe...... the codes succinctly using Gröbner bases....
NOVEL BIPHASE CODE -INTEGRATED SIDELOBE SUPPRESSION CODE
Institute of Scientific and Technical Information of China (English)
Wang Feixue; Ou Gang; Zhuang Zhaowen
2004-01-01
A kind of novel binary phase code named sidelobe suppression code is proposed in this paper. It is defined to be the code whose corresponding optimal sidelobe suppression filter outputs the minimum sidelobes. It is shown that there do exist sidelobe suppression codes better than the conventional optimal codes-Barker codes. For example, the sidelobe suppression code of length 11 with filter of length 39 has better sidelobe level up to 17dB than that of Barker code with the same code length and filter length.
From concatenated codes to graph codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom
2004-01-01
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...
Suleman, Naushadalli K.
1994-12-01
were generated for the irradiated specimens showed that the electrons penetrated the material to a depth of approximately 0.125 inch. These data show a very high degree of correlation to the energy deposition profile as predicted by the Tiger Code, a Monte Carlo code that provides guidelines for the transport of electrons in matter. Subsequent efforts will focus on delineating the transport properties of energetic protons in Ultem(R).
Suleman, Naushadalli K.
1994-01-01
were generated for the irradiated specimens showed that the electrons penetrated the material to a depth of approximately 0.125 inch. These data show a very high degree of correlation to the energy deposition profile as predicted by the Tiger Code, a Monte Carlo code that provides guidelines for the transport of electrons in matter. Subsequent efforts will focus on delineating the transport properties of energetic protons in Ultem(R).
Hiebeler, David E
2015-01-01
The First Book to Explain How a User of R or MATLAB Can Benefit from the OtherIn today's increasingly interdisciplinary world, R and MATLAB® users from different backgrounds must often work together and share code. R and MATLAB® is designed for users who already know R or MATLAB and now need to learn the other platform. The book makes the transition from one platform to the other as quick and painless as possible.Enables R and MATLAB Users to Easily Collaborate and Share CodeThe author covers essential tasks, such as working with matrices and vectors, writing functions and other programming co
DEFF Research Database (Denmark)
Mailund, Thomas
2017-01-01
Learn how to manipulate functions and expressions to modify how the R language interprets itself. This book is an introduction to metaprogramming in the R language, so you will write programs to manipulate other programs. Metaprogramming in R shows you how to treat code as data that you can...
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.
LFSC - Linac Feedback Simulation Code
Energy Technology Data Exchange (ETDEWEB)
Ivanov, Valentin; /Fermilab
2008-05-01
The computer program LFSC (
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 ...
Braun, W. John; White, Bethany J. G.; Craig, Gavin
2014-01-01
Real-world phenomena simulation models, which can be used to engage middle-school students with probability, are described. Links to R instructional material and easy-to-use code are provided to facilitate implementation in the classroom.
Braun, W. John; White, Bethany J. G.; Craig, Gavin
2014-01-01
Real-world phenomena simulation models, which can be used to engage middle-school students with probability, are described. Links to R instructional material and easy-to-use code are provided to facilitate implementation in the classroom.
Space Time Codes from Permutation Codes
Henkel, Oliver
2006-01-01
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.
Fundamentals of convolutional coding
Johannesson, Rolf
2015-01-01
Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field * Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding * Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes * Distance properties of convolutional codes * Includes a downloadable solutions manual
Strong Trinucleotide Circular Codes
Directory of Open Access Journals (Sweden)
Christian J. Michel
2011-01-01
Full Text Available Recently, we identified a hierarchy relation between trinucleotide comma-free codes and trinucleotide circular codes (see our previous works. Here, we extend our hierarchy with two new classes of codes, called DLD and LDL codes, which are stronger than the comma-free codes. We also prove that no circular code with 20 trinucleotides is a DLD code and that a circular code with 20 trinucleotides is comma-free if and only if it is a LDL code. Finally, we point out the possible role of the symmetric group ∑4 in the mathematical study of trinucleotide circular codes.
Mathematical models for the EPIC code
Energy Technology Data Exchange (ETDEWEB)
Buchanan, H.L.
1981-06-03
EPIC is a fluid/envelope type computer code designed to study the energetics and dynamics of a high energy, high current electron beam passing through a gas. The code is essentially two dimensional (x, r, t) and assumes an axisymmetric beam whose r.m.s. radius is governed by an envelope model. Electromagnetic fields, background gas chemistry, and gas hydrodynamics (density channel evolution) are all calculated self-consistently as functions of r, x, and t. The code is a collection of five major subroutines, each of which is described in some detail in this report.
Forms and Linear Network Codes
DEFF Research Database (Denmark)
Hansen, Johan P.
spaces of Veronese varieties. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal......We present a general theory to obtain linear network codes utilizing forms and obtain explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same small dimension. The theory is inspired by the methods of the author utilizing the osculating...... them suitable for linear network coding. The parameters of the resulting linear network codes are determined....
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
On the Codes over a Semilocal Finite Ring
Directory of Open Access Journals (Sweden)
Abdullah Dertli
2015-10-01
Full Text Available In this paper, we study the structure of cyclic, quasi cyclic, constacyclic codes and their skew codes over the finite ring R. The Gray images of cyclic, quasi cyclic, skew cyclic, skew quasi cyclic and skew constacyclic codes over R are obtained. A necessary and sufficient condition for cyclic (negacyclic codes over R that contains its dual has been given. The parameters of quantum error correcting codes are obtained from both cyclic and negacyclic codes over R. Some examples are given. Firstly, quasi constacyclic and skew quasi constacyclic codes are introduced. By giving two inner product, it is investigated their duality. A sufficient condition for 1 generator skew quasi constacyclic codes to be free is determined.
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…
DEFF Research Database (Denmark)
de Porcellinis, Alice Jara; Klähn, Stephan; Rosgaard, Lisa
2016-01-01
activity and possible factors acting downstream of PmgA are unknown. Here, a genome-wide microarray analysis of a ΔpmgA strain identified the expression of 36 protein-coding genes and 42 non-coding transcripts as significantly altered. From these, the non-coding RNA Ncr0700 was identified as the transcript...... most strongly reduced in abundance. Ncr0700 is widely conserved among cyanobacteria. In Synechocystis its expression is inversely correlated with light intensity. Similarly to a ΔpmgA mutant, a Δncr0700 deletion strain showed an approximately 2-fold increase in glycogen content under photoautotrophic...
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip
2012-01-01
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....
A decoding method of an n length binary BCH code through (n + 1n length binary cyclic code
Directory of Open Access Journals (Sweden)
TARIQ SHAH
2013-09-01
Full Text Available For a given binary BCH code Cn of length n = 2 s - 1 generated by a polynomial of degree r there is no binary BCH code of length (n + 1n generated by a generalized polynomial of degree 2r. However, it does exist a binary cyclic code C (n+1n of length (n + 1n such that the binary BCH code Cn is embedded in C (n+1n . Accordingly a high code rate is attained through a binary cyclic code C (n+1n for a binary BCH code Cn . Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C (n+1n , while the codes Cn and C (n+1n have the same minimum hamming distance.
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
Creating R Packages: A Tutorial
Leisch, Friedrich
2008-01-01
This tutorial gives a practical introduction to creating R packages. We discuss how object oriented programming and S formulas can be used to give R code the usual look and feel, how to start a package from a collection of R functions, and how to test the code once the package has been created. As running example we use functions for standard linear regression analysis which are developed from scratch.
A note on Type II covolutional codes
Johannesson, Rolf; Ståhl, Per; Wittenmark, Emma
2000-01-01
The result of a search for the world's second type II (doubly-even and self-dual) convolutional code is reported. A rate R=4/8, 16-state, time-invariant, convolutional code with free distance dfree=8 was found to be type II. The initial part of its weight spectrum is better than that of the Golay convolutional code (GCC). Generator matrices and path weight enumerators for some other type II convolutional codes are given. By the “wrap-around” technique tail-biting versions of (32, 18, 8) T...
Rateless Coding for MIMO Block Fading Channels
Fan, Yijia; Erkip, Elza; Poor, H Vincent
2008-01-01
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.
Locally Orderless Registration Code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Locally orderless registration code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
New quantum codes from dual-containing cyclic codes over finite rings
Tang, Yongsheng; Zhu, Shixin; Kai, Xiaoshan; Ding, Jian
2016-11-01
Let R=F_{2m}+uF_{2m}+\\cdots +ukF_{2m}, where F_{2m} is the finite field with 2m elements, m is a positive integer, and u is an indeterminate with u^{k+1}=0. In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over R. A new Gray map over R is defined, and a sufficient and necessary condition for the existence of dual-containing cyclic codes over R is given. A new family of 2m-ary quantum codes is obtained via the Gray map and the Calderbank-Shor-Steane construction from dual-containing cyclic codes over R. In particular, a new family of binary quantum codes is obtained via the Gray map, the trace map and the Calderbank-Shor-Steane construction from dual-containing cyclic codes over R.
Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark
2012-01-01
A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…
Institute of Scientific and Technical Information of China (English)
2008-01-01
Quantum error correcting codes are indispensable for quantum information processing and quantum computation.In 1995 and 1996,Shor and Steane gave first several examples of quantum codes from classical error correcting codes.The construction of efficient quantum codes is now an active multi-discipline research field.In this paper we review the known several constructions of quantum codes and present some examples.
Turbo Codes Extended with Outer BCH Code
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
1996-01-01
The "error floor" observed in several simulations with the turbo codes is verified by calculation of an upper bound to the bit error rate for the ensemble of all interleavers. Also an easy way to calculate the weight enumerator used in this bound is presented. An extended coding scheme is proposed...
R data analysis without programming
Gerbing, David W
2013-01-01
This book prepares readers to analyze data and interpret statistical results using R more quickly than other texts. R is a challenging program to learn because code must be created to get started. To alleviate that challenge, Professor Gerbing developed lessR. LessR extensions remove the need to program. By introducing R through less R, readers learn how to organize data for analysis, read the data into R, and produce output without performing numerous functions and programming exercises first. With lessR, readers can select the necessary procedure and change the relevant variables without pro
Further results on binary convolutional codes with an optimum distance profile
DEFF Research Database (Denmark)
Johannesson, Rolf; Paaske, Erik
1978-01-01
the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic...... codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes.......Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit...
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...
Fang, Qun; Chen, XiaoYan; Zhi, XuTing
2016-01-01
Background In this study, we aimed to investigate the association between UCA1 and miR-27b in gastric cancer and further study their involvement in multi-drug resistance (MDR) of gastric cancer. Material/Methods The microarray data of dysregulated lncRNAs in gastric cancer tissues was retrieved in the GEO dataset. QRT-PCR analysis was performed to assess UCA1 expression based on 28 paired cancerous and peritumoral normal tissues. The human gastric cancer cell line SGC-7901, and SGC-7901 derived Adriamycin (doxorubicin) resistant SGC-7901/ADR, cisplatin resistant SGC-7901/DDP, and 5-FU resistant SGC-7901/FU cells were used as in vitro cell models to assess the effect of UCA1 and miR-27b on MDR. Results UCA1 was significantly upregulated in the cancerous tissues and its expression was negatively correlated with miR-27b expression level. Inhibition of UCA1 significantly restored miR-27b expression in MDR gastric cancer cells. UCA1 knockdown and miR-27b overexpression reduced IC50 of ADR, DDP, and 5-FU in SGC-7901/ADR cells and increased ADR induced cell apoptosis. UCA1 overexpression and miR-27b inhibition increased the IC50 of ADR, DDP, and 5-FU in SGC-7901 cells and reduced ADR induced cell apoptosis. Western blot analysis showed that UCA1 knockdown and miR-27b overexpression also decreased anti-apoptotic protein BCL-2 and increased apoptotic protein cleaved caspase-3. Conclusions UCA1 is negatively correlated with miR-27b expression in gastric cancer tissue. Knockdown of UCA1 restored miR-27b expression in gastric cancer cells. The UCA1-miR-27b axis was involved in regulation of chemosensitivity of gastric cancer cells. PMID:27694794
Rcpp: Seamless R and C++ Integration
Dirk Eddelbuettel; Romain Francois
2011-01-01
The Rcpp package simplifies integrating C++ code with R. It provides a consistent C++ class hierarchy that maps various types of R objects (vectors, matrices, functions, environments, . . . ) to dedicated C++ classes. Object interchange between R and C++ is managed by simple, flexible and extensible concepts which include broad support for C++ Standard Template Library idioms. C++ code can both be compiled, linked and loaded on the fly, or added via packages. Flexible error and exception code...
Network coding for computing: Linear codes
Appuswamy, Rathinakumar; Karamchandani, Nikhil; Zeger, Kenneth
2011-01-01
In network coding it is known that linear codes are sufficient to achieve the coding capacity in multicast networks and that they are not sufficient in general to achieve the coding capacity in non-multicast networks. In network computing, Rai, Dey, and Shenvi have recently shown that linear codes are not sufficient in general for solvability of multi-receiver networks with scalar linear target functions. We study single receiver networks where the receiver node demands a target function of the source messages. We show that linear codes may provide a computing capacity advantage over routing only when the receiver demands a `linearly-reducible' target function. % Many known target functions including the arithmetic sum, minimum, and maximum are not linearly-reducible. Thus, the use of non-linear codes is essential in order to obtain a computing capacity advantage over routing if the receiver demands a target function that is not linearly-reducible. We also show that if a target function is linearly-reducible,...
Practices in Code Discoverability
Teuben, Peter; Nemiroff, Robert J; Shamir, Lior
2012-01-01
Much of scientific progress now hinges on the reliability, falsifiability and reproducibility of computer source codes. Astrophysics in particular is a discipline that today leads other sciences in making useful scientific components freely available online, including data, abstracts, preprints, and fully published papers, yet even today many astrophysics source codes remain hidden from public view. We review the importance and history of source codes in astrophysics and previous efforts to develop ways in which information about astrophysics codes can be shared. We also discuss why some scientist coders resist sharing or publishing their codes, the reasons for and importance of overcoming this resistance, and alert the community to a reworking of one of the first attempts for sharing codes, the Astrophysics Source Code Library (ASCL). We discuss the implementation of the ASCL in an accompanying poster paper. We suggest that code could be given a similar level of referencing as data gets in repositories such ...
Djordjevic, Ivan; Vasic, Bane
2010-01-01
This unique book provides a coherent and comprehensive introduction to the fundamentals of optical communications, signal processing and coding for optical channels. It is the first to integrate the fundamentals of coding theory and optical communication.
Zhang, Linfan; Zheng, Shuang
2015-01-01
Quick Response code opens possibility to convey data in a unique way yet insufficient prevention and protection might lead into QR code being exploited on behalf of attackers. This thesis starts by presenting a general introduction of background and stating two problems regarding QR code security, which followed by a comprehensive research on both QR code itself and related issues. From the research a solution taking advantages of cloud and cryptography together with an implementation come af...
A. van Deursen (Arie); L.M.F. Moonen (Leon); A. van den Bergh; G. Kok
2001-01-01
textabstractTwo key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from
Bergstra, Jan A
2010-01-01
General definitions as well as rules of reasoning regarding control code production, distribution, deployment, and usage are described. The role of testing, trust, confidence and risk analysis is considered. A rationale for control code testing is sought and found for the case of safety critical embedded control code.
DEFF Research Database (Denmark)
Bombin Palomo, Hector
2015-01-01
Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a generalized, subsystem version of color codes. In 3D they allow...
Deursen, A. van; Moonen, L.M.F.; Bergh, A. van den; Kok, G.
2001-01-01
Two key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from refactoring product
ARC Code TI: CODE Software Framework
National Aeronautics and Space Administration — CODE is a software framework for control and observation in distributed environments. The basic functionality of the framework allows a user to observe a distributed...
ARC Code TI: ROC Curve Code Augmentation
National Aeronautics and Space Administration — ROC (Receiver Operating Characteristic) curve Code Augmentation was written by Rodney Martin and John Stutz at NASA Ames Research Center and is a modification of ROC...
Fountain Codes: LT And Raptor Codes Implementation
Directory of Open Access Journals (Sweden)
Ali Bazzi, Hiba Harb
2017-01-01
Full Text Available Digital fountain codes are a new class of random error correcting codes designed for efficient and reliable data delivery over erasure channels such as internet. These codes were developed to provide robustness against erasures in a way that resembles a fountain of water. A digital fountain is rateless in a way that sender can send limitless number of encoded packets. The receiver doesn’t care which packets are received or lost as long as the receiver gets enough packets to recover original data. In this paper, the design of the fountain codes is explored with its implementation of the encoding and decoding algorithm so that the performance in terms of encoding/decoding symbols, reception overhead, data length, and failure probability is studied.
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.
DEFF Research Database (Denmark)
Mailund, Thomas
2017-01-01
Discover best practices for data analysis and software development in R and start on the path to becoming a fully-fledged data scientist. This book teaches you techniques for both data manipulation and visualization and shows you the best way for developing new software packages for R. Data Science...... and analytics using statistics and the R programming language Visualize and explore data, including working with large data sets found in big data Build an R package Test and check your code Practice version control Profile and optimize your code...
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...
DEFF Research Database (Denmark)
Adelstein, Jennifer; Clegg, Stewart
2016-01-01
Ethical codes have been hailed as an explicit vehicle for achieving more sustainable and defensible organizational practice. Nonetheless, when legal compliance and corporate governance codes are conflated, codes can be used to define organizational interests ostentatiously by stipulating norms...... for employee ethics. Such codes have a largely cosmetic and insurance function, acting subtly and strategically to control organizational risk management and protection. In this paper, we conduct a genealogical discourse analysis of a representative code of ethics from an international corporation...... to understand how management frames expectations of compliance. Our contribution is to articulate the problems inherent in codes of ethics, and we make some recommendations to address these to benefit both an organization and its employees. In this way, we show how a code of ethics can provide a foundation...
Defeating the coding monsters.
Colt, Ross
2007-02-01
Accuracy in coding is rapidly becoming a required skill for military health care providers. Clinic staffing, equipment purchase decisions, and even reimbursement will soon be based on the coding data that we provide. Learning the complicated myriad of rules to code accurately can seem overwhelming. However, the majority of clinic visits in a typical outpatient clinic generally fall into two major evaluation and management codes, 99213 and 99214. If health care providers can learn the rules required to code a 99214 visit, then this will provide a 90% solution that can enable them to accurately code the majority of their clinic visits. This article demonstrates a step-by-step method to code a 99214 visit, by viewing each of the three requirements as a monster to be defeated.
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.
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...
ON THE CHARACTERIZATION OF CYCLIC CODES OVER TWO CLASSES OF RINGS
Institute of Scientific and Technical Information of China (English)
Xiusheng LIU
2013-01-01
Let R be a finite chain ring with maximal ideal and residue field F,and let γ be of nilpotency index t.To every code C of length n over R,a tower of codes C=(C∶γ0) (∈) (C∶γ)(∈)… (∈) (C∶γi) (∈)… (∈) (C∶γt-1) can be associated withC,where for any r ∈ R,(C ∶ r) ={e ∈ Rn | re ∈ C}.Using generator elements of the projection of such a tower of codes to the residue field F,we characterize cyclic codes over R.This characterization turns the condition for codes over R to be cyclic into one for codes over the residue field F.Furthermore,we obtain a characterization of cyclic codes over the formal power series ring of a finite chain ring.
Yi, Zhenzhen; Song, Weibo; Clamp, John C; Chen, Zigui; Gao, Shan; Zhang, Qianqian
2009-03-01
Comprehensive molecular analyses of phylogenetic relationships within euplotid ciliates are relatively rare, and the relationships among some families remain questionable. We performed phylogenetic analyses of the order Euplotida based on new sequences of the gene coding for small-subunit RNA (SSrRNA) from a variety of taxa across the entire order as well as sequences from some of these taxa of other genes (ITS1-5.8S-ITS2 region and histone H4) that have not been included in previous analyses. Phylogenetic trees based on SSrRNA gene sequences constructed with four different methods had a consistent branching pattern that included the following features: (1) the "typical" euplotids comprised a paraphyletic assemblage composed of two divergent clades (family Uronychiidae and families Euplotidae-Certesiidae-Aspidiscidae-Gastrocirrhidae), (2) in the family Uronychiidae, the genera Uronychia and Paradiophrys formed a clearly outlined, well-supported clade that seemed to be rather divergent from Diophrys and Diophryopsis, suggesting that the Diophrys-complex may have had a longer and more separate evolutionary history than previously supposed, (3) inclusion of 12 new SSrRNA sequences in analyses of Euplotidae revealed two new clades of species within the family and cast additional doubt on the present classification of genera within the family, and (4) the intraspecific divergence among five species of Aspidisca was far greater than those of closely related genera. The ITS1-5.8S-ITS2 coding regions and partial histone H4 genes of six morphospecies in the Diophrys-complex were sequenced along with their SSrRNA genes and used to compare phylogenies constructed from single data sets to those constructed from combined sets. Results indicated that combined analyses could be used to construct more reliable, less ambiguous phylogenies of complex groups like the order Euplotida, because they provide a greater amount and diversity of information.
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.
Generating code adapted for interlinking legacy scalar code and extended vector code
Gschwind, Michael K
2013-06-04
Mechanisms for intermixing code are provided. Source code is received for compilation using an extended Application Binary Interface (ABI) that extends a legacy ABI and uses a different register configuration than the legacy ABI. First compiled code is generated based on the source code, the first compiled code comprising code for accommodating the difference in register configurations used by the extended ABI and the legacy ABI. The first compiled code and second compiled code are intermixed to generate intermixed code, the second compiled code being compiled code that uses the legacy ABI. The intermixed code comprises at least one call instruction that is one of a call from the first compiled code to the second compiled code or a call from the second compiled code to the first compiled code. The code for accommodating the difference in register configurations is associated with the at least one call instruction.
Energy Technology Data Exchange (ETDEWEB)
Visser, B. [Stork Product Eng., Amsterdam (Netherlands)
1996-09-01
To support the discussion on aeroelastic codes, a description of the code FLEXLAST was given and experiences within benchmarks and measurement programmes were summarized. The code FLEXLAST has been developed since 1982 at Stork Product Engineering (SPE). Since 1992 FLEXLAST has been used by Dutch industries for wind turbine and rotor design. Based on the comparison with measurements, it can be concluded that the main shortcomings of wind turbine modelling lie in the field of aerodynamics, wind field and wake modelling. (au)
DEFF Research Database (Denmark)
Steensig, Jakob; Heinemann, Trine
2015-01-01
We welcome Tanya Stivers’s discussion (Stivers, 2015/this issue) of coding social interaction and find that her descriptions of the processes of coding open up important avenues for discussion, among other things of the precise ad hoc considerations that researchers need to bear in mind, both when....... Instead we propose that the promise of coding-based research lies in its ability to open up new qualitative questions....
Shapiro, Wilbur
1996-01-01
This is an overview of new and updated industrial codes for seal design and testing. GCYLT (gas cylindrical seals -- turbulent), SPIRALI (spiral-groove seals -- incompressible), KTK (knife to knife) Labyrinth Seal Code, and DYSEAL (dynamic seal analysis) are covered. CGYLT uses G-factors for Poiseuille and Couette turbulence coefficients. SPIRALI is updated to include turbulence and inertia, but maintains the narrow groove theory. KTK labyrinth seal code handles straight or stepped seals. And DYSEAL provides dynamics for the seal geometry.
National Aeronautics and Space Administration — ACCEPT consists of an overall software infrastructure framework and two main software components. The software infrastructure framework consists of code written to...
Waters, Joe
2012-01-01
Find out how to effectively create, use, and track QR codes QR (Quick Response) codes are popping up everywhere, and businesses are reaping the rewards. Get in on the action with the no-nonsense advice in this streamlined, portable guide. You'll find out how to get started, plan your strategy, and actually create the codes. Then you'll learn to link codes to mobile-friendly content, track your results, and develop ways to give your customers value that will keep them coming back. It's all presented in the straightforward style you've come to know and love, with a dash of humor thrown
Energy Technology Data Exchange (ETDEWEB)
Reid, R.L.; Barrett, R.J.; Brown, T.G.; Gorker, G.E.; Hooper, R.J.; Kalsi, S.S.; Metzler, D.H.; Peng, Y.K.M.; Roth, K.E.; Spampinato, P.T.
1985-03-01
The FEDC Tokamak Systems Code calculates tokamak performance, cost, and configuration as a function of plasma engineering parameters. This version of the code models experimental tokamaks. It does not currently consider tokamak configurations that generate electrical power or incorporate breeding blankets. The code has a modular (or subroutine) structure to allow independent modeling for each major tokamak component or system. A primary benefit of modularization is that a component module may be updated without disturbing the remainder of the systems code as long as the imput to or output from the module remains unchanged.
Energy Technology Data Exchange (ETDEWEB)
Cramer, S.N.
1984-01-01
The MORSE code is a large general-use multigroup Monte Carlo code system. Although no claims can be made regarding its superiority in either theoretical details or Monte Carlo techniques, MORSE has been, since its inception at ORNL in the late 1960s, the most widely used Monte Carlo radiation transport code. The principal reason for this popularity is that MORSE is relatively easy to use, independent of any installation or distribution center, and it can be easily customized to fit almost any specific need. Features of the MORSE code are described.
Massive Predictive Modeling using Oracle R Enterprise
CERN. Geneva
2014-01-01
R is fast becoming the lingua franca for analyzing data via statistics, visualization, and predictive analytics. For enterprise-scale data, R users have three main concerns: scalability, performance, and production deployment. Oracle's R-based technologies - Oracle R Distribution, Oracle R Enterprise, Oracle R Connector for Hadoop, and the R package ROracle - address these concerns. In this talk, we introduce Oracle's R technologies, highlighting how each enables R users to achieve scalability and performance while making production deployment of R results a natural outcome of the data analyst/scientist efforts. The focus then turns to Oracle R Enterprise with code examples using the transparency layer and embedded R execution, targeting massive predictive modeling. One goal behind massive predictive modeling is to build models per entity, such as customers, zip codes, simulations, in an effort to understand behavior and tailor predictions at the entity level. Predictions...
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.
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
BIALEK, W; RIEKE, F; VANSTEVENINCK, RRD; WARLAND, D
1991-01-01
Traditional approaches to neural coding characterize the encoding of known stimuli in average neural responses. Organisms face nearly the opposite task - extracting information about an unknown time-dependent stimulus from short segments of a spike train. Here the neural code was characterized from
DEFF Research Database (Denmark)
Soon, Winnie
2014-01-01
, Twitter and Facebook). The focus is not to investigate the functionalities and efficiencies of the code, but to study and interpret the program level of code in order to trace the use of various technological methods such as third-party libraries and platforms’ interfaces. These are important...
Energy Technology Data Exchange (ETDEWEB)
Salomé, J.A.D.; Guerra, B.T. [Departamento de Engenharia Nuclear, Universidade Federal de Minas Gerais, Av. Antônio Carlos, 6627 – PCA1 – Anexo Engenharia – Pampulha, CEP 31270-901, Belo Horizonte, MG (Brazil); Pereira, C., E-mail: claubia@nuclear.ufmg.br [Departamento de Engenharia Nuclear, Universidade Federal de Minas Gerais, Av. Antônio Carlos, 6627 – PCA1 – Anexo Engenharia – Pampulha, CEP 31270-901, Belo Horizonte, MG (Brazil); Menezes, M.Â.B.C. de [Centro de Desenvolvimento da Tecnologia Nuclear, Comissão Nacional de Energia Nuclear, Campus da UFMG, Av. Antônio Carlos, 6627 31270-901, P.O. Box 941, Belo Horizonte, MG (Brazil); Silva, C.A.M. da [Departamento de Engenharia Nuclear, Universidade Federal de Minas Gerais, Av. Antônio Carlos, 6627 – PCA1 – Anexo Engenharia – Pampulha, CEP 31270-901, Belo Horizonte, MG (Brazil); Dalle, H.M. [Centro de Desenvolvimento da Tecnologia Nuclear, Comissão Nacional de Energia Nuclear, Campus da UFMG, Av. Antônio Carlos, 6627 31270-901, P.O. Box 941, Belo Horizonte, MG (Brazil)
2014-07-01
Highlights: • The TRIGA IPR-R1 was modelled using MCNP. • The thermal neutron flux through the samples in eleven irradiation channels was obtained. • The simulated results were compared to experimental values. • The relative error, the relative trend, the z-score test and uncertainty were analysed. - Abstract: The TRIGA IPR-R1 was modelled using MCNP. The model consists of a cylinder filled with water, fuel elements, radial reflectors, central tube, control rods and neutron source. Around the core is placed the Rotary Specimen Rack (RSR) with adequate groove to insert the samples to irradiation. The values of the thermal neutron flux through the samples in eleven irradiation channels were simulated and compared to the experimental results to validate the model. After that, the values of the thermal neutron flux, in the same channels, were simulated on two horizontal planes at different heights and compared to validate the model. These channels were characterized as representative channels of the neutron flux distribution in the RSR. To evaluate the results, the relative errors, the relative trend, the z-score test and the relevance to a confidence interval of 95% were analysed. Good agreement has been obtained for the most channels when compared with the experimental results.
Transformation invariant sparse coding
DEFF Research Database (Denmark)
Mørup, Morten; Schmidt, Mikkel Nørgaard
2011-01-01
Sparse coding is a well established principle for unsupervised learning. Traditionally, features are extracted in sparse coding in specific locations, however, often we would prefer invariant representation. This paper introduces a general transformation invariant sparse coding (TISC) model....... The model decomposes images into features invariant to location and general transformation by a set of specified operators as well as a sparse coding matrix indicating where and to what degree in the original image these features are present. The TISC model is in general overcomplete and we therefore invoke...... sparse coding to estimate its parameters. We demonstrate how the model can correctly identify components of non-trivial artificial as well as real image data. Thus, the model is capable of reducing feature redundancies in terms of pre-specified transformations improving the component identification....
1983-01-01
The specification of Software Implemented Fault Tolerance (SIFT) consists of two parts, the specifications of the SIFT models and the specifications of the SIFT PASCAL program which actually implements the SIFT system. The code specifications are the last of a hierarchy of models describing the operation of the SIFT system and are related to the SIFT models as well as the PASCAL program. These Specifications serve to link the SIFT models to the running program. The specifications are very large and detailed and closely follow the form and organization of the PASCAL code. In addition to describing each of the components of the SIFT code, the code specifications describe the assumptions of the upper SIFT models which are required to actually prove that the code will work as specified. These constraints are imposed primarily on the schedule tables.
DEFF Research Database (Denmark)
Andersen, Christian Ulrik
2007-01-01
discusses code as the artist’s material and, further, formulates a critique of Cramer. The seductive magic in computer-generated art does not lie in the magical expression, but nor does it lie in the code/material/text itself. It lies in the nature of code to do something – as if it was magic......Computer art is often associated with computer-generated expressions (digitally manipulated audio/images in music, video, stage design, media facades, etc.). In recent computer art, however, the code-text itself – not the generated output – has become the artwork (Perl Poetry, ASCII Art, obfuscated...... avant-garde’. In line with Cramer, the artists Alex McLean and Adrian Ward (aka Slub) declare: “art-oriented programming needs to acknowledge the conditions of its own making – its poesis.” By analysing the Live Coding performances of Slub (where they program computer music live), the presentation...
Combustion chamber analysis code
Przekwas, A. J.; Lai, Y. G.; Krishnan, A.; Avva, R. K.; Giridharan, M. G.
1993-05-01
A three-dimensional, time dependent, Favre averaged, finite volume Navier-Stokes code has been developed to model compressible and incompressible flows (with and without chemical reactions) in liquid rocket engines. The code has a non-staggered formulation with generalized body-fitted-coordinates (BFC) capability. Higher order differencing methodologies such as MUSCL and Osher-Chakravarthy schemes are available. Turbulent flows can be modeled using any of the five turbulent models present in the code. A two-phase, two-liquid, Lagrangian spray model has been incorporated into the code. Chemical equilibrium and finite rate reaction models are available to model chemically reacting flows. The discrete ordinate method is used to model effects of thermal radiation. The code has been validated extensively against benchmark experimental data and has been applied to model flows in several propulsion system components of the SSME and the STME.
Astrophysics Source Code Library
Allen, Alice; Berriman, Bruce; Hanisch, Robert J; Mink, Jessica; Teuben, Peter J
2012-01-01
The Astrophysics Source Code Library (ASCL), founded in 1999, is a free on-line registry for source codes of interest to astronomers and astrophysicists. The library is housed on the discussion forum for Astronomy Picture of the Day (APOD) and can be accessed at http://ascl.net. The ASCL has a comprehensive listing that covers a significant number of the astrophysics source codes used to generate results published in or submitted to refereed journals and continues to grow. The ASCL currently has entries for over 500 codes; its records are citable and are indexed by ADS. The editors of the ASCL and members of its Advisory Committee were on hand at a demonstration table in the ADASS poster room to present the ASCL, accept code submissions, show how the ASCL is starting to be used by the astrophysics community, and take questions on and suggestions for improving the resource.
On Codes for Optimal Rebuilding Access
Wang, Zhiying; Bruck, Jehoshua
2011-01-01
MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r erasures by accessing (reading) all the remaining information in both the systematic nodes and the parity (redundancy) nodes. However, in practice, a single erasure is the most likely failure event; hence, a natural question is how much information do we need to access in order to rebuild a single storage node? We define the rebuilding ratio as the fraction of remaining information accessed during the rebuilding of a single erasure. In our previous work we showed that the optimal rebuilding ratio of 1/r is achievable (using our newly constructed array codes) for the rebuilding of any systematic node, however, all the information needs to be accessed for the rebuilding of the parity nodes. Namely, constructing array codes with a rebuilding ratio of 1/r was left as an open problem. In this paper, we solve th...
Implementation of the Resonance Analysis Code SAMMY
Institute of Scientific and Technical Information of China (English)
2002-01-01
The multi-level multi-channel R-matrix SAMMY code is used for making the resonance parameters,which was developed by Oak Ridge National Laboratory (ORNL), and widely used around the USA(ORELA, KAPL, LANL, TUNL...) and around the world (Belgium, Japan, France, Bulgaria, etc.).Thecode SAMMY is an important program to CNDC.
From Barcode to QR Code Applications
Directory of Open Access Journals (Sweden)
László Várallyai
2012-12-01
Full Text Available This paper shows the Zsohár Horticulture Company in Nagyrákos, how they want to change their barcode identification system to QR code. They cultivate herbaceous, perpetual decorational plants, rock-garden, flower-bed and swamp perpetuals, decorational grasses and spices. A part of the perpetuals are evergreens, but most of them has special organs - such as onions, thick-, bulbous roots, "winter-proof" buds - so they can survive winter. In the first part of the paper I introduce the different barcode standards, how can it be printed and how can it be read. In the second part of the paper I give details about the quick response code (QR code and the two-dimensional (2D barcode. Third part of this paper illustrates the QR code usability in agriculture focused on the gardening.
Embedded foveation image coding.
Wang, Z; Bovik, A C
2001-01-01
The human visual system (HVS) is highly space-variant in sampling, coding, processing, and understanding. The spatial resolution of the HVS is highest around the point of fixation (foveation point) and decreases rapidly with increasing eccentricity. By taking advantage of this fact, it is possible to remove considerable high-frequency information redundancy from the peripheral regions and still reconstruct a perceptually good quality image. Great success has been obtained previously by a class of embedded wavelet image coding algorithms, such as the embedded zerotree wavelet (EZW) and the set partitioning in hierarchical trees (SPIHT) algorithms. Embedded wavelet coding not only provides very good compression performance, but also has the property that the bitstream can be truncated at any point and still be decoded to recreate a reasonably good quality image. In this paper, we propose an embedded foveation image coding (EFIC) algorithm, which orders the encoded bitstream to optimize foveated visual quality at arbitrary bit-rates. A foveation-based image quality metric, namely, foveated wavelet image quality index (FWQI), plays an important role in the EFIC system. We also developed a modified SPIHT algorithm to improve the coding efficiency. Experiments show that EFIC integrates foveation filtering with foveated image coding and demonstrates very good coding performance and scalability in terms of foveated image quality measurement.
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity in the net...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof.......Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...
Energy Technology Data Exchange (ETDEWEB)
Nelson, R.N. (ed.)
1985-05-01
This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.
Application of RS Codes in Decoding QR Code
Institute of Scientific and Technical Information of China (English)
Zhu Suxia(朱素霞); Ji Zhenzhou; Cao Zhiyan
2003-01-01
The QR Code is a 2-dimensional matrix code with high error correction capability. It employs RS codes to generate error correction codewords in encoding and recover errors and damages in decoding. This paper presents several QR Code's virtues, analyzes RS decoding algorithm and gives a software flow chart of decoding the QR Code with RS decoding algorithm.
Evaluation Codes from an Affine Veriety Code Perspective
DEFF Research Database (Denmark)
Geil, Hans Olav
2008-01-01
Evaluation codes (also called order domain codes) are traditionally introduced as generalized one-point geometric Goppa codes. In the present paper we will give a new point of view on evaluation codes by introducing them instead as particular nice examples of affine variety codes. Our study...
Code domains in tandem repetitive DNA sequence structures.
Vogt, P
1992-10-01
Traditionally, many people doing research in molecular biology attribute coding properties to a given DNA sequence if this sequence contains an open reading frame for translation into a sequence of amino acids. This protein coding capability of DNA was detected about 30 years ago. The underlying genetic code is highly conserved and present in every biological species studied so far. Today, it is obvious that DNA has a much larger coding potential for other important tasks. Apart from coding for specific RNA molecules such as rRNA, snRNA and tRNA molecules, specific structural and sequence patterns of the DNA chain itself express distinct codes for the regulation and expression of its genetic activity. A chromatin code has been defined for phasing of the histone-octamer protein complex in the nucleosome. A translation frame code has been shown to exist that determines correct triplet counting at the ribosome during protein synthesis. A loop code seems to organize the single stranded interaction of the nascent RNA chain with proteins during the splicing process, and a splicing code phases successive 5' and 3' splicing sites. Most of these DNA codes are not exclusively based on the primary DNA sequence itself, but also seem to include specific features of the corresponding higher order structures. Based on the view that these various DNA codes are genetically instructive for specific molecular interactions or processes, important in the nucleus during interphase and during cell division, the coding capability of tandem repetitive DNA sequences has recently been reconsidered.
High performance single-error-correcting quantum codes for amplitude damping
Shor, Peter W; Smolin, John A; Zeng, Bei
2009-01-01
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block length n > 7 except n=2^r-1. We generalize this construction to employ classical codes over GF(3) with which we numerically obtain better performing codes up to length 14. Because the resulting codes are of the codeword stabilized (CWS) type, easy encoding and decoding circuits are available.
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.
Energy Technology Data Exchange (ETDEWEB)
Freeman, L.N.; Wilson, R.E. [Oregon State Univ., Dept. of Mechanical Engineering, Corvallis, OR (United States)
1996-09-01
The FAST Code which is capable of determining structural loads on a flexible, teetering, horizontal axis wind turbine is described and comparisons of calculated loads with test data are given at two wind speeds for the ESI-80. The FAST Code models a two-bladed HAWT with degrees of freedom for blade bending, teeter, drive train flexibility, yaw, and windwise and crosswind tower motion. The code allows blade dimensions, stiffnesses, and weights to differ and models tower shadow, wind shear, and turbulence. Additionally, dynamic stall is included as are delta-3 and an underslung rotor. Load comparisons are made with ESI-80 test data in the form of power spectral density, rainflow counting, occurrence histograms, and azimuth averaged bin plots. It is concluded that agreement between the FAST Code and test results is good. (au)
Vermont Center for Geographic Information — (Link to Metadata) A ZIP Code Tabulation Area (ZCTA) is a statistical geographic entity that approximates the delivery area for a U.S. Postal Service five-digit...
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof....
National Research Council Canada - National Science Library
Leslie Hawthorn
2008-01-01
This article examines the Google Summer of Code (GSoC) program, the world's first global initiative to introduce College and University students to free/libre open source software (F/LOSS) development...
Directory of Open Access Journals (Sweden)
Reshmi Banerjee
2015-06-01
Full Text Available A building code, or building control, is a set of rules that specify the minimum standards for constructed objects such as buildings and non building structures. The main purpose of building codes are to protect public health, safety and general welfare as they relate to the construction and occupancy of buildings and structures. The building code becomes law of a particular jurisdiction when formally enacted by the appropriate governmental or private authority. Building codes are generally intended to be applied by architects, engineers, constructors and regulators but are also used for various purposes by safety inspectors, environmental scientists, real estate developers, subcontractors, manufacturers of building products and materials, insurance companies, facility managers, tenants and others.
Anderson, John B
2017-01-01
Bandwidth Efficient Coding addresses the major challenge in communication engineering today: how to communicate more bits of information in the same radio spectrum. Energy and bandwidth are needed to transmit bits, and bandwidth affects capacity the most. Methods have been developed that are ten times as energy efficient at a given bandwidth consumption as simple methods. These employ signals with very complex patterns and are called "coding" solutions. The book begins with classical theory before introducing new techniques that combine older methods of error correction coding and radio transmission in order to create narrowband methods that are as efficient in both spectrum and energy as nature allows. Other topics covered include modulation techniques such as CPM, coded QAM and pulse design.
DEFF Research Database (Denmark)
Paolini, Enrico; Stefanovic, Cedomir; Liva, Gianluigi
2015-01-01
, in which the structure of the access protocol can be mapped to a structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded......The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered...... as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access...
Code Disentanglement: Initial Plan
Energy Technology Data Exchange (ETDEWEB)
Wohlbier, John Greaton [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kelley, Timothy M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Rockefeller, Gabriel M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Calef, Matthew Thomas [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-27
The first step to making more ambitious changes in the EAP code base is to disentangle the code into a set of independent, levelized packages. We define a package as a collection of code, most often across a set of files, that provides a defined set of functionality; a package a) can be built and tested as an entity and b) fits within an overall levelization design. Each package contributes one or more libraries, or an application that uses the other libraries. A package set is levelized if the relationships between packages form a directed, acyclic graph and each package uses only packages at lower levels of the diagram (in Fortran this relationship is often describable by the use relationship between modules). Independent packages permit independent- and therefore parallel|development. The packages form separable units for the purposes of development and testing. This is a proven path for enabling finer-grained changes to a complex code.
Self-Inverse Interleavers for Turbo Codes
Sakzad, Amin; Panario, Daniel; Eshghi, Nasim
2010-01-01
In this work we introduce and study a set of new interleavers based on permutation polynomials and functions with known inverses over a finite field $\\mathbb{F}_q$ for using in turbo code structures. We use Monomial, Dickson, M\\"{o}bius and R\\'edei functions in order to get new interleavers. In addition we employ Skolem sequences in order to find new interleavers with known cycle structure. As a byproduct we give an exact formula for the inverse of every R\\'edei function. The cycle structure of R\\'edei functions are also investigated. Finally, self-inverse versions of permutation functions are used to construct interleavers. These interleavers are their own de-interleavers and are useful for turbo coding and turbo decoding. Experiments carried out for self-inverse interleavers constructed using these kind of permutation polynomials and functions show excellent agreement with our theoretical results.
Asymptotic bound on binary self-orthogonal codes
Institute of Scientific and Technical Information of China (English)
DING Yang
2009-01-01
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the in-formation rate R = 1/2, by our constructive lower bound, the relative minimum distance δ≈ 0.0595 (for GV bound, δ≈0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.
Asymptotic bound on binary self-orthogonal codes
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the in-formation rate R = 1/2, by our constructive lower bound, the relative minimum distance δ≈ 0.0595 (for GV bound, δ≈ 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.
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.
Directory of Open Access Journals (Sweden)
Colombo C.
2009-08-01
Full Text Available Mutilations of female genital organs are a particularly difficult issue. That is the reason why it occupies historical, anthropological and medico-legal research. So the present article considers the situation in all these aspects together with the provisions introduced by Law n. 7, 9/1/2006 and article 583 bis of the Criminal Code for the Protection of the rights of women being mutilated.Indeed we believe that the mutilations are real and cause personal psychic injury. The custom of mutilation has nothing to do with religious beliefs, but is the product of old social prejudices against women, as an individual.La MGF (mutilation génitale féminine est un sujet de société tristement actuel dont on dit qu'elle est pratiquée au nom des croyances religieuses les plus ancestrales.C’est la raison pour laquelle j’ai voulu avant tout consulter, bien que brièvement, l'analyse anthropologique, historique, médico-légale et juridique effectuée sur cet argument pour me pencher ensuite sur la loi italienne n° 7 du 9/1/2006 et sur l’article n° 583bis du Code Pénal Italien, ayant trait à la sauvegarde des droits inaliénables de la femme qui subit une mutilation.En effet les mutilations sont de véritables lésions physiques et souffrances psychiques qui plus que motivées par des croyances religieuses sont dictées par d'anciens us et coutumes combles de préjugés sociaux envers la femme en tant qu’individu.Le mutilazioni degli organi genitali femminili rappresentano un tema tristemente attuale legato per “comodità” alle credenze religiose più arcaiche.Per questo motivo, l’articolo ha voluto, da subito, volgere uno sguardo, seppur breve, all’analisi antropologica, storica e medico-giuridica dell’argomento per poi considerare la legge n. 7 del 9/1/2006 (che ha attuato i principi della Dichiarazione e del Programma della IV Conferenza mondiale dell’ONU sulle donne - Pechino 1995, nonché le disposizioni degli artt. 2,3,32 della
Yang, Qianli; Pitkow, Xaq
2015-03-01
Most interesting natural sensory stimuli are encoded in the brain in a form that can only be decoded nonlinearly. But despite being a core function of the brain, nonlinear population codes are rarely studied and poorly understood. Interestingly, the few existing models of nonlinear codes are inconsistent with known architectural features of the brain. In particular, these codes have information content that scales with the size of the cortical population, even if that violates the data processing inequality by exceeding the amount of information entering the sensory system. Here we provide a valid theory of nonlinear population codes by generalizing recent work on information-limiting correlations in linear population codes. Although these generalized, nonlinear information-limiting correlations bound the performance of any decoder, they also make decoding more robust to suboptimal computation, allowing many suboptimal decoders to achieve nearly the same efficiency as an optimal decoder. Although these correlations are extremely difficult to measure directly, particularly for nonlinear codes, we provide a simple, practical test by which one can use choice-related activity in small populations of neurons to determine whether decoding is suboptimal or optimal and limited by correlated noise. We conclude by describing an example computation in the vestibular system where this theory applies. QY and XP was supported by a grant from the McNair foundation.
Barbarien, Joeri; Munteanu, Adrian; Verdicchio, Fabio; Andreopoulos, Yiannis; Cornelis, Jan P.; Schelkens, Peter
2004-11-01
Modern video coding applications require transmission of video data over variable-bandwidth channels to a variety of terminals with different screen resolutions and available computational power. Scalable video coding is needed to optimally support these applications. Recently proposed wavelet-based video codecs employing spatial domain motion compensated temporal filtering (SDMCTF) provide quality, resolution and frame-rate scalability while delivering compression performance comparable to that of the state-of-the-art non-scalable H.264-codec. These codecs require scalable coding of the motion vectors in order to support a large range of bit-rates with optimal compression efficiency. Scalable motion vector coding algorithms based on the integer wavelet transform followed by embedded coding of the wavelet coefficients were recently proposed. In this paper, a new and fundamentally different scalable motion vector codec (MVC) using median-based motion vector prediction is proposed. Extensive experimental results demonstrate that the proposed MVC systematically outperforms the wavelet-based state-of-the-art solutions. To be able to take advantage of the proposed scalable MVC, a rate allocation mechanism capable of optimally dividing the available rate among texture and motion information is required. Two rate allocation strategies are proposed and compared. The proposed MVC and rate allocation schemes are incorporated into an SDMCTF-based video codec and the benefits of scalable motion vector coding are experimentally demonstrated.
Wu, Yingquan
2008-01-01
The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix maintains the symbol-wise algebraic structure and thus keeps many important original characteristics. The second purpose of this paper is to identify a class of constant-weight cyclic codes. Specifically, we show that a well-known class of $q$-ary BCH codes excluding the all-zero codeword are constant-weight cyclic codes. Moreover, we show this class of codes achieve the Plotkin bound. The last purpose of the paper is to characterize expanded cyclic codes utilizing the proposed expanded generator matrix and parity check matrix. We analyze the properties of component codewords of a codeword and particularly establish the precise conditions under which a codeword can be represented by a subbasis. With the new insights, we present an improved lower bound on the minimum distance of...
Automatisierte VHDL-Code-Generierung eines Delta-Sigma Modulators
Spilka, R.; Ostermann, T.
2006-09-01
Im vorliegenden Beitrag wird eine automatische Generierung des VHDL-Codes eines Delta-Sigma Modulators präsentiert. Die Koeffizientenmultiplikation wird hierbei durch Bit-Serielle-Addition durchgeführt. Mit Hilfe zweier neuer Matlab Funktionen wird der Systementwurf durch die bekannte Delta-Sigma Toolbox von R. Schreier erweitert und direkt synthesefähiger VHDL Code erzeugt.
Murrell, Paul
2005-01-01
R is revolutionizing the world of statistical computing. Powerful, flexible, and best of all free, R is now the program of choice for tens of thousands of statisticians. Destined to become an instant classic, R Graphics presents the first complete, authoritative exposition on the R graphical system. Paul Murrell, widely known as the leading expert on R graphics, has developed an in-depth resource that takes nothing for granted and helps both neophyte and seasoned users master the intricacies of R graphics. After an introductory overview of R graphics facilities, the presentation first focuses
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.
On the Construction of Skew Quasi-Cyclic Codes
Abualrub, Taher; Aydin, Nuh; Siap, Irfan
2008-01-01
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;\\theta ]$. After a brief description of the skew polynomial ring $F[x;\\theta ]$ it is shown that skew QC codes are left submodules of the ring $R_{s}^{l}=(F[x;\\theta ]/(x^{s}-1))^{l}.$ The notions of generator and parity-check polynomials are given. We also introduce the notion of similar polynomials in the ring $F[x;\\theta ]$ and show that parity-check polynomials for skew QC codes are unique up to similarity. Our search results lead to the construction of several new codes with Hamming distances exceeding the Hamming distances of the previously best known linear codes with comparable parameters.
Research on Primary Shielding Calculation Source Generation Codes
Zheng, Zheng; Mei, Qiliang; Li, Hui; Shangguan, Danhua; Zhang, Guangchun
2017-09-01
Primary Shielding Calculation (PSC) plays an important role in reactor shielding design and analysis. In order to facilitate PSC, a source generation code is developed to generate cumulative distribution functions (CDF) for the source particle sample code of the J Monte Carlo Transport (JMCT) code, and a source particle sample code is deveoped to sample source particle directions, types, coordinates, energy and weights from the CDFs. A source generation code is developed to transform three dimensional (3D) power distributions in xyz geometry to source distributions in r θ z geometry for the J Discrete Ordinate Transport (JSNT) code. Validation on PSC model of Qinshan No.1 nuclear power plant (NPP), CAP1400 and CAP1700 reactors are performed. Numerical results show that the theoretical model and the codes are both correct.
Distributed Video Coding: Iterative Improvements
DEFF Research Database (Denmark)
Luong, Huynh Van
Nowadays, emerging applications such as wireless visual sensor networks and wireless video surveillance are requiring lightweight video encoding with high coding efficiency and error-resilience. Distributed Video Coding (DVC) is a new coding paradigm which exploits the source statistics...
Product Codes for Optical Communication
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
2002-01-01
Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes.......Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes....
Directory of Open Access Journals (Sweden)
Rumen Daskalov
2017-07-01
Full Text Available Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q$. One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].
Algebraic geometric codes with applications
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2007-01-01
The theory of linear error-correcting codes from algebraic geomet-ric curves (algebraic geometric (AG) codes or geometric Goppa codes) has been well-developed since the work of Goppa and Tsfasman, Vladut, and Zink in 1981-1982. In this paper we introduce to readers some recent progress in algebraic geometric codes and their applications in quantum error-correcting codes, secure multi-party computation and the construction of good binary codes.
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
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.
Skew cyclic codes over F_q+uF_q+vF_q+uvF_q
Directory of Open Access Journals (Sweden)
Ting Yao
2015-09-01
Full Text Available In this paper, we study skew cyclic codes over the ring $R=F_q+uF_q+vF_q+uvF_q$, where $u^{2}=u,v^{2}=v,uv=vu$, $q=p^{m}$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $R$ through a decomposition theorem. Furthermore, we give a formula for the number of skew cyclic codes of length $n$ over $R.$
Golden Coded Multiple Beamforming
Li, Boyu
2010-01-01
The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M^4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M^(2.5)) without performance degradation. When the CSI is known by the transmitter as well as the receiver, beamforming techniques that employ singular value decomposition are commonly used in MIMO systems. In the absence of channel coding, when a single symbol is transmitted, these systems achieve the full diversity order provided by the channel. Whereas this property is lost when multiple symbols are simultaneously transmitted. However, uncoded multiple beamforming can achieve the full div...
Energy Technology Data Exchange (ETDEWEB)
Bingham, Philip R [ORNL; Santos-Villalobos, Hector J [ORNL
2011-01-01
Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100 m) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100um and 10um aperture hole diameters show resolutions matching the hole diameters.
Bingham, Philip; Santos-Villalobos, Hector; Tobin, Ken
2011-03-01
Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100μm) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100μm and 10μm aperture hole diameters show resolutions matching the hole diameters.
Speech coding code- excited linear prediction
Bäckström, Tom
2017-01-01
This book provides scientific understanding of the most central techniques used in speech coding both for advanced students as well as professionals with a background in speech audio and or digital signal processing. It provides a clear connection between the whys hows and whats thus enabling a clear view of the necessity purpose and solutions provided by various tools as well as their strengths and weaknesses in each respect Equivalently this book sheds light on the following perspectives for each technology presented Objective What do we want to achieve and especially why is this goal important Resource Information What information is available and how can it be useful and Resource Platform What kind of platforms are we working with and what are their capabilities restrictions This includes computational memory and acoustic properties and the transmission capacity of devices used. The book goes on to address Solutions Which solutions have been proposed and how can they be used to reach the stated goals and ...
Phase-coded pulse aperiodic transmitter coding
Directory of Open Access Journals (Sweden)
I. I. Virtanen
2009-07-01
Full Text Available Both ionospheric and weather radar communities have already adopted the method of transmitting radar pulses in an aperiodic manner when measuring moderately overspread targets. Among the users of the ionospheric radars, this method is called Aperiodic Transmitter Coding (ATC, whereas the weather radar users have adopted the term Simultaneous Multiple Pulse-Repetition Frequency (SMPRF. When probing the ionosphere at the carrier frequencies of the EISCAT Incoherent Scatter Radar facilities, the range extent of the detectable target is typically of the order of one thousand kilometers – about seven milliseconds – whereas the characteristic correlation time of the scattered signal varies from a few milliseconds in the D-region to only tens of microseconds in the F-region. If one is interested in estimating the scattering autocorrelation function (ACF at time lags shorter than the F-region correlation time, the D-region must be considered as a moderately overspread target, whereas the F-region is a severely overspread one. Given the technical restrictions of the radar hardware, a combination of ATC and phase-coded long pulses is advantageous for this kind of target. We evaluate such an experiment under infinitely low signal-to-noise ratio (SNR conditions using lag profile inversion. In addition, a qualitative evaluation under high-SNR conditions is performed by analysing simulated data. The results show that an acceptable estimation accuracy and a very good lag resolution in the D-region can be achieved with a pulse length long enough for simultaneous E- and F-region measurements with a reasonable lag extent. The new experiment design is tested with the EISCAT Tromsø VHF (224 MHz radar. An example of a full D/E/F-region ACF from the test run is shown at the end of the paper.
Nested Quantum Error Correction Codes
Wang, Zhuo; Fan, Hen; Vedral, Vlatko
2009-01-01
The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties. Our method works for all length and all distance codes, and is quite efficient to construct optimal or near optimal codes. Two main known methods in constructing new codes from old codes in quantum error-correction theory, the concatenating and pasting, can be understood in the framework of nested quantum error correction codes.
Frutos-Alfaro, Francisco
2015-01-01
A program to generate codes in Fortran and C of the full Magnetohydrodynamic equations is shown. The program used the free computer algebra system software REDUCE. This software has a package called EXCALC, which is an exterior calculus program. The advantage of this program is that it can be modified to include another complex metric or spacetime. The output of this program is modified by means of a LINUX script which creates a new REDUCE program to manipulate the MHD equations to obtain a code that can be used as a seed for a MHD code for numerical applications. As an example, we present part of output of our programs for Cartesian coordinates and how to do the discretization.
Autocatalysis, information and coding.
Wills, P R
2001-01-01
Autocatalytic self-construction in macromolecular systems requires the existence of a reflexive relationship between structural components and the functional operations they perform to synthesise themselves. The possibility of reflexivity depends on formal, semiotic features of the catalytic structure-function relationship, that is, the embedding of catalytic functions in the space of polymeric structures. Reflexivity is a semiotic property of some genetic sequences. Such sequences may serve as the basis for the evolution of coding as a result of autocatalytic self-organisation in a population of assignment catalysts. Autocatalytic selection is a mechanism whereby matter becomes differentiated in primitive biochemical systems. In the case of coding self-organisation, it corresponds to the creation of symbolic information. Prions are present-day entities whose replication through autocatalysis reflects aspects of biological semiotics less obvious than genetic coding.
Coded Splitting Tree Protocols
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar
2013-01-01
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....
Institute of Scientific and Technical Information of China (English)
CHENG Qiang; CAO JianWen; WANG Bin; ZHANG HaiBin
2009-01-01
The adjoint code generator (ADG) is developed to produce the adjoint codes, which are used to analytically calculate gradients and the Hessian-vector products with the costs independent of the number of the independent variables. Different from other automatic differentiation tools, the implementation of ADG has advantages of using the least program behavior decomposition method and several static dependence analysis techniques. In this paper we first address the concerned concepts and fundamentals, and then introduce the functionality and the features of ADG. In particular, we also discuss the design architecture of ADG and implementation details including the recomputation and storing strategy and several techniques for code optimization. Some experimental results in several applications are presented at the end.
Vaucouleur, Sebastien
2011-02-01
We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.
Spread codes and spread decoding in network coding
Manganiello, F; Gorla, E.; Rosenthal, J.
2008-01-01
In this paper we introduce the class of spread codes for the use in random network coding. Spread codes are based on the construction of spreads in finite projective geometry. The major contribution of the paper is an efficient decoding algorithm of spread codes up to half the minimum distance.
Graph Codes with Reed-Solomon Component Codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2006-01-01
We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes...
Doppler Properties of Polyphase Coded Pulse Compression Waveforms.
1982-09-30
phase structure. An example is shown in Fig. 12 for a PI code. Each code can be generated or compressed with the same standard FFT phase filter shown...in Fig. 13. The phase shifts used before and after the FFT phase filter depend on the particular code. One way to reduce the 4-dB cyclic variation of...could be achieved by the use of additional phase shifters and delay lines in the F, output ports of the FFT phase filter shown in Fig. 12. EXPANSION r r
Ogunfunmi, Tokunbo
2010-01-01
It is becoming increasingly apparent that all forms of communication-including voice-will be transmitted through packet-switched networks based on the Internet Protocol (IP). Therefore, the design of modern devices that rely on speech interfaces, such as cell phones and PDAs, requires a complete and up-to-date understanding of the basics of speech coding. Outlines key signal processing algorithms used to mitigate impairments to speech quality in VoIP networksOffering a detailed yet easily accessible introduction to the field, Principles of Speech Coding provides an in-depth examination of the
Energy Technology Data Exchange (ETDEWEB)
Link, Hamilton E.; Schroeppel, Richard Crabtree; Neumann, William Douglas; Campbell, Philip LaRoche; Beaver, Cheryl Lynn; Pierson, Lyndon George; Anderson, William Erik
2004-10-01
If software is designed so that the software can issue functions that will move that software from one computing platform to another, then the software is said to be 'mobile'. There are two general areas of security problems associated with mobile code. The 'secure host' problem involves protecting the host from malicious mobile code. The 'secure mobile code' problem, on the other hand, involves protecting the code from malicious hosts. This report focuses on the latter problem. We have found three distinct camps of opinions regarding how to secure mobile code. There are those who believe special distributed hardware is necessary, those who believe special distributed software is necessary, and those who believe neither is necessary. We examine all three camps, with a focus on the third. In the distributed software camp we examine some commonly proposed techniques including Java, D'Agents and Flask. For the specialized hardware camp, we propose a cryptographic technique for 'tamper-proofing' code over a large portion of the software/hardware life cycle by careful modification of current architectures. This method culminates by decrypting/authenticating each instruction within a physically protected CPU, thereby protecting against subversion by malicious code. Our main focus is on the camp that believes that neither specialized software nor hardware is necessary. We concentrate on methods of code obfuscation to render an entire program or a data segment on which a program depends incomprehensible. The hope is to prevent or at least slow down reverse engineering efforts and to prevent goal-oriented attacks on the software and execution. The field of obfuscation is still in a state of development with the central problem being the lack of a basis for evaluating the protection schemes. We give a brief introduction to some of the main ideas in the field, followed by an in depth analysis of a technique called &apos
Grayscale Image Compression Based on Min Max Block Truncating Coding
Directory of Open Access Journals (Sweden)
Hilal Almarabeh
2011-11-01
Full Text Available This paper presents an image compression techniques based on block truncating coding. In this work, a min max block truncating coding (MM_BTC is presented for grayscale image compression relies on applying dividing image into non-overlapping blocks. MM_BTC differ from other block truncating coding such as block truncating coding (BTC in the way of selecting the quantization level in order to remove redundancy. Objectives measures such as: Bit Rate (BR, Mean Square Error (MSE, Peak Signal to Noise Ratio (PSNR, and Redundancy (R, were used to present a detailed evaluation of MM_BTC of image quality.
Proof-Carrying Code with Correct Compilers
Appel, Andrew W.
2009-01-01
In the late 1990s, proof-carrying code was able to produce machine-checkable safety proofs for machine-language programs even though (1) it was impractical to prove correctness properties of source programs and (2) it was impractical to prove correctness of compilers. But now it is practical to prove some correctness properties of source programs, and it is practical to prove correctness of optimizing compilers. We can produce more expressive proof-carrying code, that can guarantee correctness properties for machine code and not just safety. We will construct program logics for source languages, prove them sound w.r.t. the operational semantics of the input language for a proved-correct compiler, and then use these logics as a basis for proving the soundness of static analyses.
Encoding of multi-alphabet sources by binary arithmetic coding
Guo, Muling; Oka, Takahumi; Kato, Shigeo; Kajiwara, Hiroshi; Kawamura, Naoto
1998-12-01
In case of encoding a multi-alphabet source, the multi- alphabet symbol sequence can be encoded directly by a multi- alphabet arithmetic encoder, or the sequence can be first converted into several binary sequences and then each binary sequence is encoded by binary arithmetic encoder, such as the L-R arithmetic coder. Arithmetic coding, however, requires arithmetic operations for each symbol and is computationally heavy. In this paper, a binary representation method using Huffman tree is introduced to reduce the number of arithmetic operations, and a new probability approximation for L-R arithmetic coding is further proposed to improve the coding efficiency when the probability of LPS (Least Probable Symbol) is near 0.5. Simulation results show that our proposed scheme has high coding efficacy and can reduce the number of coding symbols.
New code match strategy for wideband code division multiple access code tree management
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.
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.
Laëtitia Pedroso
2010-01-01
During his talk to the staff at the beginning of the year, the Director-General mentioned that a new code of conduct was being drawn up. What exactly is it and what is its purpose? Anne-Sylvie Catherin, Head of the Human Resources (HR) Department, talked to us about the whys and wherefores of the project. Drawing by Georges Boixader from the cartoon strip “The World of Particles” by Brian Southworth. A code of conduct is a general framework laying down the behaviour expected of all members of an organisation's personnel. “CERN is one of the very few international organisations that don’t yet have one", explains Anne-Sylvie Catherin. “We have been thinking about introducing a code of conduct for a long time but lacked the necessary resources until now”. The call for a code of conduct has come from different sources within the Laboratory. “The Equal Opportunities Advisory Panel (read also the "Equal opportuni...
DEFF Research Database (Denmark)
Fukui, Hironori; Popovski, Petar; Yomo, Hiroyuki
2014-01-01
Physical layer network coding (PLNC) has been proposed to improve throughput of the two-way relay channel, where two nodes communicate with each other, being assisted by a relay node. Most of the works related to PLNC are focused on a simple three-node model and they do not take into account...
Corporate governance through codes
Haxhi, I.; Aguilera, R.V.; Vodosek, M.; den Hartog, D.; McNett, J.M.
2014-01-01
The UK's 1992 Cadbury Report defines corporate governance (CG) as the system by which businesses are directed and controlled. CG codes are a set of best practices designed to address deficiencies in the formal contracts and institutions by suggesting prescriptions on the preferred role and compositi
1989-09-30
SUMMARY OF POLAR ACHIEVEMENTS ..... .......... 3 3. POLAR CODE PHYSICAL MODELS ..... ............. 5 3.1 PL- ASMA Su ^"ru5 I1LS SH A...of this problem. 1.1. The Charge-2 Rocket The Charge-2 payload was launched on a Black Brant VB from White Sands Mis- sile Range in New Mexico in
Corporate governance through codes
Haxhi, I.; Aguilera, R.V.; Vodosek, M.; den Hartog, D.; McNett, J.M.
2014-01-01
The UK's 1992 Cadbury Report defines corporate governance (CG) as the system by which businesses are directed and controlled. CG codes are a set of best practices designed to address deficiencies in the formal contracts and institutions by suggesting prescriptions on the preferred role and
Khina, Anatoly
2016-08-15
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Directory of Open Access Journals (Sweden)
V.P. Bereznev
2015-10-01
An iterative solution process is used, including external iterations for the fission source and internal iterations for the scattering source. The paper presents the results of a cross-verification against the Monte Carlo MMK code [3] and on a model of the BN-800 reactor core.
Anaïs Schaeffer
2013-01-01
This summer, CERN took part in the Google Summer of Code programme for the third year in succession. Open to students from all over the world, this programme leads to very successful collaborations for open source software projects. Image: GSoC 2013. Google Summer of Code (GSoC) is a global programme that offers student developers grants to write code for open-source software projects. Since its creation in 2005, the programme has brought together some 6,000 students from over 100 countries worldwide. The students selected by Google are paired with a mentor from one of the participating projects, which can be led by institutes, organisations, companies, etc. This year, CERN PH Department’s SFT (Software Development for Experiments) Group took part in the GSoC programme for the third time, submitting 15 open-source projects. “Once published on the Google Summer for Code website (in April), the projects are open to applications,” says Jakob Blomer, one of the o...
Focusing Automatic Code Inspections
Boogerd, C.J.
2010-01-01
Automatic Code Inspection tools help developers in early detection of defects in software. A well-known drawback of many automatic inspection approaches is that they yield too many warnings and require a clearer focus. In this thesis, we provide such focus by proposing two methods to prioritize
Low ML Decoding Complexity STBCs via Codes over GF(4)
Natarajan, Lakshmi Prasad
2010-01-01
In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field $\\mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over $\\mathbb{F}_4$, for number of transmit antennas \\mbox{$N=2^m$}, \\mbox{$m \\geq 1$}, and rates \\mbox{$R>1$} complex symbols per channel use. When \\mbox{$R=N$}, the new STBCs are information-lossless as well. The new class of STBCs have the least known ML decoding complexity among all the codes available in the literature for a large set of \\mbox{$(N,R)$} pairs.
Non-linear index coding outperforming the linear optimum
Lubetzky, Eyal
2008-01-01
The following source coding problem was introduced by Birk and Kol: a sender holds a word $x\\in\\{0,1\\}^n$, and wishes to broadcast a codeword to $n$ receivers, $R_1,...,R_n$. The receiver $R_i$ is interested in $x_i$, and has prior \\emph{side information} comprising some subset of the $n$ bits. This corresponds to a directed graph $G$ on $n$ vertices, where $i j$ is an edge iff $R_i$ knows the bit $x_j$. An \\emph{index code} for $G$ is an encoding scheme which enables each $R_i$ to always reconstruct $x_i$, given his side information. The minimal word length of an index code was studied by Bar-Yossef, Birk, Jayram and Kol (FOCS 2006). They introduced a graph parameter, $\\minrk_2(G)$, which completely characterizes the length of an optimal \\emph{linear} index code for $G$. The authors of BBJK showed that in various cases linear codes attain the optimal word length, and conjectured that linear index coding is in fact \\emph{always} optimal. In this work, we disprove the main conjecture of BBJK in the following s...
Fundamentals of coding and reimbursement.
Price, Paula
2002-01-01
After completing this introduction to radiology coding and reimbursement, readers will: Understand how health care reimbursement evolved over the past 50 years. Know the importance of documenting the patient's history. Have an overall picture of the standardized numerical coding system. Understand how accurate coding affects reimbursement. Understand coding functions as they pertain to regulatory compliance in the radiology department. Be familiar with the U.S. Justice Department's use of coding in tracking health care fraud.
On Asymmetric Quantum MDS Codes
Ezerman, Martianus Frederic; Ling, San
2010-01-01
Assuming the validity of the MDS Conjecture, the weight distribution of all MDS codes is known. Using a recently-established characterization of asymmetric quantum error-correcting codes, linear MDS codes can be used to construct asymmetric quantum MDS codes with $d_{z} \\geq d_{x}\\geq 2$ for all possible values of length $n$ for which linear MDS codes over $\\F_{q}$ are known to exist.
Rate-adaptive BCH codes for distributed source coding
DEFF Research Database (Denmark)
Salmistraro, Matteo; Larsen, Knud J.; Forchhammer, Søren
2013-01-01
This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its...... strategies for improving the reliability of the decoded result are analyzed, and methods for estimating the performance are proposed. In the analysis, noiseless feedback and noiseless communication are assumed. Simulation results show that rate-adaptive BCH codes achieve better performance than low...... correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario, where the marginal probability of each symbol, Xi in X, given Y is highly skewed (unbalanced). Rate-adaptive BCH codes are presented and applied to distributed source coding. Adaptive and fixed checking...
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...
Weight hierarchies of linear codes satisfying the almost chain condition
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
The weight hierarchy of a linear [n, k; q] code C over GF(q) is the sequence (d1, d2,…,dk) where dr is the size of the smallest support of an r-dimensional subcode of C. An [n, k; q] codehas dimension r and support of size dr for all r. Further, C satisfies the almost chain condition ifit does not satisfy the chain condition, but there exist subcodes Dr of dimension r and support offor a sequence to be the weight hierarchy of a code satisfying the almost chain condition is given.Further, explicit constructions of such codes are given, showing that in almost all cases, the necessaryconditions are also sufficient.
Schnack, D. D.; Glasser, A. H.
1996-11-01
NIMROD is a new code system that is being developed for the analysis of modern fusion experiments. It is being designed from the beginning to make the maximum use of massively parallel computer architectures and computer graphics. The NIMROD physics kernel solves the three-dimensional, time-dependent two-fluid equations with neo-classical effects in toroidal geometry of arbitrary poloidal cross section. The NIMROD system also includes a pre-processor, a grid generator, and a post processor. User interaction with NIMROD is facilitated by a modern graphical user interface (GUI). The NIMROD project is using Quality Function Deployment (QFD) team management techniques to minimize re-engineering and reduce code development time. This paper gives an overview of the NIMROD project. Operation of the GUI is demonstrated, and the first results from the physics kernel are given.
Epetra developers coding guidelines.
Energy Technology Data Exchange (ETDEWEB)
Heroux, Michael Allen; Sexton, Paul Michael
2003-12-01
Epetra is a package of classes for the construction and use of serial and distributed parallel linear algebra objects. It is one of the base packages in Trilinos. This document describes guidelines for Epetra coding style. The issues discussed here go beyond correct C++ syntax to address issues that make code more readable and self-consistent. The guidelines presented here are intended to aid current and future development of Epetra specifically. They reflect design decisions that were made in the early development stages of Epetra. Some of the guidelines are contrary to more commonly used conventions, but we choose to continue these practices for the purposes of self-consistency. These guidelines are intended to be complimentary to policies established in the Trilinos Developers Guide.
Efficient convolutional sparse coding
Energy Technology Data Exchange (ETDEWEB)
Wohlberg, Brendt
2017-06-20
Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.
Decoding the productivity code
DEFF Research Database (Denmark)
Hansen, David
.e., to be prepared to initiate improvement. The study shows how the effectiveness of the improvement system depends on the congruent fit between the five elements as well as the bridging coherence between the improvement system and the work system. The bridging coherence depends on how improvements are activated...... approach often ends up with demanding intense employee focus to sustain improvement and engagement. Likewise, a single-minded employee development approach often ends up demanding rationalization to achieve the desired financial results. These ineffective approaches make organizations react like pendulums...... that swing between rationalization and employee development. The productivity code is the lack of alternatives to this ineffective approach. This thesis decodes the productivity code based on the results from a 3-year action research study at a medium-sized manufacturing facility. During the project period...
DEFF Research Database (Denmark)
Beck Jørgensen, Torben; Sørensen, Ditte-Lene
2013-01-01
Good governance is a broad concept used by many international organizations to spell out how states or countries should be governed. Definitions vary, but there is a clear core of common public values, such as transparency, accountability, effectiveness, and the rule of law. It is quite likely......, however, that national views of good governance reflect different political cultures and institutional heritages. Fourteen national codes of conduct are analyzed. The findings suggest that public values converge and that they match model codes from the United Nations and the European Council as well...... as conceptions of good governance from other international organizations. While values converge, they are balanced and communicated differently, and seem to some extent to be translated into the national cultures. The set of global public values derived from this analysis include public interest, regime dignity...
Confocal coded aperture imaging
Energy Technology Data Exchange (ETDEWEB)
Tobin, Jr., Kenneth William (Harriman, TN); Thomas, Jr., Clarence E. (Knoxville, TN)
2001-01-01
A method for imaging a target volume comprises the steps of: radiating a small bandwidth of energy toward the target volume; focusing the small bandwidth of energy into a beam; moving the target volume through a plurality of positions within the focused beam; collecting a beam of energy scattered from the target volume with a non-diffractive confocal coded aperture; generating a shadow image of said aperture from every point source of radiation in the target volume; and, reconstructing the shadow image into a 3-dimensional image of the every point source by mathematically correlating the shadow image with a digital or analog version of the coded aperture. The method can comprise the step of collecting the beam of energy scattered from the target volume with a Fresnel zone plate.
McCallum, Ethan
2011-01-01
It's tough to argue with R as a high-quality, cross-platform, open source statistical software product-unless you're in the business of crunching Big Data. This concise book introduces you to several strategies for using R to analyze large datasets. You'll learn the basics of Snow, Multicore, Parallel, and some Hadoop-related tools, including how to find them, how to use them, when they work well, and when they don't. With these packages, you can overcome R's single-threaded nature by spreading work across multiple CPUs, or offloading work to multiple machines to address R's memory barrier.
Evolution of coding and non-coding genes in HOX clusters of a marsupial
Directory of Open Access Journals (Sweden)
Yu Hongshi
2012-06-01
Full Text Available Abstract Background The HOX gene clusters are thought to be highly conserved amongst mammals and other vertebrates, but the long non-coding RNAs have only been studied in detail in human and mouse. The sequencing of the kangaroo genome provides an opportunity to use comparative analyses to compare the HOX clusters of a mammal with a distinct body plan to those of other mammals. Results Here we report a comparative analysis of HOX gene clusters between an Australian marsupial of the kangaroo family and the eutherians. There was a strikingly high level of conservation of HOX gene sequence and structure and non-protein coding genes including the microRNAs miR-196a, miR-196b, miR-10a and miR-10b and the long non-coding RNAs HOTAIR, HOTAIRM1 and HOXA11AS that play critical roles in regulating gene expression and controlling development. By microRNA deep sequencing and comparative genomic analyses, two conserved microRNAs (miR-10a and miR-10b were identified and one new candidate microRNA with typical hairpin precursor structure that is expressed in both fibroblasts and testes was found. The prediction of microRNA target analysis showed that several known microRNA targets, such as miR-10, miR-414 and miR-464, were found in the tammar HOX clusters. In addition, several novel and putative miRNAs were identified that originated from elsewhere in the tammar genome and that target the tammar HOXB and HOXD clusters. Conclusions This study confirms that the emergence of known long non-coding RNAs in the HOX clusters clearly predate the marsupial-eutherian divergence 160 Ma ago. It also identified a new potentially functional microRNA as well as conserved miRNAs. These non-coding RNAs may participate in the regulation of HOX genes to influence the body plan of this marsupial.
Price, Daniel; Wurster, James; Nixon, Chris
2016-05-01
I will present the capabilities of the Phantom SPH code for global simulations of dust and gas in protoplanetary discs. I will present our new algorithms for simulating both small and large grains in discs, as well as our progress towards simulating evolving grain populations and coupling with radiation. Finally, I will discuss our recent applications to HL Tau and the physics of dust gap opening.
Scuflaire, R; Théado, S; Bourge, P -O; Miglio, A; Godart, M; Thoul, A; Noels, A
2007-01-01
The Liege Oscillation code can be used as a stand-alone program or as a library of subroutines that the user calls from a Fortran main program of his own to compute radial and non-radial adiabatic oscillations of stellar models. We describe the variables and the equations used by the program and the methods used to solve them. A brief account is given of the use and the output of the program.
Energy Technology Data Exchange (ETDEWEB)
N.V. Mokhov
2003-04-09
Status and recent developments of the MARS 14 Monte Carlo code system for simulation of hadronic and electromagnetic cascades in shielding, accelerator and detector components in the energy range from a fraction of an electronvolt up to 100 TeV are described. these include physics models both in strong and electromagnetic interaction sectors, variance reduction techniques, residual dose, geometry, tracking, histograming. MAD-MARS Beam Line Build and Graphical-User Interface.
Sundararajan, Jay Kumar; Médard, Muriel
2008-01-01
A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node "seeing" a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is $O(\\frac1{1-\\rho})$ as opposed to $\\Omega(\\frac1{(1-\\rho)^2})$ for the baseline approach...
Energy Technology Data Exchange (ETDEWEB)
Summers, R.M.; Cole, R.K. Jr.; Smith, R.C.; Stuart, D.S.; Thompson, S.L. [Sandia National Labs., Albuquerque, NM (United States); Hodge, S.A.; Hyman, C.R.; Sanders, R.L. [Oak Ridge National Lab., TN (United States)
1995-03-01
MELCOR is a fully integrated, engineering-level computer code that models the progression of severe accidents in light water reactor nuclear power plants. MELCOR is being developed at Sandia National Laboratories for the U.S. Nuclear Regulatory Commission as a second-generation plant risk assessment tool and the successor to the Source Term Code Package. A broad spectrum of severe accident phenomena in both boiling and pressurized water reactors is treated in MELCOR in a unified framework. These include: thermal-hydraulic response in the reactor coolant system, reactor cavity, containment, and confinement buildings; core heatup, degradation, and relocation; core-concrete attack; hydrogen production, transport, and combustion; fission product release and transport; and the impact of engineered safety features on thermal-hydraulic and radionuclide behavior. Current uses of MELCOR include estimation of severe accident source terms and their sensitivities and uncertainties in a variety of applications. This publication of the MELCOR computer code manuals corresponds to MELCOR 1.8.3, released to users in August, 1994. Volume 1 contains a primer that describes MELCOR`s phenomenological scope, organization (by package), and documentation. The remainder of Volume 1 contains the MELCOR Users Guides, which provide the input instructions and guidelines for each package. Volume 2 contains the MELCOR Reference Manuals, which describe the phenomenological models that have been implemented in each package.
Energy Technology Data Exchange (ETDEWEB)
Stefani, Giovanni Laranjo de, E-mail: gstefani@ipen.b [Universidade de Sao Paulo (USP), SP (Brazil). Inst. de Fisica; Conti, Thadeu das Neves, E-mail: tnconti@ipen.b [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)
2009-07-01
This work proceeds the elaboration of a computational program for execution of various neutron and thermalhydraulic calculation methodology programs of the IEA-R1-Sao Paulo, Brazil, making the process more practical and safe, besides transforming de output data of each program an automatic process. This reactor is largely used for production of radioisotopes for medical use, material irradiation, personnel training and also for basic research. For that purposes it is necessary to change his core configuration in order to adapt the reactor for different uses. The work will transform various existent programs into subroutines of a principal program, i.e.,a program which call each of the programs automatically when necessary, and create another programs for manipulation the output data and therefore making practical the process
Directory of Open Access Journals (Sweden)
Taryn Dewar
2016-12-01
Full Text Available As more and more historical records are digitized, having a way to quickly analyze large volumes of tabular data makes research faster and more effective. R is a programming language with strengths in statistical analyses. As such, it can be used to complete quantitative analysis on historical sources, including but not limited to statistical tests. Because you can repeatedly re-run the same code on the same sources, R lets you analyze data quickly and produces repeatable results. Because you can save your code, R lets you re-purpose or revise functions for future projects, making it a flexible part of your toolkit. This tutorial presumes no prior knowledge of R. It will go through some of the basic functions of R and serves as an introduction to the language. It will take you through the installation process, explain some of the tools that you can use in R, as well as explain how to work with data sets while doing research. The tutorial will do so by going through a series of mini-lessons that will show the kinds of sources R works well with and examples of how to do calculations to find information that could be relevant to historical research. The lesson will also cover different input methods for R such as matrices and using CSV files.
low bit rate video coding low bit rate video coding
African Journals Online (AJOL)
eobe
ariable length bit rate (VLBR) broadly encompasses video coding which broadly encompasses ... for motion estimation and compensation to reduce the prediction sation to reduce the ... a special interest among the video coding community ...
Decoding of concatenated codes with interleaved outer codes
DEFF Research Database (Denmark)
Justesen, Jørn; Thommesen, Christian; Høholdt, Tom
2004-01-01
Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved Reed/Solomon codes, which allows close to errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes. (NK) N-K...
Random linear codes in steganography
Directory of Open Access Journals (Sweden)
Kamil Kaczyński
2016-12-01
Full Text Available Syndrome coding using linear codes is a technique that allows improvement in the steganographic algorithms parameters. The use of random linear codes gives a great flexibility in choosing the parameters of the linear code. In parallel, it offers easy generation of parity check matrix. In this paper, the modification of LSB algorithm is presented. A random linear code [8, 2] was used as a base for algorithm modification. The implementation of the proposed algorithm, along with practical evaluation of algorithms’ parameters based on the test images was made.[b]Keywords:[/b] steganography, random linear codes, RLC, LSB
R + R$^{2}$ gravity as R + backreaction
Kung, J H
1995-01-01
Quadratic theory of gravity is a complicated constraint system. We investigate some consequences of treating quadratic terms perturbatively (higher derivative version of backreaction effects). This approach is shown to overcome some well known problems associated with higher derivative theories, i.e., the physical gravitational degree of freedom remains unchanged from those of Einstein gravity. Using such an interpretation of R + \\beta R^2 gravity, we investigate a classical and Wheeler DeWitt evolution of R + \\beta R^2 gravity for a particular sign of \\beta, corresponding to non- tachyon case. Matter is described by a phenomenological \\rho \\propto a(t)^{-n}. It is concluded that both the Friedmann potential U(a) ( {\\dot a}^2 + 2U(a) = 0 ) and the Wheeler DeWitt potential W(a) (\\left[-{\\partial^2\\over \\partial a^2} + 2W(a)\\right]\\psi (a) =0 ) develop repulsive barriers near a\\approx 0 for n>4 (i.e., p > {1\\over 3}\\rho ). The interpretations is clear. Repulsive barrier in U(a) implies that a contracting FRW un...
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
National Research Council Canada - National Science Library
Lluís Ribas de Pouplana; Adrian Gabriel Torres; albert Rafels-Ybern
2017-01-01
The frozen accident theory of the Genetic Code was a proposal by Francis Crick that attempted to explain the universal nature of the Genetic Code and the fact that it only contains information for twenty amino acids...
DEFF Research Database (Denmark)
Nielsen, Rasmus Refslund
2002-01-01
This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.......This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed....
CERN. Geneva
2017-01-01
Join the path of code linting and discover how it can help you reach higher levels of programming enlightenment. Today we will cover how to embrace code linters to offload cognitive strain on preserving style standards in your code base as well as avoiding error-prone constructs. Additionally, I will show you the journey ahead for integrating several code linters in the programming tools your already use with very little effort.
Multiple LDPC decoding for distributed source coding and video coding
DEFF Research Database (Denmark)
Forchhammer, Søren; Luong, Huynh Van; Huang, Xin
2011-01-01
Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...
Benavente, L; Villanueva, M J; Vega, P; Casado, I; Vidal, J A; Castaño, B; Amorín, M; de la Vega, V; Santos, H; Trigo, A; Gómez, M B; Larrosa, D; Temprano, T; González, M; Murias, E; Calleja, S
2016-04-01
Intravenous thrombolysis with alteplase is an effective treatment for ischaemic stroke when applied during the first 4.5 hours, but less than 15% of patients have access to this technique. Mechanical thrombectomy is more frequently able to recanalise proximal occlusions in large vessels, but the infrastructure it requires makes it even less available. We describe the implementation of code stroke in Asturias, as well as the process of adapting various existing resources for urgent stroke care in the region. By considering these resources, and the demographic and geographic circumstances of our region, we examine ways of reorganising the code stroke protocol that would optimise treatment times and provide the most appropriate treatment for each patient. We distributed the 8 health districts in Asturias so as to permit referral of candidates for reperfusion therapies to either of the 2 hospitals with 24-hour stroke units and on-call neurologists and providing IV fibrinolysis. Hospitals were assigned according to proximity and stroke severity; the most severe cases were immediately referred to the hospital with on-call interventional neurology care. Patient triage was provided by pre-hospital emergency services according to the NIHSS score. Modifications to code stroke in Asturias have allowed us to apply reperfusion therapies with good results, while emphasising equitable care and managing the severity-time ratio to offer the best and safest treatment for each patient as soon as possible. Copyright © 2015 Sociedad Española de Neurología. Published by Elsevier España, S.L.U. All rights reserved.
Directory of Open Access Journals (Sweden)
A.S. Dayananda
2012-04-01
Full Text Available In the title compound (systematic name: (R-dimethyl{2-[1-phenyl-1-(pyridin-2-ylethoxy]ethyl}azanium (R,R-3-carboxy-2,3-dihydroxypropanoate, C17H23N2O+·C4H5O6−, the doxylaminium cation is protonated at the N atom. The tartrate monoanions are linked by short, almost linear O—H...O hydrogen bonds into chains extended along [100]. These chains are interlinked by anion–pyridine O—H...N hydrogen bonds into a two-dimensional grid structure. WeakC—H...O interactions also play a role in the crystal packing. An intramolecular hydroxy–carboxylate O—H...O hydrogen bond influences the conformation of the anion: the hydrogen-bonded fragment is almost planar, the maximum deviation from the mean plane being 0.059 (14 Å. In the cation, the aromatic rings are almost perpendicular [dihedral angle = 84.94 (8°] and the conformation of the O—C—C—N chain is gauche(−, the dihedral angle is −76.6 (2°. The absolute configuration was assigned on the basis of known chirality of the parent compound.
DEFF Research Database (Denmark)
Mailund, Thomas
2017-01-01
Master functions and discover how to write functional programs in R. In this book, you'll make your functions pure by avoiding side-effects; you’ll write functions that manipulate other functions, and you’ll construct complex functions using simpler functions as building blocks. In Functional...... functions by combining simpler functions. You will: Write functions in R including infix operators and replacement functions Create higher order functions Pass functions to other functions and start using functions as data you can manipulate Use Filer, Map and Reduce functions to express the intent behind...... code clearly and safely Build new functions from existing functions without necessarily writing any new functions, using point-free programming Create functions that carry data along with them...
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
Wavefront coding with adaptive optics
Agbana, Temitope E.; Soloviev, Oleg; Bezzubik, Vitalii; Patlan, Vsevolod; Verhaegen, Michel; Vdovin, Gleb
2015-03-01
We have implemented an extended depth of field optical system by wavefront coding with a micromachined membrane deformable mirror. This approach provides a versatile extension to standard wavefront coding based on fixed phase mask. First experimental results validate the feasibility of the use of adaptive optics for variable depth wavefront coding in imaging optical systems.
Authorship Attribution of Source Code
Tennyson, Matthew F.
2013-01-01
Authorship attribution of source code is the task of deciding who wrote a program, given its source code. Applications include software forensics, plagiarism detection, and determining software ownership. A number of methods for the authorship attribution of source code have been presented in the past. A review of those existing methods is…
Strongly-MDS convolutional codes
Gluesing-Luerssen, H; Rosenthal, J; Smarandache, R
2006-01-01
Maximum-distance separable (MDS) convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper, a class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earlies
Laflame, D. T.
1980-01-01
Delay-locked loop tracks pseudonoise codes without introducing dc timing errors, because it is not sensitive to gain imbalance between signal processing arms. "Early" and "late" reference codes pass in combined form through both arms, and each arm acts on both codes. Circuit accomodates 1 dB weaker input signals with tracking ability equal to that of tau-dither loops.
Alderson, Tim L.; Svenja Huntemann
2013-01-01
Singleton-type upper bounds on the minimum Lee distance of general (not necessarily linear) Lee codes over ℤq are discussed. Two bounds known for linear codes are shown to also hold in the general case, and several new bounds are established. Codes meeting these bounds are investigated and in some cases characterised.
Coding Issues in Grounded Theory
Moghaddam, Alireza
2006-01-01
This paper discusses grounded theory as one of the qualitative research designs. It describes how grounded theory generates from data. Three phases of grounded theory--open coding, axial coding, and selective coding--are discussed, along with some of the issues which are the source of debate among grounded theorists, especially between its…
Ezerman, Martianus Frederic; Sole, Patrick
2009-01-01
The weights in MDS codes of length n and dimension k over the finite field GF(q) are studied. Up to some explicit exceptional cases, the MDS codes with parameters given by the MDS conjecture are shown to contain all k weights in the range n-k+1 to n. The proof uses the covering radius of the dual code
Coding Issues in Grounded Theory
Moghaddam, Alireza
2006-01-01
This paper discusses grounded theory as one of the qualitative research designs. It describes how grounded theory generates from data. Three phases of grounded theory--open coding, axial coding, and selective coding--are discussed, along with some of the issues which are the source of debate among grounded theorists, especially between its…
Order functions and evaluation codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pellikaan, Ruud; van Lint, Jack
1997-01-01
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geometry codes as wella s the generalized Reed-Muller codes and the parameters are detremined without using the heavy...
Order functions and evaluation codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pellikaan, Ruud; van Lint, Jack
1997-01-01
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geometry codes as wella s the generalized Reed-Muller codes and the parameters are detremined without using the heavy...... machinery of algebraic geometry....
A class of constacyclic BCH codes and new quantum codes
liu, Yang; Li, Ruihu; Lv, Liangdong; Ma, Yuena
2017-03-01
Constacyclic BCH codes have been widely studied in the literature and have been used to construct quantum codes in latest years. However, for the class of quantum codes of length n=q^{2m}+1 over F_{q^2} with q an odd prime power, there are only the ones of distance δ ≤ 2q^2 are obtained in the literature. In this paper, by a detailed analysis of properties of q2-ary cyclotomic cosets, maximum designed distance δ _{max} of a class of Hermitian dual-containing constacyclic BCH codes with length n=q^{2m}+1 are determined, this class of constacyclic codes has some characteristic analog to that of primitive BCH codes over F_{q^2}. Then we can obtain a sequence of dual-containing constacyclic codes of designed distances 2q^2 2q^2 can be constructed from these dual-containing codes via Hermitian Construction. These newly obtained quantum codes have better code rate compared with those constructed from primitive BCH codes.
ON CLASSICAL BCH CODES AND QUANTUM BCH CODES
Institute of Scientific and Technical Information of China (English)
Xu Yajie; Ma Zhi; Zhang Chunyuan
2009-01-01
It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.
New quantum codes constructed from quaternary BCH codes
Xu, Gen; Li, Ruihu; Guo, Luobin; Ma, Yuena
2016-10-01
In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes.
Structured error recovery for code-word-stabilized quantum codes
Li, Yunfan; Dumer, Ilya; Grassl, Markus; Pryadko, Leonid P.
2010-05-01
Code-word-stabilized (CWS) codes are, in general, nonadditive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical nonlinear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less and employs a separate n-qubit measurement in each test. In this article, we suggest an error grouping technique that allows one to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Wachter, Antonia; Bossert, Martin; Zyablov, Victor
2011-01-01
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined analogous to the extended row distance in Hamming metric. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived and an explicit construction of (P)UM codes based on Gabidulin codes is given, achieving the upper bound for the free rank distance.
Performance of JPEG Image Transmission Using Proposed Asymmetric Turbo Code
Directory of Open Access Journals (Sweden)
Mohamad Yusoff Alias
2007-01-01
Full Text Available This paper gives the results of a simulation study on the performance of JPEG image transmission over AWGN and Rayleigh fading channels using typical and proposed asymmetric turbo codes for error control coding. The baseline JPEG algorithm is used to compress a QCIF (176×144 “Suzie” image. The recursive systematic convolutional (RSC encoder with generator polynomials (1,D3+D2+1/D3+D+1, that is, (13/11 in decimal, and 3G interleaver are used for the typical WCDMA and CDMA2000 turbo codes. The proposed asymmetric turbo code uses generator polynomials (1,D3+D2+1/D3+D+1;D3+D2+1/D3+1, that is, (13/11; 13/9 in decimal, and a code-matched interleaver. The effect of interleaver in the proposed asymmetric turbo code is studied using weight distribution and simulation. The simulation results and performance bound for proposed asymmetric turbo code for the frame length N=400, code rate r=1/3 with Log-MAP decoder over AWGN channel are compared with the typical system. From the simulation results, it is observed that the image transmission using proposed asymmetric turbo code performs better than that with the typical system.
DEFF Research Database (Denmark)
Fukui, Hironori; Yomo, Hironori; Popovski, Petar
2013-01-01
Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause/receive inter......Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause....../receive interference. The way to deal with this problem in distributed wireless networks is usage of MAC-layer mechanisms that make a spatial reservation of the shared wireless medium, similar to the well-known RTS/CTS in IEEE 802.11 wireless networks. In this paper, we investigate two-way relaying in presence...
Ly, Hung D; Blankenship, Yufei
2011-01-01
This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation of the problem is presented. A coding scheme that combines rate splitting, superposition coding, nested binning and channel prefixing is considered and is shown to achieve the secrecy capacity region of the channel in several scenarios. Specifying these results to both scalar and independent parallel Gaussian channels (under an average individual per-subchannel power constraint), it is shown that the high-security message can be embedded into the low-security message at full rate (as if the low-security message does not exist) without incurring any loss on the overall rate of communication (as if both messages are low-security messages). Extensions to the wiretap channel II setting of Ozarow and Wyner are also considered, where it is shown that "perfect" security embedding...
Supervised Transfer Sparse Coding
Al-Shedivat, Maruan
2014-07-27
A combination of the sparse coding and transfer learn- ing techniques was shown to be accurate and robust in classification tasks where training and testing objects have a shared feature space but are sampled from differ- ent underlying distributions, i.e., belong to different do- mains. The key assumption in such case is that in spite of the domain disparity, samples from different domains share some common hidden factors. Previous methods often assumed that all the objects in the target domain are unlabeled, and thus the training set solely comprised objects from the source domain. However, in real world applications, the target domain often has some labeled objects, or one can always manually label a small num- ber of them. In this paper, we explore such possibil- ity and show how a small number of labeled data in the target domain can significantly leverage classifica- tion accuracy of the state-of-the-art transfer sparse cod- ing methods. We further propose a unified framework named supervised transfer sparse coding (STSC) which simultaneously optimizes sparse representation, domain transfer and classification. Experimental results on three applications demonstrate that a little manual labeling and then learning the model in a supervised fashion can significantly improve classification accuracy.
DEFF Research Database (Denmark)
Hansen, Jonas; Krigslund, Jeppe; Roetter, Daniel Enrique Lucani
2014-01-01
Packet losses in wireless networks dramatically curbs the performance of TCP. This paper introduces a simple coding shim that aids IP-layer traffic in lossy environments while being transparent to transport layer protocols. The proposed coding approach enables erasure correction while being...... oblivious to the congestion control algorithms of the utilised transport layer protocol. Although our coding shim is indifferent towards the transport layer protocol, we focus on the performance of TCP when ran on top of our proposed coding mechanism due to its widespread use. The coding shim provides gains...
Boswell, Dustin
2011-01-01
As programmers, we've all seen source code that's so ugly and buggy it makes our brain ache. Over the past five years, authors Dustin Boswell and Trevor Foucher have analyzed hundreds of examples of "bad code" (much of it their own) to determine why they're bad and how they could be improved. Their conclusion? You need to write code that minimizes the time it would take someone else to understand it-even if that someone else is you. This book focuses on basic principles and practical techniques you can apply every time you write code. Using easy-to-digest code examples from different languag
2015-01-01
Games for teaching coding have been an educational holy grail since at least the early 1980s. Yet for decades, with games more popular than ever and with the need to teach kids coding having been well-recognized, no blockbuster coding games have arisen (see Chapter 2). Over the years, the research community has made various games for teaching computer science: a survey made by shows that most do not teach coding, and of the ones that do teach coding, most are research prototypes (not produc...
Rotated and Scaled Alamouti Coding
Willems, Frans M J
2008-01-01
Repetition-based retransmission is used in Alamouti-modulation [1998] for $2\\times 2$ MIMO systems. We propose to use instead of ordinary repetition so-called "scaled repetition" together with rotation. It is shown that the rotated and scaled Alamouti code has a hard-decision performance which is only slightly worse than that of the Golden code [2005], the best known $2\\times 2$ space-time code. Decoding the Golden code requires an exhaustive search over all codewords, while our rotated and scaled Alamouti code can be decoded with an acceptable complexity however.
On constructing disjoint linear codes
Institute of Scientific and Technical Information of China (English)
ZHANG Weiguo; CAI Mian; XIAO Guozhen
2007-01-01
To produce a highly nonlinear resilient function,the disjoint linear codes were originally proposed by Johansson and Pasalic in IEEE Trans.Inform.Theory,2003,49(2):494-501.In this paper,an effective method for finding a set of such disjoint linear codes is presented.When n≥2k,we can find a set of[n,k] disjoint linear codes with joint linear codes exists with cardinality at least 2.We also describe a result on constructing a set of [n,k] disjoint linear codes with minimum distance at least some fixed positive integer.
Automatisierte VHDL-Code-Generierung eines Delta-Sigma Modulators
Directory of Open Access Journals (Sweden)
R. Spilka
2006-01-01
Full Text Available Im vorliegenden Beitrag wird eine automatische Generierung des VHDL-Codes eines Delta-Sigma Modulators präsentiert. Die Koeffizientenmultiplikation wird hierbei durch Bit-Serielle-Addition durchgeführt. Mit Hilfe zweier neuer Matlab Funktionen wird der Systementwurf durch die bekannte Delta-Sigma Toolbox von R. Schreier erweitert und direkt synthesefähiger VHDL Code erzeugt.
Emergency readmissions to paediatric surgery and urology: The impact of inappropriate coding.
Peeraully, R; Henderson, K; Davies, B
2016-04-01
Introduction In England, emergency readmissions within 30 days of hospital discharge after an elective admission are not reimbursed if they do not meet Payment by Results (PbR) exclusion criteria. However, coding errors could inappropriately penalise hospitals. We aimed to assess the accuracy of coding for emergency readmissions. Methods Emergency readmissions attributed to paediatric surgery and urology between September 2012 and August 2014 to our tertiary referral centre were retrospectively reviewed. Payment by Results (PbR) coding data were obtained from the hospital's Family Health Directorate. Clinical details were obtained from contemporaneous records. All readmissions were categorised as appropriately coded (postoperative or nonoperative) or inappropriately coded (planned surgical readmission, unrelated surgical admission, unrelated medical admission or coding error). Results Over the 24-month period, 241 patients were coded as 30-day readmissions, with 143 (59%) meeting the PbR exclusion criteria. Of the remaining 98 (41%) patients, 24 (25%) were inappropriately coded as emergency readmissions. These readmissions resulted in 352 extra bed days, of which 117 (33%) were attributable to inappropriately coded cases. Conclusions One-quarter of non-excluded emergency readmissions were inappropriately coded, accounting for one-third of additional bed days. As a stay on a paediatric ward costs up to £500 a day, the potential cost to our institution due to inappropriate readmission coding was over £50,000. Diagnoses and the reason for admission for each care episode should be accurately documented and coded, and readmission data should be reviewed at a senior clinician level.
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
Directory of Open Access Journals (Sweden)
Hassan Yousif Ahmed
2011-03-01
Full Text Available A new code structure with zero in-phase cross correlation for spectral amplitude coding optical code division multiple access (SAC-OCDMA system is proposed, and called zero vectors combinatorial (ZVC. This code is constructed in a simple algebraic way using Euclidean vectors and combinatorial theories based on the relationship between the number of users N and the weight W. One of the important properties of this code is that the maximum cross correlation (CC is always zero, which means that multi-user interference (MUI and phase induced intensity noise (PIIN are reduced. Bit error rate (BER performance is compared with previous reported codes. Therefore, theoretically, we demonstrate the performance of ZVC code with the related equations. In addition, the structure of the encoder/decoder based on fiber Bragg gratings (FBGs and the proposed system have been analyzed theoretically by taking into consideration the effects of some noises. The results characterizing BER with respect to the total number of active users show that ZVC code offers a significantly improved performance over previous reported codes by supporting large numbers of users at BER≥ 10-9. A comprehensive simulation study has been carried out using a commercial optical system simulator “VPI™”. Moreover, it was shown that the proposed code managed to reduce the hardware complexity and eventually the cost.
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.
Monogan III, James E
2015-01-01
Political Analysis Using R can serve as a textbook for undergraduate or graduate students as well as a manual for independent researchers. It is unique among competitor books in its usage of 21 example datasets that are all drawn from political research. All of the data and example code is available from the Springer website, as well as from Dataverse (http://dx.doi.org/10.7910/DVN/ARKOTI). The book provides a narrative of how R can be useful for addressing problems common to the analysis of public administration, public policy, and political science data specifically, in addition to the social sciences more broadly. While the book uses data drawn from political science, public administration, and policy analyses, it is written so that students and researchers in other fields should find it accessible and useful as well. Political Analysis Using R is perfect for the first-time R user who has no prior knowledge about the program. By working through the first seven chapters of this book, an entry-level user sho...
PaxtoolsR: pathway analysis in R using Pathway Commons.
Luna, Augustin; Babur, Özgün; Aksoy, Bülent Arman; Demir, Emek; Sander, Chris
2016-04-15
PaxtoolsR package enables access to pathway data represented in the BioPAX format and made available through the Pathway Commons webservice for users of the R language to aid in advanced pathway analyses. Features include the extraction, merging and validation of pathway data represented in the BioPAX format. This package also provides novel pathway datasets and advanced querying features for R users through the Pathway Commons webservice allowing users to query, extract and retrieve data and integrate these data with local BioPAX datasets. The PaxtoolsR package is compatible with versions of R 3.1.1 (and higher) on Windows, Mac OS X and Linux using Bioconductor 3.0 and is available through the Bioconductor R package repository along with source code and a tutorial vignette describing common tasks, such as data visualization and gene set enrichment analysis. Source code and documentation are at http://www.bioconductor.org/packages/paxtoolsr This plugin is free, open-source and licensed under the LGPL-3. paxtools@cbio.mskcc.org or lunaa@cbio.mskcc.org. © The Author 2015. Published by Oxford University Press.
Riemann-Roch Spaces and Linear Network Codes
DEFF Research Database (Denmark)
Hansen, Johan P.
2015-01-01
We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...... number of points for curves of their respective genera. 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 %\\cite{DBLP:journals/tit/KoetterK08} introduced...... in the above metric making them suitable for linear network coding....
Riemann-Roch Spaces and Linear Network Codes
DEFF Research Database (Denmark)
Hansen, Johan P.
We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...... number of points for curves of their respective genera. 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 %\\cite{DBLP:journals/tit/KoetterK08} introduced...... in the above metric making them suitable for linear network coding....
Specific structural probing of plasmid-coded ribosomal RNAs from Escherichia coli
DEFF Research Database (Denmark)
Aagaard, C; Rosendahl, G; Dam, M
1991-01-01
The preferred method for construction and in vivo expression of mutagenised Escherichia coli ribosomal RNAs (rRNAs) is via high copy number plasmids. Transcription of wild-type rRNA from the seven chromosomal rrn operons in strains harbouring plasmid-coded mutant rRNAs leads to a heterogeneous...... ribosome population, which consequently hinders direct probing of mutant rRNAs. Here, we describe how nonconserved helical regions of plasmid-coded rRNA have been altered in a manner that preserves their secondary structures while creating new sites for primer extension of mutant rRNAs. This facilitates...
An Efficient Construction of Self-Dual Codes
Lee, Yoonjin
2012-01-01
We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with $q \\equiv 3 \\pmod 4$, and over $\\Z_{p^m}$ and Galois rings $\\GR(p^m,r)$ with an odd prime $p$ satisfying $p \\equiv 3 \\pmod 4$ with $r$ odd. We also extend the building-up construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we construct 945 new extremal self-dual ternary $[32,16,9]$ codes, each of which has a trivial automorphism group. We also obtain many new self-dual codes over $\\mathbb Z_9$ of lengths $12, 16, 20$ all with minimum Hamming weight 6, which is the best possible minimum Hamming weight that free self-dual codes over $\\Z_9$ of these lengths can attain. From the constructed codes over $\\mathbb Z_9$, we reconstruct optimal Type I lattices of dimensions $12, 16, 20,$ and 24 using Construction $A$; this shows that our building-up construction can make a good contribution for finding optimal Type I lat...
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...
1974-01-01
R407/R408 were experiments designed by the CERN-Collège de France-Heidelberg-Karlsruhe Collaboration to study two-particle correlations in the fragmentation region requiring a large transverse momentum particle in the forward direction. Atmospheric pressure Cerenkov counters were part of the additional equipment set up during 1974 at the SFM facility. Here Paul Hanke multi-reflected on Cerenkov mirrors.
LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources
Directory of Open Access Journals (Sweden)
Javier Garcia-Frias
2005-05-01
Full Text Available We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes for channel coding and joint source-channel coding of multiterminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed. Several decoding possibilities are investigated, compared, and evaluated. For different types of noisy channels and correlation models, the resulting performance is very close to the theoretical limits.
Improved lossless intra coding for next generation video coding
Vanam, Rahul; He, Yuwen; Ye, Yan
2016-09-01
Recently, there have been efforts by the ITU-T VCEG and ISO/IEC MPEG to further improve the compression performance of the High Efficiency Video Coding (HEVC) standard for developing a potential next generation video coding standard. The exploratory codec software of this potential standard includes new coding tools for inter and intra coding. In this paper, we present a new intra prediction mode for lossless intra coding. Our new intra mode derives a prediction filter for each input pixel using its neighboring reconstructed pixels, and applies this filter to the nearest neighboring reconstructed pixels to generate a prediction pixel. The proposed intra mode is demonstrated to improve the performance of the exploratory software for lossless intra coding, yielding a maximum and average bitrate savings of 4.4% and 2.11%, respectively.
Using R via PHP for Teaching Purposes: R-php
Directory of Open Access Journals (Sweden)
Angelo Mineo
2006-10-01
Full Text Available This paper deals with the R-php statistical software, that is an environment for statistical analysis, freely accessible and attainable through the World Wide Web, based on R. Indeed, this software uses, as “engine” for statistical analyses, R via PHP and its design has been inspired by a paper of de Leeuw (1997. R-php is based on two modules: a base module and a point-and-click module. R-php base allows the simple editing of R code in a form. R-php point-and-click allows some statistical analyses by means of a graphical user interface (GUI: then, to use this module it is not necessary for the user to know the R environment, but all the allowed analyses can be performed by using the computer mouse. We think that this tool could be particularly useful for teaching purposes: one possible use could be in a University computer laboratory to permit a smooth approach of students to R.
Using R via PHP for Teaching Purposes: R-php
Directory of Open Access Journals (Sweden)
Angelo Mineo
2006-10-01
Full Text Available This paper deals with the R-php statistical software, that is an environment for statistical analysis, freely accessible and attainable through the World Wide Web, based on R. Indeed, this software uses, as "engine" for statistical analyses, R via PHP and its design has been inspired by a paper of de Leeuw (1997. R-php is based on two modules: a base module and a point-and-click module. R-php base allows the simple editing of R code in a form. R-php point-and-click allows some statistical analyses by means of a graphical user interface (GUI: then, to use this module it is not necessary for the user to know the R environment, but all the allowed analyses can be performed by using the computer mouse. We think that this tool could be particularly useful for teaching purposes: one possible use could be in a University computer laboratory to permit a smooth approach of students to R.
Fourteen Years of R/qtl: Just Barely Sustainable
Directory of Open Access Journals (Sweden)
Karl W Broman
2014-07-01
Full Text Available R/qtl is an R package for mapping quantitative trait loci (genetic loci that contribute to variation in quantitative traits in experimental crosses. Its development began in 2000. There have been 38 software releases since 2001. The latest release contains 35k lines of R code and 24k lines of C code, plus 15k lines of code for the documentation. Challenges in the development and maintenance of the software are discussed. A key to the success of R/qtl is that it remains a central tool for the chief developer's own research work, and so its maintenance is of selfish importance.
Selection of Code and Interleaver for Turbo Coding
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
1998-01-01
The selection of component codes for turbo coding has often been based on the performance at high SNR's. However, we will argue that the selection mainly should be based on the performance at low SNR's, i.e. the convergence properties. Further, we will present a way to construct interleavers...... that significantly improve the performance of the turbo coding scheme at high SNR's, i.e. lowers the error floor...
Superimposed Code Theorectic Analysis of DNA Codes and DNA Computing
2010-03-01
Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences ”, 2008 IEEE Proceedings of International Symposium on Information Theory, pp. 2292...5, June 2008, pp. 525-34. 32 28. A. Macula, et al., “Random Coding Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences ”, 2008...combinatorial method of bio-memory design and detection that encodes item or process information as numerical sequences represented in DNA. ComDMem is a
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...
Directory of Open Access Journals (Sweden)
Clement A.
2006-11-01
Full Text Available Le programme thermodynamique et cinétique KINDISP (KINetic of DISsolution and Precipitation simule les interactions minéraux/solutions aqueuses en considérant la dissolution irréversible des réactants et la précipitation réversible ou irréversible des phases secondaires. Les lois générales introduites dans le modèle ont pour base théorique la Thermodynamique des Processus Irréversibles. Les interactions eaux/roches à basse température (25-30 °C sont interprétées théoriquement à l'aide de la Théorie de l'Etat de Transition et de la Chimie de Coordination de Surface. Le mécanisme qui limite la vitesse de dissolution ou de précipitation d'un minéral, c'est-à-dire le mécanisme le plus lent pour les réactions irréversibles successives, est soit la diffusion moléculaire aqueuse d'une entité élémentaire (atome, molécule . . . ou bien la réaction de surface (adsorption-désorption d'une entité élémentaire. A chaque étape du calcul, caractérisé par un incrément de temps (dt, le modèle informatique KINDISP calcule les vitesses de réaction pour chaque minéral réactif dans le système eau-roche. A partir de ce calcul, le modèle compare les vitesses contrôlées par la diffusion moléculaire et par la réaction de surface. Ensuite, KINDISP retient la vitesse la plus lente pour représenter la loi de dissolution d'un minéral réactif primaire ou la loi de précipitation d'une phase néoformée secondaire. La croissance des minéraux secondaires est simulée, soit à l'équilibre thermodynamique, soit en domaine de sursaturation (en nonéquilibre, après une étape de nucléation, lorsque le point de sursaturation critique S* est atteint. Le programme géochimique KINDISP est divisé en deux ensembles : un module de calcul d'équilibre initial de la solution aqueuse appelé EQUILT et un module constitué de la procédure de perturbation par incréments de temps rendant compte de l'évolution géochimique du syst
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
Institute of Scientific and Technical Information of China (English)
高莹
2004-01-01
Abraham Lempel et al[1] made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.
Error correcting coding for OTN
DEFF Research Database (Denmark)
Justesen, Jørn; Larsen, Knud J.; Pedersen, Lars A.
2010-01-01
Forward error correction codes for 100 Gb/s optical transmission are currently receiving much attention from transport network operators and technology providers. We discuss the performance of hard decision decoding using product type codes that cover a single OTN frame or a small number...... of such frames. In particular we argue that a three-error correcting BCH is the best choice for the component code in such systems....
High performance scalable image coding
Institute of Scientific and Technical Information of China (English)
Gan Tao; He Yanmin; Zhu Weile
2007-01-01
A high performance scalable image coding algorithm is proposed. The salient features of this algorithm are the ways to form and locate the significant clusters. Thanks to the list structure, the new coding algorithm achieves fine fractional bit-plane coding with negligible additional complexity. Experiments show that it performs comparably or better than the state-of-the-art coders. Furthermore, the flexible codec supports both quality and resolution scalability, which is very attractive in many network applications.
2015-10-01
UNCLASSIFIED AD-E403 688 Technical Report ARWSE-TR-14025 CODE SPEED MEASURING FOR VC++ Tom Nealis...TYPE Final 3. DATES COVERED (From – To) 4. TITLE AND SUBTITLE CODE SPEED MEASURING FOR VC++ 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c...ABSTRACT It’s often important to know how fast a snippet of code executes. This information allows the coder to make important decisions
Directory of Open Access Journals (Sweden)
Vukobratović Dejan
2006-01-01
Full Text Available Construction of short-length LDPC codes with good, both waterfall and error-floor, behavior is still an attractive research problem. Recently proposed construction algorithms in this field are based on remarkably simple ideas, but yet, their effectiveness can still be questioned. In this paper we investigate a novel measure of goodness of a given LDPC code namely its ACE spectrum, based on a previously introduced ACE metrics associated with each cycle in LDPC code graph.
QR code for medical information uses.
Fontelo, Paul; Liu, Fang; Ducut, Erick G
2008-11-06
We developed QR code online tools, simulated and tested QR code applications for medical information uses including scanning QR code labels, URLs and authentication. Our results show possible applications for QR code in medicine.
Astrophysics Source Code Library Enhancements
Hanisch, Robert J; Berriman, G Bruce; DuPrie, Kimberly; Mink, Jessica; Nemiroff, Robert J; Schmidt, Judy; Shamir, Lior; Shortridge, Keith; Taylor, Mark; Teuben, Peter J; Wallin, John
2014-01-01
The Astrophysics Source Code Library (ASCL; ascl.net) is a free online registry of codes used in astronomy research; it currently contains over 900 codes and is indexed by ADS. The ASCL has recently moved a new infrastructure into production. The new site provides a true database for the code entries and integrates the WordPress news and information pages and the discussion forum into one site. Previous capabilities are retained and permalinks to ascl.net continue to work. This improvement offers more functionality and flexibility than the previous site, is easier to maintain, and offers new possibilities for collaboration. This presentation covers these recent changes to the ASCL.
Multiple Beamforming with Perfect Coding
Li, Boyu
2011-01-01
In Singular Value Decomposition (SVD) beamforming, without channel coding, there is a trade-off between full diversity and full multiplexing. Adding channel coding, full diversity and full multiplexing can be both achieved, as long as the code rate Rc and the number of subchannels S satisfy RcS1. Recently discovered Perfect Space-Time Block Codes (PSTBCs) are full-rate full-diversity space-time codes, achieving maximum coding gain. In this paper, two novel techniques, Perfect Coded Multiple Beamforming (PCMB) and Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), are proposed, employing PSTBCs. PCMB achieves full diversity, full multiplexing, and full rate simultaneously, and its performance is close to PSTBC and FPMB, while the decoding complexity is significantly less than PSTBC and much lower than FPMB of dimensions 2 and 4. On the other hand, BICMB-PC achieves both full diversity and full multiplexing, and its performance is similar to BICMB-FP, but provides much lower decoding com...
Automatic code generation in practice
DEFF Research Database (Denmark)
Adam, Marian Sorin; Kuhrmann, Marco; Schultz, Ulrik Pagh
2016-01-01
-specific language to specify those requirements and to allow for generating a safety-enforcing layer of code, which is deployed to the robot. The paper at hand reports experiences in practically applying code generation to mobile robots. For two cases, we discuss how we addressed challenges, e.g., regarding weaving...... code generation into proprietary development environments and testing of manually written code. We find that a DSL based on the same conceptual model can be used across different kinds of hardware modules, but a significant adaptation effort is required in practical scenarios involving different kinds...
Team, The Hyperink
2013-01-01
On May 15, 2012 Jeff Atwood (co-founder of Stack Overflow) published a blog post titled "Please Don't Learn to Code" in response to Mayor Mike Bloomberg's resolution to learn how to code in 2012. In that post he argues against "learning to code just for the sake of learning how to code," a sentiment that sparked an active online debate. This book is a compilation of several different perspectives on that debate. Should programming be taught to every student as part of their core curriculum, similar to mathematics, reading, and writing? Should every working professional take time to learn a
Grassmann codes and Schubert unions
DEFF Research Database (Denmark)
Hansen, Johan Peder; Johnsen, Trygve; Ranestad, Kristian
2009-01-01
We study subsets of Grassmann varieties over a field , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study such sets in detail, and give applications to coding theory, in particular for Grassmann codes. For much is known about such Schubert unions...... with a maximal number of -rational points for a given spanning dimension. We study the case and give a conjecture for general . We also define Schubert union codes in general, and study the parameters and support weights of these codes....
Wang, Jim Jing-Yan
2014-07-06
Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.
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
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom; Thommesen, Christian
2004-01-01
Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes....
The KIDTALK Behavior and Language Code: Manual and Coding Protocol.
Delaney, Elizabeth M.; Ezell, Sara S.; Solomon, Ned A.; Hancock, Terry B.; Kaiser, Ann P.
Developed as part of the Milieu Language Teaching Project at the John F. Kennedy Center at Vanderbilt University in Nashville, Tennessee, this KIDTALK Behavior-Language Coding Protocol and manual measures behavior occurring during adult-child interactions. The manual is divided into 5 distinct sections: (1) the adult behavior codes describe…
Directory of Open Access Journals (Sweden)
Caimmi, R.
2008-06-01
Full Text Available A theory of collisionless fluids is developed in a unified picture, where nonrotating $(widetilde{Omega_1}=widetilde{Omega_2}= widetilde{Omega_3}=0$ figures with some given random velocity component distributions, and rotating $(widetilde{Omega_1} ewidetilde{Omega_2} e widetilde{Omega_3} $ figures with a different random velocity component distributions, make adjoint configurations to the same system. R fluids are defined as ideal, self-gravitating fluids satisfying the virial theorem assumptions, in presence of systematic rotation around each of the principal axes of inertia. To this aim, mean and rms angular velocities and mean and rms tangential velocity components are expressed, by weighting on the moment of inertia and the mass, respectively. The figure rotation is defined as the mean angular velocity, weighted on the moment of inertia, with respectto a selected axis. The generalized tensor virial equations (Caimmi and Marmo 2005 are formulated for R fluidsand further attention is devoted to axisymmetric configurations where, for selected coordinateaxes, a variation in figure rotation has to be counterbalanced by a variation in anisotropy excess and viceversa. A microscopical analysis of systematic and random motions is performed under a fewgeneral hypotheses, by reversing the sign of tangential or axial velocity components of anassigned fraction of particles, leaving the distribution function and other parametersunchanged (Meza 2002. The application of the reversion process to tangential velocitycomponents is found to imply the conversion of random motion rotation kinetic energy intosystematic motion rotation kinetic energy. The application ofthe reversion process to axial velocity components is found to imply the conversionof random motion translation kinetic energy into systematic motion translation kinetic energy, and theloss related to a change of reference frame is expressed in terms of systematic motion (imaginary rotation kinetic
Directory of Open Access Journals (Sweden)
Caimmi R.
2008-01-01
Full Text Available A theory of collisionless fluids is developed in a unified picture, where nonrotating (Ωf1 = Ωf2 = Ωf3 = 0 figures with some given random velocity component distributions, and rotating (Ωf1 = Ωf2 = Ωf3 figures with a different random velocity component distributions, make adjoint configurations to the same system. R fluids are defined as ideal, self-gravitating fluids satisfying the virial theorem assumptions, in presence of systematic rotation around each of the principal axes of inertia. To this aim, mean and rms angular velocities and mean and rms tangential velocity components are expressed, by weighting on the moment of inertia and the mass, respectively. The figure rotation is defined as the mean angular velocity, weighted on the moment of inertia, with respect to a selected axis. The generalized tensor virial equations (Caimmi and Marmo 2005 are formulated for R fluids and further attention is devoted to axisymmetric configurations where, for selected coordinate axes, a variation in figure rotation has to be counterbalanced by a variation in anisotropy excess and vice versa. A microscopical analysis of systematic and random motions is performed under a few general hypotheses, by reversing the sign of tangential or axial velocity components of an assigned fraction of particles, leaving the distribution function and other parameters unchanged (Meza 2002. The application of the reversion process to tangential velocity components is found to imply the conversion of random motion rotation kinetic energy into systematic motion rotation kinetic energy. The application of the reversion process to axial velocity components is found to imply the conversion of random motion translation kinetic energy into systematic motion translation kinetic energy, and the loss related to a change of reference frame is expressed in terms of systematic motion (imaginary rotation kinetic energy. A number of special situations are investigated in greater
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...
2012-01-11
... Federal Aviation Administration 14 CFR Part 71 RIN 2120-AI92 Proposed Establishment of Restricted Areas R-5402, R-5403A, R- 5403B, R-5403C, R-5403D, R-5403E, R-5403F; Devils Lake, ND AGENCY: Federal Aviation... Areas R-5402, R-5403A, R-5403B, R- 5403C, R-5403D, R-5403E, R-5403F; Devils Lake, ND......
Probability and statistics with R
Ugarte, Maria Dolores; Arnholt, Alan T
2008-01-01
-Technometrics, May 2009, Vol. 51, No. 2 The book is comprehensive and well written. The notation is clear and the mathematical derivations behind nontrivial equations and computational implementations are carefully explained. Rather than presenting a collection of R scripts together with a summary of relevant theoretical results, this book offers a well-balanced mix of theory, examples and R code.-Raquel Prado, University of California, Santa Cruz, The American Statistician, February 2009… an impressive book … Overall, this is a good reference book with comprehensive coverage of the details
Allele coding in genomic evaluation
Directory of Open Access Journals (Sweden)
Christensen Ole F
2011-06-01
Full Text Available Abstract Background Genomic data are used in animal breeding to assist genetic evaluation. Several models to estimate genomic breeding values have been studied. In general, two approaches have been used. One approach estimates the marker effects first and then, genomic breeding values are obtained by summing marker effects. In the second approach, genomic breeding values are estimated directly using an equivalent model with a genomic relationship matrix. Allele coding is the method chosen to assign values to the regression coefficients in the statistical model. A common allele coding is zero for the homozygous genotype of the first allele, one for the heterozygote, and two for the homozygous genotype for the other allele. Another common allele coding changes these regression coefficients by subtracting a value from each marker such that the mean of regression coefficients is zero within each marker. We call this centered allele coding. This study considered effects of different allele coding methods on inference. Both marker-based and equivalent models were considered, and restricted maximum likelihood and Bayesian methods were used in inference. Results Theoretical derivations showed that parameter estimates and estimated marker effects in marker-based models are the same irrespective of the allele coding, provided that the model has a fixed general mean. For the equivalent models, the same results hold, even though different allele coding methods lead to different genomic relationship matrices. Calculated genomic breeding values are independent of allele coding when the estimate of the general mean is included into the values. Reliabilities of estimated genomic breeding values calculated using elements of the inverse of the coefficient matrix depend on the allele coding because different allele coding methods imply different models. Finally, allele coding affects the mixing of Markov chain Monte Carlo algorithms, with the centered coding being
1988-01-01
Article 162 of this Mexican Code provides, among other things, that "Every person has the right freely, responsibly, and in an informed fashion to determine the number and spacing of his or her children." When a marriage is involved, this right is to be observed by the spouses "in agreement with each other." The civil codes of the following states contain the same provisions: 1) Baja California (Art. 159 of the Civil Code of 28 April 1972 as revised in Decree No. 167 of 31 January 1974); 2) Morelos (Art. 255 of the Civil Code of 26 September 1949 as revised in Decree No. 135 of 29 December 1981); 3) Queretaro (Art. 162 of the Civil Code of 29 December 1950 as revised in the Act of 9 January 1981); 4) San Luis Potosi (Art. 147 of the Civil Code of 24 March 1946 as revised in 13 June 1978); Sinaloa (Art. 162 of the Civil Code of 18 June 1940 as revised in Decree No. 28 of 14 October 1975); 5) Tamaulipas (Art. 146 of the Civil Code of 21 November 1960 as revised in Decree No. 20 of 30 April 1975); 6) Veracruz-Llave (Art. 98 of the Civil Code of 1 September 1932 as revised in the Act of 30 December 1975); and 7) Zacatecas (Art. 253 of the Civil Code of 9 February 1965 as revised in Decree No. 104 of 13 August 1975). The Civil Codes of Puebla and Tlaxcala provide for this right only in the context of marriage with the spouses in agreement. See Art. 317 of the Civil Code of Puebla of 15 April 1985 and Article 52 of the Civil Code of Tlaxcala of 31 August 1976 as revised in Decree No. 23 of 2 April 1984. The Family Code of Hidalgo requires as a formality of marriage a certification that the spouses are aware of methods of controlling fertility, responsible parenthood, and family planning. In addition, Article 22 the Civil Code of the Federal District provides that the legal capacity of natural persons is acquired at birth and lost at death; however, from the moment of conception the individual comes under the protection of the law, which is valid with respect to the
An algebraic approach to graph codes
DEFF Research Database (Denmark)
Pinero, Fernando
theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four......This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... are optimal or best known for their parameters. In chapter five we study some graph codes with Reed–Solomon component codes. The underlying graph is well known and widely used for its good characteristics. This helps us to compute the dimension of the graph codes. We also introduce a combinatorial concept...
R-loopDB: a database for R-loop forming sequences (RLFS) and R-loops
Jenjaroenpun, Piroon; Wongsurawat, Thidathip; Sutheeworapong, Sawannee; Kuznetsov, Vladimir A.
2017-01-01
R-loopDB (http://rloop.bii.a-star.edu.sg) was originally constructed as a collection of computationally predicted R-loop forming sequences (RLFSs) in the human genic regions. The renewed R-loopDB provides updates, improvements and new options, including access to recent experimental data. It includes genome-scale prediction of RLFSs for humans, six other animals and yeast. Using the extended quantitative model of RLFSs (QmRLFS), we significantly increased the number of RLFSs predicted in the human genes and identified RLFSs in other organism genomes. R-loopDB allows searching of RLFSs in the genes and in the 2 kb upstream and downstream flanking sequences of any gene. R-loopDB exploits the Ensembl gene annotation system, providing users with chromosome coordinates, sequences, gene and genomic data of the 1 565 795 RLFSs distributed in 121 056 genic or proximal gene regions of the covered organisms. It provides a comprehensive annotation of Ensembl RLFS-positive genes including 93 454 protein coding genes, 12 480 long non-coding RNA and 7 568 small non-coding RNA genes and 7 554 pseudogenes. Using new interface and genome viewers of R-loopDB, users can search the gene(s) in multiple species with keywords in a single query. R-loopDB provides tools to carry out comparative evolution and genome-scale analyses in R-loop biology. PMID:27899586
Coding ill-defined and unknown cause of death is 13 times more frequent in Denmark than in Finland
DEFF Research Database (Denmark)
Ylijoki-Sørensen, Seija; Sajantila, Annti; Lalu, Kaisa;
2014-01-01
to the death. Thus, the aim of the study was, firstly, to analyse the frequencies of R00-R99-coded deaths in mortality statistics in Finland and in Denmark and, secondly, to compare these and the methods used to investigate the cause of death. To do so, we extracted a random 90% sample of the Finnish death...... certificates and 100% of the Danish certificates from the national mortality registries for 2000, 2005 and 2010. Subsequently, we analysed the frequencies of forensic and medical autopsies and external clinical examinations of the bodies in R00-R99-coded deaths. The use of R00-R99 codes was significantly......Exact cause and manner of death determination improves legislative safety for the individual and for society and guides aspects of national public health. In the International Classification of Diseases, codes R00-R99 are used for "symptoms, signs and abnormal clinical and laboratory findings...
Overview of MPEG internet video coding
Wang, R. G.; Li, G.; Park, S.; Kim, J.; Huang, T.; Jang, E. S.; Gao, W.
2015-09-01
MPEG has produced standards that have provided the industry with the best video compression technologies. In order to address the diversified needs of the Internet, MPEG issued the Call for Proposals (CfP) for internet video coding in July, 2011. It is anticipated that any patent declaration associated with the Baseline Profile of this standard will indicate that the patent owner is prepared to grant a free of charge license to an unrestricted number of applicants on a worldwide, non-discriminatory basis and under other reasonable terms and conditions to make, use, and sell implementations of the Baseline Profile of this standard in accordance with the ITU-T/ITU-R/ISO/IEC Common Patent Policy. Three different codecs had responded to the CfP, which are WVC, VCB and IVC. WVC was proposed jointly by Apple, Cisco, Fraunhofer HHI, Magnum Semiconductor, Polycom and RIM etc. it's in fact AVC baseline. VCB was proposed by Google, and it's in fact VP8. IVC was proposed by several Universities (Peking University, Tsinghua University, Zhejiang University, Hanyang University and Korea Aerospace University etc.) and its coding tools was developed from Zero. In this paper, we give an overview of the coding tools in IVC, and evaluate its performance by comparing it with WVC, VCB and AVC High Profile.
Non-coding RNAs in cardiovascular ageing.
Gupta, Shashi Kumar; Piccoli, Maria Teresa; Thum, Thomas
2014-09-01
The increasing burden of ageing populations and their healthcare expenditure is a major challenge worldwide. Ageing is a complex disorder and can be defined as progressive decline in function with time leading to increased incidence of various cardiovascular, neurological and immunological diseases. The human genome comprises of many protein coding and even more non-coding RNA genes. MicroRNAs, a class of non-coding RNA, regulate the expression of multiple messenger RNAs post-transcriptionally and are reported to be involved in crucial aspects of cell biology encompassing ageing. Recently, several studies have reported the regulation of microRNAs with ageing and microRNAs like miR-34 have emerged as critical regulator of ageing extending from Caenorhabditis elegans to mammals. Here, we summarize the reported role of microRNAs as well as long noncoding RNAs (lncRNAs) in the process of ageing with a special emphasis on cardiovascular ageing. Copyright © 2014 Elsevier B.V. All rights reserved.
SC Secretariat
2005-01-01
Please note that the revised Safety Code A2 (Code A2 rev.) entitled "REPORTING OF ACCIDENTS AND NEAR MISSES" is available on the web at the following url: https://edms.cern.ch/document/335502/LAST_RELEASED Paper copies can also be obtained from the SC Unit Secretariat, e-mail: sc.secretariat@cern.ch SC Secretariat
Flow Analysis of Code Customizations
DEFF Research Database (Denmark)
Hessellund, Anders; Sestoft, Peter
2008-01-01
Inconsistency between metadata and code customizations is a major concern in modern, configurable enterprise systems. The increasing reliance on metadata, in the form of XML files, and code customizations, in the form of Java files, has led to a hybrid development platform. The expected consisten...
NETWORK CODING BY BEAM FORMING
DEFF Research Database (Denmark)
2013-01-01
Network coding by beam forming in networks, for example, in single frequency networks, can provide aid in increasing spectral efficiency. When network coding by beam forming and user cooperation are combined, spectral efficiency gains may be achieved. According to certain embodiments, a method...... cooperating with the plurality of user equipment to decode the received data....
Grassmann codes and Schubert unions
DEFF Research Database (Denmark)
Hansen, Johan Peder; Johnsen, Trygve; Ranestad, Kristian
2009-01-01
We study subsets of Grassmann varieties over a field , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study such sets in detail, and give applications to coding theory, in particular for Grassmann codes. For much is known about such Schubert unions...
Donovan, Peter
2014-01-01
Covers the historical context and the evolution of the technically complex Allied Signals Intelligence (Sigint) activity against Japan from 1920 to 1945 Describes, explains and analyzes the code breaking techniques developed during the war in the Pacific Exposes the blunders (in code construction and use) made by the Japanese Navy that led to significant US Naval victories
Accelerator Physics Code Web Repository
Energy Technology Data Exchange (ETDEWEB)
Zimmermann, F.; Basset, R.; Bellodi, G.; Benedetto, E.; Dorda, U.; Giovannozzi, M.; Papaphilippou, Y.; Pieloni, T.; Ruggiero, F.; Rumolo, G.; Schmidt, F.; Todesco, E.; Zotter, B.W.; /CERN; Payet, J.; /Saclay; Bartolini, R.; /RAL, Diamond; Farvacque, L.; /ESRF, Grenoble; Sen, T.; /Fermilab; Chin, Y.H.; Ohmi, K.; Oide, K.; /KEK, Tsukuba; Furman, M.; /LBL, Berkeley /Oak Ridge /Pohang Accelerator Lab. /SLAC /TRIUMF /Tech-X, Boulder /UC, San Diego /Darmstadt, GSI /Rutherford /Brookhaven
2006-10-24
In the framework of the CARE HHH European Network, we have developed a web-based dynamic accelerator-physics code repository. We describe the design, structure and contents of this repository, illustrate its usage, and discuss our future plans, with emphasis on code benchmarking.
ACCELERATION PHYSICS CODE WEB REPOSITORY.
Energy Technology Data Exchange (ETDEWEB)
WEI, J.
2006-06-26
In the framework of the CARE HHH European Network, we have developed a web-based dynamic accelerator-physics code repository. We describe the design, structure and contents of this repository, illustrate its usage, and discuss our future plans, with emphasis on code benchmarking.
Jing, Yindi
2014-01-01
Distributed Space-Time Coding (DSTC) is a cooperative relaying scheme that enables high reliability in wireless networks. This brief presents the basic concept of DSTC, its achievable performance, generalizations, code design, and differential use. Recent results on training design and channel estimation for DSTC and the performance of training-based DSTC are also discussed.
Recommendations for ECG diagnostic coding
Bonner, R.E.; Caceres, C.A.; Cuddy, T.E.; Meijler, F.L.; Milliken, J.A.; Rautaharju, P.M.; Robles de Medina, E.O.; Willems, J.L.; Wolf, H.K.; Working Group 'Diagnostic Codes'
1978-01-01
The Oxford dictionary defines code as "a body of laws so related to each other as to avoid inconsistency and overlapping". It is obvious that natural language with its high degree of ambiguity does not qualify as a code in the sense of this definition. Everyday experiences provide ample evidence tha
Bounds on Generalized Huffman Codes
Baer, Michael B
2007-01-01
New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding - which concern the traditional linear code objective of minimizing average codeword length -- these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman coding, some upper bounds can be found using sufficient conditions for the codeword corresponding to the most probable symbol being one bit long. Whereas having probability no less than 0.4 is a tight sufficient condition for this to be the case in Huffman coding, other penalties differ, some having a tighter condition, some a looser condition, and others having no such sufficient condition. The objectives explored here are ones for which optimal codes can be found using a generalized form of Huffman coding. These objectives include one related to queueing (an increasing exponential average), one related to single-shot c...
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
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 ...
Distributed source coding of video
DEFF Research Database (Denmark)
Forchhammer, Søren; Van Luong, Huynh
2015-01-01
A foundation for distributed source coding was established in the classic papers of Slepian-Wolf (SW) [1] and Wyner-Ziv (WZ) [2]. This has provided a starting point for work on Distributed Video Coding (DVC), which exploits the source statistics at the decoder side offering shifting processing...... steps, conventionally performed at the video encoder side, to the decoder side. Emerging applications such as wireless visual sensor networks and wireless video surveillance all require lightweight video encoding with high coding efficiency and error-resilience. The video data of DVC schemes differ from...... the assumptions of SW and WZ distributed coding, e.g. by being correlated in time and nonstationary. Improving the efficiency of DVC coding is challenging. This paper presents some selected techniques to address the DVC challenges. Focus is put on pin-pointing how the decoder steps are modified to provide...
Pastawski, Fernando; Wilming, Henrik
2016-01-01
Approximate quantum error-correcting codes are codes with "soft recovery guarantees" wherein information can be approximately recovered. In this article, we propose a complementary "soft code-spaces" wherein a weighted prior distribution is assumed over the possible logical input states. The performance for protecting information from noise is then evaluated in terms of entanglement fidelity. We apply a recent construction for approximate recovery maps, which come with a guaranteed lower-bounds on the decoding performance. These lower bound are straightforwardly obtained by evaluating entropies on marginals of the mixed state which represents the "soft code-space". As an example, we consider thermal states of the transverse field Ising model at criticality and provide numerical evidence that the entanglement fidelity admits non-trivial recoverability from local errors. This provides the first concrete interpretation of a bonafide conformal field theory as a quantum error-correcting code. We further suggest, t...
Distributed source coding of video
DEFF Research Database (Denmark)
Forchhammer, Søren; Van Luong, Huynh
2015-01-01
steps, conventionally performed at the video encoder side, to the decoder side. Emerging applications such as wireless visual sensor networks and wireless video surveillance all require lightweight video encoding with high coding efficiency and error-resilience. The video data of DVC schemes differ from......A foundation for distributed source coding was established in the classic papers of Slepian-Wolf (SW) [1] and Wyner-Ziv (WZ) [2]. This has provided a starting point for work on Distributed Video Coding (DVC), which exploits the source statistics at the decoder side offering shifting processing...... the assumptions of SW and WZ distributed coding, e.g. by being correlated in time and nonstationary. Improving the efficiency of DVC coding is challenging. This paper presents some selected techniques to address the DVC challenges. Focus is put on pin-pointing how the decoder steps are modified to provide...
DEFF Research Database (Denmark)
Blackwell, Alan; Cox, Geoff; Lee, Sang Wong
2016-01-01
This paper is a speculation on the relationship between coding and writing, and the ways in which technical innovations and capabilities enable us to rethink each in terms of the other. As a case study, we draw on recent experiences of preparing a book on live coding, which integrates a wide rang...... of personal, historical, technical and critical perspectives. This book project has been both experimental and reflective, in a manner that allows us to draw on critical understanding of both code and writing, and point to the potential for new practices in the future.......This paper is a speculation on the relationship between coding and writing, and the ways in which technical innovations and capabilities enable us to rethink each in terms of the other. As a case study, we draw on recent experiences of preparing a book on live coding, which integrates a wide range...
Binary Error Correcting Network Codes
Wang, Qiwen; Li, Shuo-Yen Robert
2011-01-01
We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. We propose a new metric for errors under this model. Using this metric, we prove a new Hamming-type upper bound on the network capacity. We also show a commensurate lower bound based on GV-type codes that can be used for error-correction. The codes used to attain the lower bound are non-coherent (do not require prior knowledge of network topology). The end-to-end nature of our design enables our codes to be overlaid on classical distributed random linear network codes. Further, we free internal nodes from having to implement potentially computationally intensive link-by-link error-correction.
Ribas de Pouplana, Lluís; Torres, Adrian Gabriel; Rafels-Ybern, Àlbert
2017-04-05
The frozen accident theory of the Genetic Code was a proposal by Francis Crick that attempted to explain the universal nature of the Genetic Code and the fact that it only contains information for twenty amino acids. Fifty years later, it is clear that variations to the universal Genetic Code exist in nature and that translation is not limited to twenty amino acids. However, given the astonishing diversity of life on earth, and the extended evolutionary time that has taken place since the emergence of the extant Genetic Code, the idea that the translation apparatus is for the most part immobile remains true. Here, we will offer a potential explanation to the reason why the code has remained mostly stable for over three billion years, and discuss some of the mechanisms that allow species to overcome the intrinsic functional limitations of the protein synthesis machinery.
Reliability-Based Code Calibration
DEFF Research Database (Denmark)
Faber, M.H.; Sørensen, John Dalsgaard
2003-01-01
The present paper addresses fundamental concepts of reliability based code calibration. First basic principles of structural reliability theory are introduced and it is shown how the results of FORM based reliability analysis may be related to partial safety factors and characteristic values....... Thereafter the code calibration problem is presented in its principal decision theoretical form and it is discussed how acceptable levels of failure probability (or target reliabilities) may be established. Furthermore suggested values for acceptable annual failure probabilities are given for ultimate...... and serviceability limit states. Finally the paper describes the Joint Committee on Structural Safety (JCSS) recommended procedure - CodeCal - for the practical implementation of reliability based code calibration of LRFD based design codes....
Rodionov, Anatoly
2007-01-01
A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm may be considered as of generalization a popular compression technique - arithmetic coding algorithms. It is shown that for p = 2 the algorithm works as integer variant of arithmetic coding; for a special class of models it gives exactly the same codes as Huffman's algorithm, for another special model and a specific alphabet it gives Golomb-Rice codes.
PARAVT: Parallel Voronoi tessellation code
González, R. E.
2016-10-01
In this study, we present a new open source code for massive parallel computation of Voronoi tessellations (VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several serial Voronoi tessellation codes, however no open source and parallel implementations are available to handle the large number of particles/galaxies in current N-body simulations and sky surveys. Parallelization is implemented under MPI and VT using Qhull library. Domain decomposition takes into account consistent boundary computation between tasks, and includes periodic conditions. In addition, the code computes neighbors list, Voronoi density, Voronoi cell volume, density gradient for each particle, and densities on a regular grid. Code implementation and user guide are publicly available at https://github.com/regonzar/paravt.
Portable code development in C
Energy Technology Data Exchange (ETDEWEB)
Brown, S.A.
1990-11-06
With a new generation of high performance computers appearing around us on a time scale of months, a new challenge for developers of simulation codes is to write and maintain production codes that are both highly portable and maximally efficient. My contention is that C is the language that is both best suited to that goal and is widely available today. GLF is a new code written mainly in C which is intended to have all of the XRASER physics and run on any platform of interest. It demonstrates the power of the C paradigm for code developers and flexibility and ease of use for the users. Three fundamental problems are discussed: the C/UNIX development environment; the supporting tools and libraries which handle data and graphics portability issues; and the advantages of C in numerical simulation code development.
Medical coding in clinical trials
Directory of Open Access Journals (Sweden)
Deven Babre
2010-01-01
Full Text Available Data generated in all clinical trial are recorded on the data collection instrument Case report Form / Electronic Case Report Form by investigators located at various sites in various countries. In multicentric clinical trials since different investigator or medically qualified experts are from different sites / centers recording the medical term(s uniformly is a big challenge. Medical coders from clinical data management team process these terms and perform medical coding. Medical coding is performed to categorize the medical terms reported appropriately so that they can be analyzed/reviewed. This article describes process which is used for medical coding in clinical data management and two most commonly used medical dictionaries MedDRA and WHO-DDE in brief. It is expected to help medical coders to understand the process of medical coding in clinical data management. Few common issues which the medical coder faces while performing medical coding, are also highlighted.
Walter, Nils G; Batey, Robert T
2009-01-01
This book assembles chapters from experts in the Biophysics of RNA to provide a broadly accessible snapshot of the current status of this rapidly expanding field. The 2006 Nobel Prize in Physiology or Medicine was awarded to the discoverers of RNA interference, highlighting just one example of a large number of non-protein coding RNAs. Because non-protein coding RNAs outnumber protein coding genes in mammals and other higher eukaryotes, it is now thought that the complexity of organisms is correlated with the fraction of their genome that encodes non-protein coding RNAs. Essential biological processes as diverse as cell differentiation, suppression of infecting viruses and parasitic transposons, higher-level organization of eukaryotic chromosomes, and gene expression itself are found to largely be directed by non-protein coding RNAs. The biophysical study of these RNAs employs X-ray crystallography, NMR, ensemble and single molecule fluorescence spectroscopy, optical tweezers, cryo-electron microscopy, and ot...
Super Special Codes using Super Matrices
Kandasamy, W B Vasantha; Ilanthenral, K
2010-01-01
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these codes are given in the final chapter.
Detecting non-coding selective pressure in coding regions
Directory of Open Access Journals (Sweden)
Blanchette Mathieu
2007-02-01
Full Text Available Abstract Background Comparative genomics approaches, where orthologous DNA regions are compared and inter-species conserved regions are identified, have proven extremely powerful for identifying non-coding regulatory regions located in intergenic or intronic regions. However, non-coding functional elements can also be located within coding region, as is common for exonic splicing enhancers, some transcription factor binding sites, and RNA secondary structure elements affecting mRNA stability, localization, or translation. Since these functional elements are located in regions that are themselves highly conserved because they are coding for a protein, they generally escaped detection by comparative genomics approaches. Results We introduce a comparative genomics approach for detecting non-coding functional elements located within coding regions. Codon evolution is modeled as a mixture of codon substitution models, where each component of the mixture describes the evolution of codons under a specific type of coding selective pressure. We show how to compute the posterior distribution of the entropy and parsimony scores under this null model of codon evolution. The method is applied to a set of growth hormone 1 orthologous mRNA sequences and a known exonic splicing elements is detected. The analysis of a set of CORTBP2 orthologous genes reveals a region of several hundred base pairs under strong non-coding selective pressure whose function remains unknown. Conclusion Non-coding functional elements, in particular those involved in post-transcriptional regulation, are likely to be much more prevalent than is currently known. With the numerous genome sequencing projects underway, comparative genomics approaches like that proposed here are likely to become increasingly powerful at detecting such elements.
Hybrid coded aperture and Compton imaging using an active mask
Energy Technology Data Exchange (ETDEWEB)
Schultz, L.J. [Los Alamos National Laboratory, Los Alamos, NM (United States)], E-mail: schultz@lanl.gov; Wallace, M.S.; Galassi, M.C.; Hoover, A.S.; Mocko, M.; Palmer, D.M.; Tornga, S.R.; Kippen, R.M. [Los Alamos National Laboratory, Los Alamos, NM (United States); Hynes, M.V.; Toolin, M.J.; Harris, B.; McElroy, J.E. [Raytheon Integrated Defense Systems, Tewksbury, MA (United States); Wakeford, D. [Bubble Technology Industries, Chalk River, Ontario (Canada); Lanza, R.C.; Horn, B.K.P. [Massachusetts Institute of Technology, Cambridge, MA (United States); Wehe, D.K. [University of Michigan, Ann Arbor, MI (United States)
2009-09-11
The trimodal imager (TMI) images gamma-ray sources from a mobile platform using both coded aperture (CA) and Compton imaging (CI) modalities. In this paper we will discuss development and performance of image reconstruction algorithms for the TMI. In order to develop algorithms in parallel with detector hardware we are using a GEANT4 [J. Allison, K. Amako, J. Apostolakis, H. Araujo, P.A. Dubois, M. Asai, G. Barrand, R. Capra, S. Chauvie, R. Chytracek, G. Cirrone, G. Cooperman, G. Cosmo, G. Cuttone, G. Daquino, et al., IEEE Trans. Nucl. Sci. NS-53 (1) (2006) 270] based simulation package to produce realistic data sets for code development. The simulation code incorporates detailed detector modeling, contributions from natural background radiation, and validation of simulation results against measured data. Maximum likelihood algorithms for both imaging methods are discussed, as well as a hybrid imaging algorithm wherein CA and CI information is fused to generate a higher fidelity reconstruction.
Specific structural probing of plasmid-coded ribosomal RNAs from Escherichia coli
DEFF Research Database (Denmark)
Aagaard, C; Rosendahl, G; Dam, M
1991-01-01
ribosome population, which consequently hinders direct probing of mutant rRNAs. Here, we describe how nonconserved helical regions of plasmid-coded rRNA have been altered in a manner that preserves their secondary structures while creating new sites for primer extension of mutant rRNAs. This facilitates...
Using DEWIS and R for Multi-Staged Statistics e-Assessments
Gwynllyw, D. Rhys; Weir, Iain S.; Henderson, Karen L.
2016-01-01
We demonstrate how the DEWIS e-Assessment system may use embedded R code to facilitate the assessment of students' ability to perform involved statistical analyses. The R code has been written to emulate SPSS output and thus the statistical results for each bespoke data set can be generated efficiently and accurately using standard R routines.…
Unfolding code for neutron spectrometry based on neural nets technology
Energy Technology Data Exchange (ETDEWEB)
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
The most delicate part of neutron spectrometry, is the unfolding process. The derivation of the spectral information is not simple because the unknown is not given directly as a result of the measurements. The drawbacks associated with traditional unfolding procedures have motivated the need of complementary approaches. Novel methods based on Artificial Neural Networks have been widely investigated. In this work, a neutron spectrum unfolding code based on neural nets technology is presented. This unfolding code called Neutron Spectrometry and Dosimetry by means of Artificial Neural Networks was designed in a graphical interface under LabVIEW programming environment. The core of the code is an embedded neural network architecture, previously optimized by the {sup R}obust Design of Artificial Neural Networks Methodology{sup .} The main features of the code are: is easy to use, friendly and intuitive to the user. This code was designed for a Bonner Sphere System based on a {sup 6}Lil(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. The main feature of the code is that as entrance data, only seven rate counts measurement with a Bonner spheres spectrometer are required for simultaneously unfold the 60 energy bins of the neutron spectrum and to calculate 15 dosimetric quantities, for radiation protection porpoises. This code generates a full report in html format with all relevant information. (Author)
Identifying codes and locating-dominating sets on paths and cycles
Chen, Chunxia; Miao, Zhengke
2009-01-01
Let $G=(V,E)$ be a graph and let $r\\ge 1$ be an integer. For a set $D \\subseteq V$, define $N_r[x] = \\{y \\in V: d(x, y) \\leq r\\}$ and $D_r(x) = N_r[x] \\cap D$, where $d(x,y)$ denotes the number of edges in any shortest path between $x$ and $y$. $D$ is known as an $r$-identifying code ($r$-locating-dominating set, respectively), if for all vertices $x\\in V$ ($x \\in V\\backslash D$, respectively), $D_r(x)$ are all nonempty and different. In this paper, we provide complete results for $r$-identifying codes in paths and odd cycles; we also give complete results for 2-locating-dominating sets in cycles.
CYCLIC CODES OVER FORMAL POWER SERIES RINGS
Institute of Scientific and Technical Information of China (English)
Dougherty Steven T.; Liu Hongwei
2011-01-01
In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.
Non-Pauli observables for CWS codes
Santiago, Douglas F. G.; Portugal, Renato; Melo, Nolmar
2013-05-01
It is known that nonadditive quantum codes can have higher code dimensions than stabilizer codes for the same length and minimum distance. The class of codeword stabilized codes (CWS) provides tools to obtain new nonadditive quantum codes by reducing the problem to finding nonlinear classical codes. In this work, we establish some results on the kind of non-Pauli operators that can be used as observables in the decoding scheme of CWS codes and propose a procedure to obtain those observables.
The Flutter Shutter Code Calculator
Directory of Open Access Journals (Sweden)
Yohann Tendero
2015-08-01
Full Text Available The goal of the flutter shutter is to make uniform motion blur invertible, by a"fluttering" shutter that opens and closes on a sequence of well chosen sub-intervals of the exposure time interval. In other words, the photon flux is modulated according to a well chosen sequence calledflutter shutter code. This article provides a numerical method that computes optimal flutter shutter codes in terms of mean square error (MSE. We assume that the observed objects follow a known (or learned random velocity distribution. In this paper, Gaussian and uniform velocity distributions are considered. Snapshots are also optimized taking the velocity distribution into account. For each velocity distribution, the gain of the optimal flutter shutter code with respectto the optimal snapshot in terms of MSE is computed. This symmetric optimization of theflutter shutter and of the snapshot allows to compare on an equal footing both solutions, i.e. camera designs. Optimal flutter shutter codes are demonstrated to improve substantially the MSE compared to classic (patented or not codes. A numerical method that permits to perform a reverse engineering of any existing (patented or not flutter shutter codes is also describedand an implementation is given. In this case we give the underlying velocity distribution fromwhich a given optimal flutter shutter code comes from. The combination of these two numerical methods furnishes a comprehensive study of the optimization of a flutter shutter that includes a forward and a backward numerical solution.
Constructions of Rank Modulation Codes
Mazumdar, Arya; Zémor, Gilles
2011-01-01
Rank modulation is a way of encoding information to correct errors in flash memory devices as well as impulse noise in transmission lines. Modeling rank modulation involves construction of packings of the space of permutations equipped with the Kendall tau distance. We present several general constructions of codes in permutations that cover a broad range of code parameters. In particular, we show a number of ways in which conventional error-correcting codes can be modified to correct errors in the Kendall space. Codes that we construct afford simple encoding and decoding algorithms of essentially the same complexity as required to correct errors in the Hamming metric. For instance, from binary BCH codes we obtain codes correcting $t$ Kendall errors in $n$ memory cells that support the order of $n!/(\\log_2n!)^t$ messages, for any constant $t= 1,2,...$ We also construct families of codes that correct a number of errors that grows with $n$ at varying rates, from $\\Theta(n)$ to $\\Theta(n^{2})$. One of our constr...
Trajectory Codes for Flash Memory
Anxiao,; Langberg, Michael; Schwartz, Moshe; Bruck, Jehoshua
2010-01-01
Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data updates are determined by the data structure and the application, and are independent of the constraints imposed by the storage medium. Thus, an appropriate coding scheme is needed so that the data changes can be updated and stored efficiently under the storage-medium's constraints. In this paper, we define the general rewriting problem using a graph model. It extends many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a new rewriting scheme for flash memories, called the trajectory code, for rewriting the stored data as many times as possible without block erasures. We prove that the trajectory code is asymptotically optimal in a wide range of scenarios. We also present randomized rewriting codes optimized for expected performance (g...
Energy Technology Data Exchange (ETDEWEB)
Barr, W.L.; Bathke, C.G.; Brooks, J.N.; Bulmer, R.H.; Busigin, A.; DuBois, P.F.; Fenstermacher, M.E.; Fink, J.; Finn, P.A.; Galambos, J.D.; Gohar, Y.; Gorker, G.E.; Haines, J.R.; Hassanein, A.M.; Hicks, D.R.; Ho, S.K.; Kalsi, S.S.; Kalyanam, K.M.; Kerns, J.A.; Lee, J.D.; Miller, J.R.; Miller, R.L.; Myall, J.O.; Peng, Y-K.M.; Perkins, L.J.; Spampinato, P.T.; Strickler, D.J.; Thomson, S.L.; Wagner, C.E.; Willms, R.S.; Reid, R.L. (ed.)
1988-04-01
A tokamak systems code capable of modeling experimental test reactors has been developed and is described in this document. The code, named TETRA (for Tokamak Engineering Test Reactor Analysis), consists of a series of modules, each describing a tokamak system or component, controlled by an optimizer/driver. This code development was a national effort in that the modules were contributed by members of the fusion community and integrated into a code by the Fusion Engineering Design Center. The code has been checked out on the Cray computers at the National Magnetic Fusion Energy Computing Center and has satisfactorily simulated the Tokamak Ignition/Burn Experimental Reactor II (TIBER) design. A feature of this code is the ability to perform optimization studies through the use of a numerical software package, which iterates prescribed variables to satisfy a set of prescribed equations or constraints. This code will be used to perform sensitivity studies for the proposed International Thermonuclear Experimental Reactor (ITER). 22 figs., 29 tabs.
CodedStream: live media streaming with overlay coded multicast
Guo, Jiang; Zhu, Ying; Li, Baochun
2003-12-01
Multicasting is a natural paradigm for streaming live multimedia to multiple end receivers. Since IP multicast is not widely deployed, many application-layer multicast protocols have been proposed. However, all of these schemes focus on the construction of multicast trees, where a relatively small number of links carry the multicast streaming load, while the capacity of most of the other links in the overlay network remain unused. In this paper, we propose CodedStream, a high-bandwidth live media distribution system based on end-system overlay multicast. In CodedStream, we construct a k-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied to work around bottlenecks. Simulation results have shown that the combination of k-redundant multicast graph and network coding may indeed bring significant benefits with respect to improving the quality of live media at the end receivers.
Surface code implementation of block code state distillation
Fowler, Austin G.; Devitt, Simon J.; Jones, Cody
2013-01-01
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved |A〉 state given 15 input copies. New block code state distillation methods can produce k improved |A〉 states given 3k + 8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three. PMID:23736868
Coding and decoding for code division multiple user communication systems
Healy, T. J.
1985-01-01
A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.
Code-Mixing and Code Switchingin The Process of Learning
Directory of Open Access Journals (Sweden)
Diyah Atiek Mustikawati
2016-09-01
Full Text Available This study aimed to describe a form of code switching and code mixing specific form found in the teaching and learning activities in the classroom as well as determining factors influencing events stand out that form of code switching and code mixing in question.Form of this research is descriptive qualitative case study which took place in Al Mawaddah Boarding School Ponorogo. Based on the analysis and discussion that has been stated in the previous chapter that the form of code mixing and code switching learning activities in Al Mawaddah Boarding School is in between the use of either language Java language, Arabic, English and Indonesian, on the use of insertion of words, phrases, idioms, use of nouns, adjectives, clauses, and sentences. Code mixing deciding factor in the learning process include: Identification of the role, the desire to explain and interpret, sourced from the original language and its variations, is sourced from a foreign language. While deciding factor in the learning process of code, includes: speakers (O1, partners speakers (O2, the presence of a third person (O3, the topic of conversation, evoke a sense of humour, and just prestige. The significance of this study is to allow readers to see the use of language in a multilingual society, especially in AL Mawaddah boarding school about the rules and characteristics variation in the language of teaching and learning activities in the classroom. Furthermore, the results of this research will provide input to the ustadz / ustadzah and students in developing oral communication skills and the effectiveness of teaching and learning strategies in boarding schools.
Network Coding Fundamentals and Applications
Medard, Muriel
2011-01-01
Network coding is a field of information and coding theory and is a method of attaining maximum information flow in a network. This book is an ideal introduction for the communications and network engineer, working in research and development, who needs an intuitive introduction to network coding and to the increased performance and reliability it offers in many applications. This book is an ideal introduction for the research and development communications and network engineer who needs an intuitive introduction to the theory and wishes to understand the increased performance and reliabil
State building energy codes status
Energy Technology Data Exchange (ETDEWEB)
NONE
1996-09-01
This document contains the State Building Energy Codes Status prepared by Pacific Northwest National Laboratory for the U.S. Department of Energy under Contract DE-AC06-76RL01830 and dated September 1996. The U.S. Department of Energy`s Office of Codes and Standards has developed this document to provide an information resource for individuals interested in energy efficiency of buildings and the relevant building energy codes in each state and U.S. territory. This is considered to be an evolving document and will be updated twice a year. In addition, special state updates will be issued as warranted.
Neural Decoder for Topological Codes
Torlai, Giacomo; Melko, Roger G.
2017-07-01
We present an algorithm for error correction in topological codes that exploits modern machine learning techniques. Our decoder is constructed from a stochastic neural network called a Boltzmann machine, of the type extensively used in deep learning. We provide a general prescription for the training of the network and a decoding strategy that is applicable to a wide variety of stabilizer codes with very little specialization. We demonstrate the neural decoder numerically on the well-known two-dimensional toric code with phase-flip errors.
Atlas C++ Coding Standard Specification
Albrand, S; Barberis, D; Bosman, M; Jones, B; Stavrianakou, M; Arnault, C; Candlin, D; Candlin, R; Franck, E; Hansl-Kozanecka, Traudl; Malon, D; Qian, S; Quarrie, D; Schaffer, R D
2001-01-01
This document defines the ATLAS C++ coding standard, that should be adhered to when writing C++ code. It has been adapted from the original "PST Coding Standard" document (http://pst.cern.ch/HandBookWorkBook/Handbook/Programming/programming.html) CERN-UCO/1999/207. The "ATLAS standard" comprises modifications, further justification and examples for some of the rules in the original PST document. All changes were discussed in the ATLAS Offline Software Quality Control Group and feedback from the collaboration was taken into account in the "current" version.
Nonlocally Centralized Simultaneous Sparse Coding
Institute of Scientific and Technical Information of China (English)
雷阳; 宋占杰
2016-01-01
The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlo-cal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NC-SSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image resto-ration methods.
Lavieri, Edward D
2013-01-01
A practical guide written in a tutorial-style, ""LiveCode Mobile Development Hotshot"" walks you step-by-step through 10 individual projects. Every project is divided into sub tasks to make learning more organized and easy to follow along with explanations, diagrams, screenshots, and downloadable material.This book is great for anyone who wants to develop mobile applications using LiveCode. You should be familiar with LiveCode and have access to a smartphone. You are not expected to know how to create graphics or audio clips.
PRACTICAL ALGORITHMS FOR TORNADO CODES
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect,two algorithms are introduced: (1) while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; (2) in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.
Directory of Open Access Journals (Sweden)
Jonas Kubilius
2014-02-01
Full Text Available Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF. GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
Dynamic documents with R and knitr
Xie, Yihui
2013-01-01
IntroductionReproducible ResearchLiteratureGood and Bad PracticesBarriersA First LookSetupMinimal ExamplesQuick Reporting Extracting R Code Editors RStudio LYX Emacs/ESS Other Editors Document FormatsInput Syntax Document Formats Output Renderers R Scripts Text OutputInline Output Chunk Output Tables Themes GraphicsGraphical Devices Plot Recording Plot Rearrangement Plot Size in Output Extra Output Options The tikz Device Figure Environment Figure Path CacheImplementation Write Cache When to Update Cache Side Effects Chunk Dependencies Cross Reference 79Chunk Reference Code Externalization Chi
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
Linear and nonlinear verification of gyrokinetic microstability codes
Bravenec, R. V.; Candy, J.; Barnes, M.; Holland, C.
2011-12-01
Verification of nonlinear microstability codes is a necessary step before comparisons or predictions of turbulent transport in toroidal devices can be justified. By verification we mean demonstrating that a code correctly solves the mathematical model upon which it is based. Some degree of verification can be accomplished indirectly from analytical instability threshold conditions, nonlinear saturation estimates, etc., for relatively simple plasmas. However, verification for experimentally relevant plasma conditions and physics is beyond the realm of analytical treatment and must rely on code-to-code comparisons, i.e., benchmarking. The premise is that the codes are verified for a given problem or set of parameters if they all agree within a specified tolerance. True verification requires comparisons for a number of plasma conditions, e.g., different devices, discharges, times, and radii. Running the codes and keeping track of linear and nonlinear inputs and results for all conditions could be prohibitive unless there was some degree of automation. We have written software to do just this and have formulated a metric for assessing agreement of nonlinear simulations. We present comparisons, both linear and nonlinear, between the gyrokinetic codes GYRO [J. Candy and R. E. Waltz, J. Comput. Phys. 186, 545 (2003)] and GS2 [W. Dorland, F. Jenko, M. Kotschenreuther, and B. N. Rogers, Phys. Rev. Lett. 85, 5579 (2000)]. We do so at the mid-radius for the same discharge as in earlier work [C. Holland, A. E. White, G. R. McKee, M. W. Shafer, J. Candy, R. E. Waltz, L. Schmitz, and G. R. Tynan, Phys. Plasmas 16, 052301 (2009)]. The comparisons include electromagnetic fluctuations, passing and trapped electrons, plasma shaping, one kinetic impurity, and finite Debye-length effects. Results neglecting and including electron collisions (Lorentz model) are presented. We find that the linear frequencies with or without collisions agree well between codes, as do the time averages of
microRNA-9 targets the long non-coding RNA MALAT1 for degradation in the nucleus
DEFF Research Database (Denmark)
Leucci, Eleonora; Patella, Francesca; Waage, Johannes
2013-01-01
-coding RNAs. Here we report that microRNA-9 (miR-9) regulates the expression of the Metastasis Associated Lung Adenocarcinoma Transcript 1 (MALAT-1), one of the most abundant and conserved long non-coding RNAs. Intriguingly, we find that miR-9 targets AGO2-mediated regulation of MALAT1 in the nucleus. Our...
Performance of mixture refrigerant R152a/R125/R32 in domestic air-conditioner
Energy Technology Data Exchange (ETDEWEB)
Wu, Jiangtao; Chu, Yingjie; Hu, Jing; Liu, Zhigang [State Key Laboratory of Multiphase Flow in Power Engineering, Xi' an Jiaotong University, Xi' an, Shaanxi 710049 (China)
2009-08-15
This work reports a ternary blend R152a/R125/R32 with a mass ratio of 48/18/34 as a potential alternative to R22. A computer code has been developed with NIST REFPROP 7.0 for the comparative analysis of thermophysical properties and refrigerant performance of this new mixture and of R22. A drop-in test of this new mixture was performed in a domestic air-conditioner originally designed for R22. Both the calculation and experimental results showed that this new mixture could be regarded as a most likely drop-in substitute for R22 in many applications. The flammability of this ternary blend was also studied with an explosion apparatus to prove that it could be used safely. Besides, simulation of the refrigerant cycle leakage showed that the variation of composition due to leakage was so little that there is no much performance degradation. (author)
Introduction to coding and information theory
Roman, Steven
1997-01-01
This book is intended to introduce coding theory and information theory to undergraduate students of mathematics and computer science. It begins with a review of probablity theory as applied to finite sample spaces and a general introduction to the nature and types of codes. The two subsequent chapters discuss information theory: efficiency of codes, the entropy of information sources, and Shannon's Noiseless Coding Theorem. The remaining three chapters deal with coding theory: communication channels, decoding in the presence of errors, the general theory of linear codes, and such specific codes as Hamming codes, the simplex codes, and many others.
Beam-dynamics codes used at DARHT
Energy Technology Data Exchange (ETDEWEB)
Ekdahl, Jr., Carl August [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-02-01
Several beam simulation codes are used to help gain a better understanding of beam dynamics in the DARHT LIAs. The most notable of these fall into the following categories: for beam production – Tricomp Trak orbit tracking code, LSP Particle in cell (PIC) code, for beam transport and acceleration – XTR static envelope and centroid code, LAMDA time-resolved envelope and centroid code, LSP-Slice PIC code, for coasting-beam transport to target – LAMDA time-resolved envelope code, LSP-Slice PIC code. These codes are also being used to inform the design of Scorpius.
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...
Electronic Code of Federal Regulations
National Archives and Records Administration — The Electronic Code of Federal Regulations (e-CFR) is the codification of the general and permanent rules published in the Federal Register by the executive...
FLYCHK Collisional-Radiative Code
SRD 160 FLYCHK Collisional-Radiative Code (Web, free access) FLYCHK provides a capability to generate atomic level populations and charge state distributions for low-Z to mid-Z elements under NLTE conditions.
Allegheny County Zip Code Boundaries
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — This dataset demarcates the zip code boundaries that lie within Allegheny County. These are not clipped to the Allgeheny County boundary. If viewing this...
Squares of Random Linear Codes
DEFF Research Database (Denmark)
Cascudo Pueyo, Ignacio; Cramer, Ronald; Mirandola, Diego
2015-01-01
a positive answer, for codes of dimension $k$ and length roughly $\\frac{1}{2}k^2$ or smaller. Moreover, the convergence speed is exponential if the difference $k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the precise......Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code ``typically'' fill the whole space? We give...
The Serializability of Network Codes
Blasiak, Anna
2010-01-01
Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of network coding problems aims to reduce the problem to optimization over a polytope of entropic vectors subject to constraints imposed by the network structure. In the case of directed acyclic graphs, these constraints are completely understood, but for general graphs the problem of enumerating them remains open: it is not known how to classify the constraints implied by a property that we call serializability, which refers to the absence of paradoxical circular dependencies in a network code. In this work we initiate the first systematic study of the constraints imposed on a network code by serializability. We find that serializability cannot be detected solely by evaluating the Shannon entropy of edge sets in the graph, but nevertheless, we give a polynomial-time algorithm tha...
Institute of Scientific and Technical Information of China (English)
Qunying LIAO
2011-01-01
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. The main problem is to compute the error distance of a received word.Using the Weil bound for character sum estimate,Li and Wan showed that the error distance can be determined when the degree of the received word as a polynomial is small.In the first part,the result of Li and Wan is improved.On the other hand,one of the important parameters of an error-correcting code is the dimension.In most cases,one can only get bounds for the dinension.In the second part,a formula for the dimension of the generalized trace Reed-Solonon codes in some cases is obtained.
Code properties from holographic geometries
Pastawski, Fernando
2016-01-01
Almheiri, Dong, and Harlow [hep-th/1411.7041] proposed a highly illuminating connection between the AdS/CFT holographic correspondence and operator algebra quantum error correction (OAQEC). Here we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes which admit a holographic interpretation. We introduce a new quantity called `price', which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit `uberholography', meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for q...
Efficient codes and balanced networks.
Denève, Sophie; Machens, Christian K
2016-03-01
Recent years have seen a growing interest in inhibitory interneurons and their circuits. A striking property of cortical inhibition is how tightly it balances excitation. Inhibitory currents not only match excitatory currents on average, but track them on a millisecond time scale, whether they are caused by external stimuli or spontaneous fluctuations. We review, together with experimental evidence, recent theoretical approaches that investigate the advantages of such tight balance for coding and computation. These studies suggest a possible revision of the dominant view that neurons represent information with firing rates corrupted by Poisson noise. Instead, tight excitatory/inhibitory balance may be a signature of a highly cooperative code, orders of magnitude more precise than a Poisson rate code. Moreover, tight balance may provide a template that allows cortical neurons to construct high-dimensional population codes and learn complex functions of their inputs.
NSGIC Local Govt | GIS Inventory — The WCSZipcode polygon feature class was created by Miami-Dade Enterprise Technology Department to be used in the WCS batch jobs to assign the actual zip code of...
The moving mesh code Shadowfax
Vandenbroucke, Bert
2016-01-01
We introduce the moving mesh code Shadowfax, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public License. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare Shadowfax with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
The moving mesh code SHADOWFAX
Vandenbroucke, B.; De Rijcke, S.
2016-07-01
We introduce the moving mesh code SHADOWFAX, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public Licence. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare SHADOWFAX with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
Ultrasound imaging using coded signals
DEFF Research Database (Denmark)
Misaridis, Athanasios
Modulated (or coded) excitation signals can potentially improve the quality and increase the frame rate in medical ultrasound scanners. The aim of this dissertation is to investigate systematically the applicability of modulated signals in medical ultrasound imaging and to suggest appropriate...... methods for coded imaging, with the goal of making better anatomic and flow images and three-dimensional images. On the first stage, it investigates techniques for doing high-resolution coded imaging with improved signal-to-noise ratio compared to conventional imaging. Subsequently it investigates how...... coded excitation can be used for increasing the frame rate. The work includes both simulated results using Field II, and experimental results based on measurements on phantoms as well as clinical images. Initially a mathematical foundation of signal modulation is given. Pulse compression based...
Facilitating Internet-Scale Code Retrieval
Bajracharya, Sushil Krishna
2010-01-01
Internet-Scale code retrieval deals with the representation, storage, and access of relevant source code from a large amount of source code available on the Internet. Internet-Scale code retrieval systems support common emerging practices among software developers related to finding and reusing source code. In this dissertation we focus on some…
Decoder for Nonbinary CWS Quantum Codes
Melo, Nolmar; Portugal, Renato
2012-01-01
We present a decoder for nonbinary CWS quantum codes using the structure of union codes. The decoder runs in two steps: first we use a union of stabilizer codes to detect a sequence of errors, and second we build a new code, called union code, that allows to correct the errors.
The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes
Guenda, Kenza
2010-01-01
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two cyclic codes of length p^r can be equivalent. We also find the set of permutations by which two quasi-cyclic codes can be equivalent.
Parametric Coding of Stereo Audio
Directory of Open Access Journals (Sweden)
Erik Schuijers
2005-06-01
Full Text Available Parametric-stereo coding is a technique to efficiently code a stereo audio signal as a monaural signal plus a small amount of parametric overhead to describe the stereo image. The stereo properties are analyzed, encoded, and reinstated in a decoder according to spatial psychoacoustical principles. The monaural signal can be encoded using any (conventional audio coder. Experiments show that the parameterized description of spatial properties enables a highly efficient, high-quality stereo audio representation.
Interleaver Design for Turbo Coding
DEFF Research Database (Denmark)
Andersen, Jakob Dahl; Zyablov, Viktor
1997-01-01
By a combination of construction and random search based on a careful analysis of the low weight words and the distance properties of the component codes, it is possible to find interleavers for turbo coding with a high minimum distance. We have designed a block interleaver with permutations...... of each row, and found a combination of permutations where a tight upper bound to the minimum distance of the complete turbo scheme is 108....
Eklund, Kerri
2016-01-01
The Guide to the Code of Ethics for Nurses is an excellent guideline for all nurses regardless of their area of practice. I greatly enjoyed reading the revisions in place within the 2015 edition and refreshing my nursing conscience. I plan to always keep my Guide to the Code of Ethics for Nurses near in order to keep my moral compass from veering off the path of quality care.
Indian Academy of Sciences (India)
Prathyush Samineni; Debabrata Goswami
2008-12-01
We demonstrate coded self-assembly in nanostructures using the code seeded at the component level through computer simulations. Defects or cavities occur in all natural assembly processes including crystallization and our simulations capture this essential aspect under surface minimization constraints for self-assembly. Our bottom-up approach to nanostructures would provide a new dimension towards nanofabrication and better understanding of defects and crystallization process.
Energy Technology Data Exchange (ETDEWEB)
Chang, Jong Hwa; Lee, Ki Bog; Zee, Sung Kyun; Lee, Chang Ho [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1993-12-01
ONED90 developed by KAERI is a 1-dimensional 2-group diffusion theory code. For nuclear design and reactor simulation, the usage of ONED90 encompasses core follow calculation, load follow calculation, plant power control simulation, xenon oscillation simulation and control rod maneuvering, etc. In order to verify the validity of ONED90 code, two well-known benchmark problems are solved by ONED90 shows very similar result to reference solution. (Author) 11 refs., 5 figs., 13 tabs.
Product Work Classification and Coding
1986-06-01
detail is much more useful in planning steel welding processes. In this regard remember that mild steel , HSLA steel , and high-yield steel (e.g. HY80 ...manufacturing facility. In Figure 2.3-2, a classification and coding system for steel parts is shown. This classification and coding system sorts steel parts...system would provide a shop which produced steel parts with a means of organizing parts. Rather than attempting to manage all of its parts as a single
n-Nucleotide circular codes in graph theory.
Fimmel, Elena; Michel, Christian J; Strüngmann, Lutz
2016-03-13
The circular code theory proposes that genes are constituted of two trinucleotide codes: the classical genetic code with 61 trinucleotides for coding the 20 amino acids (except the three stop codons {TAA,TAG,TGA}) and a circular code based on 20 trinucleotides for retrieving, maintaining and synchronizing the reading frame. It relies on two main results: the identification of a maximal C(3) self-complementary trinucleotide circular code X in genes of bacteria, eukaryotes, plasmids and viruses (Michel 2015 J. Theor. Biol. 380, 156-177. (doi:10.1016/j.jtbi.2015.04.009); Arquès & Michel 1996 J. Theor. Biol. 182, 45-58. (doi:10.1006/jtbi.1996.0142)) and the finding of X circular code motifs in tRNAs and rRNAs, in particular in the ribosome decoding centre (Michel 2012 Comput. Biol. Chem. 37, 24-37. (doi:10.1016/j.compbiolchem.2011.10.002); El Soufi & Michel 2014 Comput. Biol. Chem. 52, 9-17. (doi:10.1016/j.compbiolchem.2014.08.001)). The univerally conserved nucleotides A1492 and A1493 and the conserved nucleotide G530 are included in X circular code motifs. Recently, dinucleotide circular codes were also investigated (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. (doi:10.1155/2013/538631); Fimmel et al. 2015 J. Theor. Biol. 386, 159-165. (doi:10.1016/j.jtbi.2015.08.034)). As the genetic motifs of different lengths are ubiquitous in genes and genomes, we introduce a new approach based on graph theory to study in full generality n-nucleotide circular codes X, i.e. of length 2 (dinucleotide), 3 (trinucleotide), 4 (tetranucleotide), etc. Indeed, we prove that an n-nucleotide code X is circular if and only if the corresponding graph [Formula: see text] is acyclic. Moreover, the maximal length of a path in [Formula: see text] corresponds to the window of nucleotides in a sequence for detecting the correct reading frame. Finally, the graph theory of tournaments is applied to the study of dinucleotide circular codes. It has full equivalence between the combinatorics
A Pixel Domain Video Coding based on Turbo code and Arithmetic code
Directory of Open Access Journals (Sweden)
Cyrine Lahsini
2012-05-01
Full Text Available In recent years, with emerging applications such as multimedia sensors networks, wirelesslow-power surveillance and mobile camera phones, the traditional video coding architecture in beingchallenged. In fact, these applications have different requirements than those of the broadcast videodelivery systems: a low power consumption at the encoder side is essential.In this context, we propose a pixel-domain video coding scheme which fits well in these senarios.In this system, both the arithmetic and turbo codes are used to encode the video sequence's frames.Simulations results show significant gains over Pixel-domain Wyner-Ziv video codeingr.
Cyclic Code and Self-Dual Code over F2+ uF2 + u2F2%环F2+uF2+u2F2上的循环码及自对偶码
Institute of Scientific and Technical Information of China (English)
冯倩倩; 周伟刚
2009-01-01
We give the structures of a cyclic code over ring R = F2+ uF2 + u2F2 = {0, 1,u, u2,υ,υ2,uυ, υ3}, where υ3 = 0, of odd length and its dual code. For the cyclic code, necessary and sufficient conditions for the existence of self-dual code are provided.
Problem-Based Test: An "In Vitro" Experiment to Analyze the Genetic Code
Szeberenyi, Jozsef
2010-01-01
Terms to be familiar with before you start to solve the test: genetic code, translation, synthetic polynucleotide, leucine, serine, filter precipitation, radioactivity measurement, template, mRNA, tRNA, rRNA, aminoacyl-tRNA synthesis, ribosomes, degeneration of the code, wobble, initiation, and elongation of protein synthesis, initiation codon.…
System performance with R407A, R407B, R407C compared to R22
DEFF Research Database (Denmark)
Knudsen, Hans Jørgen Høgaard
1997-01-01
The article presents the results obtained by substituting R22 with mixture of R32/R125/R134A (R407A, R407B and R407C) in an existing refrigeration plant. Cooling capacity, coefficient of performance and heat transfer coefficient in the evaporator have been measured.The results show that for R407C...
The Proteomic Code: a molecular recognition code for proteins
Directory of Open Access Journals (Sweden)
Biro Jan C
2007-11-01
Full Text Available Abstract Background The Proteomic Code is a set of rules by which information in genetic material is transferred into the physico-chemical properties of amino acids. It determines how individual amino acids interact with each other during folding and in specific protein-protein interactions. The Proteomic Code is part of the redundant Genetic Code. Review The 25-year-old history of this concept is reviewed from the first independent suggestions by Biro and Mekler, through the works of Blalock, Root-Bernstein, Siemion, Miller and others, followed by the discovery of a Common Periodic Table of Codons and Nucleic Acids in 2003 and culminating in the recent conceptualization of partial complementary coding of interacting amino acids as well as the theory of the nucleic acid-assisted protein folding. Methods and conclusions A novel cloning method for the design and production of specific, high-affinity-reacting proteins (SHARP is presented. This method is based on the concept of proteomic codes and is suitable for large-scale, industrial production of specifically interacting peptides.
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.
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
Institute of Scientific and Technical Information of China (English)
LU Peizhong; LI Shen; ZOU Yan; LUO Xiangyang
2005-01-01
This paper presents an algorithm for blind recognition of punctured convolutional codes which is an important problem in adaptive modulation and coding. For a given finite sequence of convolutional code, the parity check matrix of the convolutional code is first computed by solving a linear system with adequate error tolerance. Then a minimal basic encoding matrix of the original convolutional code and its puncturing pattern are determined according to the known parity check matrix of the punctured convolutional code.
Wireless Network Coding with Local Network Views: Coded Layer Scheduling
Vahid, Alireza; Avestimehr, A Salman; Sabharwal, Ashutosh
2011-01-01
One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire limited local views of the whole network to design their transmission strategies. In this paper, we study multi-layer wireless networks and assume that each node has only a limited knowledge, namely 1-local view, where each S-D pair has enough information to perform optimally when other pairs do not interfere, along with connectivity information for rest of the network. We investigate the information-theoretic limits of communication with such limited knowledge at the nodes. We develop a novel transmission strategy, namely Coded Layer Scheduling, that solely relies on 1-local view at the nodes and incorporates three different techniques: (1) per layer interference avoidance, (2) repetition coding to allow overhearing of the interference, and (3) network coding to allow inter...
Prescription Drug Abuse Information in D.A.R.E.
Morris, Melissa C.; Cline, Rebecca J. Welch; Weiler, Robert M.; Broadway, S. Camille
2006-01-01
This investigation was designed to examine prescription drug-related content and learning objectives in Drug Abuse Resistance Education (D.A.R.E.) for upper elementary and middle schools. Specific prescription-drug topics and context associated with content and objectives were coded. The coding system for topics included 126 topics organized…
Urn Sampling Without Replacement: Enumerative Combinatorics in R
Directory of Open Access Journals (Sweden)
Robin K. S. Hankin
2007-01-01
Full Text Available This short paper introduces a code snippet in the form of two new R functions that enumerate possible draws from an urn without replacement; these functions call C code, written by the author. Some simple combinatorial problems are solved using the software.
Congress of the U.S., Washington, DC. House Committee on the Judiciary.
This hearing was called to consider two bills that would amend the section of the United States Code relating to fair use, to clarify that such section applies to both published and unpublished copyrighted works. Recent judicial developments are reviewed which suggest that the fair use doctrine does not apply to the subsequent uses of unpublished…
Requirements of a Better Secure Program Coding
Directory of Open Access Journals (Sweden)
Marius POPA
2012-01-01
Full Text Available Secure program coding refers to how manage the risks determined by the security breaches because of the program source code. The papers reviews the best practices must be doing during the software development life cycle for secure software assurance, the methods and techniques used for a secure coding assurance, the most known and common vulnerabilities determined by a bad coding process and how the security risks are managed and mitigated. As a tool of the better secure program coding, the code review process is presented, together with objective measures for code review assurance and estimation of the effort for the code improvement.
Multiplicatively Repeated Non-Binary LDPC Codes
Kasai, Kenta; Poulliat, Charly; Sakaniwa, Kohichi
2010-01-01
We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.
New multilevel codes over GF(q)
Wu, Jiantian; Costello, Daniel J., Jr.
1992-01-01
Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.
Combinatorial polarization, code loops, and codes of high level
Directory of Open Access Journals (Sweden)
Petr Vojtěchovský
2004-07-01
Full Text Available We first find the combinatorial degree of any map f:VÃ¢Â†Â’F, where F is a finite field and V is a finite-dimensional vector space over F. We then simplify and generalize a certain construction, due to Chein and Goodaire, that was used in characterizing code loops as finite Moufang loops that possess at most two squares. The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.
On the Dimension of Graph Codes with Reed–Solomon Component Codes
DEFF Research Database (Denmark)
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...
DEFF Research Database (Denmark)
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
Energy Technology Data Exchange (ETDEWEB)
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
Energy Technology Data Exchange (ETDEWEB)
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
DEFF Research Database (Denmark)
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...
DEFF Research Database (Denmark)
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
Directory of Open Access Journals (Sweden)
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
Energy Technology Data Exchange (ETDEWEB)
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.