WorldWideScience

Sample records for code primary

  1. Research on Primary Shielding Calculation Source Generation Codes

    Science.gov (United States)

    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.

  2. Start App: a coding experience between primary and secondary school

    Directory of Open Access Journals (Sweden)

    Filippo Bruni

    2016-04-01

    Full Text Available The paper presents a coding experience in primary school (“Colozza” in Campobasso. Within the theoretical framework offered by computational thinking, using App Inventor, it was created a calculator for smartphone in the Android environment. High school students (from a technical secondary school guided the pupils in primary school, making an interesting form of cooperation between primary and secondary schools. Start App: una esperienza di coding tra scuola primaria e scuola secondariaIl contributo presenta una esperienza di coding nella scuola primaria dell’Istituto Comprensivo statale “Colozza” di Campobasso. All’interno della cornice teorica offerta dal pensiero computazionale, utilizzando App Inventor, è stata realizzata una calcolatrice per smartphone in ambiente Android. A guidare gli allievi della primaria sono stati gli studenti dell’Istituto Tecnico Industriale “Marconi” di Campobasso realizzando una interessante forma di collaborazione tra istituti scolastici di ordine diverso.

  3. Non-coding RNAs in primary liver cancer

    Directory of Open Access Journals (Sweden)

    Michele eGhidini

    2015-06-01

    Full Text Available Hepatocellular carcinoma (HCC is a primary malignancy of the liver with poor prognosis and limited therapeutic options. Over the past few years, many studies have evaluated the role of non-coding RNAs (ncRNAs in hepatocarcinogenesis and tumour progression. ncRNAs were shown to have diagnostic, prognostic and therapeutic potential in HCC. In this manuscript, we review the latest major discoveries concerning microRNAs and long ncRNAs in HCC pathogenesis, and discuss the potentials and the limitations for their use in clinical practice.

  4. Behaviorally relevant burst coding in primary sensory neurons.

    Science.gov (United States)

    Sabourin, Patrick; Pollack, Gerald S

    2009-08-01

    Bursts of action potentials in sensory interneurons are believed to signal the occurrence of particularly salient stimulus features. Previous work showed that bursts in an identified, ultrasound-tuned interneuron (AN2) of the cricket Teleogryllus oceanicus code for conspicuous increases in amplitude of an ultrasound stimulus, resulting in behavioral responses that are interpreted as avoidance of echolocating bats. We show that the primary sensory neurons that inform AN2 about high-frequency acoustic stimuli also produce bursts. As is the case for AN2, bursts in sensory neurons perform better as feature detectors than isolated, nonburst, spikes. Bursting is temporally correlated between sensory neurons, suggesting that on occurrence of a salient stimulus feature, AN2 will receive strong synaptic input in the form of coincident bursts, from several sensory neurons, and that this might result in bursting in AN2. Our results show that an important feature of the temporal structure of interneuron spike trains can be established at the earliest possible level of sensory processing, i.e., that of the primary sensory neuron.

  5. Fast coding of orientation in primary visual cortex.

    Directory of Open Access Journals (Sweden)

    Oren Shriki

    Full Text Available Understanding how populations of neurons encode sensory information is a major goal of systems neuroscience. Attempts to answer this question have focused on responses measured over several hundred milliseconds, a duration much longer than that frequently used by animals to make decisions about the environment. How reliably sensory information is encoded on briefer time scales, and how best to extract this information, is unknown. Although it has been proposed that neuronal response latency provides a major cue for fast decisions in the visual system, this hypothesis has not been tested systematically and in a quantitative manner. Here we use a simple 'race to threshold' readout mechanism to quantify the information content of spike time latency of primary visual (V1 cortical cells to stimulus orientation. We find that many V1 cells show pronounced tuning of their spike latency to stimulus orientation and that almost as much information can be extracted from spike latencies as from firing rates measured over much longer durations. To extract this information, stimulus onset must be estimated accurately. We show that the responses of cells with weak tuning of spike latency can provide a reliable onset detector. We find that spike latency information can be pooled from a large neuronal population, provided that the decision threshold is scaled linearly with the population size, yielding a processing time of the order of a few tens of milliseconds. Our results provide a novel mechanism for extracting information from neuronal populations over the very brief time scales in which behavioral judgments must sometimes be made.

  6. A Spanish version for the new ERA-EDTA coding system for primary renal disease.

    Science.gov (United States)

    Zurriaga, Óscar; López-Briones, Carmen; Martín Escobar, Eduardo; Saracho-Rotaeche, Ramón; Moina Eguren, Íñigo; Pallardó Mateu, Luis; Abad Díez, José María; Sánchez Miret, José Ignacio

    2015-01-01

    The European Renal Association and the European Dialysis and Transplant Association (ERA-EDTA) have issued an English-language new coding system for primary kidney disease (PKD) aimed at solving the problems that were identified in the list of "Primary renal diagnoses" that has been in use for over 40 years. In the context of Registro Español de Enfermos Renales (Spanish Registry of Renal Patients, [REER]), the need for a translation and adaptation of terms, definitions and notes for the new ERA-EDTA codes was perceived in order to help those who have Spanish as their working language when using such codes. Bilingual nephrologists contributed a professional translation and were involved in a terminological adaptation process, which included a number of phases to contrast translation outputs. Codes, paragraphs, definitions and diagnostic criteria were reviewed and agreements and disagreements aroused for each term were labelled. Finally, the version that was accepted by a majority of reviewers was agreed. A wide agreement was reached in the first review phase, with only 5 points of discrepancy remaining, which were agreed on in the final phase. Translation and adaptation into Spanish represent an improvement that will help to introduce and use the new coding system for PKD, as it can help reducing the time devoted to coding and also the period of adaptation of health workers to the new codes. Copyright © 2015 The Authors. Published by Elsevier España, S.L.U. All rights reserved.

  7. A new hybrid coding for protein secondary structure prediction based on primary structure similarity.

    Science.gov (United States)

    Li, Zhong; Wang, Jing; Zhang, Shunpu; Zhang, Qifeng; Wu, Wuming

    2017-03-16

    The coding pattern of protein can greatly affect the prediction accuracy of protein secondary structure. In this paper, a novel hybrid coding method based on the physicochemical properties of amino acids and tendency factors is proposed for the prediction of protein secondary structure. The principal component analysis (PCA) is first applied to the physicochemical properties of amino acids to construct a 3-bit-code, and then the 3 tendency factors of amino acids are calculated to generate another 3-bit-code. Two 3-bit-codes are fused to form a novel hybrid 6-bit-code. Furthermore, we make a geometry-based similarity comparison of the protein primary structure between the reference set and the test set before the secondary structure prediction. We finally use the support vector machine (SVM) to predict those amino acids which are not detected by the primary structure similarity comparison. Experimental results show that our method achieves a satisfactory improvement in accuracy in the prediction of protein secondary structure.

  8. Playing Music, Playing with Music: A Proposal for Music Coding in Primary School

    Science.gov (United States)

    Baratè, Adriano; Ludovico, Luca Andrea; Mangione, Giuseppina Rita; Rosa, Alessia

    2015-01-01

    In this work we will introduce the concept of "music coding," namely a new discipline that employs basic music activities and simplified languages to teach the computational way of thinking to musically-untrained children who attend the primary school. In this context, music represents both a mean and a goal: in fact, from one side…

  9. Effects of adaptation on neural coding by primary sensory interneurons in the cricket cercal system.

    Science.gov (United States)

    Clague, H; Theunissen, F; Miller, J P

    1997-01-01

    Methods of stochastic systems analysis were applied to examine the effect of adaptation on frequency encoding by two functionally identical primary interneurons of the cricket cercal system. Stimulus reconstructions were obtained from a linear filtering transformation of spike trains elicited in response to bursts of broadband white noise air current stimuli (5-400 Hz). Each linear reconstruction was compared with the actual stimulus in the frequency domain to obtain a measure of waveform coding accuracy as a function of frequency. The term adaptation in this paper refers to the decrease in firing rate of a cell after the onset or increase in power of a white noise stimulus. The increase in firing rate after stimulus offset or decrease in stimulus power is assumed to be a complementary aspect of the same phenomenon. As the spike rate decreased during the course of adaptation, the total amount of information carried about the velocity waveform of the stimulus also decreased. The quality of coding of frequencies between 70 and 400 Hz decreased dramatically. The quality of coding of frequencies between 5 and 70 Hz decreased only slightly or even increased in some cases. The disproportionate loss of information about the higher frequencies could be attributed in part to the more rapid loss of spikes correlated with high-frequency stimulus components than of spikes correlated with low-frequency components. An increase in the responsiveness of a cell to frequencies > 70 Hz was correlated with a decrease in the ability of that cell to encode frequencies in the 5-70 Hz range. This nonlinear property could explain the improvement seen in some cases in the coding accuracy of frequencies between 5 and 70 Hz during the course of adaptation. Waveform coding properties also were characterized for fully adapted neurons at several stimulus intensities. The changes in coding observed through the course of adaptation were similar in nature to those found across stimulus powers

  10. Development of a computer code for dynamic analysis of the primary circuit of advanced reactors

    Energy Technology Data Exchange (ETDEWEB)

    Rocha, Jussie Soares da; Lira, Carlos A.B.O.; Magalhaes, Mardson A. de Sa, E-mail: cabol@ufpe.b [Universidade Federal de Pernambuco (DEN/UFPE), Recife, PE (Brazil). Dept. de Energia Nuclear

    2011-07-01

    Currently, advanced reactors are being developed, seeking for enhanced safety, better performance and low environmental impacts. Reactor designs must follow several steps and numerous tests before a conceptual project could be certified. In this sense, computational tools become indispensable in the preparation of such projects. Thus, this study aimed at the development of a computational tool for thermal-hydraulic analysis by coupling two computer codes to evaluate the influence of transients caused by pressure variations and flow surges in the region of the primary circuit of IRIS reactor between the core and the pressurizer. For the simulation, it was used a situation of 'insurge', characterized by the entry of water in the pressurizer, due to the expansion of the refrigerant in the primary circuit. This expansion was represented by a pressure disturbance in step form, through the block 'step' of SIMULINK, thus enabling the transient startup. The results showed that the dynamic tool, obtained through the coupling of the codes, generated very satisfactory responses within model limitations, preserving the most important phenomena in the process. (author)

  11. Associative learning shapes the neural code for stimulus magnitude in primary auditory cortex.

    Science.gov (United States)

    Polley, Daniel B; Heiser, Marc A; Blake, David T; Schreiner, Christoph E; Merzenich, Michael M

    2004-11-16

    Since the dawn of experimental psychology, researchers have sought an understanding of the fundamental relationship between the amplitude of sensory stimuli and the magnitudes of their perceptual representations. Contemporary theories support the view that magnitude is encoded by a linear increase in firing rate established in the primary afferent pathways. In the present study, we have investigated sound intensity coding in the rat primary auditory cortex (AI) and describe its plasticity by following paired stimulus reinforcement and instrumental conditioning paradigms. In trained animals, population-response strengths in AI became more strongly nonlinear with increasing stimulus intensity. Individual AI responses became selective to more restricted ranges of sound intensities and, as a population, represented a broader range of preferred sound levels. These experiments demonstrate that the representation of stimulus magnitude can be powerfully reshaped by associative learning processes and suggest that the code for sound intensity within AI can be derived from intensity-tuned neurons that change, rather than simply increase, their firing rates in proportion to increases in sound intensity.

  12. Selection of medical diagnostic codes for analysis of electronic patient records. Application to stroke in a primary care database.

    Directory of Open Access Journals (Sweden)

    Martin C Gulliford

    Full Text Available BACKGROUND: Electronic patient records from primary care databases are increasingly used in public health and health services research but methods used to identify cases with disease are not well described. This study aimed to evaluate the relevance of different codes for the identification of acute stroke in a primary care database, and to evaluate trends in the use of different codes over time. METHODS: Data were obtained from the General Practice Research Database from 1997 to 2006. All subjects had a minimum of 24 months of up-to-standard record before the first recorded stroke diagnosis. Initially, we identified stroke cases using a supplemented version of the set of codes for prevalent stroke used by the Office for National Statistics in Key health statistics from general practice 1998 (ONS codes. The ONS codes were then independently reviewed by four raters and a restricted set of 121 codes for 'acute stroke' was identified but the kappa statistic was low at 0.23. RESULTS: Initial extraction of data using the ONS codes gave 48,239 cases of stroke from 1997 to 2006. Application of the restricted set of codes reduced this to 39,424 cases. There were 2,288 cases whose index medical codes were for 'stroke annual review' and 3,112 for 'stroke monitoring'. The frequency of stroke review and monitoring codes as index codes increased from 9 per year in 1997 to 1,612 in 2004, 1,530 in 2005 and 1,424 in 2006. The one year mortality of cases with the restricted set of codes was 29.1% but for 'stroke annual review,' 4.6% and for 'stroke monitoring codes', 5.7%. CONCLUSION: In the analysis of electronic patient records, different medical codes for a single condition may have varying clinical and prognostic significance; utilisation of different medical codes may change over time; researchers with differing clinical or epidemiological experience may have differing interpretations of the relevance of particular codes. There is a need for greater

  13. Origin and chemical coding of primary afferent neurones supplying the prostate of the dog.

    Science.gov (United States)

    Arciszewski, M B; Zacharko, A

    2004-12-01

    Retrograde tracing technique combined with the double-fluorescent immunohistochemistry were used to investigate the distribution and chemical coding of primary afferent neurones supplying the canine prostate. After the injection of Fast Blue (FB) into the prostatic tissue retrogradely-labelled (FB(+)) primary afferent neurones were localized in bilateral L(1)-Ca(1) dorsal root ganglia (DRG). Statistical analysis using anova test showed that there are two major sources of afferent prostate innervation. The vast majority of prostate-supplying primary afferent neurones were located in bilateral L(2)-L(4) DRG (56.9 +/- 0.6%). The second source of the afferent innervation of canine prostate were bilateral S(1)-Ca(1) DRG (40.6 +/- 1.0%). No statistically significant differences were found between average number of FB(+) neurones localized in the left and right DRG (49.5 +/- 1.7 and 50.5 +/- 1.7%, respectively). Immunohistochemistry revealed that FB(+) primary afferent neurones contain several neuropeptides in various combinations. In the prostate-supplying neurones of lumbar and sacro-caudal DRG the immunoreactivity to substance P (SP) and calcitonin gene-related peptide (CGRP) was found most frequently (50 +/- 3.7 and 37.3 +/- 1.9%, respectively). Both in the lumbar and sacro-caudal DRG, considerable population of FB(+) neurones immunoreactive neither to SP nor CGRP were also found (23 +/- 2.6 and 32.8 +/- 2.3%, respectively). In the lumbar DRG 10.7 +/- 1.1% of SP-immunoreactive FB(+) neurones also contained galanin (GAL). In 9.2 +/- 2.2% of the prostate-supplying primary afferent neurones located in the sacro-caudal DRG the co-localization of SP and GAL was also reported. Results of the retrograde tracing experiment demonstrated for the first time sources of afferent innervation of the canine prostate. Double immunohistochemistry revealed that many of the prostate-supplying primary afferent neurones express some of sensory neuropeptides which presumably may be involved

  14. A Spanish version for the new ERA-EDTA coding system for primary renal disease

    Directory of Open Access Journals (Sweden)

    Óscar Zurriaga

    2015-07-01

    Conclusions: Translation and adaptation into Spanish represent an improvement that will help to introduce and use the new coding system for PKD, as it can help reducing the time devoted to coding and also the period of adaptation of health workers to the new codes.

  15. Reusability of coded data in the primary care electronic medical record : A dynamic cohort study concerning cancer diagnoses

    NARCIS (Netherlands)

    Sollie, Annet; Sijmons, Rolf H.; Helsper, Charles W.; Numans, Mattijs E.

    2017-01-01

    Objectives: To assess quality and reusability of coded cancer diagnoses in routine primary care data. To identify factors that influence data quality and areas for improvement. Methods: A dynamic cohort study in a Dutch network database containing 250,000 anonymized electronic medical records (EMRs)

  16. Reusability of coded data in the primary care electronic medical record : A dynamic cohort study concerning cancer diagnoses

    NARCIS (Netherlands)

    Sollie, Annet; Sijmons, Rolf H; Helsper, Charles; Numans, Mattijs E

    2017-01-01

    OBJECTIVES: To assess quality and reusability of coded cancer diagnoses in routine primary care data. To identify factors that influence data quality and areas for improvement. METHODS: A dynamic cohort study in a Dutch network database containing 250,000 anonymized electronic medical records (EMRs)

  17. A coded structured light system based on primary color stripe projection and monochrome imaging.

    Science.gov (United States)

    Barone, Sandro; Paoli, Alessandro; Razionale, Armando Viviano

    2013-10-14

    Coded Structured Light techniques represent one of the most attractive research areas within the field of optical metrology. The coding procedures are typically based on projecting either a single pattern or a temporal sequence of patterns to provide 3D surface data. In this context, multi-slit or stripe colored patterns may be used with the aim of reducing the number of projected images. However, color imaging sensors require the use of calibration procedures to address crosstalk effects between different channels and to reduce the chromatic aberrations. In this paper, a Coded Structured Light system has been developed by integrating a color stripe projector and a monochrome camera. A discrete coding method, which combines spatial and temporal information, is generated by sequentially projecting and acquiring a small set of fringe patterns. The method allows the concurrent measurement of geometrical and chromatic data by exploiting the benefits of using a monochrome camera. The proposed methodology has been validated by measuring nominal primitive geometries and free-form shapes. The experimental results have been compared with those obtained by using a time-multiplexing gray code strategy.

  18. A Coded Structured Light System Based on Primary Color Stripe Projection and Monochrome Imaging

    Directory of Open Access Journals (Sweden)

    Armando Viviano Razionale

    2013-10-01

    Full Text Available Coded Structured Light techniques represent one of the most attractive research areas within the field of optical metrology. The coding procedures are typically based on projecting either a single pattern or a temporal sequence of patterns to provide 3D surface data. In this context, multi-slit or stripe colored patterns may be used with the aim of reducing the number of projected images. However, color imaging sensors require the use of calibration procedures to address crosstalk effects between different channels and to reduce the chromatic aberrations. In this paper, a Coded Structured Light system has been developed by integrating a color stripe projector and a monochrome camera. A discrete coding method, which combines spatial and temporal information, is generated by sequentially projecting and acquiring a small set of fringe patterns. The method allows the concurrent measurement of geometrical and chromatic data by exploiting the benefits of using a monochrome camera. The proposed methodology has been validated by measuring nominal primitive geometries and free-form shapes. The experimental results have been compared with those obtained by using a time-multiplexing gray code strategy.

  19. Long non-coding RNAs may serve as biomarkers in breast cancer combined with primary lung cancer

    Science.gov (United States)

    Mao, Weimin; Chen, Bo; Yang, Shifeng; Ding, Xiaowen; Zou, Dehong; Mo, Wenju; He, Xiangming; Zhang, Xiping

    2017-01-01

    Long non-coding RNAs (lncRNAs) have been shown to play important regulatory role in certain type of cancers biology, including breast and lung cancers. However, the lncRNA expression in breast cancer combined with primary lung cancer remains unknown. In this study, databases of the Cancer Genome Atlas (TCGA) and the lncRNA profiler of contained candidate 192 lncRNAs were utilized. 11 lncRNAs were differentially expressed in breast cancer, 9 candidate lncRNAs were differentially expressed in lung cancer. In order to find the aberrant expression of lncRNAs in breast cancer combined with primary lung cancer, seven samples of primary breast cancer and lung cancer were studied for the expression of selected lncRNAs. The results showed that SNHG6 and NEAT1 were reversely expressed in breast cancer combined with primary lung cancer compared with primary breast or lung cancer. In addition, a significant correlation of lncRNAs was found in the patients whose age was above 56 in breast cancer. What's more, PVT1 expression was negatively correlated with the pathological stage, and the level of ER, PR, HER2, p53 in breast cancer. Furthermore, lncRNA expression did not have significant relationship with the 5-year survival of patients with breast cancer combined with primary lung cancer. The findings revealed that PVT1, SNHG6, NEAT1 may serve as a prognostic marker for breast cancer combined with primary lung cancer. Therefore, these lncRNAs are potential molecular indicators in the diagnosis and prognosis of cancer in the future. PMID:28938549

  20. Development of Calculation Code for Fission Product and Corrosion Product in PWR’s Primary Loop

    Institute of Scientific and Technical Information of China (English)

    XU; Zhi-long; WAN; Hai-xia; SHAO; Jing; WU; Xiao-chun; LI; Long; LIU; Xing-min; KE; Guo-tu

    2015-01-01

    With the basis of study on generation,release and migration of fission product,calculation model for each of the above processes was developed,and calculation method for source term of PWR fission products was established.Study on source term of corrosion product in primary loop was been done.Based on the study of corrosion,

  1. Hammurabi's Code: A primary datum in the conjoined professions of medicine and law.

    Science.gov (United States)

    Pearn, John

    2016-09-01

    The history of our current law dates from Palaeolithic times. The first written laws were codified by the rulers of Mesopotamian kingdoms, from the beginning of the second millennium B.C.E. This history, and those of the medico-legal specialties in particular, trace their origins to Hammurabi's Code. Hammurabi (ruled 1792-1750 B.C.E.) was the sixth King of the First Dynasty of ancient Babylon, today an archaeological site in modern-day Iraq. Hammurabi's Laws (c.1760 B.C.E.), inscribed on at least one diorite stele, were set up in public places in Babylon, towards the end of the King's 43-year reign. Comprising almost 300 specific laws, with judicial punishment for transgressions, Hammurabi's Code reflects his role both as a guardian of the vulnerable and as a protector of the weak and powerless. Just as medical papyri from ancient Egypt (e.g. the Edwin Smith papyrus c.1600 B.C.E.) are regarded as the origins of western medicine, so Hammurabi is the pioneer of "medical" laws as these have evolved to their sophisticated state today. © The Author(s) 2016.

  2. ICECO-CEL: a coupled Eulerian-Lagrangian code for analyzing primary system response in fast reactors

    Energy Technology Data Exchange (ETDEWEB)

    Wang, C.Y.

    1981-02-01

    This report describes a coupled Eulerian-Lagrangian code, ICECO-CEL, for analyzing the response of the primary system during hypothetical core disruptive accidents. The implicit Eulerian method is used to calculate the fluid motion so that large fluid distortion, two-dimensional sliding interface, flow around corners, flow through coolant passageways, and out-flow boundary conditions can be treated. The explicit Lagrangian formulation is employed to compute the response of the containment vessel and other elastic-plastic solids inside the reactor containment. Large displacements, as well as geometrical and material nonlinearities are considered in the analysis. Marker particles are utilized to define the free surface or the material interface and to visualize the fluid motion. The basic equations and numerical techniques used in the Eulerian hydrodynamics and Lagrangian structural dynamics are described. Treatment of the above-core hydrodynamics, sodium spillage, fluid cavitation, free-surface boundary conditions and heat transfer are also presented. Examples are given to illustrate the capabilities of the computer code. Comparisons of the code predictions with available experimental data are also made.

  3. Elastic-plastic analysis of the PVRC burst disk tests with comparison to the ASME code -- Primary stress limits

    Energy Technology Data Exchange (ETDEWEB)

    Jones, D.P.; Holliday, J.E.

    1999-02-01

    This paper provides a comparison between finite element analysis results and test data from the Pressure Vessel Research Council (PVRC) burst disk program. Testing sponsored by the PVRC over 20 years ago was done by pressurizing circular flat disks made from three different materials until failure by bursting. The purpose of this re-analysis is to investigate the use of finite element analysis (FEA) to assess the primary stress limits of the ASME Boiler and Pressure Vessel Code (1998) and to qualify the use of elastic-plastic (EP-FEA) for limit load calculations. The three materials tested represent the range of strength and ductility found in modern pressure vessel construction and include a low strength high ductility material, a medium strength medium ductility material, and a high strength low ductility low alloy material. Results of elastic and EP-FEA are compared to test data. Stresses from the elastic analyses are linearized for comparison of Code primary stress limits to test results. Elastic-plastic analyses are done using both best-estimate and elastic-perfectly plastic (EPP) stress-strain curves. Both large strain-large displacement (LSLD) and small strain-small displacement (SSSD) assumptions are used with the EP-FEA. Analysis results are compared to test results to evaluate the various analysis methods, models, and assumptions as applied to the bursting of thin disks.

  4. Intermittency coding in the primary olfactory system: a neural substrate for olfactory scene analysis.

    Science.gov (United States)

    Park, Il Memming; Bobkov, Yuriy V; Ache, Barry W; Príncipe, José C

    2014-01-15

    The spatial and temporal characteristics of the visual and acoustic sensory input are indispensable attributes for animals to perform scene analysis. In contrast, research in olfaction has focused almost exclusively on how the nervous system analyzes the quality and quantity of the sensory signal and largely ignored the spatiotemporal dimension especially in longer time scales. Yet, detailed analyses of the turbulent, intermittent structure of water- and air-borne odor plumes strongly suggest that spatio-temporal information in longer time scales can provide major cues for olfactory scene analysis for animals. We show that a bursting subset of primary olfactory receptor neurons (bORNs) in lobster has the unexpected capacity to encode the temporal properties of intermittent odor signals. Each bORN is tuned to a specific range of stimulus intervals, and collectively bORNs can instantaneously encode a wide spectrum of intermittencies. Our theory argues for the existence of a novel peripheral mechanism for encoding the temporal pattern of odor that potentially serves as a neural substrate for olfactory scene analysis.

  5. Code-Switching in the Primary Classroom: One Response to the Planned and the Unplanned Language Environment in Brunei [and] A Response.

    Science.gov (United States)

    Martin, Peter W.; Espiritu, Clemencia C

    1996-01-01

    Examines how the teacher incorporates elements of both "Bahasa Melayu" and Brunei Malay into content lessons and views code switching in the primary classroom within the wider framework of community language norms and the linguistic pressures on students and teachers. Espiritu shares Martin's concern regarding the quantity and quality of…

  6. Code-Switching in the Primary Classroom: One Response to the Planned and the Unplanned Language Environment in Brunei [and] A Response.

    Science.gov (United States)

    Martin, Peter W.; Espiritu, Clemencia C

    1996-01-01

    Examines how the teacher incorporates elements of both "Bahasa Melayu" and Brunei Malay into content lessons and views code switching in the primary classroom within the wider framework of community language norms and the linguistic pressures on students and teachers. Espiritu shares Martin's concern regarding the quantity and quality of…

  7. Positive predictive values of ICD-10 codes to identify incident acute pancreatitis and incident primary malignancy in the Scandinavian national patient registries among women with postmenopausal osteoporosis.

    Science.gov (United States)

    Munch, Troels; Christensen, Lotte B; Adelborg, Kasper; Tell, Grethe S; Apalset, Ellen M; Westerlund, Anna; Lagerros, Ylva T; Kahlert, Johnny; Xue, Fei; Ehrenstein, Vera

    2017-01-01

    Validation of definitions used to identify conditions of interest is imperative to epidemiologic studies based on routinely collected data. The objective of the study was thus to estimate positive predictive values (PPVs) of International Classification of Diseases, 10th Revision (ICD-10) codes to identify cases of incident acute pancreatitis leading to hospitalization and incident primary malignancy in the Scandinavian (Denmark, Norway, and Sweden) national patient registries in women with postmenopausal osteoporosis (PMO). This validation study included postmenopausal (defined as 55 years or older) women with osteoporosis, identified between 2005-2014. Potential cases were sampled based on ICD-10 codes from the three national patient registries. Cases were adjudicated by physicians, using medical record review as gold standard. PPVs with corresponding 95% CIs were computed. Medical records of 286 of 325 (retrieval rate 88%) women with PMO were available for adjudication. Acute pancreatitis leading to hospitalization had a PPV of 87.6% (95% CI: 80.8%-90.2%). Incident primary malignancy had a PPV of 88.1% (95% CI: 81.3%-92.7%). The PPVs did not vary substantially across the three countries. ICD-10 codes to identify acute pancreatitis leading to hospitalization, and incident primary malignancy in the Scandinavian national patient registries had high PPVs among women with PMO. This allows identification of cases of acute pancreatitis and incident primary malignancy with reasonable validity and to use these as outcomes in comparative analyses.

  8. A Study on the Application of CRUDTRAN Code in Primary Systems of Domestic Pressurized Heavy-Water Reactors for Prediction of Radiation Source Term

    Directory of Open Access Journals (Sweden)

    Jong Soon Song

    2017-04-01

    Full Text Available The importance of developing a source-term assessment technology has been emphasized owing to the decommissioning of Kori nuclear power plant (NPP Unit 1 and the increase of deteriorated NPPs. We analyzed the behavioral mechanism of corrosion products in the primary system of a pressurized heavy-water reactor-type NPP. In addition, to check the possibility of applying the CRUDTRAN code to a Canadian Deuterium Uranium Reactor (CANDU-type NPP, the type was assessed using collected domestic onsite data. With the assessment results, it was possible to predict trends according to operating cycles. Values estimated using the code were similar to the measured values. The results of this study are expected to be used to manage the radiation exposures of operators in high-radiation areas and to predict decommissioning processes in the primary system.

  9. A study on the application of CRUDTRAN code in primary systems of domestic pressurized heavy-water reactors for prediction of radiation source term

    Energy Technology Data Exchange (ETDEWEB)

    Song, Jong Soon; Cho, Hoon Jo; Jung, Min Young; Lee, Sang Heon [Dept. of Nuclear Engineering, Chosun University, Gwangju (Korea, Republic of)

    2017-04-15

    The importance of developing a source-term assessment technology has been emphasized owing to the decommissioning of Kori nuclear power plant (NPP) Unit 1 and the increase of deteriorated NPPs. We analyzed the behavioral mechanism of corrosion products in the primary system of a pressurized heavy-water reactor-type NPP. In addition, to check the possibility of applying the CRUDTRAN code to a Canadian Deuterium Uranium Reactor (CANDU)-type NPP, the type was assessed using collected domestic onsite data. With the assessment results, it was possible to predict trends according to operating cycles. Values estimated using the code were similar to the measured values. The results of this study are expected to be used to manage the radiation exposures of operators in high-radiation areas and to predict decommissioning processes in the primary system.

  10. Single nucleotide polymorphisms with cis-regulatory effects on long non-coding transcripts in human primary monocytes.

    Directory of Open Access Journals (Sweden)

    Jonas Carlsson Almlöf

    Full Text Available We applied genome-wide allele-specific expression analysis of monocytes from 188 samples. Monocytes were purified from white blood cells of healthy blood donors to detect cis-acting genetic variation that regulates the expression of long non-coding RNAs. We analysed 8929 regions harboring genes for potential long non-coding RNA that were retrieved from data from the ENCODE project. Of these regions, 60% were annotated as intergenic, which implies that they do not overlap with protein-coding genes. Focusing on the intergenic regions, and using stringent analysis of the allele-specific expression data, we detected robust cis-regulatory SNPs in 258 out of 489 informative intergenic regions included in the analysis. The cis-regulatory SNPs that were significantly associated with allele-specific expression of long non-coding RNAs were enriched to enhancer regions marked for active or bivalent, poised chromatin by histone modifications. Out of the lncRNA regions regulated by cis-acting regulatory SNPs, 20% (n = 52 were co-regulated with the closest protein coding gene. We compared the identified cis-regulatory SNPs with those in the catalog of SNPs identified by genome-wide association studies of human diseases and traits. This comparison identified 32 SNPs in loci from genome-wide association studies that displayed a strong association signal with allele-specific expression of non-coding RNAs in monocytes, with p-values ranging from 6.7×10(-7 to 9.5×10(-89. The identified cis-regulatory SNPs are associated with diseases of the immune system, like multiple sclerosis and rheumatoid arthritis.

  11. International Classification of Primary Care-2 coding of primary care data at the general out-patients' clinic of General Hospital, Lagos, Nigeria

    NARCIS (Netherlands)

    Olagundoye, O.A.; Boven, C. van; Weel, C. van

    2016-01-01

    BACKGROUND: Primary care serves as an integral part of the health systems of nations especially the African continent. It is the portal of entry for nearly all patients into the health care system. Paucity of accurate data for health statistics remains a challenge in the most parts of Africa because

  12. Three types of ambiguity in coding empathic interactions in primary care visits: implications for research and practice.

    Science.gov (United States)

    Stone, Ashley L; Tai-Seale, Ming; Stults, Cheryl D; Luiz, Jamie M; Frankel, Richard M

    2012-10-01

    To describe three methodological challenges experienced in studying patients' expressions of emotion in a sample of periodic health exams, and the research and practice implications of these challenges. Qualitative analysis of empathic cues in audio-taped and transcribed periodic health examinations of adult patients (n=322) in an integrated delivery system. The empathic and potential empathic opportunities methodology was used. Identifying emotional cues that constitute "empathic opportunities" is a complex task. Three types of ambiguity made this task particularly challenging: 1) presentations of emotional cues can be "fuzzy" and varied; 2) expressions of illness can be emotionally laden in the absence of explicit "emotion words"; and 3) empathic opportunities vary in length and intensity. Interactional ambiguities pose a challenge to researchers attempting to document emotional cues with a binary coding scheme that indicates only whether an empathic opportunity is present or absent. Additional efforts to refine the methodological approach for studying empathy in medical interactions are needed. The challenges discussed likely represent the same types of situations physicians find themselves in when talking with patients. Highlighting these ambiguities may aid physicians in better recognizing and meeting the emotional needs of their patients. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

  13. Application of the Severe Accident Code ATHLET-CD. Coolant injection to primary circuit of a PWR by mobile pump system in case of SBLOCA severe accident scenario

    Energy Technology Data Exchange (ETDEWEB)

    Jobst, Matthias; Wilhelm, Polina; Kliem, Soeren; Kozmenkov, Yaroslav [Helmholtz-Zentrum Dresden-Rossendorf e.V., Dresden (Germany). Reactor Safety

    2017-06-01

    The improvement of the safety of nuclear power plants is a continuously on-going process. The analysis of transients and accidents is an important research topic, which significantly contributes to safety enhancements of existing power plants. In case of an accident with multiple failures of safety systems, core uncovery and heat-up can occur. In order to prevent the accident to turn into a severe one or to mitigate the consequences of severe accidents, different accident management measures can be applied. By means of numerical analyses performed with the compute code ATHLET-CD, the effectiveness of coolant injection with a mobile pump system into the primary circuit of a PWR was studied. According to the analyses, such a system can stop the melt progression if it is activated prior to 10 % of total core is molten.

  14. Long non-coding RNA HOTAIR is an independent prognostic marker of metastasis in estrogen receptor-positive primary breast cancer

    DEFF Research Database (Denmark)

    Sørensen, Kristina P; Thomassen, Mads; Tan, Qihua

    2013-01-01

    -negative tumor samples, we are not able to detect a prognostic value of HOTAIR expression, probably due to the limited sample size. These results are successfully validated in an independent dataset with similar associations (P = 0.018, HR 1.825). In conclusion, our findings suggest that HOTAIR expression may......Expression of HOX transcript antisense intergenic RNA (HOTAIR)-a long non-coding RNA-has been examined in a variety of human cancers, and overexpression of HOTAIR is correlated with poor survival among breast, colon, and liver cancer patients. In this retrospective study, we examine HOTAIR...... that high HOTAIR expression in primary tumors is significantly associated with worse prognosis independent of prognostic markers (P = 0.012, hazard ratio (HR) 1.747). This association is even stronger when looking only at estrogen receptor (ER)-positive tumor samples (P = 0.0086, HR 1.985). In ER...

  15. Isolation of cDNA clones coding for human tissue factor: primary structure of the protein and cDNA

    Energy Technology Data Exchange (ETDEWEB)

    Spicer, E.K.; Horton, R.; Bloem, L.; Bach, R.; Williams, K.R.; Guha, A.; Kraus, J.; Lin, T.C.; Nemerson, Y.; Konigsberg, W.H.

    1987-08-01

    Tissue factor is a membrane-bound procoagulant protein that activates the extrinsic pathway of blood coagulation in the presence of factor VII and calcium. lambda Phage containing the tissue factor gene were isolated from a human placental cDNA library. The amino acid sequence deduced from the nucleotide sequence of the cDNAs indicates that tissue factor is synthesized as a higher molecular weight precursor with a leader sequence of 32 amino acids, while the mature protein is a single polypeptide chain composed of 263 residues. The derived primary structure of tissue factor has been confirmed by comparison to protein and peptide sequence data. The sequence of the mature protein suggests that there are three distinct domains: extracellular, residues 1-219; hydrophobic, residues 220-242; and cytoplasmic, residues 243-263. Three potential N-linked carbohydrate attachment sites occur in the extracellular domain. The amino acid sequence of tissue factor shows no significant homology with the vitamin K-dependent serine proteases, coagulation cofactors, or any other protein in the National Biomedical Research Foundation sequence data bank (Washington, DC).

  16. Detection of long non-coding RNA in archival tissue: correlation with polycomb protein expression in primary and metastatic breast carcinoma.

    Directory of Open Access Journals (Sweden)

    Karen M Chisholm

    Full Text Available A major function of long non-coding RNAs (lncRNAs is regulating gene expression through changes in chromatin state. Experimental evidence suggests that in cancer, they can influence Polycomb Repressive Complexes (PRC to retarget to an occupancy pattern resembling that of the embryonic state. We have previously demonstrated that the expression level of lncRNA in the HOX locus, including HOTAIR, is a predictor of breast cancer metastasis. In this current project, RNA in situ hybridization of probes to three different lncRNAs (HOTAIR, ncHoxA1, and ncHoxD4, as well a immunohistochemical staining of EZH2, is undertaken in formalin-fixed paraffin-embedded breast cancer tissues in a high throughput tissue microarray format to correlate expression with clinicopathologic features. Though overall EZH2 and HOTAIR expression levels were highly correlated, the subset of cases with strong HOTAIR expression correlated with ER and PR positivity, while the subset of cases with strong EZH2 expression correlated with an increased proliferation rate, ER and PR negativity, HER2 underexpression, and triple negativity. Co-expression of HOTAIR and EZH2 trended with a worse outcome. In matched primary and metastatic cancers, both HOTAIR and EZH2 had increased expression in the metastatic carcinomas. This is the first study to show that RNA in situ hybridization of formalin fixed paraffin-embedded clinical material can be used to measure levels of long non-coding RNAs. This approach offers a method to make observations on lncRNAs that may influence the cancer epigenome in a tissue-based technique.

  17. Tokamak Systems Code

    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.

  18. Nested Quantum Error Correction Codes

    CERN Document Server

    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.

  19. Coding Partitions

    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.

  20. Obtaining of primary rays of spectrum X codes Penelope and MCNP5; Obtencion del espectro primario de Rayos X con los codigos Penelope y MCNP5

    Energy Technology Data Exchange (ETDEWEB)

    Pozuelo, F.; Querol, A.; Gallardo, S.; Rodenas, J.; Verdu, G.

    2012-07-01

    In this case, used codes PENELOPE MCNP5, based on the Monte Carlo method for x-ray spectrum taking into account the characteristics of the x-ray tube. In order to achieve a greater fit of simulated by the theoretical spectrum. It carried out a sensitivity analysis of the parameters available in both codes. The obtaining of the simulated spectrum could lead to an improvement in quality control of the x-ray tube to incorporate it as a method complementary to techniques.

  1. IM3D: A parallel Monte Carlo code for efficient simulations of primary radiation displacements and damage in 3D geometry

    National Research Council Canada - National Science Library

    Li, Yong Gang; Yang, Yang; Short, Michael P; Ding, Ze Jun; Zeng, Zhi; Li, Ju

    2015-01-01

    ... and > 10(4) times faster using parallel computation. For 3D problems, it provides a fast approach for analyzing the spatial distributions of primary displacements and defect generation under ion irradiation...

  2. Holographic codes

    CERN Document Server

    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.

  3. Sharing code

    OpenAIRE

    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.

  4. Primary structure and promoter analysis of leghemoglobin genes of the stem-nodulated tropical legume Sesbania rostrata: conserved coding sequences, cis-elements and trans-acting factors

    DEFF Research Database (Denmark)

    Metz, B A; Welters, P; Hoffmann, H J;

    1988-01-01

    The primary structure of a leghemoglobin (lb) gene from the stem-nodulated, tropical legume Sesbania rostrata and two lb gene promoter regions was analysed. The S. rostrata lb gene structure and Lb amino acid composition were found to be highly conserved with previously described lb genes and Lb...

  5. Speaking Code

    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...

  6. Polar Codes

    Science.gov (United States)

    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

  7. Report number codes

    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.

  8. Orthogonal coding of object location.

    Science.gov (United States)

    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.

  9. 27. The impact of introduction of code-stemi program on clinical outcomes of acute st-elevation myocardial infarction (stemi patients undergoing primary pci: Single center study in Saudi Arabia

    Directory of Open Access Journals (Sweden)

    A. ALYAHYA

    2016-07-01

    Full Text Available This study was conducted to evaluate the effect of direct Emergency Department activation of the Catheterization Lab on door to balloon (D2B time and outcomes of acute ST-elevation myocardial infarction (STEMI patients in King Khalid University Hospital (KKUH. Establishing dedicated comprehensive STEMI programs aiming at reducing door to balloon time will impact favourably the outcomes of patients presenting with acute STEMI. This was a retrospective cohort study that involved 100 patients in KKUH who presented with acute STEMI and underwent primary percutaneous intervention (PPCI, between June 2010 and January 2015. The cohort was divided into two groups, the first group consisted of 50 patients who were treated before establishing the Code-STEMI protocol, whereas the second group were 50 patients who were treated according to the protocol, which was implemented in June 2013. Code-STEMI program is a comprehensive program that includes direct activation of the cath lab team using a single call system, data monitoring and feedback, and standardized order forms. The mean age in both groups was 54 ± 12 years and 86% (43 and 94% (47 of the patients in the two groups were males, respectively. 90% (90 of patients in both groups had one or more comorbidities.Code-STEMI group had a significantly lower D2BT with 70% of patients treated within the recommended 90 minutes (median = 76.5 min, IQR: 63–90 min compared to only 26% of pre code-STEMI patients (median = 107 min, IQR: 74–149 min In-hospital complications were lower in the Code-STEMI group; however, the only statistically significant reduction was in non-fatal re-infarction, (8% vs. 0%, p = 0.043. In addition, the number of patients with more than one in-hospital complications was also reduced by 20%.Implementation of direct ER-Catheterization lab activation protocol was associated with a significant reduction in D2B time, and an overall improvement of in-hospital outcomes.

  10. Speech coding

    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

  11. Flow regimes and heat transfer modes identification in ANGRA 2 core, during small break in the primary loop with area of 100 cm{sup 2}, simulated with RELAP5 code

    Energy Technology Data Exchange (ETDEWEB)

    Borges, Eduardo M.; Sabundjian, Gaiane, E-mail: gdgian@ipen.br, E-mail: borges.em@hotmail.com [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

    2015-07-01

    Identifying the flow regimes and the heat transfer modes is important for the analysis of accidents such as the Loss-of-Coolant Accident (LOCA). The aim of this paper is to identify the flow regimes, the heat transfer modes, and the correlations used in the RELAP5/MOD3.2.gama code in ANGRA 2 during the Small-Break Loss-of-Coolant Accident (SBLOCA) with a 100cm{sup 2}-rupture area in the cold leg of primary loop. The Chapter 15 of the Final Safety Analysis Report of ANGRA 2 (FSAR - A2) reports this specific kind of accident. The results from this work demonstrated the several flow regimes and heat transfer modes that can be present in the core of ANGRA 2 during the postulated accident. (author)

  12. Performance of the primary containment of a BWR during a severe accident whit the code RELAP/SCDAPSIM; Comportamiento del contenedor primario de un reactor BWR durante un accidente severo con el codigo RELAP/SCDAPSIM

    Energy Technology Data Exchange (ETDEWEB)

    Castillo G, F.

    2015-07-01

    In this thesis work, it was developed a model of the vacuum breaker valves and down comers for a BWR Mark II primary containment for the code RELAP/SCDAPSIM Mod. 3.4. This code was used to simulate a Station Blackout (Sbo) that evolves to a severe accident scenario. To accomplish this task, the vacuum breaker valves and down comers were included in a simplified model of the primary containment that includes both wet well and dry well, which was coupled with a model of the Nuclear Steam Supply System (NSSS), in order to study the behavior of the primary containment during the evolution of the accident scenario. In the analysis of the results of the simulation, the behavior of the wet well and dry well during the event was particularly monitored, by analyzing the evolution of temperature and pressure profiles in such volumes, this to determine the impact of the inclusion of the breaker vacuum valves and down comers. The results show that the effect of this extension of the model is that more conservative results are obtained, i.e., higher pressures are reached in both wet well and dry well than when it is used a containment model that does not include neither the vacuum valves nor the down comers. The most relevant results obtained show that the Rcic alone is able to keep the core fully covered, but even in such a case, it evaporates about 15% of the initial inventory of liquid water in the Pressure Suppression Pool (Psp). When the Rcic operation is lost, 20% more of the liquid water inventory in the Psp is further reduced within four to twelve hours (approximately), time at which the simulation crashed. Besides, there is a significant increase of pressure in the containment. As the accident evolves, the pressure in the containment continues increasing, but there is still considerable margin to reach the design pressure of the containment. At the end of the simulation, the results show a gauge pressure value of 224,550 Pa in the Psp and 187,482 Pa in the wet well

  13. Speaking Code

    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....

  14. The Aster code; Code Aster

    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.)

  15. 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....

  16. Coded Path Protection: Efficient Conversion of Sharing to Coding

    CERN Document Server

    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...

  17. AP1000主回路系统热工水力瞬态计算程序RETAC的开发%Development of Thermal-Hydraulic Transient Analysis Code RETAC for AP1000 Primary Loop

    Institute of Scientific and Technical Information of China (English)

    王伟伟; 苏光辉; 田文喜; 秋穗正

    2011-01-01

    A thermal-hydraulic microcomputer code (RETAC, Reactor Transient Analysis Code) for transient analysis of AP1000 primary loop was developed using FORTRAN language. The loss of flow accident (LOFA) was analyzed using RET AC. Transient characteristics of some main system parameters were obtained, including the maximum fuel temperature and MDNBR in the hot channel, pressure and water level in the pressurizer and steam generator secondary side. The results show that at the early stage of the loss of flow accident, the highest fuel central temperature and MDNBR in the hot channel do not exceed specified limits and meet the safety criteria. Modular programming technique was adopted for RET AC and it is convenient for further modification andapplication. It is expected that the present work is instructive to develop Chinese ownindependent software for the design and safety analysis of large scale PWR.%针对先进压水堆AP1000的具体结构和运行特点,采用FORTRAN程序设计语言,自主开发了用于AP1000主回路系统热工水力瞬态计算的微机型程序RETAC(REactor Transient Analysis Code).利用程序对AP1000失流事故进行分析,得到了堆芯燃料中心最高温度、最小偏离泡核沸腾比(MDN-BR)、稳压器压力、水位及蒸汽发生器二次侧压力、水位等主要系统参数的瞬态特性.分析结果表明,在失流事故初期阶段,堆芯热通道燃料中心最高温度和MDNBR不超出规定限值,满足安全准则要求.RETAC完全采用模块化编程,便于移植和二次开发,可为后续开发自主知识产权的大功率压水堆安全分析程序提供借鉴.

  18. 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.

  19. 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...

  20. Good Codes From Generalised Algebraic Geometry Codes

    CERN Document Server

    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.

  1. Space Time Codes from Permutation Codes

    CERN Document Server

    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.

  2. Fundamentals of convolutional coding

    CERN Document Server

    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

  3. 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.

  4. Joint source channel coding using arithmetic codes

    CERN Document Server

    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

  5. Model Children's Code.

    Science.gov (United States)

    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…

  6. Rateless feedback codes

    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....

  7. Coding for dummies

    CERN Document Server

    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

  8. Advanced video coding systems

    CERN Document Server

    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

  9. Homogenous Chaotic Network Serving as a Rate/Population Code to Temporal Code Converter

    Directory of Open Access Journals (Sweden)

    Mikhail V. Kiselev

    2014-01-01

    Full Text Available At present, it is obvious that different sections of nervous system utilize different methods for information coding. Primary afferent signals in most cases are represented in form of spike trains using a combination of rate coding and population coding while there are clear evidences that temporal coding is used in various regions of cortex. In the present paper, it is shown that conversion between these two coding schemes can be performed under certain conditions by a homogenous chaotic neural network. Interestingly, this effect can be achieved without network training and synaptic plasticity.

  10. On the role of code comparisons in verification and validation.

    Energy Technology Data Exchange (ETDEWEB)

    Oberkampf, William Louis; Trucano, Timothy Guy; Pilch, Martin M.

    2003-08-01

    This report presents a perspective on the role of code comparison activities in verification and validation. We formally define the act of code comparison as the Code Comparison Principle (CCP) and investigate its application in both verification and validation. One of our primary conclusions is that the use of code comparisons for validation is improper and dangerous. We also conclude that while code comparisons may be argued to provide a beneficial component in code verification activities, there are higher quality code verification tasks that should take precedence. Finally, we provide a process for application of the CCP that we believe is minimal for achieving benefit in verification processes.

  11. 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....

  12. 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....

  13. QR Codes 101

    Science.gov (United States)

    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…

  14. Constructing quantum codes

    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.

  15. ¿Es factible que los médicos de primaria utilicen CIE-9-MC?: Calidad de la codificación de diagnósticos en las historias clínicas informatizadas Can primary care physicians use the ICD-9-MC?: An evaluation of the quality of diagnosis coding in computerized medical records

    Directory of Open Access Journals (Sweden)

    Juan F. Orueta

    2006-06-01

    Full Text Available Objetivos: Determinar el grado de exhaustividad y precisión de los códigos CIE-9-MC asignados por los médicos de primaria en sus historias clínicas informatizadas; evaluar el impacto de actividades para su mejora. Métodos: Los códigos de 87.806 pacientes de 56 médicos de Osakidetza/Servicio Vasco de Salud fueron evaluados en 3 ocasiones en 1 año, según los siguientes criterios: correspondencia con un código CIE-9-MC válido; concordancia entre diagnóstico y código; porcentaje de consultas sin diagnóstico. Finalmente, se contrastaron, con un registro previo de morbilidad atendida, los promedios de diagnósticos únicos y tasas anuales de enfermedades de los 84.136 pacientes que permanecieron con el mismo médico al menos 6 meses. Se realizaron 2 intervenciones para mejorar la codificación: corrección central de errores detectados; asesoramiento e información a los médicos de sus resultados individuales. Resultados: En la primera evaluación, el 59% de los diagnósticos no contenía ningún código CIE-9-MC asociado, mientras que a la finalización este porcentaje descendió al 2%. El porcentaje de errores (discrepancia entre diagnóstico del episodio y código CIE9-MC disminuyó del 17 al 3%. El promedio anual de diagnósticos por paciente fue ligeramente menor que en el archivo de referencia (2,26 frente a 2,43, así como las tasas de diversos grupos de enfermedades. Conclusiones: Es factible que los médicos de atención primaria alcancen un alto grado de calidad en la clasificación de diagnósticos mediante CIE-9-MC. La implantación de medidas de evaluación, corrección de errores e información a los clínicos permitió mejorar notablemente los resultados iniciales.Objectives: To determine the completeness and accuracy of ICD-9-CM codes allocated by primary health care physicians in their computerized medical records and evaluate the effects of improvement procedures. Methods: The codes of 87,806 patients assigned to 56

  16. 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...

  17. Hybrid Noncoherent Network Coding

    CERN Document Server

    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...

  18. Network coding for computing: Linear codes

    CERN Document Server

    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,...

  19. Practices in Code Discoverability

    CERN Document Server

    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 ...

  20. Coding for optical channels

    CERN Document Server

    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.

  1. The Bricklayer Ecosystem - Art, Math, and Code

    OpenAIRE

    2016-01-01

    This paper describes the Bricklayer Ecosystem - a freely-available online educational ecosystem created for people of all ages and coding backgrounds. Bricklayer is designed in accordance with a "low-threshold infinite ceiling" philosophy and has been successfully used to teach coding to primary school students, middle school students, university freshmen, and in-service secondary math teachers. Bricklayer programs are written in the functional programming language SML and, when executed, cre...

  2. Enhancing QR Code Security

    OpenAIRE

    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...

  3. Refactoring test code

    NARCIS (Netherlands)

    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

  4. Informal Control code logic

    CERN Document Server

    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.

  5. Gauge color codes

    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...

  6. Refactoring test code

    NARCIS (Netherlands)

    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

  7. ARC Code TI: CODE Software Framework

    Data.gov (United States)

    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...

  8. ARC Code TI: ROC Curve Code Augmentation

    Data.gov (United States)

    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...

  9. 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.

  10. Universal Rateless Codes From Coupled LT Codes

    CERN Document Server

    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...

  11. Software Certification - Coding, Code, and Coders

    Science.gov (United States)

    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.

  12. Coding for Electronic Mail

    Science.gov (United States)

    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.

  13. Noisy Network Coding

    CERN Document Server

    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...

  14. 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.

  15. Chinese remainder codes

    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.

  16. Chinese Remainder 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.

  17. Code of Ethics

    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...

  18. Defeating the coding monsters.

    Science.gov (United States)

    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.

  19. 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.

  20. Serially Concatenated IRA Codes

    CERN Document Server

    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.

  1. Finding the key to a better code: code team restructure to improve performance and outcomes.

    Science.gov (United States)

    Prince, Cynthia R; Hines, Elizabeth J; Chyou, Po-Huang; Heegeman, David J

    2014-09-01

    Code teams respond to acute life threatening changes in a patient's status 24 hours a day, 7 days a week. If any variable, whether a medical skill or non-medical quality, is lacking, the effectiveness of a code team's resuscitation could be hindered. To improve the overall performance of our hospital's code team, we implemented an evidence-based quality improvement restructuring plan. The code team restructure, which occurred over a 3-month period, included a defined number of code team participants, clear identification of team members and their primary responsibilities and position relative to the patient, and initiation of team training events and surprise mock codes (simulations). Team member assessments of the restructured code team and its performance were collected through self-administered electronic questionnaires. Time-to-defibrillation, defined as the time the code was called until the start of defibrillation, was measured for each code using actual time recordings from code summary sheets. Significant improvements in team member confidence in the skills specific to their role and clarity in their role's position were identified. Smaller improvements were seen in team leadership and reduction in the amount of extra talking and noise during a code. The average time-to-defibrillation during real codes decreased each year since the code team restructure. This type of code team restructure resulted in improvements in several areas that impact the functioning of the team, as well as decreased the average time-to-defibrillation, making it beneficial to many, including the team members, medical institution, and patients. © 2014 Marshfield Clinic.

  2. Rewriting the Genetic Code.

    Science.gov (United States)

    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.

  3. On Polynomial Remainder Codes

    CERN Document Server

    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.

  4. Generating code adapted for interlinking legacy scalar code and extended vector code

    Science.gov (United States)

    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.

  5. The aeroelastic code FLEXLAST

    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)

  6. Opening up codings?

    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....

  7. Industrial Computer Codes

    Science.gov (United States)

    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.

  8. ARC Code TI: ACCEPT

    Data.gov (United States)

    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...

  9. QR codes for dummies

    CERN Document Server

    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

  10. MORSE Monte Carlo code

    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.

  11. [Primary lipodystrophies].

    Science.gov (United States)

    Capeau, J; Magré, J; Lascols, O; Caron, M; Béréziat, V; Vigouroux, C

    2007-02-01

    Primary lipodystrophies represent a heterogeneous group of very rare diseases with a prevalence of less than 1 case for 100.000, inherited or acquired, caracterized by a loss of body fat either generalized or localized (lipoatrophy). In some forms, lipoatrophy is associated with a selective hypertrophy of other fat depots. Clinical signs of insulin resistance are often present: acanthosis nigricans, signs of hyperandrogenism. All lipodystrophies are associated with dysmetabolic alterations with insulin resistance, altered glucose tolerance or diabetes and hypertriglyceridemia leading to a risk of acute pancreatitis. Chronic complications are those resulting from diabetes involving the retina, kidney and nerves, cardiovascular complications and steatotic liver lesions that could result in cirrhosis. Genetic forms of generalized lipodystrophy (or Berardinelli-Seip syndrome) result, in most cases, from recessive mutations in one of two genes: either BSCL2 coding seipin or BSCL1 coding AGPAT2, an acyl-transferase involved in triglyceride synthesis. Acquired generalized lipodystrophy (Lawrence syndrome) is of unknown origin but is sometimes associated with signs of autoimmunity. Partial lipodystrophies can be familial with dominant transmission. Heterozygous mutations have been identified in the LMNA gene encoding nuclear lamin A/C belonging to the nuclear lamina, or in PPARG encoding the adipogenic transcription factor PPARgamma. Some less typical lipodystrophies, associated with signs of premature aging, have been linked to mutations in LMNA or in the ZMPSTE24 gene encoding the protease responsible for the maturation of prelamin A into lamin A. Acquired partial lipodystrophy (Barraquer-Simons syndrome) is characterized by cephalothoracic fat loss. Its aetiology is unknown but mutations in LMNB2, encoding the lamina protein lamin B2, could represent susceptibility factors. Highly active antiretroviral treatments for HIV infection are currently the most frequent cause

  12. Variation in clinical coding lists in UK general practice: a barrier to consistent data entry?

    Directory of Open Access Journals (Sweden)

    Tracy Waize

    2007-09-01

    Conclusions Current systems for clinical coding promote diversity rather than consistency of clinical coding. As the UK moves towards an integrated health IT system consistency of coding will become more important. A standardised, limited list of codes for primary care might help address this need.

  13. Research on universal combinatorial coding.

    Science.gov (United States)

    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.

  14. Safety Code A12

    CERN Multimedia

    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

  15. Dress Codes for Teachers?

    Science.gov (United States)

    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…

  16. Nuremberg code turns 60

    OpenAIRE

    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.

  17. Pseudonoise code tracking loop

    Science.gov (United States)

    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.

  18. Scrum Code Camps

    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...

  19. Scrum Code Camps

    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...

  20. READING A NEURAL CODE

    NARCIS (Netherlands)

    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

  1. The materiality of Code

    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...

  2. Interface requirements for coupling a containment code to a reactor system thermal hydraulic codes

    Energy Technology Data Exchange (ETDEWEB)

    Baratta, A.J.

    1997-07-01

    To perform a complete analysis of a reactor transient, not only the primary system response but the containment response must also be accounted for. Such transients and accidents as a loss of coolant accident in both pressurized water and boiling water reactors and inadvertent operation of safety relief valves all challenge the containment and may influence flows because of containment feedback. More recently, the advanced reactor designs put forth by General Electric and Westinghouse in the US and by Framatome and Seimens in Europe rely on the containment to act as the ultimate heat sink. Techniques used by analysts and engineers to analyze the interaction of the containment and the primary system were usually iterative in nature. Codes such as RELAP or RETRAN were used to analyze the primary system response and CONTAIN or CONTEMPT the containment response. The analysis was performed by first running the system code and representing the containment as a fixed pressure boundary condition. The flows were usually from the primary system to the containment initially and generally under choked conditions. Once the mass flows and timing are determined from the system codes, these conditions were input into the containment code. The resulting pressures and temperatures were then calculated and the containment performance analyzed. The disadvantage of this approach becomes evident when one performs an analysis of a rapid depressurization or a long term accident sequence in which feedback from the containment can occur. For example, in a BWR main steam line break transient, the containment heats up and becomes a source of energy for the primary system. Recent advances in programming and computer technology are available to provide an alternative approach. The author and other researchers have developed linkage codes capable of transferring data between codes at each time step allowing discrete codes to be coupled together.

  3. Certifying Auto-Generated Flight Code

    Science.gov (United States)

    Denney, Ewen

    2008-01-01

    Model-based design and automated code generation are being used increasingly at NASA. Many NASA projects now use MathWorks Simulink and Real-Time Workshop for at least some of their modeling and code development. However, there are substantial obstacles to more widespread adoption of code generators in safety-critical domains. Since code generators are typically not qualified, there is no guarantee that their output is correct, and consequently the generated code still needs to be fully tested and certified. Moreover, the regeneration of code can require complete recertification, which offsets many of the advantages of using a generator. Indeed, manual review of autocode can be more challenging than for hand-written code. Since the direct V&V of code generators is too laborious and complicated due to their complex (and often proprietary) nature, we have developed a generator plug-in to support the certification of the auto-generated code. Specifically, the AutoCert tool supports certification by formally verifying that the generated code is free of different safety violations, by constructing an independently verifiable certificate, and by explaining its analysis in a textual form suitable for code reviews. The generated documentation also contains substantial tracing information, allowing users to trace between model, code, documentation, and V&V artifacts. This enables missions to obtain assurance about the safety and reliability of the code without excessive manual V&V effort and, as a consequence, eases the acceptance of code generators in safety-critical contexts. The generation of explicit certificates and textual reports is particularly well-suited to supporting independent V&V. The primary contribution of this approach is the combination of human-friendly documentation with formal analysis. The key technical idea is to exploit the idiomatic nature of auto-generated code in order to automatically infer logical annotations. The annotation inference algorithm

  4. 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....

  5. The SIFT Code Specification

    Science.gov (United States)

    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.

  6. The Aesthetics of Coding

    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...

  7. Combustion chamber analysis code

    Science.gov (United States)

    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.

  8. Astrophysics Source Code Library

    CERN Document Server

    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.

  9. Code domains in tandem repetitive DNA sequence structures.

    Science.gov (United States)

    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.

  10. Determining the appropriate code in a South African business ...

    African Journals Online (AJOL)

    Determining the appropriate code in a South African business environment. ... that the use of clients' primary languages is a function of advisors' multilingual skills. ... As researchers, we are of the opinion that these results could impact on ...

  11. Embedded foveation image coding.

    Science.gov (United States)

    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.

  12. Fulcrum Network Codes

    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...

  13. 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.

  14. 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...

  15. 47 CFR 52.15 - Central office code administration.

    Science.gov (United States)

    2010-10-01

    ...; (4) Monitoring the use of central office codes within each area code and forecasting the date by... business customers may be aged for no more than 365 days. (iii) Assigned numbers are numbers working in the..., Operating Company Number (OCN), parent company OCN, and the primary type of business in which the reporting...

  16. Distributed multiple description coding

    CERN Document Server

    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,

  17. Cryptography cracking codes

    CERN Document Server

    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.

  18. Coded MapReduce

    OpenAIRE

    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...

  19. Classical Holographic Codes

    CERN Document Server

    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.

  20. CFD analysis for the hydrogen transport in the primary contention of a BWR using the codes OpenFOAM and Gas-Flow; Analisis CFD para el transporte de hidrogeno en la contencion primaria de un reactor BWR usando los codigos OpenFOAM y GasFlow

    Energy Technology Data Exchange (ETDEWEB)

    Jimenez P, D. A.

    2014-07-01

    using a limited number of semi-empirical data, and instead, mathematical relationships are used taking into account the various physical phenomena as well the interactions that occur among them, such as heat transfer between the fluid and the solid walls condensation of water vapor on the walls, the turbulent effects in areas of restricted passage, etc. Taking into account these advantages, this study presents a qualitative and quantitative comparison between the CFD codes OpenFOAM and Gas-Flow related to the transport phenomena of Hydrogen and other gases in the primary containment of a BWR reactor. Gas-Flow is a code of commercial license that is well validated, developed in Germany to analyze the transport of gases in nuclear reactor containments. On the other hand, OpenFOAM is an open source CFD code offering several solvers for different phenomena assessments, in this work, the reacting Foam solver is used because it has a strong similarity to the intended application of Hydrogen transport. In this thesis the results obtained using the reacting Foam solver of OpenFOAM for the calculation of transport of Hydrogen are compared with the results of the Gas-Flow code in order to assess if it is feasible to use the open source code OpenFOAM in the case of Hydrogen transport in primary containment of a BWR reactor. Some differences in the qualitative and quantitative results from both codes were found, the differences (with a maximum error rate of 4%) in the quantitative results were found are small and are considered more than acceptable for this type of analysis, moreover, these differences are mainly attributed to the transport models used, mainly because OpenFOAM uses a homogeneous mixture model and Gas-Flow a heterogeneous one. Implementing appropriate solvers in codes like OpenFOAM has the goal to develop own tools that are applicable to the transport of Hydrogen in the primary containment of a BWR reactor and thus, to gain some independence while not relying on

  1. The fast code

    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)

  2. VT ZIP Code Areas

    Data.gov (United States)

    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...

  3. Fulcrum Network Codes

    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....

  4. GOOGLE SUMMER OF CODE

    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...

  5. Importance of Building Code

    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.

  6. Bandwidth efficient coding

    CERN Document Server

    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.

  7. Coded Random Access

    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...

  8. 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.

  9. Annotated Raptor Codes

    CERN Document Server

    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.

  10. CBP PHASE I CODE INTEGRATION

    Energy Technology Data Exchange (ETDEWEB)

    Smith, F.; Brown, K.; Flach, G.; Sarkar, S.

    2011-09-30

    The goal of the Cementitious Barriers Partnership (CBP) is to develop a reasonable and credible set of software tools to predict the structural, hydraulic, and chemical performance of cement barriers used in nuclear applications over extended time frames (greater than 100 years for operating facilities and greater than 1000 years for waste management). The simulation tools will be used to evaluate and predict the behavior of cementitious barriers used in near surface engineered waste disposal systems including waste forms, containment structures, entombments, and environmental remediation. These cementitious materials are exposed to dynamic environmental conditions that cause changes in material properties via (i) aging, (ii) chloride attack, (iii) sulfate attack, (iv) carbonation, (v) oxidation, and (vi) primary constituent leaching. A set of state-of-the-art software tools has been selected as a starting point to capture these important aging and degradation phenomena. Integration of existing software developed by the CBP partner organizations was determined to be the quickest method of meeting the CBP goal of providing a computational tool that improves the prediction of the long-term behavior of cementitious materials. These partner codes were selected based on their maturity and ability to address the problems outlined above. The GoldSim Monte Carlo simulation program (GTG 2010a, GTG 2010b) was chosen as the code integration platform (Brown & Flach 2009b). GoldSim (current Version 10.5) is a Windows based graphical object-oriented computer program that provides a flexible environment for model development (Brown & Flach 2009b). The linking of GoldSim to external codes has previously been successfully demonstrated (Eary 2007, Mattie et al. 2007). GoldSim is capable of performing deterministic and probabilistic simulations and of modeling radioactive decay and constituent transport. As part of the CBP project, a general Dynamic Link Library (DLL) interface was

  11. Robust Nonlinear Neural Codes

    Science.gov (United States)

    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.

  12. Scalable motion vector coding

    Science.gov (United States)

    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.

  13. On Expanded Cyclic Codes

    CERN Document Server

    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...

  14. The Bricklayer Ecosystem - Art, Math, and Code

    Directory of Open Access Journals (Sweden)

    Victor Winter

    2016-11-01

    Full Text Available This paper describes the Bricklayer Ecosystem - a freely-available online educational ecosystem created for people of all ages and coding backgrounds. Bricklayer is designed in accordance with a "low-threshold infinite ceiling" philosophy and has been successfully used to teach coding to primary school students, middle school students, university freshmen, and in-service secondary math teachers. Bricklayer programs are written in the functional programming language SML and, when executed, create 2D and 3D artifacts. These artifacts can be viewed using a variety of third-party tools such as LEGO Digital Designer (LDD, LDraw, Minecraft clients, Brickr, as well as STereoLithography viewers.

  15. Distributed Video Coding: CODEC Architecture and Implementation

    Directory of Open Access Journals (Sweden)

    Vijay Kumar Kodavalla

    2011-03-01

    Full Text Available Distributed Video Coding (DVC is a new coding paradigm for video compression, based on Slepian-Wolf (lossless coding and Wyner-Ziv (lossy coding information theoretic results. DVC is useful foremerging applications such as wireless video cameras, wireless low-power surveillance networks anddisposable video cameras for medical applications etc. The primary objective of DVC is low-complexityvideo encoding, where bulk of computation is shifted to the decoder, as opposed to low-complexitydecoder in conventional video compression standards such as H.264 and MPEG etc. There are couple ofearly architectures and implementations of DVC from Stanford University[2][3] in 2002, BerkeleyUniversity PRISM (Power-efficient, Robust, hIgh-compression, Syndrome-based Multimedia coding[4][5]in 2002 and European project DISCOVER (DIStributed COding for Video SERvices[6] in 2007.Primarily there are two types of DVC techniques namely pixel domain and transform domain based.Transform domain design will have better rate-distortion (RD performance as it exploits spatialcorrelation between neighbouring samples and compacts the block energy into as few transformcoefficients as possible (aka energy compaction. In this paper, architecture, implementation details and“C” model results of our transform domain DVC are presented.

  16. Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes

    CERN Document Server

    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.

  17. 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...

  18. 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....

  19. Understanding the chromatin remodeling code.

    Science.gov (United States)

    Ha, Misook

    2013-10-01

    Remodeling a chromatin structure enables the genetic elements stored in a genome to function in a condition-specific manner and predisposes the interactions between cis-regulatory elements and trans-acting factors. A chromatin signature can be an indicator of the activity of the underlying genetic elements. This paper reviews recent studies showing that the combination and arrangements of chromatin remodeling marks play roles as chromatin code affecting the activity of genetic elements. This paper also reviews recent studies inferring the primary DNA sequence contexts associated with chromatin remodeling that suggest interactions between genetic and epigenetic factors. We conclude that chromatin remodeling, which provides accurate models of gene expression and morphological variations, may help to find the biological marks that cannot be detected by genome-wide association study or genetic study. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

  20. Multichannel Error Correction Code Decoder

    Science.gov (United States)

    1996-01-01

    NASA Lewis Research Center's Digital Systems Technology Branch has an ongoing program in modulation, coding, onboard processing, and switching. Recently, NASA completed a project to incorporate a time-shared decoder into the very-small-aperture terminal (VSAT) onboard-processing mesh architecture. The primary goal was to demonstrate a time-shared decoder for a regenerative satellite that uses asynchronous, frequency-division multiple access (FDMA) uplink channels, thereby identifying hardware and power requirements and fault-tolerant issues that would have to be addressed in a operational system. A secondary goal was to integrate and test, in a system environment, two NASA-sponsored, proof-of-concept hardware deliverables: the Harris Corp. high-speed Bose Chaudhuri-Hocquenghem (BCH) codec and the TRW multichannel demultiplexer/demodulator (MCDD). A beneficial byproduct of this project was the development of flexible, multichannel-uplink signal-generation equipment.

  1. 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....

  2. Some new ternary linear 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].

  3. 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.

  4. Spectral Analysis Code: PARAS SPEC

    CERN Document Server

    Chaturvedi, Priyanka; Anandarao, B G

    2016-01-01

    The light emitted from the stellar photosphere serves as a unique signature for the nature of stars. The behaviour of these stellar lines depend upon the surface temperature, mass, evolutionary status and chemical composition of the star. With the advent of high-resolution spectrographs coupled with medium to large aperture telescopes around the globe, there is plenty of high-resolution and high signal-to-noise ratio data available to the astronomy community. Apart from radial velocity (RV) studies, such data offer us the unique opportunity to study chemical composition and atmospheric properties of the star. The procedure used to derive these parameters must be automated and well adaptable to data available from any high-resolution spectrograph. We hereby present an IDL code, PARAS SPEC, which was primary designed to handle high-resolution spectroscopy data from PARAS spectrograph coupled with the 1.2~m telescope at Mt. Abu, India. This code is designed to adapt with data from other spectrographs as well. Th...

  5. Optical coding theory with Prime

    CERN Document Server

    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

  6. Algebraic and stochastic coding theory

    CERN Document Server

    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.

  7. Golden Coded Multiple Beamforming

    CERN Document Server

    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...

  8. Coded source neutron imaging

    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.

  9. Coded source neutron imaging

    Science.gov (United States)

    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.

  10. Speech coding code- excited linear prediction

    CERN Document Server

    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 ...

  11. 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.

  12. Quantitative code accuracy evaluation of ISP33

    Energy Technology Data Exchange (ETDEWEB)

    Kalli, H.; Miwrrin, A. [Lappeenranta Univ. of Technology (Finland); Purhonen, H. [VTT Energy, Lappeenranta (Finland)] [and others

    1995-09-01

    Aiming at quantifying code accuracy, a methodology based on the Fast Fourier Transform has been developed at the University of Pisa, Italy. The paper deals with a short presentation of the methodology and its application to pre-test and post-test calculations submitted to the International Standard Problem ISP33. This was a double-blind natural circulation exercise with a stepwise reduced primary coolant inventory, performed in PACTEL facility in Finland. PACTEL is a 1/305 volumetrically scaled, full-height simulator of the Russian type VVER-440 pressurized water reactor, with horizontal steam generators and loop seals in both cold and hot legs. Fifteen foreign organizations participated in ISP33, with 21 blind calculations and 20 post-test calculations, altogether 10 different thermal hydraulic codes and code versions were used. The results of the application of the methodology to nine selected measured quantities are summarized.

  13. MHD Generation Code

    CERN Document Server

    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.

  14. Autocatalysis, information and coding.

    Science.gov (United States)

    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.

  15. 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....

  16. Adjoint code generator

    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.

  17. Code query by example

    Science.gov (United States)

    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.

  18. Spread codes and spread decoding in network coding

    OpenAIRE

    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.

  19. 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...

  20. Principles of speech coding

    CERN Document Server

    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

  1. Securing mobile code.

    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

  2. Model Description of TASS/SMR Code

    Energy Technology Data Exchange (ETDEWEB)

    Hwang, Y. D.; Yang, S. H.; Kim, S. H.; Lee, S. W.; Kim, H. K.; Yoon, H. Y.; Lee, G. H.; Bae, K. H.; Chung, Y. J

    2005-12-15

    TASS/SMR(Transient And Setpoint Simulation/System-integrated Modular Reactor) code has been developed for the safety analysis of the SMART-P reactor. TASS/SMR code can be applied for the analysis of design base accidents including small break loss of coolant accident of the SMART research reactor. TASS/SMR code models the primary and secondary system using a node and flow path. A node represents the control volume which defines the fluid mass and energy. Flow path connects the nodes to define the momentum of the fluid. The mass and energy conservation equations are applied to the node and the momentum conservation equation applied to the flow path. In TASS/SMR, the governing equations are applied for both the primary and the secondary coolant system and are solved simultaneously. The governing equations of TASS/SMR are based on the drift-flux model so that the accidents or transients accompanying with two-phase flow can be analyzed. Also, the SMART-P reactor specific thermal-hydraulic models are incorporated, such as non-condensable gas model, helical steam generator heat transfer model, and passive residual heat removal system (PRHRS) heat transfer model. This technical report describes the governing equations, solution method, thermal hydraulics, reactor core, control system models used in TASS/SMR code. Also, the description for the steady state simulation, the minimum CHFR and hottest fuel temperature calculation methods are described in this report.

  3. 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%.

  4. Reed-Solomon convolutional codes

    NARCIS (Netherlands)

    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.

  5. New code of conduct

    CERN Multimedia

    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...

  6. Physical layer network coding

    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...

  7. Corporate governance through codes

    NARCIS (Netherlands)

    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

  8. Polar Code Validation

    Science.gov (United States)

    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

  9. Corporate governance through codes

    NARCIS (Netherlands)

    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

  10. (Almost) practical tree codes

    KAUST Repository

    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.

  11. Corner neutronic code

    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.

  12. Ready, steady… Code!

    CERN Multimedia

    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...

  13. Focusing Automatic Code Inspections

    NARCIS (Netherlands)

    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

  14. Flexibility of the genetic code with respect to DNA structure

    DEFF Research Database (Denmark)

    Baisnée, P. F.; Baldi, Pierre; Brunak, Søren

    2001-01-01

    Motivation. The primary function of DNA is to carry genetic information through the genetic code. DNA, however, contains a variety of other signals related, for instance, to reading frame, codon bias, pairwise codon bias, splice sites and transcription regulation, nucleosome positioning and DNA...... structure. Here we study the relationship between the genetic code and DNA structure and address two questions. First, to which degree does the degeneracy of the genetic code and the acceptable amino acid substitution patterns allow for the superimposition of DNA structural signals to protein coding...... sequences? Second, is the origin or evolution of the genetic code likely to have been constrained by DNA structure? Results. We develop an index for code flexibility with respect to DNA structure. Using five different di- or tri-nucleotide models of sequence-dependent DNA structure, we show...

  15. Primary fibromyalgia

    DEFF Research Database (Denmark)

    Jacobsen, S; Jensen, L T; Foldager, M

    1990-01-01

    Serum concentrations of procollagen type III aminoterminal peptide have previously been reported to be low in some patients with primary fibromyalgia and the aim of this study was to determine if such patients differ clinically from primary fibromyalgia patients with normal levels of procollagen...... type III aminoterminal peptide. Subjective symptoms, tender points and dynamic muscle strength in 45 women with primary fibromyalgia were related to serum concentrations of procollagen type III aminoterminal peptide. Patients with low serum concentrations of procollagen type III aminoterminal peptide...... concentrations of procollagen type III aminoterminal peptide of primary fibromyalgia patients are connected to the disease impact....

  16. Fundamentals of coding and reimbursement.

    Science.gov (United States)

    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.

  17. On Asymmetric Quantum MDS Codes

    CERN Document Server

    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.

  18. 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...

  19. Modular optimization code package: MOZAIK

    Science.gov (United States)

    Bekar, Kursat B.

    This dissertation addresses the development of a modular optimization code package, MOZAIK, for geometric shape optimization problems in nuclear engineering applications. MOZAIK's first mission, determining the optimal shape of the D2O moderator tank for the current and new beam tube configurations for the Penn State Breazeale Reactor's (PSBR) beam port facility, is used to demonstrate its capabilities and test its performance. MOZAIK was designed as a modular optimization sequence including three primary independent modules: the initializer, the physics and the optimizer, each having a specific task. By using fixed interface blocks among the modules, the code attains its two most important characteristics: generic form and modularity. The benefit of this modular structure is that the contents of the modules can be switched depending on the requirements of accuracy, computational efficiency, or compatibility with the other modules. Oak Ridge National Laboratory's discrete ordinates transport code TORT was selected as the transport solver in the physics module of MOZAIK, and two different optimizers, Min-max and Genetic Algorithms (GA), were implemented in the optimizer module of the code package. A distributed memory parallelism was also applied to MOZAIK via MPI (Message Passing Interface) to execute the physics module concurrently on a number of processors for various states in the same search. Moreover, dynamic scheduling was enabled to enhance load balance among the processors while running MOZAIK's physics module thus improving the parallel speedup and efficiency. In this way, the total computation time consumed by the physics module is reduced by a factor close to M, where M is the number of processors. This capability also encourages the use of MOZAIK for shape optimization problems in nuclear applications because many traditional codes related to radiation transport do not have parallel execution capability. A set of computational models based on the

  20. A minimum-error, energy-constrained neural code is an instantaneous-rate code.

    Science.gov (United States)

    Johnson, Erik C; Jones, Douglas L; Ratnam, Rama

    2016-04-01

    Sensory neurons code information about stimuli in their sequence of action potentials (spikes). Intuitively, the spikes should represent stimuli with high fidelity. However, generating and propagating spikes is a metabolically expensive process. It is therefore likely that neural codes have been selected to balance energy expenditure against encoding error. Our recently proposed optimal, energy-constrained neural coder (Jones et al. Frontiers in Computational Neuroscience, 9, 61 2015) postulates that neurons time spikes to minimize the trade-off between stimulus reconstruction error and expended energy by adjusting the spike threshold using a simple dynamic threshold. Here, we show that this proposed coding scheme is related to existing coding schemes, such as rate and temporal codes. We derive an instantaneous rate coder and show that the spike-rate depends on the signal and its derivative. In the limit of high spike rates the spike train maximizes fidelity given an energy constraint (average spike-rate), and the predicted interspike intervals are identical to those generated by our existing optimal coding neuron. The instantaneous rate coder is shown to closely match the spike-rates recorded from P-type primary afferents in weakly electric fish. In particular, the coder is a predictor of the peristimulus time histogram (PSTH). When tested against in vitro cortical pyramidal neuron recordings, the instantaneous spike-rate approximates DC step inputs, matching both the average spike-rate and the time-to-first-spike (a simple temporal code). Overall, the instantaneous rate coder relates optimal, energy-constrained encoding to the concepts of rate-coding and temporal-coding, suggesting a possible unifying principle of neural encoding of sensory signals.

  1. Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes

    CERN Document Server

    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.

  2. Quantum codes from linear codes over finite chain rings

    Science.gov (United States)

    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.

  3. Epigenetics and primary care.

    Science.gov (United States)

    Wright, Robert; Saul, Robert A

    2013-12-01

    Epigenetics, the study of functionally relevant chemical modifications to DNA that do not involve a change in the DNA nucleotide sequence, is at the interface between research and clinical medicine. Research on epigenetic marks, which regulate gene expression independently of the underlying genetic code, has dramatically changed our understanding of the interplay between genes and the environment. This interplay alters human biology and developmental trajectories, and can lead to programmed human disease years after the environmental exposure. In addition, epigenetic marks are potentially heritable. In this article, we discuss the underlying concepts of epigenetics and address its current and potential applicability for primary care providers.

  4. Reserved-Length Prefix Coding

    CERN Document Server

    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).

  5. Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon Codes

    CERN Document Server

    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...

  6. The NIMROD Code

    Science.gov (United States)

    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.

  7. 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.

  8. 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.

  9. 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...

  10. Codes of Good Governance

    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...

  11. 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.

  12. The Phantom SPH code

    Science.gov (United States)

    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.

  13. The Liege Oscillation Code

    CERN Document Server

    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.

  14. Status of MARS Code

    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.

  15. ClinicalCodes: an online clinical codes repository to improve the validity and reproducibility of research using electronic medical records.

    Directory of Open Access Journals (Sweden)

    David A Springate

    Full Text Available Lists of clinical codes are the foundation for research undertaken using electronic medical records (EMRs. If clinical code lists are not available, reviewers are unable to determine the validity of research, full study replication is impossible, researchers are unable to make effective comparisons between studies, and the construction of new code lists is subject to much duplication of effort. Despite this, the publication of clinical codes is rarely if ever a requirement for obtaining grants, validating protocols, or publishing research. In a representative sample of 450 EMR primary research articles indexed on PubMed, we found that only 19 (5.1% were accompanied by a full set of published clinical codes and 32 (8.6% stated that code lists were available on request. To help address these problems, we have built an online repository where researchers using EMRs can upload and download lists of clinical codes. The repository will enable clinical researchers to better validate EMR studies, build on previous code lists and compare disease definitions across studies. It will also assist health informaticians in replicating database studies, tracking changes in disease definitions or clinical coding practice through time and sharing clinical code information across platforms and data sources as research objects.

  16. ARQ for Network Coding

    CERN Document Server

    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...

  17. MELCOR computer code manuals

    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.

  18. 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 ...

  19. 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...

  20. 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

  1. Convolutional coding techniques for data protection

    Science.gov (United States)

    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.

  2. Code Flows : Visualizing Structural Evolution of Source Code

    NARCIS (Netherlands)

    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

  3. Code flows : Visualizing structural evolution of source code

    NARCIS (Netherlands)

    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

  4. Primary productivity

    Digital Repository Service at National Institute of Oceanography (India)

    Verlecar, X.N.; Parulekar, A.H.

    Photosynthetic production in the oceans in relation to light, nutrients and mixing processes is discussed. Primary productivity in the estuarine region is reported to be high in comparison to coastal and oceanic waters. Upwelling phenomenon...

  5. Primary hyperparathyroidism

    OpenAIRE

    Madkhali, Tarıq; Alhefdhi, Amal; Chen, Herbert; Elfenbein, Dawn

    2016-01-01

    Primary hyperparathyroidism is a common endocrine disorder caused by overactivation of parathyroid glands resulting in excessive release of parathyroid hormone. The resultant hypercalcemia leads to a myriad of symptoms. Primary hyperparathyroidism may increase a patient’s morbidity and even mortality if left untreated. During the last few decades, disease presentation has shifted from the classic presentation of severe bone and kidney manifestations to most patients now being diagnosed on rou...

  6. What Froze the Genetic Code?

    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...

  7. Decoding Xing-Ling codes

    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....

  8. The path of code linting

    CERN Document Server

    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.

  9. 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...

  10. Code stroke in Asturias.

    Science.gov (United States)

    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.

  11. MHD Generation Code

    OpenAIRE

    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...

  12. Cinder begin creative coding

    CERN Document Server

    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

  13. Code Optimization in FORM

    CERN Document Server

    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.

  14. Topological code Autotune

    CERN Document Server

    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.

  15. Code Generation with Templates

    CERN Document Server

    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

  16. Memory Code©

    OpenAIRE

    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 ...

  17. Wavefront coding with adaptive optics

    Science.gov (United States)

    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.

  18. Authorship Attribution of Source Code

    Science.gov (United States)

    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…

  19. Strongly-MDS convolutional codes

    NARCIS (Netherlands)

    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

  20. Improved code-tracking loop

    Science.gov (United States)

    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.

  1. On Maximum Lee Distance Codes

    OpenAIRE

    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.

  2. Coding Issues in Grounded Theory

    Science.gov (United States)

    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…

  3. The Weights in MDS Codes

    CERN Document Server

    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

  4. Coding Issues in Grounded Theory

    Science.gov (United States)

    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…

  5. 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...

  6. 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....

  7. A class of constacyclic BCH codes and new quantum codes

    Science.gov (United States)

    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.

  8. 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.

  9. New quantum codes constructed from quaternary BCH codes

    Science.gov (United States)

    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.

  10. Structured error recovery for code-word-stabilized quantum codes

    Science.gov (United States)

    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.

  11. On (Partial) Unit Memory Codes Based on Gabidulin Codes

    CERN Document Server

    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.

  12. The use of diagnostic coding in chiropractic practice

    DEFF Research Database (Denmark)

    Testern, Cecilie D; Hestbæk, Lise; French, Simon D

    2015-01-01

    of chiropractors about diagnostic coding and explore the use of it in a chiropractic setting. A secondary aim was to compare the diagnostic coding undertaken by chiropractors and an independent coder. METHOD: A codin exercise based on the International Classification of Primary Care version 2, PLUS extension (ICPC...... of agreement between the chiropractors and the coder was determined and Cohen's Kappa was used to determine the agreement beyond that expected by chance. RESULTS: From the interviews the three emerging themes were: 1) Advantages and disadvantages of using a clinical coding system in chiropractic practice, 2......) ICPC-2 PLUS terminology issues for chiropractic practice and 3) Implementation of a coding system into chiropractic practice. The participating chiropractors did not uniformly support or condemn the idea of using diagnostic coding. However there was a strong agreement that the terminology in ICPC-2...

  13. SCDAP/RELAP5 code development and assessment

    Energy Technology Data Exchange (ETDEWEB)

    Allison, C.M.; Hohorst, J.K. [Idaho National Engineering Lab., Idaho Falls, ID (United States)

    1996-03-01

    The SCDAP/RELAP5 computer code is designed to describe the overall reactor coolant system thermal-hydraulic response, core damage progression, and fission product release during severe accidents. The code is being developed at the Idaho National Engineering Laboratory under the primary sponsorship of the Office of Nuclear Regulatory Research of the U.S. Nuclear Regulatory Commission. The current version of the code is SCDAP/RELAP5/MOD3.1e. Although MOD3.1e contains a number of significant improvements since the initial version of MOD3.1 was released, new models to treat the behavior of the fuel and cladding during reflood have had the most dramatic impact on the code`s calculations. This paper provides a brief description of the new reflood models, presents highlights of the assessment of the current version of MOD3.1, and discusses future SCDAP/RELAP5/MOD3.2 model development activities.

  14. Recent Improvements in the SHIELD-HIT Code

    DEFF Research Database (Denmark)

    Hansen, David Christoffer; Lühr, Armin Christian; Herrmann, Rochus

    2012-01-01

    Purpose: The SHIELD-HIT Monte Carlo particle transport code has previously been used to study a wide range of problems for heavy-ion treatment and has been benchmarked extensively against other Monte Carlo codes and experimental data. Here, an improved version of SHIELD-HIT is developed...... of using accelerator control files as a basis for the primaries. Furthermore, the code has been parallelized and efficiency is improved. The physical description of inelastic ion collisions has been modified. Results: The simulation of an experimental depth-dose distribution including a ripple filter...

  15. Physical Layer Network Coding

    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...

  16. Security Embedding Codes

    CERN Document Server

    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...

  17. Supervised Transfer Sparse Coding

    KAUST Repository

    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.

  18. Sub-Transport Layer Coding

    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...

  19. The Art of Readable Code

    CERN Document Server

    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

  20. Three Paradigms for Mixing Coding and Games: Coding in a Game, Coding as a Game, and Coding for a Game

    OpenAIRE

    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...

  1. Remarks on generalized toric codes

    CERN Document Server

    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.

  2. Rotated and Scaled Alamouti Coding

    CERN Document Server

    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.

  3. 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.

  4. Comparison of secondary flows predicted by a viscous code and an inviscid code with experimental data for a turning duct

    Science.gov (United States)

    Schwab, J. R.; Povinelli, L. A.

    1984-01-01

    A comparison of the secondary flows computed by the viscous Kreskovsky-Briley-McDonald code and the inviscid Denton code with benchmark experimental data for turning duct is presented. The viscous code is a fully parabolized space-marching Navier-Stokes solver while the inviscid code is a time-marching Euler solver. The experimental data were collected by Taylor, Whitelaw, and Yianneskis with a laser Doppler velocimeter system in a 90 deg turning duct of square cross-section. The agreement between the viscous and inviscid computations was generally very good for the streamwise primary velocity and the radial secondary velocity, except at the walls, where slip conditions were specified for the inviscid code. The agreement between both the computations and the experimental data was not as close, especially at the 60.0 deg and 77.5 deg angular positions within the duct. This disagreement was attributed to incomplete modelling of the vortex development near the suction surface.

  5. 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.

  6. Making your code citable with the Astrophysics Source Code Library

    Science.gov (United States)

    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.

  7. Code manual for CONTAIN 2.0: A computer code for nuclear reactor containment analysis

    Energy Technology Data Exchange (ETDEWEB)

    Murata, K.K.; Williams, D.C.; Griffith, R.O.; Gido, R.G.; Tadios, E.L.; Davis, F.J.; Martinez, G.M.; Washington, K.E. [Sandia National Labs., Albuquerque, NM (United States); Tills, J. [J. Tills and Associates, Inc., Sandia Park, NM (United States)

    1997-12-01

    The CONTAIN 2.0 computer code is an integrated analysis tool used for predicting the physical conditions, chemical compositions, and distributions of radiological materials inside a containment building following the release of material from the primary system in a light-water reactor accident. It can also predict the source term to the environment. CONTAIN 2.0 is intended to replace the earlier CONTAIN 1.12, which was released in 1991. The purpose of this Code Manual is to provide full documentation of the features and models in CONTAIN 2.0. Besides complete descriptions of the models, this Code Manual provides a complete description of the input and output from the code. CONTAIN 2.0 is a highly flexible and modular code that can run problems that are either quite simple or highly complex. An important aspect of CONTAIN is that the interactions among thermal-hydraulic phenomena, aerosol behavior, and fission product behavior are taken into account. The code includes atmospheric models for steam/air thermodynamics, intercell flows, condensation/evaporation on structures and aerosols, aerosol behavior, and gas combustion. It also includes models for reactor cavity phenomena such as core-concrete interactions and coolant pool boiling. Heat conduction in structures, fission product decay and transport, radioactive decay heating, and the thermal-hydraulic and fission product decontamination effects of engineered safety features are also modeled. To the extent possible, the best available models for severe accident phenomena have been incorporated into CONTAIN, but it is intrinsic to the nature of accident analysis that significant uncertainty exists regarding numerous phenomena. In those cases, sensitivity studies can be performed with CONTAIN by means of user-specified input parameters. Thus, the code can be viewed as a tool designed to assist the knowledge reactor safety analyst in evaluating the consequences of specific modeling assumptions.

  8. On Bounded Weight Codes

    CERN Document Server

    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.

  9. Homomorphic encryption from codes

    CERN Document Server

    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...

  10. 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.

  11. Improved lossless intra coding for next generation video coding

    Science.gov (United States)

    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.

  12. Primary Myelofibrosis

    Science.gov (United States)

    ... the blood cells. Symptoms of primary myelofibrosis include pain below the ribs on the left side and feeling very tired. ... if you have any of the following: Feeling pain or fullness below the ribs on the left side. Feeling full sooner than ...

  13. [Primary hyperaldosteronism

    NARCIS (Netherlands)

    Meiracker, A.H. van den; Deinum, J.

    2003-01-01

    Primary hyperaldosteronism (PHA), autonomic secretion of aldosterone by the adrenal gland, is rare. PHA usually results in therapy-resistant hypertension and is often but not always accompanied by hypokalaemia. Common causes of PHA are an aldosterone-producing adenoma, idiopathic aldosterone hyperse

  14. [Primary hyperaldosteronism

    NARCIS (Netherlands)

    Meiracker, A.H. van den; Deinum, J.

    2003-01-01

    Primary hyperaldosteronism (PHA), autonomic secretion of aldosterone by the adrenal gland, is rare. PHA usually results in therapy-resistant hypertension and is often but not always accompanied by hypokalaemia. Common causes of PHA are an aldosterone-producing adenoma, idiopathic aldosterone hyperse

  15. Primary Processing

    NARCIS (Netherlands)

    Mulder, W.J.; Harmsen, P.F.H.; Sanders, J.P.M.; Carre, P.; Kamm, B.; Schoenicke, P.

    2012-01-01

    Primary processing of oil-containing material involves pre-treatment processes, oil recovery processes and the extraction and valorisation of valuable compounds from waste streams. Pre-treatment processes, e.g. thermal, enzymatic, electrical and radio frequency, have an important effect on the oil r

  16. 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...

  17. Superimposed Code Theorectic Analysis of DNA Codes and DNA Computing

    Science.gov (United States)

    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

  18. Bit-Interleaved Coded Multiple Beamforming with Perfect Coding

    CERN Document Server

    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...

  19. Practices in Code Discoverability: Astrophysics Source Code Library

    CERN Document Server

    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...

  20. Elements of algebraic coding systems

    CERN Document Server

    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.

  1. Hyperthyroidism (primary)

    DEFF Research Database (Denmark)

    Nygaard, Birte

    2010-01-01

    Hyperthyroidism is characterised by high levels of serum thyroxine and triiodothyronine, and low levels of thyroid-stimulating hormone. The main causes of hyperthyroidism are Graves' disease, toxic multinodular goitre, and toxic adenoma. About 20 times more women than men have hyperthyroidism....... METHODS AND OUTCOMES: We conducted a systematic review and aimed to answer the following clinical questions: What are the effects of drug treatments for primary hyperthyroidism? What are the effects of surgical treatments for primary hyperthyroidism? What are the effects of treatments for subclinical...... hyperthyroidism? We searched: Medline, Embase, The Cochrane Library, and other important databases up to February 2010 (Clinical Evidence reviews are updated periodically, please check our website for the most up-to-date version of this review). We included harms alerts from relevant organisations such as the US...

  2. 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.

  3. 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....

  4. 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.

  5. Code Speed Measuring for VC++

    Science.gov (United States)

    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

  6. ACE spectrum of LDPC codes

    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.

  7. QR code for medical information uses.

    Science.gov (United States)

    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.

  8. Hyperthyroidism (primary)

    OpenAIRE

    Nygaard, Birte

    2008-01-01

    Hyperthyroidism is characterised by high levels of serum thyroxine and triiodothyronine, and low levels of thyroid-stimulating hormone. Thyrotoxicosis is the clinical effect of high levels of thyroid hormones, whether or not the thyroid gland is the primary source.The main causes of hyperthyroidism are Graves' disease, toxic multinodular goitre, and toxic adenoma.About 20 times more women than men have hyperthyroidism.

  9. Hyperthyroidism (primary)

    OpenAIRE

    Nygaard, Birte

    2010-01-01

    Hyperthyroidism is characterised by high levels of serum thyroxine and triiodothyronine, and low levels of thyroid-stimulating hormone (TSH). Thyrotoxicosis is the clinical effect of high levels of thyroid hormones, whether or not the thyroid gland is the primary source.The main causes of hyperthyroidism are Graves' disease, toxic multinodular goitre, and toxic adenoma.About 20 times more women than men have hyperthyroidism.

  10. Astrophysics Source Code Library Enhancements

    CERN Document Server

    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.

  11. Multiple Beamforming with Perfect Coding

    CERN Document Server

    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...

  12. 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...

  13. Should you learn to code?

    CERN Document Server

    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

  14. 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....

  15. Semi-supervised sparse coding

    KAUST Repository

    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.

  16. Coding, cryptography and combinatorics

    CERN Document Server

    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...

  17. Polymatroids with Network Coding

    CERN Document Server

    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...

  18. Consensus Convolutional Sparse Coding

    KAUST Repository

    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.

  19. 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....

  20. The KIDTALK Behavior and Language Code: Manual and Coding Protocol.

    Science.gov (United States)

    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…

  1. Recognition of Multifunctional Coded Target in Single-camera Mobile 3D-vision Coordination Measurement

    Institute of Scientific and Technical Information of China (English)

    XU Zhi-hua; XIA Ling-li; YU Zhi-jing

    2009-01-01

    Single-camera mobile-vision coordinate measurement is one of the primary methods of 3Dcoordinate vision measurement,and coded target plays an important role in this system. A muhifunctional coded target and its recognition algorithm is developed,which can realize automatic match of feature points,calculation of camera initial exterior orientation and apace scale factor constraint in measurement system.The uniqueness and scalability of coding are guaranteed by the rational arrangement of code bits.The recognition of coded targets is realized by cross-ratio invariance restriction,space coordinates transform of feature points based on spacial pose estimation algorithm,recognition of code bits and computation of coding values.The experiment results demonstrate the uniqueness of the coding form and the reliability of recognition.

  2. Barriers and challenges of using medical coding systems

    NARCIS (Netherlands)

    Surján, G.

    2011-01-01

    The subject of this study is the generation and utilisation of coded medical data. There are essentially two uses of health data: one is the clinical use within the primary healthcare process. The other use, which is the focus of my thesis, is the central collection of data aggregated from clinical

  3. Developing a Working Code of Ethics for Human Resource Personnel.

    Science.gov (United States)

    Rampal, Kuldip R.

    1991-01-01

    To develop codes of ethics for their profession, college human resources personnel must first understand their primary job-related responsibilities. These include being alert to evolving organizational needs; coordinating needed training of employees; appreciating the nuances of psychology, communication, and motivation; and observing employee…

  4. 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

  5. Civil Code, 11 December 1987.

    Science.gov (United States)

    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

  6. Aspen Code Development Collaboration

    Energy Technology Data Exchange (ETDEWEB)

    none,; Cherry, Robert S. [INL; Richard, Boardman D. [INL

    2013-10-03

    Wyoming has a wealth of primary energy resources in the forms of coal, natural gas, wind, uranium, and oil shale. Most of Wyoming?s coal and gas resources are exported from the state in unprocessed form rather than as refined higher value products. Wyoming?s leadership recognizes the opportunity to broaden the state?s economic base energy resources to make value-added products such as synthetic vehicle fuels and commodity chemicals. Producing these higher value products in an environmentally responsible manner can benefit from the use of clean energy technologies including Wyoming?s abundant wind energy and nuclear energy such as new generation small modular reactors including the high temperature gas-cooled reactors.

  7. 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...

  8. New medical psychotherapy CPT coding: the tail wagging the dog?

    Science.gov (United States)

    Clemens, Norman A

    2013-03-01

    The implications of the 2013 revised current procedural terminology (CPT) system for coding psychotherapy with medical evaluation and management (E&M) are discussed. The author expresses concern about a potential devaluing of psychotherapy because of the required order of reporting combined codes, with E&M the primary code. Procedural and documentation requirements for using the standard medical E&M codes challenge psychiatrists to be systematic and efficient in order not to interfere with time and attention essential to an effective psychotherapy process. Insensitive use of computers when working with patients can damage rapport and progress. The trend toward sharing personal health information in large systems calls for heightened discretion. Using the psychotherapy notes protected under the Health Insurance Portability and Accountability Act (HIPAA) for highly sensitive personal information is essential to preserve patient privacy.

  9. Validation uncertainty of MATRA code for subchannel void distributions

    Energy Technology Data Exchange (ETDEWEB)

    Hwang, Dae-Hyun; Kim, S. J.; Kwon, H.; Seo, K. W. [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2014-10-15

    To extend code capability to the whole core subchannel analysis, pre-conditioned Krylov matrix solvers such as BiCGSTAB and GMRES are implemented in MATRA code as well as parallel computing algorithms using MPI and OPENMP. It is coded by fortran 90, and has some user friendly features such as graphic user interface. MATRA code was approved by Korean regulation body for design calculation of integral-type PWR named SMART. The major role subchannel code is to evaluate core thermal margin through the hot channel analysis and uncertainty evaluation for CHF predictions. In addition, it is potentially used for the best estimation of core thermal hydraulic field by incorporating into multiphysics and/or multi-scale code systems. In this study we examined a validation process for the subchannel code MATRA specifically in the prediction of subchannel void distributions. The primary objective of validation is to estimate a range within which the simulation modeling error lies. The experimental data for subchannel void distributions at steady state and transient conditions was provided on the framework of OECD/NEA UAM benchmark program. The validation uncertainty of MATRA code was evaluated for a specific experimental condition by comparing the simulation result and experimental data. A validation process should be preceded by code and solution verification. However, quantification of verification uncertainty was not addressed in this study. The validation uncertainty of the MATRA code for predicting subchannel void distribution was evaluated for a single data point of void fraction measurement at a 5x5 PWR test bundle on the framework of OECD UAM benchmark program. The validation standard uncertainties were evaluated as 4.2%, 3.9%, and 2.8% with the Monte-Carlo approach at the axial levels of 2216 mm, 2669 mm, and 3177 mm, respectively. The sensitivity coefficient approach revealed similar results of uncertainties but did not account for the nonlinear effects on the

  10. Primary fibromyalgia

    DEFF Research Database (Denmark)

    Jacobsen, Søren; Jensen, L T; Foldager, Marie Viftrup

    1990-01-01

    type III aminoterminal peptide. Subjective symptoms, tender points and dynamic muscle strength in 45 women with primary fibromyalgia were related to serum concentrations of procollagen type III aminoterminal peptide. Patients with low serum concentrations of procollagen type III aminoterminal peptide...... had more symptoms, a higher frequency of tender points and lesser quality of sleep compared to patients with normal serum concentrations of procollagen type III aminoterminal peptide (P less than 0.05). They also had a lower dynamic muscle strength (P less than 0.0005). We conclude that the serum...

  11. Revised Safety Code A2

    CERN Multimedia

    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

  12. 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...

  13. 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....

  14. 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...

  15. Code breaking in the pacific

    CERN Document Server

    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

  16. 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.

  17. 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.

  18. Distributed space-time coding

    CERN Document Server

    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.

  19. Recommendations for ECG diagnostic coding

    NARCIS (Netherlands)

    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

  20. Bounds on Generalized Huffman Codes

    CERN Document Server

    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...

  1. LFSC - Linac Feedback Simulation Code

    Energy Technology Data Exchange (ETDEWEB)

    Ivanov, Valentin; /Fermilab

    2008-05-01

    The computer program LFSC (Code>) is a numerical tool for simulation beam based feedback in high performance linacs. The code LFSC is based on the earlier version developed by a collective of authors at SLAC (L.Hendrickson, R. McEwen, T. Himel, H. Shoaee, S. Shah, P. Emma, P. Schultz) during 1990-2005. That code was successively used in simulation of SLC, TESLA, CLIC and NLC projects. It can simulate as pulse-to-pulse feedback on timescale corresponding to 5-100 Hz, as slower feedbacks, operating in the 0.1-1 Hz range in the Main Linac and Beam Delivery System. The code LFSC is running under Matlab for MS Windows operating system. It contains about 30,000 lines of source code in more than 260 subroutines. The code uses the LIAR ('Linear Accelerator Research code') for particle tracking under ground motion and technical noise perturbations. It uses the Guinea Pig code to simulate the luminosity performance. A set of input files includes the lattice description (XSIF format), and plane text files with numerical parameters, wake fields, ground motion data etc. The Matlab environment provides a flexible system for graphical output.

  2. Recommendations for ECG diagnostic coding

    NARCIS (Netherlands)

    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

  3. Cyclic Codes of Length 2

    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.

  4. Coded continuous wave meteor radar

    OpenAIRE

    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 ...

  5. 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...

  6. Quantum source-channel codes

    CERN Document Server

    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...

  7. 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...

  8. Writing the Live Coding Book

    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...

  9. Binary Error Correcting Network Codes

    CERN Document Server

    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.

  10. What Froze the Genetic Code?

    Science.gov (United States)

    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.

  11. 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....

  12. P-adic arithmetic coding

    CERN Document Server

    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.

  13. PARAVT: Parallel Voronoi tessellation code

    Science.gov (United States)

    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.

  14. 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.

  15. 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.

  16. Non-Protein Coding RNAs

    CERN Document Server

    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...

  17. Super Special Codes using Super Matrices

    CERN Document Server

    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.

  18. 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.

  19. From research to praxis: Empowering Trinidadian primary school teachers via action research

    National Research Council Canada - National Science Library

    Bissessar, Charmaine S

    2015-01-01

    .... The narrative review of student-teachers' archival action research proposals was thematically coded to reflect challenges confronting primary school, special needs, and early childhood educators in Trinidad...

  20. Primary hyperparathyroidism.

    Science.gov (United States)

    Muñoz-Torres, Manuel; García-Martín, Antonia

    2017-10-06

    Primary hyperparathyroidism (PHPT) is a common endocrinological process, characterized by chronic elevation of serum concentrations of calcium and parathyroid hormone (PTH). Many years ago, the most frequent forms of clinical presentation were symptomatic renal or skeletal disease with moderate or severe hypercalcemia; however, currently, most patients have few symptoms and mild hypercalcemia. A new form of presentation called normocalcemic PHPT has also been described but clinical consequences are not well established. The biochemical profile of PHPT is characterized by hypercalcemia and high or inappropriately normal PTH concentrations. Parathyroidectomy is the only definitive cure. Medical treatment with the calcimimetic cinacalcet has been shown to normalize calcemia in a high percentage of cases. Copyright © 2017 Elsevier España, S.L.U. All rights reserved.

  1. Primary Hyperoxaluria

    Directory of Open Access Journals (Sweden)

    Jérôme Harambat

    2011-01-01

    Full Text Available Primary hyperoxalurias (PH are inborn errors in the metabolism of glyoxylate and oxalate. PH type 1, the most common form, is an autosomal recessive disorder caused by a deficiency of the liver-specific enzyme alanine, glyoxylate aminotransferase (AGT resulting in overproduction and excessive urinary excretion of oxalate. Recurrent urolithiasis and nephrocalcinosis are the hallmarks of the disease. As glomerular filtration rate decreases due to progressive renal damage, oxalate accumulates leading to systemic oxalosis. Diagnosis is often delayed and is based on clinical and sonographic findings, urinary oxalate assessment, DNA analysis, and, if necessary, direct AGT activity measurement in liver biopsy tissue. Early initiation of conservative treatment, including high fluid intake, inhibitors of calcium oxalate crystallization, and pyridoxine in responsive cases, can help to maintain renal function in compliant subjects. In end-stage renal disease patients, the best outcomes have been achieved with combined liver-kidney transplantation which corrects the enzyme defect.

  2. 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.

  3. Non-Pauli observables for CWS codes

    Science.gov (United States)

    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.

  4. 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.

  5. Constructions of Rank Modulation Codes

    CERN Document Server

    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...

  6. Trajectory Codes for Flash Memory

    CERN Document Server

    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...

  7. ETR/ITER systems code

    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.

  8. CodedStream: live media streaming with overlay coded multicast

    Science.gov (United States)

    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.

  9. Surface code implementation of block code state distillation

    Science.gov (United States)

    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

  10. Coding and decoding for code division multiple user communication systems

    Science.gov (United States)

    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.

  11. 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.

  12. Network Coding Fundamentals and Applications

    CERN Document Server

    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

  13. 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.

  14. Neural Decoder for Topological Codes

    Science.gov (United States)

    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.

  15. Atlas C++ Coding Standard Specification

    CERN Document Server

    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.

  16. 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.

  17. LiveCode mobile development

    CERN Document Server

    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.

  18. 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.

  19. i-Review: Sharing Code

    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.

  20. Introduction to coding and information theory

    CERN Document Server

    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.

  1. 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.

  2. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

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

  3. Upper Air Observations - Synoptic Code

    Data.gov (United States)

    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.

  4. Multimedia signal coding and transmission

    CERN Document Server

    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.

  5. Zip Code Level Enrollment Data

    Data.gov (United States)

    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...

  6. 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....

  7. Electronic Code of Federal Regulations

    Data.gov (United States)

    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...

  8. FLYCHK Collisional-Radiative Code

    Science.gov (United States)

    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.

  9. Allegheny County Zip Code Boundaries

    Data.gov (United States)

    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...

  10. 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...

  11. The Serializability of Network Codes

    CERN Document Server

    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...

  12. On Reed-Solomon Codes

    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.

  13. Code properties from holographic geometries

    CERN Document Server

    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...

  14. Efficient codes and balanced networks.

    Science.gov (United States)

    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.

  15. Zip Codes - MDC_WCSZipcode

    Data.gov (United States)

    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...

  16. The moving mesh code Shadowfax

    CERN Document Server

    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.

  17. The moving mesh code SHADOWFAX

    Science.gov (United States)

    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.

  18. 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...

  19. Facilitating Internet-Scale Code Retrieval

    Science.gov (United States)

    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…

  20. Decoder for Nonbinary CWS Quantum Codes

    CERN Document Server

    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.

  1. MKHITAR GOSH'S MEDIEVAL LAW CODE AND ITS IMPLICATIONS FOR ARMENIAN COMMUNITIES ABROAD.

    Science.gov (United States)

    Davtyan, Susanna; Khachatryan, Mikayel; Johrian, Ara; Ghazaryan, Karen

    2014-07-01

    The Law Book of the medieval Armenian legal and economic thought is an exceptional work that encompasses valuable information of the Armenian nation's domestic life. Mkhitar Gosh was considered to be one of the most outstanding figures and lawyers (lawmakers) of all times. Armenian Law Code after Mkhitar Gosh is writhed at 12 century. One of the primary sources for the law code was Armenian customary law. This Code became moral code for guiding for hall Armenians over the world because of high moral spirit reflecting Armenian mentality. This article presents the brief history of extension of legal rules setting out in the Law Code. The Law Code was established and widely used not only in Armenia but also in a number of Armenian communities abroad (Russian, Poland, Georgia, Latvia, India etc.). Law Code was accepted by all Armenians. Moreover, it served for the development of legislation for a number of civilized European and Asian countries.

  2. 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.

  3. 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....

  4. Summary of Code of Ethics.

    Science.gov (United States)

    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.

  5. Coded nanoscale self-assembly

    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.

  6. Verification of ONED90 code

    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.

  7. Product Work Classification and Coding

    Science.gov (United States)

    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

  8. 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.

  9. Engineering autonomous error correction in stabilizer codes at finite temperature

    Science.gov (United States)

    Freeman, C. Daniel; Herdman, C. M.; Whaley, K. B.

    2017-07-01

    We present an error-correcting protocol that enhances the lifetime of stabilizer code-based qubits which are susceptible to the creation of pairs of localized defects (due to stringlike error operators) at finite temperature, such as the toric code. The primary tool employed is periodic application of a local, unitary operator, which exchanges defects and thereby translates localized excitations. Crucially, the protocol does not require any measurements of stabilizer operators and therefore can be used to enhance the lifetime of a qubit in the absence of such experimental resources.

  10. Simulation of the postulated stopping accident of the bombs of the primary circuit of Angra 2 with the code RELAP5/MOD3.2; Simulacao do acidente postulado de parada das bombas do circuito primario de Angra 2 com o codigo RELAP5/MOD3.2

    Energy Technology Data Exchange (ETDEWEB)

    Andrade, Delvonei A.; Sabundjian, Gaiane [Instituto de Pesquisas Energeticas e Nucleares (IPEN), Sao Paulo, SP (Brazil)]. E-mail: delvonei@net.ipen.br; Madeira, Alzira A.; Pereira, Luiz Carlos M.; Borges, Ronaldo C. [Comissao Nacional de Energia Nuclear (CNEN), Rio de Janeiro, RJ (Brazil). Coordenacao de Reatores; Azevedo, Carlos Vicente G.; Palmieri, Elcio Tadeu [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN), Belo Horizonte, MG (Brazil); Lapa, Nelbia S. [Instituto de Engenharia Nuclear (IEN), Rio de Janeiro, RJ (Brazil)

    2001-07-01

    This work presents the simulation of an anticipated transient for Angra 2 Nuclear Power Plant, where the coast down of the four reactor coolant pumps is verified. The best estimate thermal hydraulic system code RELAP5/MOD3.2 was used on this frame. A multi-purpose nodalization of Angra 2 was developed to simulate a comprehensive set of operational transients and accidents with RELAP5/MOD3.2 code. The overall objective of this work is to provide independent accident evaluation and further operational behavior follow-up to support the licensing process of the plant. (author)

  11. Primary immunodeficiency

    Directory of Open Access Journals (Sweden)

    McCusker Christine

    2011-11-01

    Full Text Available Abstract Primary immunodeficiency disorder (PID refers to a heterogeneous group of over 130 disorders that result from defects in immune system development and/or function. PIDs are broadly classified as disorders of adaptive immunity (i.e., T-cell, B-cell or combined immunodeficiencies or of innate immunity (e.g., phagocyte and complement disorders. Although the clinical manifestations of PIDs are highly variable, most disorders involve at least an increased susceptibility to infection. Early diagnosis and treatment are imperative for preventing significant disease-associated morbidity and, therefore, consultation with a clinical immunologist is essential. PIDs should be suspected in patients with: recurrent sinus or ear infections or pneumonias within a 1 year period; failure to thrive; poor response to prolonged use of antibiotics; persistent thrush or skin abscesses; or a family history of PID. Patients with multiple autoimmune diseases should also be evaluated. Diagnostic testing often involves lymphocyte proliferation assays, flow cytometry, measurement of serum immunoglobulin (Ig levels, assessment of serum specific antibody titers in response to vaccine antigens, neutrophil function assays, stimulation assays for cytokine responses, and complement studies. The treatment of PIDs is complex and generally requires both supportive and definitive strategies. Ig replacement therapy is the mainstay of therapy for B-cell disorders, and is also an important supportive treatment for many patients with combined immunodeficiency disorders. The heterogeneous group of disorders involving the T-cell arm of the adaptive system, such as severe combined immunodeficiency (SCID, require immune reconstitution as soon as possible. The treatment of innate immunodeficiency disorders varies depending on the type of defect, but may involve antifungal and antibiotic prophylaxis, cytokine replacement, vaccinations and bone marrow transplantation. This article

  12. Why Aren't More Primary Care Residents Going into Primary Care? A Qualitative Study.

    Science.gov (United States)

    Long, Theodore; Chaiyachati, Krisda; Bosu, Olatunde; Sircar, Sohini; Richards, Bradley; Garg, Megha; McGarry, Kelly; Solomon, Sonja; Berman, Rebecca; Curry, Leslie; Moriarty, John; Huot, Stephen

    2016-12-01

    Workforce projections indicate a potential shortage of up to 31,000 adult primary care providers by the year 2025. Approximately 80 % of internal medicine residents and nearly two-thirds of primary care internal medicine residents do not plan to have a career in primary care or general internal medicine. We aimed to explore contextual and programmatic factors within primary care residency training environments that may influence career choices. This was a qualitative study based on semi-structured, in-person interviews. Three primary care internal medicine residency programs were purposefully selected to represent a diversity of training environments. Second and third year residents were interviewed. We used a survey guide developed from pilot interviews and existing literature. Three members of the research team independently coded the transcripts and developed the code structure based on the constant comparative method. The research team identified emerging themes and refined codes. ATLAS.ti was used for the analysis. We completed 24 interviews (12 second-year residents, and 12 third-year residents). The age range was 27-39 years. Four recurrent themes characterized contextual and programmatic factors contributing to residents' decision-making: resident expectations of a career in primary care, navigation of the boundary between social needs and medical needs, mentorship and perceptions of primary care, and structural features of the training program. Addressing aspects of training that may discourage residents from careers in primary care such as lack of diversity in outpatient experiences and resident frustration with their inability to address social needs of patients, and strengthening aspects of training that may encourage interests in careers in primary care such as mentorship and protected time away from inpatient responsibilities during primary care rotations, may increase the proportion of residents enrolled in primary care training programs who pursue

  13. 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.

  14. Convolutional Goppa codes defined on fibrations

    CERN Document Server

    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.

  15. Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes

    Science.gov (United States)

    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

  16. 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.

  17. Wireless Network Coding with Local Network Views: Coded Layer Scheduling

    CERN Document Server

    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...

  18. Development of covariance capabilities in EMPIRE code

    Energy Technology Data Exchange (ETDEWEB)

    Herman,M.; Pigni, M.T.; Oblozinsky, P.; Mughabghab, S.F.; Mattoon, C.M.; Capote, R.; Cho, Young-Sik; Trkov, A.

    2008-06-24

    The nuclear reaction code EMPIRE has been extended to provide evaluation capabilities for neutron cross section covariances in the thermal, resolved resonance, unresolved resonance and fast neutron regions. The Atlas of Neutron Resonances by Mughabghab is used as a primary source of information on uncertainties at low energies. Care is taken to ensure consistency among the resonance parameter uncertainties and those for thermal cross sections. The resulting resonance parameter covariances are formatted in the ENDF-6 File 32. In the fast neutron range our methodology is based on model calculations with the code EMPIRE combined with experimental data through several available approaches. The model-based covariances can be obtained using deterministic (Kalman) or stochastic (Monte Carlo) propagation of model parameter uncertainties. We show that these two procedures yield comparable results. The Kalman filter and/or the generalized least square fitting procedures are employed to incorporate experimental information. We compare the two approaches analyzing results for the major reaction channels on {sup 89}Y. We also discuss a long-standing issue of unreasonably low uncertainties and link it to the rigidity of the model.

  19. 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.

  20. Multiplicatively Repeated Non-Binary LDPC Codes

    CERN Document Server

    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.

  1. New multilevel codes over GF(q)

    Science.gov (United States)

    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.

  2. 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.

  3. Applications guide to the MORSE Monte Carlo code

    Energy Technology Data Exchange (ETDEWEB)

    Cramer, S.N.

    1985-08-01

    A practical guide for the implementation of the MORESE-CG Monte Carlo radiation transport computer code system is presented. The various versions of the MORSE code are compared and contrasted, and the many references dealing explicitly with the MORSE-CG code are reviewed. The treatment of angular scattering is discussed, and procedures for obtaining increased differentiality of results in terms of reaction types and nuclides from a multigroup Monte Carlo code are explained in terms of cross-section and geometry data manipulation. Examples of standard cross-section data input and output are shown. Many other features of the code system are also reviewed, including (1) the concept of primary and secondary particles, (2) fission neutron generation, (3) albedo data capability, (4) DOMINO coupling, (5) history file use for post-processing of results, (6) adjoint mode operation, (7) variance reduction, and (8) input/output. In addition, examples of the combinatorial geometry are given, and the new array of arrays geometry feature (MARS) and its three-dimensional plotting code (JUNEBUG) are presented. Realistic examples of user routines for source, estimation, path-length stretching, and cross-section data manipulation are given. A deatiled explanation of the coupling between the random walk and estimation procedure is given in terms of both code parameters and physical analogies. The operation of the code in the adjoint mode is covered extensively. The basic concepts of adjoint theory and dimensionality are discussed and examples of adjoint source and estimator user routines are given for all common situations. Adjoint source normalization is explained, a few sample problems are given, and the concept of obtaining forward differential results from adjoint calculations is covered. Finally, the documentation of the standard MORSE-CG sample problem package is reviewed and on-going and future work is discussed.

  4. 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....

  5. 76 FR 77549 - Lummi Nation-Title 20-Code of Laws-Liquor Code

    Science.gov (United States)

    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...

  6. Index coding via linear programming

    CERN Document Server

    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-...

  7. Driver Code for Adaptive Optics

    Science.gov (United States)

    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.

  8. LDPC Codes for Compressed Sensing

    CERN Document Server

    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 ...

  9. Quantifying the Performance of Quantum Codes

    CERN Document Server

    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...

  10. Halftone Coding with JBIG2

    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...

  11. Roadmap to Majorana surface codes

    Science.gov (United States)

    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.

  12. 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.

  13. 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.

  14. 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...

  15. Tree Coding of Bilevel Images

    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...

  16. 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.

  17. 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.

  18. Multiple Schemes for Mobile Payment Authentication Using QR Code and Visual Cryptography

    Directory of Open Access Journals (Sweden)

    Jianfeng Lu

    2017-01-01

    Full Text Available QR code (quick response code is used due to its beneficial properties, especially in the mobile payment field. However, there exists an inevitable risk in the transaction process. It is not easily perceived that the attacker tampers with or replaces the QR code that contains merchant’s beneficiary account. Thus, it is of great urgency to conduct authentication of QR code. In this study, we propose a novel mechanism based on visual cryptography scheme (VCS and aesthetic QR code, which contains three primary schemes for different concealment levels. The main steps of these schemes are as follows. Firstly, one original QR code is split into two shadows using VC multiple rules; secondly, the two shadows are embedded into the same background image, respectively, and the embedded results are fused with the same carrier QR code, respectively, using XOR mechanism of RS and QR code error correction mechanism. Finally, the two aesthetic QR codes can be stacked precisely and the original QR code is restored according to the defined VCS. Experiments corresponding to three proposed schemes are conducted and demonstrate the feasibility and security of the mobile payment authentication, the significant improvement of the concealment for the shadows in QR code, and the diversity of mobile payment authentication.

  19. Zigzag Codes: MDS Array Codes with Optimal Rebuilding

    CERN Document Server

    Tamo, Itzhak; Bruck, Jehoshua

    2011-01-01

    MDS array codes are widely used in storage systems to protect data against erasures. We address the \\emph{rebuilding ratio} problem, namely, in the case of erasures, what is the fraction of the remaining information that needs to be accessed in order to rebuild \\emph{exactly} the lost information? It is clear that when the number of erasures equals the maximum number of erasures that an MDS code can correct then the rebuilding ratio is 1 (access all the remaining information). However, the interesting and more practical case is when the number of erasures is smaller than the erasure correcting capability of the code. For example, consider an MDS code that can correct two erasures: What is the smallest amount of information that one needs to access in order to correct a single erasure? Previous work showed that the rebuilding ratio is bounded between 1/2 and 3/4, however, the exact value was left as an open problem. In this paper, we solve this open problem and prove that for the case of a single erasure with ...

  20. Signal Constellations for Multilevel Coded Modulation with Sparse Graph Codes

    NARCIS (Netherlands)

    Cronie, Harm S.

    2005-01-01

    A method to combine error-correction coding and spectral efficient modulation for transmission over channels with Gaussian noise is presented. The method of modulation leads to a signal constellation in which the constellation symbols have a nonuniform distribution. This gives a so-called shape gain

  1. The stellar atmosphere simulation code Bifrost. Code description and validation

    Science.gov (United States)

    Gudiksen, B. V.; Carlsson, M.; Hansteen, V. H.; Hayek, W.; Leenaarts, J.; Martínez-Sykora, J.

    2011-07-01

    Context. Numerical simulations of stellar convection and photospheres have been developed to the point where detailed shapes of observed spectral lines can be explained. Stellar atmospheres are very complex, and very different physical regimes are present in the convection zone, photosphere, chromosphere, transition region and corona. To understand the details of the atmosphere it is necessary to simulate the whole atmosphere since the different layers interact strongly. These physical regimes are very diverse and it takes a highly efficient massively parallel numerical code to solve the associated equations. Aims: The design, implementation and validation of the massively parallel numerical code Bifrost for simulating stellar atmospheres from the convection zone to the corona. Methods: The code is subjected to a number of validation tests, among them the Sod shock tube test, the Orzag-Tang colliding shock test, boundary condition tests and tests of how the code treats magnetic field advection, chromospheric radiation, radiative transfer in an isothermal scattering atmosphere, hydrogen ionization and thermal conduction. Results.Bifrost completes the tests with good results and shows near linear efficiency scaling to thousands of computing cores.

  2. Halftone Coding with JBIG2

    DEFF Research Database (Denmark)

    Martins, Bo; Forchhammer, Søren

    2000-01-01

    The emerging international standard for compression of bilevel images and bi-level documents, JBIG2,provides a mode dedicated for lossy coding of halftones. The encoding procedure involves descreening of the bi-levelimage into gray-scale, encoding of the gray-scale image, and construction...... and care must be taken to avoid introducing artifacts in the reconstructed image. We describe how to apply this coding method for halftones created by periodic ordered dithering, by clustered dot screening (offset printing), and by techniques which in effect dithers with blue noise, e.g., error diffusion....... Besides descreening and construction of the dictionary, we address graceful degradationand artifact removal....

  3. Hybrid codes: Methods and applications

    Energy Technology Data Exchange (ETDEWEB)

    Winske, D. (Los Alamos National Lab., NM (USA)); Omidi, N. (California Univ., San Diego, La Jolla, CA (USA))

    1991-01-01

    In this chapter we discuss hybrid'' algorithms used in the study of low frequency electromagnetic phenomena, where one or more ion species are treated kinetically via standard PIC methods used in particle codes and the electrons are treated as a single charge neutralizing massless fluid. Other types of hybrid models are possible, as discussed in Winske and Quest, but hybrid codes with particle ions and massless fluid electrons have become the most common for simulating space plasma physics phenomena in the last decade, as we discuss in this paper.

  4. An Analysis of Syndrome Coding

    Science.gov (United States)

    Amiruzzaman, Md; Abdullah-Al-Wadud, M.; Chung, Yoojin

    In this paper a detail analysis is presented based on BCH syndrome coding for covert channel data hiding methods. The experimented technique is nothing but a syndrome coding algorithm with a coset based approach, analyzed results are showing that the examined method has more flexibility to choose coset, also providing less modification distortion caused by data hiding. Analyzed method presented by clear mathematical way. As it is mathematical equation dependent, hence analyzed results are showing that the analyzed method has fast computation ability and find perfect roots for modification.

  5. List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes

    DEFF Research Database (Denmark)

    Hernando, Fernando; Høholdt, Tom; Ruano, Diego

    2012-01-01

    A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list...... decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units....

  6. List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes

    OpenAIRE

    Hernando, Fernando; Høholdt, Tom; Ruano, Diego

    2012-01-01

    A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units.

  7. Learning geometry and visuo-spatial abilities through coding

    Directory of Open Access Journals (Sweden)

    Martina Sabatini

    2016-04-01

    Full Text Available This paper deals with the theme of coding, focusing particularly on its introduction in a specific primary school curriculum. The work presents the PhD research project “Learning geometry and visuo-spatial abilities through coding”. The project, which is not yet concluded, aims to reflect on the possibility of introducing coding activities within the primary school curricula of geometry of third graders, in order to study if and how these activities affect learning geometry and visuo-spatial abilities. To do so, the processes of teaching and learning of experimental classes (those in which coding activities take place and control classes (those in which coding activities do not take place will be compared, both in terms of quantity and quality. The classes has been chosen according to a uniformity requirement with respect to the starting points of geometrical knowledge and visuo-spatial abilities. L’apprendimento di conoscenze geometriche e abilità visuo-spaziali attraverso il codingIl presente lavoro affronta la tematica del coding focalizzandosi in particolar modo sulla sua introduzione in uno specifico curricolo di scuola primaria. Viene presentato il progetto di ricerca di dottorato “L’apprendimento di conoscenze geometriche e abilità visuo-spaziali attraverso il coding”. Il progetto, non ancora concluso, intende riflettere sulla possibilità di introdurre attività di coding all’interno dei curricoli di geometria delle classi terze di scuola primaria, al fine di studiare se e come questo tipo di attività influisca sull’acquisizione di apprendimenti geometrici e abilità visuo-spaziali. Per farlo, verranno confrontati, sia in termini quantitativi che qualitativi, i processi di insegnamento-apprendimento di classi sperimentali (quelle in cui avvengono attività di coding e di classi di controllo (quelle in cui non avvengono attività di coding. Le classi sono state scelte secondo un criterio di omogeneità relativamente

  8. Simulation of a transient with loss of primary coolant due to a small rupture in Angra 2 nuclear power plant with RELAP5/MOD3.2.2G code; Simulacao de um acidente postulado de perda de refrigerante primario por pequena ruptura na usina de Angra 2 com o codigo RELAP5/MOD3.2.2G

    Energy Technology Data Exchange (ETDEWEB)

    Sabundjian, Gaiane; Andrade, Delvonei Alves de [Instituto de Pesquisas Energeticas e Nucleares (IPEN), Sao Paulo, SP (Brazil)

    2002-07-01

    This paper presents a nodalization for Angra 2 Nuclear Power Plant, as well as the results obtained for a Small Break Loss of Coolant Accident (SBLOCA), simulated with RELAP5/MOD3.2G code. This accident consists in a small break (380 m{sup 2}) in the line of the Emergency Core Coolant System (ECCS) in loop 20 of Angra 2. Results are not as expected, however they are satisfactory regarding the nodalization used. (author)

  9. An Interactive Concatenated Turbo Coding System

    Science.gov (United States)

    Liu, Ye; Tang, Heng; Lin, Shu; Fossorier, Marc

    1999-01-01

    This paper presents a concatenated turbo coding system in which a Reed-Solomon outer code is concatenated with a binary turbo inner code. In the proposed system, the outer code decoder and the inner turbo code decoder interact to achieve both good bit error and frame error performances. The outer code decoder helps the inner turbo code decoder to terminate its decoding iteration while the inner turbo code decoder provides soft-output information to the outer code decoder to carry out a reliability-based soft- decision decoding. In the case that the outer code decoding fails, the outer code decoder instructs the inner code decoder to continue its decoding iterations until the outer code decoding is successful or a preset maximum number of decoding iterations is reached. This interaction between outer and inner code decoders reduces decoding delay. Also presented in the paper are an effective criterion for stopping the iteration process of the inner code decoder and a new reliability-based decoding algorithm for nonbinary codes.

  10. Type Ⅱ codes over finite rings

    Institute of Scientific and Technical Information of China (English)

    DOUGHERTY; Steven; T

    2010-01-01

    In this paper,we generalize the concept of Type Ⅱ codes to arbitrary finite rings. We focus on Type Ⅱ codes over finite chain rings and use the Chinese Remainder Theorem on these codes to study Type Ⅱ codes over principal ideal rings.

  11. SPARSE SEQUENCE CONSTRUCTION OF LDPC CODES

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    This letter proposes a novel and simple construction of regular Low-Density Parity-Check (LDPC) codes using sparse binary sequences. It utilizes the cyclic cross correlation function of sparse sequences to generate codes with girth8. The new codes perform well using the sumproduct decoding. Low encodingcomplexity can also be achieved due to the inherent quasi-cyclic structure of the codes.

  12. TOCAR: a code to interface FOURACES - CARNAVAL

    Energy Technology Data Exchange (ETDEWEB)

    Panini, G.C.; Vaccari, M.

    1981-08-01

    The TOCAR code, written in FORTRAN-IV for IBM-370 computers, is an interface between the output of the FOURACES code and the CARNAVAL binary format for the multigroup neutron cross-sections, scattering matrices and related quantities. Besides the description of the code and the how to use, the report contains the code listing.

  13. The Minimum Distance of Graph Codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2011-01-01

    We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...

  14. Channel coding techniques for wireless communications

    CERN Document Server

    Deergha Rao, K

    2015-01-01

    The book discusses modern channel coding techniques for wireless communications such as turbo codes, low-density parity check (LDPC) codes, space–time (ST) coding, RS (or Reed–Solomon) codes and convolutional codes. Many illustrative examples are included in each chapter for easy understanding of the coding techniques. The text is integrated with MATLAB-based programs to enhance the understanding of the subject’s underlying theories. It includes current topics of increasing importance such as turbo codes, LDPC codes, Luby transform (LT) codes, Raptor codes, and ST coding in detail, in addition to the traditional codes such as cyclic codes, BCH (or Bose–Chaudhuri–Hocquenghem) and RS codes and convolutional codes. Multiple-input and multiple-output (MIMO) communications is a multiple antenna technology, which is an effective method for high-speed or high-reliability wireless communications. PC-based MATLAB m-files for the illustrative examples are provided on the book page on Springer.com for free dow...

  15. Overview of CODE V development

    Science.gov (United States)

    Harris, Thomas I.

    1991-01-01

    This paper is part of a session that is aimed at briefly describing some of today''s optical design software packages with emphasis on the program''s philosophy and technology. CODE V is the ongoing result of a development process that began in the 1960''s it is now the result of many people''s efforts. This paper summarizes the roots of the program some of its history dominant philosophies and technologies that have contributed to its usefulness and some that drive its continued development. ROOTS OF CODE V Conceived in the early 60''s This was at a time when there was skepticism that " automatic design" could design lenses equal or better than " hand" methods. The concepts underlying CODE V and its predecessors were based on ten years of experience and exposure to the problems of a group of lens designers in a design-for-manufacture environment. The basic challenge was to show that lens design could be done better easier and faster by high quality computer-assisted design tools. The earliest development was for our own use as an engineering services organization -an in-house tool for custom design. As a tool it had to make us efficient in providing lens design and engineering services as a self-sustaining business. PHILOSOPHY OF OVTIM!ZATION IN CODE V Error function formation Based on experience as a designer we felt very strongly that there should be a clear separation of

  16. Pol II CTD Code Light.

    Science.gov (United States)

    Corden, Jeffry L

    2016-01-21

    In this issue of Molecular Cell, Schüller et al. (2016) and Suh et al. (2016) describe genetic and mass spectrometry methodologies for mapping phosphorylation sites on the tandem repeats of the RNA polymerase II CTD. The results suggest that the CTD Code may be simpler than expected.

  17. Coding as literacy metalithikum IV

    CERN Document Server

    Bühlmann, Vera; Moosavi, Vahid

    2015-01-01

    Recent developments in computer science, particularly "data-driven procedures" have opened a new level of design and engineering. This has also affected architecture. The publication collects contributions on Coding as Literacy by computer scientists, mathematicians, philosophers, cultural theorists, and architects. "Self-Organizing Maps" (SOM) will serve as the concrete reference point for all further discussions.

  18. CVSscan : Visualization of Code Evolution

    NARCIS (Netherlands)

    Voinea, Lucian; Telea, Alex; Wijk, Jarke J. van

    2005-01-01

    During the life cycle of a software system, the source code is changed many times. We study how developers can be enabled to get insight in these changes, in order to understand the status, history and structure better, as well as for instance the roles played by various contributors. We present CVS

  19. Corrections to the Vienna Code

    Science.gov (United States)

    Since the publication of the Vienna Code, several errors have been noticed. Most are minor punctuation or cross-referencing errors, or, in the Appendices, inconsistencies in abbreviation, but there was one important omission from Art. 37, the misspelling of two specific epithets and the transpositio...

  20. Coded continuous wave meteor radar

    Science.gov (United States)

    Vierinen, Juha; Chau, Jorge L.; Pfeffer, Nico; Clahsen, Matthias; Stober, Gunter

    2016-03-01

    The concept of a coded continuous wave specular meteor radar (SMR) is described. The radar uses a continuously transmitted pseudorandom phase-modulated waveform, which has several advantages compared to conventional pulsed SMRs. The coding avoids range and Doppler aliasing, which are in some cases problematic with pulsed radars. Continuous transmissions maximize pulse compression gain, allowing operation at lower peak power than a pulsed system. With continuous coding, the temporal and spectral resolution are not dependent on the transmit waveform and they can be fairly flexibly changed after performing a measurement. The low signal-to-noise ratio before pulse compression, combined with independent pseudorandom transmit waveforms, allows multiple geographically separated transmitters to be used in the same frequency band simultaneously without significantly interfering with each other. Because the same frequency band can be used by multiple transmitters, the same interferometric receiver antennas can be used to receive multiple transmitters at the same time. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large-scale multi-static network of meteor radar transmitters and receivers. Such a system would be useful for increasing the number of meteor detections to obtain improved meteor radar data products.

  1. QR Codes: Taking Collections Further

    Science.gov (United States)

    Ahearn, Caitlin

    2014-01-01

    With some thought and direction, QR (quick response) codes are a great tool to use in school libraries to enhance access to information. From March through April 2013, Caitlin Ahearn interned at Sanborn Regional High School (SRHS) under the supervision of Pam Harland. As a result of Harland's un-Deweying of the nonfiction collection at SRHS,…

  2. Surgical navigation with QR codes

    Directory of Open Access Journals (Sweden)

    Katanacho Manuel

    2016-09-01

    Full Text Available The presented work is an alternative to established measurement systems in surgical navigation. The system is based on camera based tracking of QR code markers. The application uses a single video camera, integrated in a surgical lamp, that captures the QR markers attached to surgical instruments and to the patient.

  3. Continuous Non-malleable Codes

    DEFF Research Database (Denmark)

    Faust, Sebastian; Mukherjee, Pratyay; Nielsen, Jesper Buus

    2014-01-01

    is based on the inner product function, collision-resistant hashing and non-interactive zero-knowledge proofs of knowledge and requires an untamperable common reference string. We apply continuous non-malleable codes to protect arbitrary cryptographic primitives against tampering attacks. Previous...

  4. Unconditional Continuous Variable Dense Coding

    CERN Document Server

    Ralph, T C

    2002-01-01

    We investigate the conditions under which unconditional dense coding can be achieved using continuous variable entanglement. We consider the effect of entanglement impurity and detector efficiency and discuss experimental verification. We conclude that the requirements for a strong demonstration are not as stringent as previously thought and are within the reach of present technology.

  5. Language Recognition via Sparse Coding

    Science.gov (United States)

    2016-09-08

    target language lT ) from the two pipelines. We can also think of more sophis- ticated fusion schemes on logistic regression and neural net - works. Table...vol. 16, no. 5, pp. 980–988, July 2008. [6] G. Sivaram, S. K. Nemala, M. Elhilali, T. D. Tran, and H. Herman- sky , “Sparse Coding for Speech

  6. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani

    2015-01-01

    Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage buffe...

  7. Reusable State Machine Code Generator

    Science.gov (United States)

    Hoffstadt, A. A.; Reyes, C.; Sommer, H.; Andolfato, L.

    2010-12-01

    The State Machine model is frequently used to represent the behaviour of a system, allowing one to express and execute this behaviour in a deterministic way. A graphical representation such as a UML State Chart diagram tames the complexity of the system, thus facilitating changes to the model and communication between developers and domain experts. We present a reusable state machine code generator, developed by the Universidad Técnica Federico Santa María and the European Southern Observatory. The generator itself is based on the open source project architecture, and uses UML State Chart models as input. This allows for a modular design and a clean separation between generator and generated code. The generated state machine code has well-defined interfaces that are independent of the implementation artefacts such as the middle-ware. This allows using the generator in the substantially different observatory software of the Atacama Large Millimeter Array and the ESO Very Large Telescope. A project-specific mapping layer for event and transition notification connects the state machine code to its environment, which can be the Common Software of these projects, or any other project. This approach even allows to automatically create tests for a generated state machine, using techniques from software testing, such as path-coverage.

  8. Code Properties from Holographic Geometries

    Science.gov (United States)

    Pastawski, Fernando; Preskill, John

    2017-04-01

    Almheiri, Dong, and Harlow [J. High Energy Phys. 04 (2015) 163., 10.1007/JHEP04(2015)163] proposed a highly illuminating connection between the AdS /CFT holographic correspondence and operator algebra quantum error correction (OAQEC). Here, we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes that admit a holographic interpretation. We introduce a new quantity called price, which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit uberholography, meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for quantum gravity in AdS space at distance scales that are small compared to the AdS curvature radius.

  9. Code Properties from Holographic Geometries

    Directory of Open Access Journals (Sweden)

    Fernando Pastawski

    2017-05-01

    Full Text Available Almheiri, Dong, and Harlow [J. High Energy Phys. 04 (2015 163.JHEPFG1029-847910.1007/JHEP04(2015163] proposed a highly illuminating connection between the AdS/CFT holographic correspondence and operator algebra quantum error correction (OAQEC. Here, we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes that admit a holographic interpretation. We introduce a new quantity called price, which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit uberholography, meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for quantum gravity in AdS space at distance scales that are small compared to the AdS curvature radius.

  10. Ex-vessel break in ITER divertor cooling loop analysis with the ECART code

    CERN Document Server

    Cambi, G; Parozzi, F; Porfiri, MT

    2003-01-01

    A hypothetical double-ended pipe rupture in the ex-vessel section of the International Thermonuclear Experimental Reactor (ITER) divertor primary heat transfer system during pulse operation has been assessed using the nuclear source term ECART code. That code was originally designed and validated for traditional nuclear power plant safety analyses, and has been internationally recognized as a relevant nuclear source term codes for nuclear fission plants. It permits the simulation of chemical reactions and transport of radioactive gases and aerosols under two-phase flow transients in generic flow systems, using a built-in thermal-hydraulic model. A comparison with the results given in ITER Generic Site Safety Report, obtained using a thermal-hydraulic system code (ATHENA), a containment code (INTRA) and an aerosol transportation code (NAUA), in a sequential way, is also presented and discussed.

  11. A Literature Review of Code Clone Analysis to Improve Software Maintenance Process

    CERN Document Server

    Morshed, Md Monzur; Ahmed, Salah Uddin

    2012-01-01

    Software systems are getting more complex as the system grows where maintaining such system is a primary concern for the industry. Code clone is one of the factors making software maintenance more difficult. It is a process of replicating code blocks by copy-and-paste that is common in software development. In the beginning stage of the project, developers find it easy and time consuming though it has crucial drawbacks in the long run. There are two types of researchers where some researchers think clones lead to additional changes during maintenance phase, in later stage increase the overall maintenance effort. On the other hand, some researchers think that cloned codes are more stable than non cloned codes. In this study, we discussed Code Clones and different ideas, methods, clone detection tools, related research on code clone, case study.

  12. New Technique for Improving Performance of LDPC Codes in the Presence of Trapping Sets

    Directory of Open Access Journals (Sweden)

    Mohamed Adnan Landolsi

    2008-06-01

    Full Text Available Trapping sets are considered the primary factor for degrading the performance of low-density parity-check (LDPC codes in the error-floor region. The effect of trapping sets on the performance of an LDPC code becomes worse as the code size decreases. One approach to tackle this problem is to minimize trapping sets during LDPC code design. However, while trapping sets can be reduced, their complete elimination is infeasible due to the presence of cycles in the underlying LDPC code bipartite graph. In this work, we introduce a new technique based on trapping sets neutralization to minimize the negative effect of trapping sets under belief propagation (BP decoding. Simulation results for random, progressive edge growth (PEG and MacKay LDPC codes demonstrate the effectiveness of the proposed technique. The hardware cost of the proposed technique is also shown to be minimal.

  13. Transversal Clifford gates on folded surface codes

    Science.gov (United States)

    Moussa, Jonathan E.

    2016-10-01

    Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and correct errors, while color codes have transversal Clifford gates and better code efficiency in the number of physical qubits needed to achieve a given code distance. A formal equivalence exists between color codes and folded surface codes, but it does not guarantee the transferability of any of these favorable properties. However, the equivalence does imply the existence of constant-depth circuit implementations of logical Clifford gates on folded surface codes. We achieve and improve this result by constructing two families of folded surface codes with transversal Clifford gates. This construction is presented generally for qudits of any dimension. The specific application of these codes to universal quantum computation based on qubit fusion is also discussed.

  14. Understanding Code Patterns - Analysis, Interpretation & Measurement

    CERN Document Server

    Dundas, Jitesh

    2011-01-01

    This research paper aims to find, analyze and understand code patterns in any software system and measure its quality by defining standards and proposing a formula for the same. Every code that is written can be divided into different code segments, each having its own impact on the overall system. We can analyze these code segments to get the code quality. The measures used in this paper include Lines of Code, Number of calls made by a module, Execution time, the system knowledge of user and developers, the use of generalization, inheritance, reusability and other object-oriented concepts. The entire software code is divided into code snippets, based on the logic that they implement. Each of these code snippets has an impact. This measure is called Impact Factor and is valued by the software developer and/or other system stakeholders. Efficiency = (Code Area / Execution Time) * Qr

  15. The Initial Atmospheric Transport (IAT) Code: Description and Validation

    Energy Technology Data Exchange (ETDEWEB)

    Morrow, Charles W. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Bartel, Timothy James [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-10-01

    The Initial Atmospheric Transport (IAT) computer code was developed at Sandia National Laboratories as part of their nuclear launch accident consequences analysis suite of computer codes. The purpose of IAT is to predict the initial puff/plume rise resulting from either a solid rocket propellant or liquid rocket fuel fire. The code generates initial conditions for subsequent atmospheric transport calculations. The Initial Atmospheric Transfer (IAT) code has been compared to two data sets which are appropriate to the design space of space launch accident analyses. The primary model uncertainties are the entrainment coefficients for the extended Taylor model. The Titan 34D accident (1986) was used to calibrate these entrainment settings for a prototypic liquid propellant accident while the recent Johns Hopkins University Applied Physics Laboratory (JHU/APL, or simply APL) large propellant block tests (2012) were used to calibrate the entrainment settings for prototypic solid propellant accidents. North American Meteorology (NAM )formatted weather data profiles are used by IAT to determine the local buoyancy force balance. The IAT comparisons for the APL solid propellant tests illustrate the sensitivity of the plume elevation to the weather profiles; that is, the weather profile is a dominant factor in determining the plume elevation. The IAT code performed remarkably well and is considered validated for neutral weather conditions.

  16. A class of Sudan-decodable codes

    DEFF Research Database (Denmark)

    Nielsen, Rasmus Refslund

    2000-01-01

    In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based...... on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made....

  17. On Code Parameters and Coding Vector Representation for Practical RLNC

    DEFF Research Database (Denmark)

    Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

    2011-01-01

    RLNC provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the encoding vector. Increasing the field size and generation size presents a fundamental trade-off between packet-based throughput...... and operational overhead. On the one hand, decreasing the probability of transmitting redundant packets is beneficial for throughput and, consequently, reduces transmission energy. On the other hand, the decoding complexity and amount of header overhead increase with field size and generation length, leading...... to higher energy consumption. Therefore, the optimal trade-off is system and topology dependent, as it depends on the cost in energy of performing coding operations versus transmitting data. We show that moderate field sizes are the correct choice when trade-offs are considered. The results show that sparse...

  18. Code Carnivals: resuscitating Code Blue training with accelerated learning.

    Science.gov (United States)

    Keys, Vicky A; Malone, Peggy; Brim, Carla; Schoonover, Heather; Nordstrom, Cindy; Selzler, Melissa

    2009-12-01

    Nurses in the hospital setting must be knowledgeable about resuscitation procedures and proficient in the delivery of care during an emergency. They must be ready to implement their knowledge and skills at a moment's notice. A common dilemma for many nurses is that cardiopulmonary emergencies (Code Blues) are infrequent occurrences. Therefore, how do nurses remain competent and confident in their implementation of emergency skills while having limited exposure to the equipment and minimal experience in emergency situations? A team of nurse educators at a regional medical center in Washington State applied adult learning theory and accelerated learning techniques to develop and present a series of learning activities to enhance the staff's familiarity with emergency equipment and procedures. The series began with a carnival venue that provided hands-on practice and review of emergency skills and was reinforced with subsequent random unannounced code drills led by both educators and charge nurses. Copyright 2009, SLACK Incorporated.

  19. Properties of Codes in the Johnson Scheme

    CERN Document Server

    Silberstein, Natalia

    2010-01-01

    Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect codes over finite fields are known, in the Johnson metric it was conjectured by Delsarte in 1970's that there are no nontrivial perfect codes. The general nonexistence proof still remains the open problem. In this work we examine constant weight codes as well as doubly constant weight codes, and reduce the range of parameters in which perfect codes may exist in both cases. We start with the constant weight codes. We introduce an improvement of Roos' bound for one-perfect codes, and present some new divisibility conditions, which are based on the connection between perfect codes in Johnson graph J(n,w) and block designs. Next, we consider binomial moments for perfect codes. We show which parameters can be excluded for one-perfect codes. We examine two-perfect codes in J(2w,w) a...

  20. Evaluation Codes from an Affine Veriety Code Perspective

    DEFF Research Database (Denmark)

    Geil, Hans Olav

    2008-01-01

    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 4.2 Affine variety codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 4.3 Some Gr¨obner basis theoretical tools . . . . . . . . . . . . . . . . . . . . . . . 155 4.4 A bound on the minimum distance of C(I,L) . . . . . . . . . . . . . . . . . . 157 4.5 The Feng-Rao bound...... for C(I,L)? . . . . . . . . . . . . . . . . . . . . . . . . 160 4.6 Using weighted degree orderings . . . . . . . . . . . . . . . . . . . . . . . . . 163 4.7 The order domain conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . 168 4.8 Weight functions and order domains...

  1. A NOVEL VARIABLE-LENGTH CODE FOR ROBUST VIDEO CODING

    Institute of Scientific and Technical Information of China (English)

    Ma Linhua; Chang Yilin

    2006-01-01

    A novel Variable-Length Code (VLC), called Alternate VLC (AVLC), is proposed in this letter,which employs two types of VLC to encode source symbols alternately. Its advantage is that it can not only stop the symbol error propagation effect, but also correct symbol insertion errors and avoid symbol deletion errors, so the original sequence number of symbols can be kept correctly, which is very important in video communication.

  2. STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM

    Directory of Open Access Journals (Sweden)

    H. Prashantha Kumar

    2012-03-01

    Full Text Available The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4 and (16, 11 extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.

  3. Code-excited linear predictive coding of multispectral MR images

    Science.gov (United States)

    Hu, Jian-Hong; Wang, Yao; Cahill, Patrick

    1996-02-01

    This paper reports a multispectral code excited linear predictive coding method for the compression of well-registered multispectral MR images. Different linear prediction models and the adaptation schemes have been compared. The method which uses forward adaptive autoregressive (AR) model has proven to achieve a good compromise between performance, complexity and robustness. This approach is referred to as the MFCELP method. Given a set of multispectral images, the linear predictive coefficients are updated over non-overlapping square macroblocks. Each macro-block is further divided into several micro-blocks and, the best excitation signals for each microblock are determined through an analysis-by-synthesis procedure. To satisfy the high quality requirement for medical images, the error between the original images and the synthesized ones are further specified using a vector quantizer. The MFCELP method has been applied to 26 sets of clinical MR neuro images (20 slices/set, 3 spectral bands/slice, 256 by 256 pixels/image, 12 bits/pixel). It provides a significant improvement over the discrete cosine transform (DCT) based JPEG method, a wavelet transform based embedded zero-tree wavelet (EZW) coding method, as well as the MSARMA method we developed before.

  4. TASS/SMR Code Topical Report for SMART Plant, Vol. I: Code Structure, System Models, and Solution Methods

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Young Jong; Kim, Soo Hyoung; Kim, See Darl (and others)

    2008-10-15

    The TASS/SMR code has been developed with domestic technologies for the safety analysis of the SMART plant which is an integral type pressurized water reactor. It can be applied to the analysis of design basis accidents including non-LOCA (loss of coolant accident) and LOCA of the SMART plant. The TASS/SMR code can be applied to any plant regardless of the structural characteristics of a reactor since the code solves the same governing equations for both the primary and secondary system. The code has been developed to meet the requirements of the safety analysis code. This report describes the overall structure of the TASS/SMR, input processing, and the processes of a steady state and transient calculations. In addition, basic differential equations, finite difference equations, state relationships, and constitutive models are described in the report. First, the conservation equations, a discretization process for numerical analysis, search method for state relationship are described. Then, a core power model, heat transfer models, physical models for various components, and control and trip models are explained.

  5. Performance Comparison of Turbo Codes with other Forward Error Correcting Codes

    Directory of Open Access Journals (Sweden)

    Kapil Narwal

    2012-03-01

    Full Text Available : In this paper, we compare performance of turbo codes with different FEC codes presented in literatures. Performance and overall coding gain are compared for Convolutional codes, CTC, TPC and LDPC codes. Turbo Codes tend to work best at low code rates and not so well at high code rates. LDPC’s work very well at high code rates and at low code rates LDPC’s Performance can be very close to Shannon capacity. The decoder complexity of TPC is much less than the Convolutional Turbo Codes (CTC. The performance of TPC is close to capacity for higher code rates, but is not great for low code rates where CTC outperforms.Index terms —

  6. The Mystery Behind the Code: Differentiated Instruction with Quick Response Codes in Secondary Physical Education

    Science.gov (United States)

    Adkins, Megan; Wajciechowski, Misti R.; Scantling, Ed

    2013-01-01

    Quick response codes, better known as QR codes, are small barcodes scanned to receive information about a specific topic. This article explains QR code technology and the utility of QR codes in the delivery of physical education instruction. Consideration is given to how QR codes can be used to accommodate learners of varying ability levels as…

  7. Clean Code - Why you should care

    CERN Document Server

    CERN. Geneva

    2015-01-01

    - Martin Fowler Writing code is communication, not solely with the computer that executes it, but also with other developers and with oneself. A developer spends a lot of his working time reading and understanding code that was written by other developers or by himself in the past. The readability of the code plays an important factor for the time to find a bug or add new functionality, which in turn has a big impact on the productivity. Code that is difficult to undestand, hard to maintain and refactor, and offers many spots for bugs to hide is not considered to be "clean code". But what could considered as "clean code" and what are the advantages of a strict application of its guidelines? In this presentation we will take a look on some typical "code smells" and proposed guidelines to improve your coding skills to write cleaner code that is less bug prone and better to maintain.

  8. The EGS5 Code System

    Energy Technology Data Exchange (ETDEWEB)

    Hirayama, Hideo; Namito, Yoshihito; /KEK, Tsukuba; Bielajew, Alex F.; Wilderman, Scott J.; U., Michigan; Nelson, Walter R.; /SLAC

    2005-12-20

    In the nineteen years since EGS4 was released, it has been used in a wide variety of applications, particularly in medical physics, radiation measurement studies, and industrial development. Every new user and every new application bring new challenges for Monte Carlo code designers, and code refinements and bug fixes eventually result in a code that becomes difficult to maintain. Several of the code modifications represented significant advances in electron and photon transport physics, and required a more substantial invocation than code patching. Moreover, the arcane MORTRAN3[48] computer language of EGS4, was highest on the complaint list of the users of EGS4. The size of the EGS4 user base is difficult to measure, as there never existed a formal user registration process. However, some idea of the numbers may be gleaned from the number of EGS4 manuals that were produced and distributed at SLAC: almost three thousand. Consequently, the EGS5 project was undertaken. It was decided to employ the FORTRAN 77 compiler, yet include as much as possible, the structural beauty and power of MORTRAN3. This report consists of four chapters and several appendices. Chapter 1 is an introduction to EGS5 and to this report in general. We suggest that you read it. Chapter 2 is a major update of similar chapters in the old EGS4 report[126] (SLAC-265) and the old EGS3 report[61] (SLAC-210), in which all the details of the old physics (i.e., models which were carried over from EGS4) and the new physics are gathered together. The descriptions of the new physics are extensive, and not for the faint of heart. Detailed knowledge of the contents of Chapter 2 is not essential in order to use EGS, but sophisticated users should be aware of its contents. In particular, details of the restrictions on the range of applicability of EGS are dispersed throughout the chapter. First-time users of EGS should skip Chapter 2 and come back to it later if necessary. With the release of the EGS4 version

  9. Do you write secure code?

    CERN Multimedia

    Computer Security Team

    2011-01-01

    At CERN, we are excellent at producing software, such as complex analysis jobs, sophisticated control programs, extensive monitoring tools, interactive web applications, etc. This software is usually highly functional, and fulfils the needs and requirements as defined by its author. However, due to time constraints or unintentional ignorance, security aspects are often neglected. Subsequently, it was even more embarrassing for the author to find out that his code flawed and was used to break into CERN computers, web pages or to steal data…   Thus, if you have the pleasure or task of producing software applications, take some time before and familiarize yourself with good programming practices. They should not only prevent basic security flaws in your code, but also improve its readability, maintainability and efficiency. Basic rules for good programming, as well as essential books on proper software development, can be found in the section for software developers on our security we...

  10. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani;

    2015-01-01

    Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage...... buffering, scheduling, and processing over the network. On the other hand, NC has shown great potential for increasing robustness and performance when deployed on intermediate nodes in the network. This new paradigm changes the dynamics of network protocols, requiring new designs that exploit its potential....... This paper advocates for the use of SDN to bring about future Internet and 5G network services by incorporating network coding (NC) functionalities. The inherent flexibility of both SDN and NC provides a fertile ground to envision more efficient, robust, and secure networking designs, that may also...

  11. The Accurate Particle Tracer Code

    CERN Document Server

    Wang, Yulei; Qin, Hong; Yu, Zhi

    2016-01-01

    The Accurate Particle Tracer (APT) code is designed for large-scale particle simulations on dynamical systems. Based on a large variety of advanced geometric algorithms, APT possesses long-term numerical accuracy and stability, which are critical for solving multi-scale and non-linear problems. Under the well-designed integrated and modularized framework, APT serves as a universal platform for researchers from different fields, such as plasma physics, accelerator physics, space science, fusion energy research, computational mathematics, software engineering, and high-performance computation. The APT code consists of seven main modules, including the I/O module, the initialization module, the particle pusher module, the parallelization module, the field configuration module, the external force-field module, and the extendible module. The I/O module, supported by Lua and Hdf5 projects, provides a user-friendly interface for both numerical simulation and data analysis. A series of new geometric numerical methods...

  12. Hello Ruby adventures in coding

    CERN Document Server

    Liukas, Linda

    2015-01-01

    "Code is the 21st century literacy and the need for people to speak the ABCs of Programming is imminent." --Linda Liukas Meet Ruby--a small girl with a huge imagination. In Ruby's world anything is possible if you put your mind to it. When her dad asks her to find five hidden gems Ruby is determined to solve the puzzle with the help of her new friends, including the Wise Snow Leopard, the Friendly Foxes, and the Messy Robots. As Ruby stomps around her world kids will be introduced to the basic concepts behind coding and programming through storytelling. Learn how to break big problems into small problems, repeat tasks, look for patterns, create step-by-step plans, and think outside the box. With hands-on activities included in every chapter, future coders will be thrilled to put their own imaginations to work.

  13. XSTAR Code and Database Status

    Science.gov (United States)

    Kallman, Timothy R.

    2017-08-01

    The XSTAR code is a simulation tool for calculating spectra associated with plasmas which are in a time-steady balance among the microphysical processes. It allows for treatment of plasmas which are exposed to illumination by energetic photons, but also treats processes relevant to collision-dominated plasmas. Processes are treated in a full collisional-radiative formalism which includes convergence to local thermodynamic equilibrium under suitable conditions. It features an interface to the most widely used software for fitting to astrophysical spectra, and has also been compared with laboratory plasma experiments. This poster will describe the recent updates to XSTAR, including atomic data, new features, and some recent applications of the code.

  14. Code Development for Collective Effects

    CERN Document Server

    Bruce Li, Kevin Shing; Hegglin, Stefan Eduard; Iadarola, Giovanni; Oeftiger, Adrian; Passarelli, Andrea; Romano, Annalisa; Rumolo, Giovanni; Schenk, Michael; CERN. Geneva. ATS Department

    2016-01-01

    The presentation will cover approaches and strategies of modeling and implementing collective effects in modern simulation codes. We will review some of the general approaches to numerically model collective beam dynamics in circular accelerators. We will then look into modern ways of implementing collective effects with a focus on plainness, modularity and flexibility, using the example of the PyHEADTAIL framework, and highlight some of the advantages and drawbacks emerging from this method. To ameliorate one of the main drawbacks, namely a potential loss of performance compared to the classical fully compiled codes, several options for speed improvements will be mentioned and discussed. Finally some examples and applications will be shown together with future plans and perspectives.

  15. Introduction of the ASGARD Code

    Science.gov (United States)

    Bethge, Christian; Winebarger, Amy; Tiwari, Sanjiv; Fayock, Brian

    2017-01-01

    ASGARD stands for 'Automated Selection and Grouping of events in AIA Regional Data'. The code is a refinement of the event detection method in Ugarte-Urra & Warren (2014). It is intended to automatically detect and group brightenings ('events') in the AIA EUV channels, to record event parameters, and to find related events over multiple channels. Ultimately, the goal is to automatically determine heating and cooling timescales in the corona and to significantly increase statistics in this respect. The code is written in IDL and requires the SolarSoft library. It is parallelized and can run with multiple CPUs. Input files are regions of interest (ROIs) in time series of AIA images from the JSOC cutout service (http://jsoc.stanford.edu/ajax/exportdata.html). The ROIs need to be tracked, co-registered, and limited in time (typically 12 hours).

  16. Enhanced motion coding in MC-EZBC

    Science.gov (United States)

    Chen, Junhua; Zhang, Wenjun; Wang, Yingkun

    2005-07-01

    Since hierarchical variable size block matching and bidirectional motion compensation are used in the motioncompensated embedded zero block coding (MC-EZBC), the motion information consists of motion vector quadtree map and motion vectors. In the conventional motion coding scheme, the quadtree structure is coded directly, the motion vector modes are coded with Huffman codes, and the motion vector differences are coded by an m-ary arithmetic coder with 0-order models. In this paper we propose a new motion coding scheme which uses an extension of the CABAC algorithm and new context modeling for quadtree structure coding and mode coding. In addition, we use a new scalable motion coding method which scales the motion vector quadtrees according to the rate-distortion slope of the tree nodes. Experimental results show that the new coding scheme increases the efficiency of the motion coding by more than 25%. The performance of the system is improved accordingly, especially in low bit rates. Moreover, with the scalable motion coding, the subjective and objective coding performance is further enhanced in low bit rate scenarios.

  17. Coherence protection by random coding

    Energy Technology Data Exchange (ETDEWEB)

    Brion, E [Laboratoire Aime Cotton, CNRS II, Batiment 505, 91405 Orsay Cedex (France); Akulin, V M [Laboratoire Aime Cotton, CNRS II, Batiment 505, 91405 Orsay Cedex (France); Dumer, I [College of Engineering, University of California, Riverside, CA 92521 (United States); Harel, G [Spinoza Institute, Utrecht University, Leuvenlaan 4, 3508 TD Utrecht (Netherlands); Kurizki, G [Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100 (Israel)

    2005-10-01

    We show that the multidimensional Zeno effect combined with non-holonomic control allows one to efficiently protect quantum systems from decoherence by a method similar to classical random coding. The method is applicable to arbitrary error-inducing Hamiltonians and general quantum systems. The quantum encoding approaches the Hamming upper bound for large dimension increases. Applicability of the method is demonstrated with a seven-qubit toy computer.

  18. Future trends in image coding

    Science.gov (United States)

    Habibi, Ali

    1993-01-01

    The objective of this article is to present a discussion on the future of image data compression in the next two decades. It is virtually impossible to predict with any degree of certainty the breakthroughs in theory and developments, the milestones in advancement of technology and the success of the upcoming commercial products in the market place which will be the main factors in establishing the future stage to image coding. What we propose to do, instead, is look back at the progress in image coding during the last two decades and assess the state of the art in image coding today. Then, by observing the trends in developments of theory, software, and hardware coupled with the future needs for use and dissemination of imagery data and the constraints on the bandwidth and capacity of various networks, predict the future state of image coding. What seems to be certain today is the growing need for bandwidth compression. The television is using a technology which is half a century old and is ready to be replaced by high definition television with an extremely high digital bandwidth. Smart telephones coupled with personal computers and TV monitors accommodating both printed and video data will be common in homes and businesses within the next decade. Efficient and compact digital processing modules using developing technologies will make bandwidth compressed imagery the cheap and preferred alternative in satellite and on-board applications. In view of the above needs, we expect increased activities in development of theory, software, special purpose chips and hardware for image bandwidth compression in the next two decades. The following sections summarize the future trends in these areas.

  19. Gray Code for Cayley Permutations

    Directory of Open Access Journals (Sweden)

    J.-L. Baril

    2003-10-01

    Full Text Available A length-n Cayley permutation p of a total ordered set S is a length-n sequence of elements from S, subject to the condition that if an element x appears in p then all elements y < x also appear in p . In this paper, we give a Gray code list for the set of length-n Cayley permutations. Two successive permutations in this list differ at most in two positions.

  20. Coded continuous wave meteor radar

    Science.gov (United States)

    Chau, J. L.; Vierinen, J.; Pfeffer, N.; Clahsen, M.; Stober, G.

    2016-12-01

    The concept of a coded continuous wave specular meteor radar (SMR) is described. The radar uses a continuously transmitted pseudorandom phase-modulated waveform, which has several advantages compared to conventional pulsed SMRs. The coding avoids range and Doppler aliasing, which are in some cases problematic with pulsed radars. Continuous transmissions maximize pulse compression gain, allowing operation at lower peak power than a pulsed system. With continuous coding, the temporal and spectral resolution are not dependent on the transmit waveform and they can be fairly flexibly changed after performing a measurement. The low signal-to-noise ratio before pulse compression, combined with independent pseudorandom transmit waveforms, allows multiple geographically separated transmitters to be used in the same frequency band simultaneously without significantly interfering with each other. Because the same frequency band can be used by multiple transmitters, the same interferometric receiver antennas can be used to receive multiple transmitters at the same time. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large-scale multi-static network of meteor radar transmitters and receivers. Such a system would be useful for increasing the number of meteor detections to obtain improved meteor radar data products, such as wind fields. This type of a radar would also be useful for over-the-horizon radar, ionosondes, and observations of field-aligned-irregularities.

  1. HADES, A Radiographic Simulation Code

    Energy Technology Data Exchange (ETDEWEB)

    Aufderheide, M.B.; Slone, D.M.; Schach von Wittenau, A.E.

    2000-08-18

    We describe features of the HADES radiographic simulation code. We begin with a discussion of why it is useful to simulate transmission radiography. The capabilities of HADES are described, followed by an application of HADES to a dynamic experiment recently performed at the Los Alamos Neutron Science Center. We describe quantitative comparisons between experimental data and HADES simulations using a copper step wedge. We conclude with a short discussion of future work planned for HADES.

  2. Raptor Codes and Cryptographic Issues

    CERN Document Server

    Malinen, Mikko

    2008-01-01

    In this paper two cryptographic methods are introduced. In the first method the presence of a certain size subgroup of persons can be checked for an action to take place. For this we use fragments of Raptor codes delivered to the group members. In the other method a selection of a subset of objects can be made secret. Also, it can be proven afterwards, what the original selection was.

  3. Impacts of Model Building Energy Codes

    Energy Technology Data Exchange (ETDEWEB)

    Athalye, Rahul A. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Sivaraman, Deepak [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Elliott, Douglas B. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Liu, Bing [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Bartlett, Rosemarie [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

    2016-10-31

    The U.S. Department of Energy (DOE) Building Energy Codes Program (BECP) periodically evaluates national and state-level impacts associated with energy codes in residential and commercial buildings. Pacific Northwest National Laboratory (PNNL), funded by DOE, conducted an assessment of the prospective impacts of national model building energy codes from 2010 through 2040. A previous PNNL study evaluated the impact of the Building Energy Codes Program; this study looked more broadly at overall code impacts. This report describes the methodology used for the assessment and presents the impacts in terms of energy savings, consumer cost savings, and reduced CO2 emissions at the state level and at aggregated levels. This analysis does not represent all potential savings from energy codes in the U.S. because it excludes several states which have codes which are fundamentally different from the national model energy codes or which do not have state-wide codes. Energy codes follow a three-phase cycle that starts with the development of a new model code, proceeds with the adoption of the new code by states and local jurisdictions, and finishes when buildings comply with the code. The development of new model code editions creates the potential for increased energy savings. After a new model code is adopted, potential savings are realized in the field when new buildings (or additions and alterations) are constructed to comply with the new code. Delayed adoption of a model code and incomplete compliance with the code’s requirements erode potential savings. The contributions of all three phases are crucial to the overall impact of codes, and are considered in this assessment.

  4. Computer Code for Nanostructure Simulation

    Science.gov (United States)

    Filikhin, Igor; Vlahovic, Branislav

    2009-01-01

    Due to their small size, nanostructures can have stress and thermal gradients that are larger than any macroscopic analogue. These gradients can lead to specific regions that are susceptible to failure via processes such as plastic deformation by dislocation emission, chemical debonding, and interfacial alloying. A program has been developed that rigorously simulates and predicts optoelectronic properties of nanostructures of virtually any geometrical complexity and material composition. It can be used in simulations of energy level structure, wave functions, density of states of spatially configured phonon-coupled electrons, excitons in quantum dots, quantum rings, quantum ring complexes, and more. The code can be used to calculate stress distributions and thermal transport properties for a variety of nanostructures and interfaces, transport and scattering at nanoscale interfaces and surfaces under various stress states, and alloy compositional gradients. The code allows users to perform modeling of charge transport processes through quantum-dot (QD) arrays as functions of inter-dot distance, array order versus disorder, QD orientation, shape, size, and chemical composition for applications in photovoltaics and physical properties of QD-based biochemical sensors. The code can be used to study the hot exciton formation/relation dynamics in arrays of QDs of different shapes and sizes at different temperatures. It also can be used to understand the relation among the deposition parameters and inherent stresses, strain deformation, heat flow, and failure of nanostructures.

  5. Fractional baud-length coding

    Directory of Open Access Journals (Sweden)

    J. Vierinen

    2011-06-01

    Full Text Available We present a novel approach for modulating radar transmissions in order to improve target range and Doppler estimation accuracy. This is achieved by using non-uniform baud lengths. With this method it is possible to increase sub-baud range-resolution of phase coded radar measurements while maintaining a narrow transmission bandwidth. We first derive target backscatter amplitude estimation error covariance matrix for arbitrary targets when estimating backscatter in amplitude domain. We define target optimality and discuss different search strategies that can be used to find well performing transmission envelopes. We give several simulated examples of the method showing that fractional baud-length coding results in smaller estimation errors than conventional uniform baud length transmission codes when estimating the target backscatter amplitude at sub-baud range resolution. We also demonstrate the method in practice by analyzing the range resolved power of a low-altitude meteor trail echo that was measured using a fractional baud-length experiment with the EISCAT UHF system.

  6. Physics codes on parallel computers

    Energy Technology Data Exchange (ETDEWEB)

    Eltgroth, P.G.

    1985-12-04

    An effort is under way to develop physics codes which realize the potential of parallel machines. A new explicit algorithm for the computation of hydrodynamics has been developed which avoids global synchronization entirely. The approach, called the Independent Time Step Method (ITSM), allows each zone to advance at its own pace, determined by local information. The method, coded in FORTRAN, has demonstrated parallelism of greater than 20 on the Denelcor HEP machine. ITSM can also be used to replace current implicit treatments of problems involving diffusion and heat conduction. Four different approaches toward work distribution have been investigated and implemented for the one-dimensional code on the Denelcor HEP. They are ''self-scheduled'', an ASKFOR monitor, a ''queue of queues'' monitor, and a distributed ASKFOR monitor. The self-scheduled approach shows the lowest overhead but the poorest speedup. The distributed ASKFOR monitor shows the best speedup and the lowest execution times on the tested problems. 2 refs., 3 figs.

  7. On Decoding Irregular Tanner Codes

    CERN Document Server

    Even, Guy

    2011-01-01

    We present a new combinatorial characterization for local-optimality of a codeword in irregular Tanner codes. This characterization is a generalization of [Arora, Daskalakis, Steurer; 2009] and [Vontobel; 2010]. The main novelty in this characterization is that it is based on a conical combination of subtrees in the computation trees. These subtrees may have any degree in the local-code nodes and may have any height (even greater than the girth). We prove that local-optimality in this new characterization implies Maximum-Likelihood (ML) optimality and LP-optimality. We also show that it is possible to compute efficiently a certificate for the local-optimality of a codeword given the channel output. We apply this characterization to regular Tanner codes. We prove a lower bound on the noise threshold in channels such as BSC and AWGNC. When the noise is below this lower bound, the probability that LP decoding fails diminishes doubly exponentially in the girth of the Tanner graph. We use local optimality also to ...

  8. Sparse Coding for Alpha Matting.

    Science.gov (United States)

    Johnson, Jubin; Varnousfaderani, Ehsan; Cholakkal, Hisham; Rajan, Deepu

    2016-04-21

    Existing color sampling based alpha matting methods use the compositing equation to estimate alpha at a pixel from pairs of foreground (F) and background (B) samples. The quality of the matte depends on the selected (F,B) pairs. In this paper, the matting problem is reinterpreted as a sparse coding of pixel features, wherein the sum of the codes gives the estimate of the alpha matte from a set of unpaired F and B samples. A non-parametric probabilistic segmentation provides a certainty measure on the pixel belonging to foreground or background, based on which a dictionary is formed for use in sparse coding. By removing the restriction to conform to (F,B) pairs, this method allows for better alpha estimation from multiple F and B samples. The same framework is extended to videos, where the requirement of temporal coherence is handled effectively. Here, the dictionary is formed by samples from multiple frames. A multi-frame graph model, as opposed to a single image as for image matting, is proposed that can be solved efficiently in closed form. Quantitative and qualitative evaluations on a benchmark dataset are provided to show that the proposed method outperforms current state-of-the-art in image and video matting.

  9. Coded continuous wave meteor radar

    Directory of Open Access Journals (Sweden)

    J. Vierinen

    2015-07-01

    Full Text Available 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 performing a measurement, as it does not depend on pulse spacing; and the low signal to noise ratio allows multiple geographically separated transmitters to be used in the same frequency band without significantly interfering with each other. The latter allows the same receiver antennas to be used to receive multiple transmitters. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large scale multi-static network of meteor radar transmitters and receivers. This would, for example, provide higher spatio-temporal resolution for mesospheric wind field measurements.

  10. Coded continuous wave meteor radar

    Science.gov (United States)

    Vierinen, J.; Chau, J. L.; Pfeffer, N.; Clahsen, M.; Stober, G.

    2015-07-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 performing a measurement, as it does not depend on pulse spacing; and the low signal to noise ratio allows multiple geographically separated transmitters to be used in the same frequency band without significantly interfering with each other. The latter allows the same receiver antennas to be used to receive multiple transmitters. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large scale multi-static network of meteor radar transmitters and receivers. This would, for example, provide higher spatio-temporal resolution for mesospheric wind field measurements.

  11. Local Graph Coloring and Index Coding

    OpenAIRE

    Shanmugam, Karthikeyan; Dimakis, Alexandros G.; Langberg, Michael

    2013-01-01

    We present a novel upper bound for the optimal index coding rate. Our bound uses a graph theoretic quantity called the local chromatic number. We show how a good local coloring can be used to create a good index code. The local coloring is used as an alignment guide to assign index coding vectors from a general position MDS code. We further show that a natural LP relaxation yields an even stronger index code. Our bounds provably outperform the state of the art on index coding but at most by a...

  12. Toric Codes, Multiplicative Structure and Decoding

    DEFF Research Database (Denmark)

    Hansen, Johan Peder

    2017-01-01

    Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for \\emph{decoding}, resembling the decoding of Reed-Solomon codes...... and aligns with decoding by error correcting pairs. We have used the multiplicative structure on toric codes to construct linear secret sharing schemes with \\emph{strong multiplication} via Massey's construction generalizing the Shamir Linear secret sharing shemes constructed from Reed-Solomon codes. We have...... constructed quantum error correcting codes from toric surfaces by the Calderbank-Shor-Steane method....

  13. Quantum coding theory with realistic physical constraints

    CERN Document Server

    Yoshida, Beni

    2010-01-01

    The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum error-correcting codes with geometrically local generators, (b) the feasibility of a self-correcting quantum memory. To investigate these problems, we study stabilizer codes supported by local interaction terms with translation and scale symmetries on a $D$-dimensional lattice. Our analysis uses the notion of topology emerging in geometric shapes of logical operators, which sheds a surprising new light on theory of quantum codes with physical constraints.

  14. QR CODE IN LIBRARY PRACTICE SOME EXAMPLES

    OpenAIRE

    Ajay Shanker Mishra*, Sachin Kumar Umre, Pavan Kumar Gupta

    2017-01-01

    Quick Response (QR) code is one such technology which can cater to the user demand of providing access to resources through mobile. The main objective of this article to review the concept of Quick Response Code (QR code) and describe the practice of reading and generating QR codes. Research paper attempt to the basic concept, structure, technological pros and cons of the QR code. The literature is filled with potential uses for Quick Response (QR) codes in the library practices like e-resour...

  15. Energy information data base: report number codes

    Energy Technology Data Exchange (ETDEWEB)

    None

    1979-09-01

    Each report processed by the US DOE Technical Information Center is identified by a unique report number consisting of a code plus a sequential number. In most cases, the code identifies the originating installation. In some cases, it identifies a specific program or a type of publication. Listed in this publication are all codes that have been used by DOE in cataloging reports. This compilation consists of two parts. Part I is an alphabetical listing of report codes identified with the issuing installations that have used the codes. Part II is an alphabetical listing of installations identified with codes each has used. (RWR)

  16. Tandem Mirror Reactor Systems Code (Version I)

    Energy Technology Data Exchange (ETDEWEB)

    Reid, R.L.; Finn, P.A.; Gohar, M.Y.; Barrett, R.J.; Gorker, G.E.; Spampinaton, P.T.; Bulmer, R.H.; Dorn, D.W.; Perkins, L.J.; Ghose, S.

    1985-09-01

    A computer code was developed to model a Tandem Mirror Reactor. Ths is the first Tandem Mirror Reactor model to couple, in detail, the highly linked physics, magnetics, and neutronic analysis into a single code. This report describes the code architecture, provides a summary description of the modules comprising the code, and includes an example execution of the Tandem Mirror Reactor Systems Code. Results from this code for two sensitivity studies are also included. These studies are: (1) to determine the impact of center cell plasma radius, length, and ion temperature on reactor cost and performance at constant fusion power; and (2) to determine the impact of reactor power level on cost.

  17. Thermal hydraulic-severe accident code interfaces for SCDAP/RELAP5/MOD3.2

    Energy Technology Data Exchange (ETDEWEB)

    Coryell, E.W.; Siefken, L.J.; Harvego, E.A. [Idaho National Engineering Lab., Idaho Falls, ID (United States)] [and others

    1997-07-01

    The SCDAP/RELAP5 computer code is designed to describe the overall reactor coolant system thermal-hydraulic response, core damage progression, and fission product release during severe accidents. The code is being developed at the Idaho National Engineering Laboratory under the primary sponsorship of the Office of Nuclear Regulatory Research of the U.S. Nuclear Regulatory Commission. The code is the result of merging the RELAP5, SCDAP, and COUPLE codes. The RELAP5 portion of the code calculates the overall reactor coolant system, thermal-hydraulics, and associated reactor system responses. The SCDAP portion of the code describes the response of the core and associated vessel structures. The COUPLE portion of the code describes response of lower plenum structures and debris and the failure of the lower head. The code uses a modular approach with the overall structure, input/output processing, and data structures following the pattern established for RELAP5. The code uses a building block approach to allow the code user to easily represent a wide variety of systems and conditions through a powerful input processor. The user can represent a wide variety of experiments or reactor designs by selecting fuel rods and other assembly structures from a range of representative core component models, and arrange them in a variety of patterns within the thermalhydraulic network. The COUPLE portion of the code uses two-dimensional representations of the lower plenum structures and debris beds. The flow of information between the different portions of the code occurs at each system level time step advancement. The RELAP5 portion of the code describes the fluid transport around the system. These fluid conditions are used as thermal and mass transport boundary conditions for the SCDAP and COUPLE structures and debris beds.

  18. Random Coding Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences

    Science.gov (United States)

    2008-07-01

    COVERED (From - To) 6 Jul 08 – 11 Jul 08 4. TITLE AND SUBTITLE RANDOM CODING BOUNDS FOR DNA CODES BASED ON FIBONACCI ENSEMBLES OF DNA SEQUENCES ... sequences which are generalizations of the Fibonacci sequences . 15. SUBJECT TERMS DNA Codes, Fibonacci Ensembles, DNA Computing, Code Optimization 16...coding bound on the rate of DNA codes is proved. To obtain the bound, we use some ensembles of DNA sequences which are generalizations of the Fibonacci

  19. An implicit Smooth Particle Hydrodynamic code

    Energy Technology Data Exchange (ETDEWEB)

    Knapp, Charles E. [Univ. of New Mexico, Albuquerque, NM (United States)

    2000-05-01

    An implicit version of the Smooth Particle Hydrodynamic (SPH) code SPHINX has been written and is working. In conjunction with the SPHINX code the new implicit code models fluids and solids under a wide range of conditions. SPH codes are Lagrangian, meshless and use particles to model the fluids and solids. The implicit code makes use of the Krylov iterative techniques for solving large linear-systems and a Newton-Raphson method for non-linear corrections. It uses numerical derivatives to construct the Jacobian matrix. It uses sparse techniques to save on memory storage and to reduce the amount of computation. It is believed that this is the first implicit SPH code to use Newton-Krylov techniques, and is also the first implicit SPH code to model solids. A description of SPH and the techniques used in the implicit code are presented. Then, the results of a number of tests cases are discussed, which include a shock tube problem, a Rayleigh-Taylor problem, a breaking dam problem, and a single jet of gas problem. The results are shown to be in very good agreement with analytic solutions, experimental results, and the explicit SPHINX code. In the case of the single jet of gas case it has been demonstrated that the implicit code can do a problem in much shorter time than the explicit code. The problem was, however, very unphysical, but it does demonstrate the potential of the implicit code. It is a first step toward a useful implicit SPH code.

  20. Implementation and evaluation of a clinical data management programme in a primary care centre.

    LENUS (Irish Health Repository)

    Sweeney, J

    2014-11-01

    Electronic health records (EHR) support clinical management, administration, quality assurance, research, and service planning. The aim of this study was to evaluate a clinical data management programme to improve consistency, completeness and accuracy of EHR information in a large primary care centre with 10 General Practitioners (GPs). A Clinical Data Manager was appointed to implement a Data Management Strategy which involved coding consultations using ICPC-2 coding, tailored support and ongoing individualised feedback to clinicians. Over an eighteen month period there were improvements in engagement with and level of coding. Prior to implementation (August 2011) 4 of the 10 GPs engaged in regular coding and 69% of their consultation notes were coded. After 12 months, all 10 GPs and 6 nurses were ICPC-2 coding their consultations and monthly coding levels had increased to 98%. This structured Data Management Strategy provides a feasible sustainable way to improve information management in primary care.