WorldWideScience

Sample records for code simulacao computacional

  1. Computer simulation of thermal-hydraulic transient events in multi-circuits with multipumps; Simulacao computacional de eventos termo-hidraulicos transitorios em multicircuitos com multibombas

    Energy Technology Data Exchange (ETDEWEB)

    Veloso, Marcelo Antonio

    2003-07-01

    PANTERA-2 (from Programa para Analise Termo-hidraulica de Reatores a Agua - Program for Thermal-hydraulic Analysis of Water Reactors, Version 2), whose fundamentals are described in this work, is intended to carry out rod bundle subchannel analysis in conjunction with multiloop simulation. It solves simultaneously the conservation equations of mass, axial and lateral momentum, and energy for subchannel geometry coupled with the balance equations that describe the fluid flows in any number of coolant loops connected to a pressure vessel containing the rod bundle. As far as subchannel analysis is concerned, the basic computational strategy of PANTERA-2 comes from COBRA codes, but an alternative implicit solution method oriented to the pressure field has been used to solve the finite difference approximations for the balance laws. The results provided by the subchannel model comprise the fluid density, enthalpy, flow rate, and pressure fields in the subchannels. The loop model predicts the individual loop flows, total flow through the pressure vessel, and pump rotational speeds as a function of time subsequent to the failure of any number of the coolant pumps. The flow transients in the loops may initiated by partial, total or sequential loss of electric power to the operating pumps. Transient events caused by either shaft break or rotor locking may also be simulated. The changes in rotational speed of the pumps as a function of rime are determined from a torque balance. Pump dynamic head and hydraulic torque are calculated as a function of rotational speed and volumetric flow from two polar homologous curves supplied to the code in the tabular form. In order to illustrate the analytical capability of PANTERA-2, three sample problems are presented and discussed. Comparisons between calculated and measured results indicate that the program reproduces with a good accuracy experimental data for subchannel exit temperatures and critical heat fluxes in 5x5 rod bundles. It

  2. Estimate of fuel burnup spatial a multipurpose reactor in computer simulation; Estimativa da queima espacial do combustivel de um reator multiproposito por simulacao computacional

    Energy Technology Data Exchange (ETDEWEB)

    Santos, Nadia Rodrigues dos, E-mail: nadia.santos@ifrj.edu.br [Instituto Federal de Educacao, Ciencia e Tecnologia do Rio de Janeiro (IFRJ), Paracambi, RJ (Brazil); Lima, Zelmo Rodrigues de; Moreira, Maria de Lourdes, E-mail: malu@ien.gov.br, E-mail: zrlima@ien.gov.br [Instituto de Engenharia Nuclear (IEN/CNEN-RJ), Rio de Janeiro, RJ (Brazil)

    2015-07-01

    In previous research, which aimed, through computer simulation, estimate the spatial fuel burnup for the research reactor benchmark, material test research - International Atomic Energy Agency (MTR/IAEA), it was found that the use of the code in FORTRAN language, based on the diffusion theory of neutrons and WIMSD-5B, which makes cell calculation, bespoke be valid to estimate the spatial burnup other nuclear research reactors. That said, this paper aims to present the results of computer simulation to estimate the space fuel burnup of a typical multipurpose reactor, plate type and dispersion. the results were considered satisfactory, being in line with those presented in the literature. for future work is suggested simulations with other core configurations. are also suggested comparisons of WIMSD-5B results with programs often employed in burnup calculations and also test different methods of interpolation values obtained by FORTRAN. Another proposal is to estimate the burning fuel, taking into account the thermohydraulics parameters and the appearance of xenon. (author)

  3. Computational simulation of flow and heat transfer in single-phase natural circulation loops; Simulacao computacional de escoamento e transferencia de calor em circuitos de circulacao natural monofasica

    Energy Technology Data Exchange (ETDEWEB)

    Pinheiro, Larissa Cunha

    2017-07-01

    Passive decay heat removal systems based on natural circulation are essential assets for the new Gen III+ nuclear power reactors and nuclear spent fuel pools. The aim of the present work is to study both laminar and turbulent flow and heat transfer in single-phase natural circulation systems through computational fluid dynamics simulations. The working fluid is considered to be incompressible with constant properties. In the way, the Boussinesq Natural Convection Hypothesis was applied. The model chosen for the turbulence closure problem was the k -- εThe commercial computational fluid dynamics code ANSYS CFX 15.0 was used to obtain the numerical solution of the governing equations. Two single-phase natural circulation circuits were studied, a 2D toroidal loop and a 3D rectangular loop, both with the same boundary conditions of: prescribed heat flux at the heater and fixed wall temperature at the cooler. The validation and verification was performed with the numerical data provided by DESRAYAUD et al. [1] and the experimental data provided by MISALE et al. [2] and KUMAR et al. [3]. An excellent agreement between the Reynolds number (Re) and the modified Grashof number (Gr{sub m}), independently of Prandtl Pr number was observed. However, the convergence interval was observed to be variable with Pr, thus indicating that Pr is a stability governing parameter for natural circulation. Multiple steady states was obtained for Pr = 0,7. Finally, the effect of inclination was studied for the 3D circuit, both in-plane and out-of-plane inclinations were verified for the steady state laminar regime. As a conclusion, the Re for the out-of-plane inclination was in perfect agreement with the correlation found for the zero inclination system, while for the in-plane inclined system the results differ from that of the corresponding vertical loop. (author)

  4. Simulation of a nuclear densimeter using the Monte Carlo MCNP-4C code; Simulacao de um densimetro nuclear utilizando o codigo Monte Carlo MCNP-4C

    Energy Technology Data Exchange (ETDEWEB)

    Penna, Rodrigo [UNI-BH, Belo Horizonte, MG (Brazil). Dept. de Ciencias Biologicas, Ambientais e da Saude (DCBAS/DCET); Silva, Clemente Jose Gusmao Carneiro da [Universidade Estadual de Santa Cruz, UESC, Ilheus, BA (Brazil); Gomes, Paulo Mauricio Costa [Universidade FUMEC, Belo Horizonte, MG (Brazil)

    2008-07-01

    Viability of building a nuclear wood densimeter based on low energy photons Compton scattering was done using Monte Carlo code (MCNP- 4C). It is simulated a collimated 60 keV beam of gamma rays emitted by {sup 241}Am source reaching wood blocks. Backscattered radiation by these blocks was calculated. Photons scattered were correlated with blocks of different wood densities. Results showed a linear relationship on wood density and scattered photons, therefore the viability of this wood densimeter. (author)

  5. Optimization of a computer simulation code to analyse thermal systems for solar energy water heating; Aperfeicoamento de um programa de simulacao computacional para analise de sistemas termicos de aquecimento de agua por energia solar

    Energy Technology Data Exchange (ETDEWEB)

    Pozzebon, Felipe Barin

    2009-02-15

    The potential of solar water heating systems through solar energy in Brazil is excellent due to the climatic features of the country. The performance of these systems is highly influenced also by the materials used to build it and by the dimension of its equipment and components. In face of global warming, solar energy gains more attention, since it is one of the renewable energy that will be largely used to replace some of the existing polluting types of energy. This paper presents the improvement of a software that conducts simulations of water heating systems using solar energy in thermosyphon regime or forced circulation. TermoSim, as it is called, was initiated at the Solar Labs, and is in its version 3.0. The current version is capable of simulating 6 different arrangements' possibilities combined with auxiliary energy: systems with solar collectors with auxiliary energy with gas, electric energy, internal electric energy, electric energy in series with the consumption line, and no auxiliary energy. The software is a tool to aid studies and analysis of solar heating systems, it has a friendly interface that is easy to comprehend and results are simple to use. Besides that, this version also allows simulations that consider heat losses at night, situation in which a reverse circulation can occur and mean efficiency loss, depending on the simulated system type. There were many simulations with the mathematical models used and comparisons were made with the climatic data of the city of Caxias do Sul, in Rio Grande do Sul state, in Brazil, determining the system with the most efficient configuration for the simulated water consume profile. The paper is finalized with simple economic analyses with the intention of foreseeing the time for payback on the investment, taking into account the current prices for electrical energy in the simulated area and the possible monthly economy provided with the use of a solar energy heating system. (author)

  6. Analysis of the microturbine combustion chamber by using the CHEMKIN III computer code; Analise da camara de combustao de microturbinas empregando-se o codigo computacional CHEMKIN III

    Energy Technology Data Exchange (ETDEWEB)

    Madela, Vinicius Zacarias; Pauliny, Luis F. de A.; Veras, Carlos A. Gurgel [Brasilia Univ., DF (Brazil). Dept. de Engenharia Mecanica]. E-mail: gurgel@enm.unb.br; Costa, Fernando de S. [Instituto Nacional de Pesquisas Espaciais (INPE), Sao Jose dos Campos, SP (Brazil). Lab. Associado de Combustao e Propulsao]. E-mail: fernando@cptec.inpe.br

    2000-07-01

    This work presents the results obtained with the simulation of multi fuel micro turbines combustion chambers. In particular, the predictions for the methane and Diesel burning are presented. The appropriate routines of the CHEMKIN III computer code were used.

  7. Simulation of clinical X-ray tube using the Monte Carlo Method - PENELOPE code; Simulacao de um tubo de raios X clinico atraves do Metodo de Monte Carlo usando codigo PENELOPE

    Energy Technology Data Exchange (ETDEWEB)

    Albuquerque, M.A.G.; David, M.G.; Almeida, C.E. de; Magalhaes, L.A.G., E-mail: malbuqueque@hotmail.com [Universidade do Estado do Rio de Janeiro (UERJ), Rio de Janeiro, RJ (Brazil). Lab. de Ciencias Radiologicas; Bernal, M. [Universidade Estadual de Campinas (UNICAMP), SP (Brazil); Braz, D. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil)

    2015-07-01

    Breast cancer is the most common type of cancer among women. The main strategy to increase the long-term survival of patients with this disease is the early detection of the tumor, and mammography is the most appropriate method for this purpose. Despite the reduction of cancer deaths, there is a big concern about the damage caused by the ionizing radiation to the breast tissue. To evaluate these measures it was modeled a mammography equipment, and obtained the depth spectra using the Monte Carlo method - PENELOPE code. The average energies of the spectra in depth and the half value layer of the mammography output spectrum. (author)

  8. Simulation for photon detection in spectrometric system of high purity (HPGe) using MCNPX code; Simulacao de deteccao de fotons em sistema espectrometrico de alta pureza (HPGe) usando o codigo MCNPX

    Energy Technology Data Exchange (ETDEWEB)

    Correa, Guilherme Jorge de Souza

    2013-07-01

    The Brazilian National Commission of Nuclear Energy defines parameters for classification and management of radioactive waste in accordance with the activity of materials. The efficiency of a detection system is crucial to determine the real activity of a radioactive source. When it's possible, the system's calibration should be performed using a standard source. Unfortunately, there are only a few cases that it can be done this way, considering the difficulty of obtaining appropriate standard sources for each type of measurement. So, computer simulations can be performed to assist in calculating of the efficiency of the system and, consequently, also auxiliary the classification of radioactive waste. This study aims to model a high purity germanium (HPGe) detector with MCNPX code, approaching the spectral values computationally obtained of the values experimentally obtained for the photopeak of {sup 137}Cs. The approach will be made through changes in outer dead layer of the germanium crystal modeled. (author)

  9. Validation of the coupling of mesh models to GEANT4 Monte Carlo code for simulation of internal sources of photons; Validacao do acoplamento de modelos mesh ao codigo Monte Carlo GEANT4 para simulacao de fontes de fotons internas

    Energy Technology Data Exchange (ETDEWEB)

    Caribe, Paulo Rauli Rafeson Vasconcelos, E-mail: raulycaribe@hotmail.com [Universidade Federal Rural de Pernambuco (UFRPE), Recife, PE (Brazil). Fac. de Fisica; Cassola, Vagner Ferreira; Kramer, Richard; Khoury, Helen Jamil [Universidade Federal de Pernambuco (UFPE), Recife, PE (Brazil). Departamento de Energia Nuclear

    2013-07-01

    The use of three-dimensional models described by polygonal meshes in numerical dosimetry enables more accurate modeling of complex objects than the use of simple solid. The objectives of this work were validate the coupling of mesh models to the Monte Carlo code GEANT4 and evaluate the influence of the number of vertices in the simulations to obtain absorbed fractions of energy (AFEs). Validation of the coupling was performed to internal sources of photons with energies between 10 keV and 1 MeV for spherical geometries described by the GEANT4 and three-dimensional models with different number of vertices and triangular or quadrilateral faces modeled using Blender program. As a result it was found that there were no significant differences between AFEs for objects described by mesh models and objects described using solid volumes of GEANT4. Since that maintained the shape and the volume the decrease in the number of vertices to describe an object does not influence so meant dosimetric data, but significantly decreases the time required to achieve the dosimetric calculations, especially for energies less than 100 keV.

  10. Simplified 3D model of a PWR reactor vessel using fluid dynamics code ANSYS CFX computational; Modelo simplificado 3D de la vasija de un reactor PWR mediante el codigo de dinamica de fluidos computacional ANSYS CFX

    Energy Technology Data Exchange (ETDEWEB)

    Martinez, M.; Miro, R.; Barrachina, T.; Verdu, G.

    2011-07-01

    This paper presents the results from the calculation of the steady state simulation with model of CFD (computational fluid dynamic) operating under conditions of operation at full power (Hot Full Power). Development and the CFD model results show the usefulness of these codes for calculating 3D of the variable thermohydraulics of these reactors.

  11. Construction of a computational exposure model for dosimetric calculations using the EGS4 Monte Carlo code and voxel phantoms; Construcao de um modelo computacional de exposicao para calculos dosimetricos utilizando o codigo Monte Carlo EGS4 e fantomas de voxels

    Energy Technology Data Exchange (ETDEWEB)

    Vieira, Jose Wilson

    2004-07-15

    The MAX phantom has been developed from existing segmented images of a male adult body, in order to achieve a representation as close as possible to the anatomical properties of the reference adult male specified by the ICRP. In computational dosimetry, MAX can simulate the geometry of a human body under exposure to ionizing radiations, internal or external, with the objective of calculating the equivalent dose in organs and tissues for occupational, medical or environmental purposes of the radiation protection. This study presents a methodology used to build a new computational exposure model MAX/EGS4: the geometric construction of the phantom; the development of the algorithm of one-directional, divergent, and isotropic radioactive sources; new methods for calculating the equivalent dose in the red bone marrow and in the skin, and the coupling of the MAX phantom with the EGS4 Monte Carlo code. Finally, some results of radiation protection, in the form of conversion coefficients between equivalent dose (or effective dose) and free air-kerma for external photon irradiation are presented and discussed. Comparing the results presented with similar data from other human phantoms it is possible to conclude that the coupling MAX/EGS4 is satisfactory for the calculation of the equivalent dose in radiation protection. (author)

  12. Pensamiento computacional en los estudios preuniversitarios. El enfoque de TACCLE3

    OpenAIRE

    García-Peñalvo, F. J.

    2017-01-01

    En la Unidad I: Gestión de la Tecnología y del Conocimiento, de la asignatura Recursos Informáticos del Máster en las TIC en la Educación: Análisis y Diseño de Procesos, Recursos y Prácticas Formativas, se ha desarrollado el día 9 de marzo de 2017 en la Facultad de Educación, Universidad de Salamanca, un grupo focal sobre Pensamiento Computacional en los estudios preuniversitarios.   Al ser una actividad muy relacionada con el Proyecto Taccle3 – Coding se ha generado este recurso para...

  13. Geometría computacional y bases de datos

    OpenAIRE

    Dorzán, María Gisela; Esquivel, Susana Cecilia; Gagliardi, Edilma Olinda; Palmero, Pablo Rafael; Taranilla, María Teresa

    2016-01-01

    La línea de investigación “Geometría Computacional y Bases de Datos” enmarcada en el proyecto “Tecnologías Avanzadas de Bases de Datos” vincula el estudio de las disciplinas Bases de Datos, Geometría Computacional y Metaheurísticas, utilizando los métodos y las herramientas provistas para la resolución de problemas orientados a optimización.

  14. Development of a computational code for the internal doses assessment of the main radionuclides of occupational exposure at IPEN; Desenvolvimento de um codigo computacional de apoio ao calculo de dose interna para radionuclideos de interesse do IPEN

    Energy Technology Data Exchange (ETDEWEB)

    Claro, Thiago Ribeiro

    2011-07-01

    The dose resulting from internal contamination can be estimated with the use of biokinetic models combined with experimental results obtained from bioanalysis and assessment of the time of incorporation. The biokinetics models are represented by a set of compartments expressing the transportation, retention and elimination of radionuclides from the body. The ICRP publications, number 66, 78 and 100, present compartmental models for the respiratory tract, gastrointestinal tract and for systemic distribution for an array of radionuclides of interest for the radiological protection. The objective of this work is to develop a computational code for the internal doses assessment of the main radionuclides of occupational exposure at IPEN. Consequently serving as a agile and efficient tool for the designing, visualization and resolution of compartmental models of any nature. The architecture of the system was conceived containing two independent software: CBT - responsible for the setup and manipulation of models and SSID - responsible for the mathematical solution of the models. Four different techniques are offered for the resolution of system of equations, including semi-analytical and numerical methods, allowing for comparison of precision and performance of both. The software was developed in C{ne} programming, using a Microsoft Access database and XML standards for file exchange with other applications. Compartmental models for uranium, thorium and iodine radionuclides were generated for the validation of the CBT software. The models were subsequently solved via SSID software and the results compared with the values published in the issue 78 of ICRP. In all cases the system replicated the values published by ICRP. (author)

  15. Development of a computational system based in the code GEANT4 for dosimetric evaluation in radiotherapy; Desenvolvimento de um sistema computacional baseado no Codigo GEANT4 para avaliacoes dosimetricas em radioterapia

    Energy Technology Data Exchange (ETDEWEB)

    Oliveira, Alex Cristovao Holanda de

    2016-10-01

    The incidence of cancer has grown in Brazil, as well as around the world, following the change in the age profile of the population. One of the most important techniques and commonly used in cancer treatment is radiotherapy. Around 60% of new cases of cancer use radiation in at least one phase of treatment. The most used equipment for radiotherapy is a linear accelerator (Linac) which produces electron or X-ray beams in energy range from 5 to 30 MeV. The most appropriate way to irradiate a patient is determined during treatment planning. Currently, treatment planning system (TPS) is the main and the most important tool in the process of planning for radiotherapy. The main objective of this work is to develop a computational system based on the MC code Geant4 for dose evaluations in photon beam radiotherapy. In addition to treatment planning, these dose evaluations can be performed for research and quality control of equipment and TPSs. The computer system, called Quimera, consists of a graphical user interface (qGUI) and three MC applications (qLinacs, qMATphantoms and qNCTphantoms). The qGUI has the function of interface for the MC applications, by creating or editing the input files, running simulations and analyzing the results. The qLinacs is used for modeling and generation of Linac beams (phase space). The qMATphantoms and qNCTphantoms are used for dose calculations in virtual models of physical phantoms and computed tomography (CT) images, respectively. From manufacturer's data, models of a Varian Linac photon beam and a Varian multileaf collimator (MLC) were simulated in the qLinacs. The Linac and MLC modelling were validated using experimental data. qMATphamtoms and qNCTphantoms were validated using IAEA phase spaces. In this first version, the Quimera can be used for research, radiotherapy planning of simple treatments and quality control in photon beam radiotherapy. The MC applications work independent of the qGUI and the qGUI can be used for

  16. Análise computacional de sistemas multicorpos.

    OpenAIRE

    Glauco Oaklonde de Campos Pacheco

    2006-01-01

    Neste texto, será apresentada a teoria básica da dinâmica computacional, juntamente com alguns métodos de solução para as equações diferenciais-algébricas de movimento. Neste contexto, uma melhoria de um método de ortogonalização existente para solução numérica das equações de movimento será apresentada, caracterizando a contribuição científica deste texto. Do ponto de vista aplicado, foi desenvolvido um programa computacional visando à simulação computacional de sistemas multicorpos. O métod...

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

  18. Esparsidade, Estrutura, Escalamento e Estabilidade em Algebra Linear Computacional

    CERN Document Server

    Stern, Julio M

    2011-01-01

    Sparsity, Structure, Scaling and Stability in Computational Linear Algebra - Textbook from the IX School of Computer Science, held on July 24-31 of 1994 at Recife, Brazil. Esparsidade, Estrutura, Escalamento e Estabilidade em Algebra Linear Computacional - Livro texto da IX Escola de Computacao, realizada nos dias 24 a 31 de Julho de 1994 em Recife, Brasil. This textbook is written in Portuguese Language.

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

  20. Evaluation of Computational Fluids Dynamics (CFD) code Open FOAM in the study of the pressurized thermal stress of PWR reactors. Comparison with the commercial code Ansys-CFX; Evaluacion del codigo de Dinamica de Fluidos Computacional (CFD) Open FOAM en el estudio del estres termico presurizado de los reactores PWR. Comparacion con el codigo comercial Ansys-CFX

    Energy Technology Data Exchange (ETDEWEB)

    Martinez, M.; Barrachina, T.; Miro, R.; Verdu Martin, G.; Chiva, S.

    2012-07-01

    In this work is proposed to evaluate the potential of the OpenFOAM code for the simulation of typical fluid flows in reactors PWR, in particular for the study of pressurized thermal stress. Test T1-1 has been simulated , within the OECD ROSA project, with the objective of evaluating the performance of the code OpenFOAM and models of turbulence that has implemented to capture the effect of the thrust forces in the case study.

  1. Comparison of performance among three systems of Clinical PET by computerized simulation; Comparacao de desempenho entre tres sistemas de PET clinico por simulacao computacional

    Energy Technology Data Exchange (ETDEWEB)

    Franze, Daniel L.; Bertolo, Antonio C.N.; Gama, Andressa F.; Moraes, Eder R. [Universidade de Sao Paulo (GIMN/USP), Ribeirao Preto, SP (Brazil). Grupo de Imagens em Medicina Nuclear

    2016-07-01

    Whereas sensitivity and spatial resolution of PET images formed in coincidence systems may exhibit improvements with reduction of the distance between the detectors. Furthermore, since the human cross section not be a circle three different detection geometries of a PET system have been simulated; a circular and two ellipticals. The performance comparison was performed by the sensitivity, resolution and the Noise Equivalent Count Rate curve. The results show that elliptical systems may experience 25% lower cost detectors, increased sensitivity to 63%. The resolution improvements introduced in X direction, large loss in the Y direction, although the use of iterative reconstruction can reduce the loss in resolution. The reduction of peak NEC curve indicates the image with better quality is achieved with lower activity of the source. (author)

  2. A computer program for sizing and simulation of autonomous photovoltaic systems; Programa computacional para dimensionamiento e simulacao de sistemas fotovoltaicos autonomos

    Energy Technology Data Exchange (ETDEWEB)

    Vera, L. H.; Krenzinger, A.

    2004-07-01

    A computer program for sizing and simulation of autonomous photovoltaic systems was developed within the scope of this work. This software was written in Visual Basic 5.0 and was named PV Size. The software estimates, for a certain system configuration, the necessary number of batteries and modules with the associated risk of energy deficit. PV Size uses a database for selection of the components of the system, and generates series of hourly solar radiation and temperature data. The program allows to design photovoltaic electricity generation systems to supply loads in direct and alternating current, becoming important tool for studying, designing and sizing photovoltaic autonomous systems. (Author)

  3. Computer simulation of deasphalting vacuum residues in a pilot unit; Simulacao computacional de desasfaltacao de residuo de vacuo realizada em unidade piloto

    Energy Technology Data Exchange (ETDEWEB)

    Concha, Viktor Oswaldo Cardenas; Quirino, Filipe Augusto Barral; Koroisgi, Erika Tomie; Rivarola, Florencia Wisnivesky Rocca; Maciel, Maria Regina Wolf; Maciel Filho, Rubens [Universidade Estadual de Campinas (UNICAMP), SP (Brazil). Faculdade de Engenharia Quimica; Medina, Lilian Carmen; Barros, Ricardo Soares de [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil). Centro de Pesquisas (CENPES)

    2008-07-01

    In the context of the national petroleum industry, it is interesting to keep the production of the paraffinic lubricant oil type I, which implies in the identification of new loads to ensure the feeding of the existing units. Therefore, it is important to carry out carefully the characterization of the oils, defining its potential for fuel, asphalt and lubricant. Aiming to introduce in the characterization and evaluation of petroleum for lubricant, carried out by PETROBRAS/CENPES, information of basic oils, more similar to industrial oils, was built up in the Laboratory of Process Separation Development - LDPS of UNICAMP/FEQ, a deasphalting pilot unit. In this work, the deasphalting process of a vacuum residue of Brazilian petroleum is simulated, using Aspen Plus{sup R} simulator, in order to remove asphaltenes, resins and other heavy components of vacuum residue. The simulations were carried out considering the configuration of the pilot plant, evaluating the extraction in near-critical operational condition applied to a petroleum, using propane as the solvent. The extraction efficiency and the solvent power were evaluated considering variations in temperature, pressure and in the solvent/feed ratio in order to obtain yields with more efficiency in the production of deasphalted oil (DAO), what means more asphaltene removal. (author)

  4. Computer simulating for oil fields with artificial elevation method by electrical submersible pump; Simulacao computacional para pocos de petroleo com metodo de elevacao artificial por bombeio centrifugo submerso

    Energy Technology Data Exchange (ETDEWEB)

    Batista, Evellyne da Silva; Maitelli, Andre Laurindo [Universidade Federal do Rio Grande do Norte (UFRN), Natal, RN (Brazil); Costa, Rutacio de Oliveira [PETROBRAS S.A., Natal, RN (Brazil). Unidade de Negocio RN/CE; Barbosa, Tiago de Souza [Universidade Federal do Rio Grande do Norte (UFRN), Natal, RN (Brazil). Dept. de Engenharia de Computacao

    2008-07-01

    The architecture heterogeneities and petrophysical properties of carbonate reservoirs result from a combination of platform morphology, related depositional environments, relative sea level changes and diagenetic events. The reservoir layering built for static and dynamic modelling purposes should reflect the key heterogeneities (depositional or diagenetic) which govern the fluid flow patterns. The layering needs to be adapted to the goal of the modelling, ranging from full field computations of hydrocarbon volumes, to sector-based fine-scale simulations to test the recovery improvement. This paper illustrates various reservoir layering types, including schemes dominated by depositional architecture, and those more driven by the diagenetic overprint. The examples include carbonate platform reservoirs from different stratigraphic settings (Tertiary, Cretaceous, Jurassic and Permian) and different regions (Europe, Africa and Middle East areas). This review shows how significant stratigraphic surfaces (such as sequence boundaries or maximum flooding) with their associated facies shifts, can be often considered as key markers to constrain the reservoir layering. Conversely, how diagenesis (dolomitization and karst development), resulting in units with particular poroperm characteristics, may significantly overprint the primary reservoir architecture by generating flow units which cross-cut depositional sequences. To demonstrate how diagenetic processes can create reservoir bodies with geometries that cross-cut the depositional fabric, different types of dolomitization and karst development are illustrated. (author)

  5. DESARROLLO DEL PENSAMIENTO COMPUTACIONAL EN LA FORMACIÓN EN MATEMÁTICA DISCRETA

    OpenAIRE

    AUGUSTO FLORES P.

    2011-01-01

    Este documento se refiere al desarrollo del pensamiento computacional en la formación en matemáticas discretas. En primer lugar, se detallan cuatro componentes principales del pensamiento computacional: pensamiento abstracto, pensamiento lógico, pensamiento modelado y pensamiento constructivo. En segundo lugar, se describe parte del contenido de las matemáticas discretas, que tiene estrecha relación con el pensamiento computacional, a través de un eje...

  6. DESARROLLO DEL PENSAMIENTO COMPUTACIONAL EN LA FORMACIÓN EN MATEMÁTICA DISCRETA

    Directory of Open Access Journals (Sweden)

    AUGUSTO FLORES P.

    2011-12-01

    Full Text Available Este documento se refiere al desarrollo del pensamiento computacional en la formación en matemáticas discretas. En primer lugar, se detallan cuatro componentes principales del pensamiento computacional: pensamiento abstracto, pensamiento lógico, pensamiento modelado y pensamiento constructivo. En segundo lugar, se describe parte del contenido de las matemáticas discretas, que tiene estrecha relación con el pensamiento computacional, a través de un ejemplo de aplicación correspondiente. Por último, se hace un mapeo de las unidades de conocimiento de las matemáticas discretas con los detalles subsecuentes del pensamiento computacional.

  7. Hacia un modelo computacional unificado del lenguaje natural

    Directory of Open Access Journals (Sweden)

    Benjamín Ramírez González

    2014-01-01

    Full Text Available ¿Qué tipo de formalismo debe utilizarse para representar el lenguaje natural? Es necesario un formalismo capaz de describir adecuadamente todas las secuencias de las lenguas naturales. Pero, además, en la medida de lo posible, debe ser un formalismo sencillo, de un coste computacional reducido. Esta pregunta ha generado mucha controversia entre las principales escuelas generativas: la Gramática Transformacional y las Gramáticas de Unificación. En este artículo se defiende que, pese a las diferencias existentes, en última instancia, tales escuelas formalizan el lenguaje humano mediante un mismo tipo de formalismo bien definido: lo que Noam Chomsky llamó lenguaje independiente del contexto. Bajo el prisma de este artículo, la Lingüística actual está en condiciones de ofrecer un modelo computacional unificado del lenguaje natural.

  8. Generación computacional de los polinomios multiortogonales

    Directory of Open Access Journals (Sweden)

    Luis R. Piñeiro Díaz

    2011-10-01

    Full Text Available Se presenta un estudio de las propiedades algebraicas de los polinomios multiortogonales clásicos (PMOC en la recta real es realizado a través del cálculo computacional de los PMOC. La relación con la aproximación simultánea (aproximantes de Hermite-Padé. Los PMOC son generados por diferentes métodos, utilizando la definición del problema de la aproximación simultánea y considerando otras propiedades algebraicas. Algunas propiedades algebraicas de los PMOC son conjeturadas así como otras propiedades extendidas de los Polinomios Ortogonales ordinarios son mostradas por la simulación computacional.

  9. Scratch + ABP, como estrategia para el desarrollo del pensamiento computacional

    OpenAIRE

    Ríos Muñóz, Gloria Cecilia

    2015-01-01

    Este proyecto plantea una estrategia metodológica basada en el uso del programa Scratch1 + A.B.P (aprendizaje basado en problemas), como alternativa para el desarrollo de competencias de pensamiento computacional -- Partiendo del análisis del contexto e implementación en la Institución Educativa Gabriel García Márquez, ubicada en el barrio Caicedo Villa Lilian, en la ciudad de Medellín – Colombia -- Los resultados del análisis del contexto institucional en los grados sexto, indican que sí es ...

  10. Modelo de balance de carga para un cluster computacional basado en la estabilidad de Lyapunov

    National Research Council Canada - National Science Library

    Barreto, Aquiles; Cardinale, Yudith

    2011-01-01

    Balancear dinamicamente la carga en un cluster computacional, para evitar el desbalance de las asignaciones, es dividir equitativamente y en cualquier instante la carga de trabajo que se ha de repartir entre los nodos...

  11. SIMULAÇÃO COMPUTACIONAL PARA OTIMIZAÇÃO DE FILAS EM PROCESSOS

    Directory of Open Access Journals (Sweden)

    Guilherme Tonini Botassoli

    2015-06-01

    Full Text Available A utilização de técnicas de otimização em simulação impactam fortemente em diferentes áreas e por isso, acabam por se tornar ferramentas fundamentais na engenharia de processos. Assim, foi desenvolvido um algoritmo para otimização em simulação computacional, em linguagem C a partir do programa Code::Blocks, utilizando-se de conceitos provenientes do Método Enxame de Partículas (MEP e Algoritmos Genéticos (AG. Partindo inicialmente de um algoritmo base com matriz de números aleatórios, buscou-se a configuração que minimizasse tempos de espera em filas frente aos processos, ou seja, um resultado Gbest. O desenvolvimento deste algoritmo e seus resultados contemplam a possibilidade de estudos e aplicações futuras em modelos reais de processos, com resultados analisados e verificados integralmente no contexto das organizações.

  12. Teoría Computacional de la Mente.

    Directory of Open Access Journals (Sweden)

    Mario Camacho Pinto

    2000-12-01

    Full Text Available

    Cuando publiqué mi trabajo titulado “Inteligencia Artificial y Neurología” en la Revista MEDICINA en cuatro ejemplares Nos. 14, 15, 16, 17, Años 1986-1987, expuse exhaustivamente la contribución científica contemporánea de las Neuro-ciencias y experimenté la ingenua ilusión (frecuente ocurrencia en el ser humano de participar, así fuese muy lejanamente, en el optimismo de los científicos japoneses quienes ofrecían obtener en el decurso de pocos años inteligencia artificial equiparable con la inteligencia humana. Infortunadamente no sucedió así, no podía ser así, lo que nunca quiere decir que de mi parte se ignoren o se desconozcan los sensacionales logros que esos mismos científicos han venido consiguiendo.

    Ahora me encuentro entusiasmado en el desarrollo de otro tema de características similares, lo cual me induce a comentarlo así sea someramente en su trayectoria.

    Se trata de la teoría computacional de la mente, interesantísimo rubro expuesto prolijamente por Steven Pinker del Instituto Tecnológico de Massachussets en el libro del cual es autor, “best seller” de 660 páginas titulado “How the Mind Works”, publicado el año pasado con 800 referencias de bibliografía.

    Su cuidadosa lectura con mis múltiples fieles transcripciones a más de mi información personal mediante Internet, constituyen el bagage intelectual y el soporte científico que me han impulsado a escribir este somero comentario sobre tan trascendente tema, con destino a MEDICINA.

    La Teoría Computacional de la Mente tiene su origen en las ideas geniales del matemático norteamericano Alan Turing quien demostró que una máquina binaria podía ser programada para realizar cualquier tarea algorítmica, lo cual fue complementado en el mismo año de 1937 por Claude Shannon del MIT con la noción de integración de circuitos en los rieles eléctricos que integran el sistema binario de almacenamiento de informaci

  13. Development of a computational system for radiotherapic planning with the IMRT technique applied to the MCNP computer code with 3D graphic interface for voxel models; Desenvolvimento de um sistema computacional para o planejamento radioterapico com a tecnica IMRT aplicado ao codigo MCNP com interface grafica 3D para modelos de voxel

    Energy Technology Data Exchange (ETDEWEB)

    Fonseca, Telma Cristina Ferreira

    2009-07-01

    The Intensity Modulated Radiation Therapy - IMRT is an advanced treatment technique used worldwide in oncology medicine branch. On this master proposal was developed a software package for simulating the IMRT protocol, namely SOFT-RT which attachment the research group 'Nucleo de Radiacoes Ionizantes' - NRI at UFMG. The computational system SOFT-RT allows producing the absorbed dose simulation of the radiotherapic treatment through a three-dimensional voxel model of the patient. The SISCODES code, from NRI, research group, helps in producing the voxel model of the interest region from a set of CT or MRI digitalized images. The SOFT-RT allows also the rotation and translation of the model about the coordinate system axis for better visualization of the model and the beam. The SOFT-RT collects and exports the necessary parameters to MCNP code which will carry out the nuclear radiation transport towards the tumor and adjacent healthy tissues for each orientation and position of the beam planning. Through three-dimensional visualization of voxel model of a patient, it is possible to focus on a tumoral region preserving the whole tissues around them. It takes in account where exactly the radiation beam passes through, which tissues are affected and how much dose is applied in both tissues. The Out-module from SOFT-RT imports the results and express the dose response superimposing dose and voxel model in gray scale in a three-dimensional graphic representation. The present master thesis presents the new computational system of radiotherapic treatment - SOFT-RT code which has been developed using the robust and multi-platform C{sup ++} programming language with the OpenGL graphics packages. The Linux operational system was adopted with the goal of running it in an open source platform and free access. Preliminary simulation results for a cerebral tumor case will be reported as well as some dosimetric evaluations. (author)

  14. Computational intercomparison of the mathematical model of a clinical accelerator LINAC 6MV using two different Monte Carlo codes: MCNPx and EGSnrc; Intercomparacao computacional do modelo matematico de um acelerador clinico LINAC 6MV utilizando dois codigos de Monte Carlo diferentes: MCNPx e EGSnrc

    Energy Technology Data Exchange (ETDEWEB)

    Castelo e Silva, L.A., E-mail: castelo@ifsp.edu.br [Instituto Federal de Sao Paulo (IFSP), SP (Brazil); Mendes, M.B.; Goncalves, B.R.; Santos, D.M.M.; Vieira, M.V.; Fonseca, R.L.M.; Zenobio, M.A.F.; Fonseca, T.C.F. [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN/CNEN-MG), Belo Horizonte, MG (Brazil); Paixao, L. [Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, MG (Brazil)

    2016-07-01

    The main goal of this work is to publish the results of an inter-comparison simulation exercise of a clinical 10 x 10 cm{sup 2} beam model of a 6 MV LINAC using two different Monte Carlo codes: the MCNPX and EGSnrc. Results obtained for the dosimetric parameters PDD{sub 20,10} and TPR{sub 20,10} were compared with experimental data obtained in Radiotherapy and Megavoltage Institute of Minas Gerais. The main challenges on the computational modeling of this system are reported and discussed for didactic purposes in the area of modeling and simulation. (author)

  15. Aplicació de tècniques de pensament computacional en aules escolars

    OpenAIRE

    Vives Pons, Jordi

    2014-01-01

    En el present article es planteja quins mecanismes existeixen per aplicar el pensament computacional en les aules escolars i s'analitzarà com s'està duent a terme aquesta implantació en diferents països. Finalment, es proposa i es desenvolupa una aplicació web basada en eines de programari lliure per tal d'introduir als infants alguns dels fonaments del pensament computacional a les seves aules. En el presente artículo se plantea qué mecanismos existen para aplicar el pensamiento computaci...

  16. Numerical simulation of a cogeneration plant with micro gas turbine using computational tool EES; Simulacao numerica de uma planta de cogeracao com microturbina a gas natural utilizando ferramenta computacional EES

    Energy Technology Data Exchange (ETDEWEB)

    Oliveira, Guilherme L.B. de; Oliveira, Andrezza C.C.T.; Dutra, Jose C.C. [Universidade Federal de Pernambuco (UFPE), Recife, PE (Brazil)

    2008-07-01

    Today, the cogeneration of energy has been widely disseminated and presents itself as a very viable alternative for energy savings, reducing CO2 emissions by conducting reuse energy. This study aims to develop a software for simulation, analysis and optimization of a cogeneration system that uses a natural gas turbine as a primary source. The data contained in the software were similar to existing data in a micro-cogeneration plant installed at UFPE and the results showed up in the standard presented by actual plant. We conclude that the software serves as a tool to pre-analysis of the plant of choice for cogeneration equipment to be installed as: pumps, heat exchangers, chillers, cooling towers. (author)

  17. Development of virtual anthropomorphism of head mathematical model for using in dosimetry computerized simulation; Desenvolvimento de modelo matematico antropomorfico virtual de cabeca para utilizacao em simulacao computacional de dosimetria

    Energy Technology Data Exchange (ETDEWEB)

    Cassola, V.F.; Hoff, G.; Streck, E.E. [Pontificia Univ. Catolica do Rio Grande do Sul, Porto Alegre, RS (Brazil). Faculdade de Fisica. Grupo de Experimentacao e Simulacao Computacional em Fisica (GESiC)]. E-mail: ghoff@pucrs.br

    2004-07-01

    This paper shows the development of a virtual anthropomorphous model of head, considering different tissue composition, based in Nuclear Magnetic Resonance (NMR) images. The head original images were acquired in an equipment of NMR GE Sigma Horizon LX 1.5 T Echo Speed, available in the clinic of diagnosis for image SIDI. These images were segmented using routines developed in C++ language. The generated model is a group of 124 matrices of sequential data in format ASCII, where 26 indices evidence different structures. (author)

  18. Complejidad descriptiva y computacional en m\\'aquinas de Turing peque\\~nas

    CERN Document Server

    Joosten, Joost J; Zenil, Hector

    2010-01-01

    En este trabajo ofrecemos algunos de los resultados obtenidos al estudiar las funciones calculadas por m\\'aquinas de Turing con un alfabeto de dos s\\'imbolos y un n\\'umero de estados entre 1 y 3. Presentamos detenidamente el modelo de m\\'aquina de Turing empleado, donde la cinta es ilimitada en un solo sentido, y no existe estado de parada. Mostramos gr\\'aficamente c\\'omo es posible representar la funci\\'on calculada por una m\\'aquina, as\\'i como las computaciones realizadas para ello. Vemos que al aumentar el n\\'umero de estados, si bien es posible que algunas funciones se calculen con mayor rapidez, por lo general aumenta considerablemente el tiempo medio de computaci\\'on.

  19. La Ingeniería Computacional en la Escuela de Caminos de Barcelona

    OpenAIRE

    Huerta, Antonio; Díez, Pedro; Fernandez Mendez, Sonia; Pérez Foguet, Agustí; Rodríguez Ferran, Antonio; Sarrate Ramos, Josep

    2003-01-01

    La ingeniería computacional se ha consolidado ya como una disciplina horizontal en el ámbito de la ingeniería civil. La modelización numérica es, cada vez más, una alternativa para el cálculo y diseño en inge niería a los procedimientos simplificados típicamente recogidos por las normativas. Permite analizar fenómenos de mayor complejidad y obtener diseños más ajustados. En la Escuela de Caminos de Barcelona, estos aspectos se abordan en la intensificación en ingeniería computacional. Los mét...

  20. La Ingeniería Computacional en la Escuela de Caminos de Barcelona

    OpenAIRE

    Huerta, Antonio; Díez, Pedro; Fernandez Mendez, Sonia; Pérez Foguet, Agustí; Rodríguez Ferran, Antonio; Sarrate Ramos, Josep

    2003-01-01

    La ingeniería computacional se ha consolidado ya como una disciplina horizontal en el ámbito de la ingeniería civil. La modelización numérica es, cada vez más, una alternativa para el cálculo y diseño en inge niería a los procedimientos simplificados típicamente recogidos por las normativas. Permite analizar fenómenos de mayor complejidad y obtener diseños más ajustados. En la Escuela de Caminos de Barcelona, estos aspectos se abordan en la intensificación en ingeniería computacional. Los mét...

  1. LA ESTADISTICA Y LA COMPUTACION EN APOYO A LA TOMA DE DECISIONES

    OpenAIRE

    Lara Villagrán, Vladimir; Murillo R., Maureen

    2011-01-01

    La mayoria de la decisiones a nivel tactico-estrategico de una organizacion necesitan un apoyo computacional que ofrezca mas que simples datos descriptivos. Se esperaria que un sistema que apoye realmente este tipo de decisiones proponga al usuario diversas alternativas para que este las conjugue a su juicio en la toma de decisiones. Estas decisiones normalmente involucran cierto grado de incertidumbre y de riesgo. Para crear un sistema de apoyo a estas decisiones,en estas circunstancias, el ...

  2. Métodos de Simulación Computacional en Biología

    Directory of Open Access Journals (Sweden)

    Amir Dario Maldonado Arce

    2016-12-01

    Full Text Available Las técnicas de simulación computacional se usan extensivamente para estudiar sistemas biológicos, y en general, materiales sólidos y blandos. Debido a la complejidad de los fenómenos biológicos, y a la imposibilidad de estudiar teóricamente el comportamiento de sistemas tales como proteínas y membranas, la simulación computacional se utiliza para estudiar la estructura y dinámica de estos sistemas en diferentes escalas temporales. En este artículo describiremos brevemente algunas de las técnicas de simulación computacional más utilizadas en Biología: la Dinámica Molecular, la Dinámica Browniana y el Método de Monte Carlo. Nuestra intención es proporcionar un panorama introductorio de la utilidad de los métodos de simulación molecular en Biología

  3. La simulación computacional en Química y Física

    Directory of Open Access Journals (Sweden)

    Ernesto Chigo Anota

    2004-01-01

    Full Text Available En el presente trabajo se da a conocer la importancia de la simulación o modelado computacional en lo que se conoce como laboratorio virtual (en analogía a un laboratorio real, desde dos puntos de vista: la química cuántica computacional (QCC y la física del estado sólido computacional (FESC, además de su aplicación y el perfil que deberá poseer el estudiante en estas áreas de la investigación. La aplicación de simulación es una prueba que llevó al matemático John Pople y al físico Walter Kohn a ganar el premio Nobel de química en 1998, creadores del programa molecular gaussian que implementa las dos principales teorías para el estudio de sistemas moleculares como son la teoría Hartree-Fock (HF y la teoría de las funcionales de la densidad-DFT

  4. Caracterización de variables utilizando inteligencia computacional para identificar alteraciones en la salud de bovinos

    OpenAIRE

    Edgar Leonardo Sarmiento-Pacanchique; Oscar Iván Torres-Corredor; Javier Antonio Ballesteros-Ricaurte; Gustavo Cáceres-Castellanos

    2015-01-01

    La detección de alteraciones de la salud de los animales mediante pruebas de laboratorio es un proceso complejo que implica relacionar diversas variables y factores clínicos de los individuos; por ello, en esta investigación se evaluaron técnicas de inteligencia computacional que contribuyeron a la identificación de patrones de comportamiento de las alteraciones detectadas en las pruebas de hemograma aplicadas en bovinos. Aunque diversos algoritmos de inteligencia computacional son utilizados...

  5. Interação Humano - Computador usando Visão Computacional

    Directory of Open Access Journals (Sweden)

    Bernardo Bucher B. Barbosa

    2015-07-01

    Full Text Available Este trabalho visa estudar maneiras de se explorar a Interação Humano Computador, usando Visão Computacional. A idéia tem como objetivo um esforço para tornar o computador mais interativo com o usuário, sem a necessidade da compra de um hardware ou acessório específico para tal. O produto final deste trabalho em desenvolvimento é um software que contempla esta funcionalidade, tornando o computador mais interativo.

  6. Neurociencia computacional aplicada a la liberación de transmisores por exocitosis

    OpenAIRE

    Fernández Peruchena, Carlos María

    2008-01-01

    Falta por incorporar las palabras clave La Tesis presentada, realizada bajo la dirección del Dr. Guillermo Álvarez de Toledo Naranjo, lleva por título Neurocincia computacional aplicada a la liberación de transmisores por exocitosis. El trabajo desarrollado en esta Tesis forma parte de la actividad de investigación sobre secreción celular que se lleva a cabo en el grupo de investigación del Dr. Álvarez de Toledo (CVI-209), dentro del proyecto BFI2001-3199. El grupo de investigación CVI-209...

  7. La Energía del Cerebro Humano Autolimita su Poder Computacional

    Directory of Open Access Journals (Sweden)

    Mario Camacho Pinto

    1990-08-01

    Full Text Available

    Los expertos en informática no consideran apropiado seguir preguntando cuántos Mips o cuántos Megaflops constituyen la capacidad de ejecución del cerebro a ejemplo de un Supercomputador Cray o de un IBM Pc, sino cuántas operaciones computacionales puede ejecutar el encéfalo en fa unidad de tiempo o sea su poder computacional.

    El enfoque neurofisiológico involucra tres aspectos contributorios para una respuesta positiva, a saber:

    l. Poder computacional de las Synapsis intemeuronales.
    2. Poder computacional de la retina como punto de referencia.
    3. Medición de la energía total gastada por el cerebro en la unidad de tiempo.

    l. Poder computacional de las Synapsis.
    Engloba así mismo 3 premisas a saber:

    a. El cerebro no puede “computar” si la programación de las señales NO se efectúa mediante el transporte de una Synapsis a la siguiente por el sofisticado mecanismo electroquímico que requiere una determinada cantidad de energía que limita su poder, como veremos adelante.

    b. Este transporte toma tiempo que ha sido posible calcular en relación con la distancia total que todos los impulsos nerviosos tienen que recorrer, tiempo que se ha estimado en un segundo por cada diez impulsos.

    c. El número de Synapsis actuantes se calcula en 10 15.

    Así el total de “operaciones” será el resultado de la relación del número de Synapsis en juego con la distancia que tenga que recorrer el impulso nervioso y su velocidad de operancia.

    Entonces como hay aproximadamente 1015 Synapsis operando a 10 impulsos por segundo, el resultado crudo sería evaluado en 1016 operaciones synapsiales del cerebro en la unidad de tiempo...

  8. SIMULACION COMPUTACIONAL DE PROCESOS DE CONGELACION Y DESHIDRATACION PARA ALIMENTOS SOLIDOS POROSOS Y LIQUIDOS NO NEWTONIANOS

    OpenAIRE

    LEMUS MONDACA, ROBERTO ALEJANDRO

    2012-01-01

    Esta Tesis Doctoral corresponde a parte de las actividades de los Proyectos FONDECYT 1070186 y 1111067, donde se utiliza la modelación matemática y la simulación computacional para describir los fenómenos de transporte de fluidos, calor y masa que ocurren en los procesos de congelación y deshidratación de alimentos sólidos porosos y líquidos no Newtonianos. En paralelo se estudian diferentes características de gran complejidad para cada proceso térmico, como son: uso de modelos conjugados ...

  9. Curso Práctico de Mecánica de Fluidos Computacional

    OpenAIRE

    Parra Santos, María Teresa

    2015-01-01

    La mecánica de fluidos computacional (CFD) es una herramienta de diseño fundamental cuyo desarrollo en los últimos años se ha visto favorecido por la potencia de los ordenadores. Existen un número significativo de códigos cuya toma de contacto puede ser más o menos sencilla. El riesgo reside en su manejo como una caja negra donde se introduce información y se extraen resultados sin conocer unos mínimos fundamentos o sin la capacidad de interpretar su validez. Las destrezas necesarias deben se...

  10. Tecnología y filosofía wiki aplicadas al electromagnetismo computacional

    OpenAIRE

    De la Cruz Calvo, Daniel

    2007-01-01

    Este trabajo de fin de carrera se ha realizado en la Escola Politècnica Superior de Castelldefels (EPSC) en colaboración con el Centre Internacional de Mètodes Numèrics en Enginyeria (CIMNE) con el objetivo de explorar las posibilidades de la tecnología wiki aplicada al ámbito de investigación de CIMNE: el electromagnetismo computacional. De acuerdo con la Wikipedia, “un (o una) wiki es un sitio web colaborativo que puede ser editado por varios usuarios. Los usuarios de una ...

  11. Panorámica de la teoría computacional: Desarrollo y problemas abiertos.

    OpenAIRE

    Sanz Herranz, Héctor

    2017-01-01

    En este trabajo se exponen sendas introducciones a los conceptos propios de la teoría de la computación y de la teoría de la complejidad computacional, prestando especial atención a los movimientos filosóficos que propiciaron su desarrollo. Asimismo, se presenta una de las incógnitas sin resolver más importantes de laMatemática, la conjetura de Cook, así como sus consiguientes implicaciones al respecto de la naturaleza de los propios problemas. Departamento de Filosofía (Fil...

  12. ADAPTACIÓN DE UN INSTRUMENTO PARA EVALUAR LA AUTOEFICACIA COMPUTACIONAL EN ESTUDIANTES VENEZOLANOS

    Directory of Open Access Journals (Sweden)

    Sofía E. Peinado de Briceño

    2010-01-01

    Full Text Available El objetivo del presente trabajo fue adaptar y evaluar algunas propiedades psicométricas del Inventario de Autoeficacia Computacional (IAC de Torkzadeh y Koufteros en una muestra de estudiantes universitarios venezolanos de carreras tecnológicas. El IAC evalúa la autopercepción de las capacidades para utilizar adecuadamente el computador y los medios de comunicación asíncronos en la realización de actividades académicas a distancia. La muestra se integró por 311 estudiantes de una universidad venezolana, cuyas edades estuvieron comprendidas entre 17 y 24 años. El procedimiento se inició con la traducción, adaptación del instrumento y estudio de su validez a través un análisis factorial de componentes principales con rotación varimax. Los resultados muestran que el IAC presenta dos subescalas de autoeficacia: habilidades básicas y habilidades avanzadas. Además, mostró una alta consistencia interna. Se estima que este instrumento es una valiosa contribución para evaluar la autoeficacia computacional en estudiantes universitarios venezolanos.

  13. Inteligência Computacional Aplicada a Resolução do Problema do Corte Unidimensional

    Directory of Open Access Journals (Sweden)

    Tiago Zonta

    2005-12-01

    Full Text Available Neste trabalho e feito um estudo para resolução do Problema do Corte Unidimensional (PCU utilizando técnicas de Programação Matemática e Inteligência Computacional (IC. No PCU, vários objetos de dimensão L, devem ser cortados em n itens menores com dimensões li e valor de utilidade vi. O problema é achar a melhor forma de se fazer este corte de modo a minimizar a perda dos objetos de comprimento L a serem cortados e maximizar a soma dos valores de utilidade de cada um dos itens menores de comprimento li. Foram utilizadas quatro técnicas: Algoritmo First Fit Decreasing (FFD, Algoritmo Guloso (AGU, Limitante de Dantzig (LD e Algoritmos Genéticos (AG.

  14. La Neurociencia Computacional hoy: II. El Proyecto Blue Brain, un ejemplo muy representativo en el campo

    Directory of Open Access Journals (Sweden)

    Jesús Cortés

    2009-01-01

    Full Text Available La Neurociencia Computacional es un campo reciente, pero bien establecido dentro de las Neurociencias. En un primer artículo (Cortés, 2009, http://www.cienciacognitiva.org/?p=55, “Qué es y por qué es difícil su estudio”, explico su principal paradigma: todo proceso mental que tiene lugar en nuestro cerebro tiene un circuito o cableado físico que lo sustenta. En este artículo comento un ejemplo muy representativo en el campo: el macro-proyecto de simulación a gran escala y en tiempo real de procesos en la corteza cerebral, el famoso Blue Brain Project.

  15. Soporte computacional para administración integrada de redes y servicios

    Directory of Open Access Journals (Sweden)

    José Nelson Pérez Castillo

    2011-06-01

    Full Text Available Este artículo contextualiza la problemática actual de la administración de redes de comunicaciones considerando las profundas repercusiones, tanto de la internacionalización de la economía como del ritmo impetuoso del avance tecnológico sobre el sector teleinformático y la calidad en la prestación de los servicios de comunicaciones. Reseña someramente las actividades de los distintos frentes de estandarización; en particular la ISO, la ITU- T y la Internet. Se muestran, entonces, las características del soporte computacional para el desarrollo de aplicaciones, señalando los servicios de comunicaciones, interfaz gráfica y bases de datos teniendo en cuenta la naturaleza distribuida de la administración de redes. Finalmente, se muestran los atributos generales de las herramientas de desarrollo disponibles en la actualidad.

  16. Occupational doses simulation in industrial radiography; Simulacao de doses ocupacionais em radiografia industrial

    Energy Technology Data Exchange (ETDEWEB)

    Teixeira, Pedro B.; Falcao, Rossana C.; Facure, Alexandre [Comissao Nacional de Energia Nuclear (CNEN), Rio de Janeiro, RJ (Brazil)]. E-mail: pbarbosa@cnen.gov.br; ross@cnen.gov.br; afsoares@cnen.gov.br; Hunt, John [Instituto de Radioprotecao e Dosimetria (IRD), Rio de Janeiro, RJ (Brazil)]. E-mail: john@ird.gov.br; Silva, Ademir X. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: ademir@com.ufrj.br

    2005-07-01

    The application of ionizing radiation in industrial processes is assuming an important role in the national scenario. Industrial radiography is one of the more used techniques in the nondestructive assays. This type of radiography can be carried out through X or gamma rays, and in about ninety percent of the cases this procedure it is carried out using 192 Ir sources, which is a gamma with average energy of 380 keV. This practice is called Gammagraphy. The Brazilian regulation Norm CNEN-NN-6.04 of the Nuclear National Energy Commission (CNEN), determines that works of Industrial Radiography in urban, suburban and agricultural areas, where there is presence of the public in general, to follow the recommendations of an specific radioprotection guide. The operations in these urban zones cannot cause over expositions to the operators as well as to the public. The present work presents the first step in order to simulate occupational doses in urban zones. Occupational doses were simulated and an intercomparison was made between the Monte Carlo Codes VMC and MCNP, with the objective of testing the viability of using the first code, which was developed at CNEN, to simulate values of occupational doses in situations of routine and emergency exposures, in real time. (author)

  17. Caracterización de variables utilizando inteligencia computacional para identificar alteraciones en la salud de bovinos

    Directory of Open Access Journals (Sweden)

    Edgar Leonardo Sarmiento-Pacanchique

    2015-01-01

    Full Text Available La detección de alteraciones de la salud de los animales mediante pruebas de laboratorio es un proceso complejo que implica relacionar diversas variables y factores clínicos de los individuos; por ello, en esta investigación se evaluaron técnicas de inteligencia computacional que contribuyeron a la identificación de patrones de comportamiento de las alteraciones detectadas en las pruebas de hemograma aplicadas en bovinos. Aunque diversos algoritmos de inteligencia computacional son utilizados en la solución de problemas médicos, no se encontró registro de investigaciones en procesos médicos veterinarios. Una vez hecha una minuciosa caracterización de las variables y la evaluación de las técnicas de inteligencia computacional, se determinó que el algoritmo que mejor se ajusta al propósito de análisis de datos planteado es FP-Growth.

  18. El proyecto computacional conexionista en el análisis teórico de la actividad conciente

    Directory of Open Access Journals (Sweden)

    Fabio Enrique Martínez

    2006-01-01

    Full Text Available La actividad conciente, ese devenir que experimentamos como una serie de estados de subjetividad, es uno de los misterios, y quizás el desafío fundamental de la ciencia contemporánea. Es también un campo de exploración especialmente activo y fructífero que sobrevivió la transición entre los siglos XIX y XX, y nuevamente ha tomado un fuerte impulso ahora en el XXI. Existe, sin embargo, una gran controversia sobre la plausibilidad de una explicación teórica, analítica y formal (v.g.: computacional de los fenómenos que asociamos a la actividad conciente. ¿Es factible formular una explicación reduccionista de la actividad conciente, es decir, una descripción del fenómeno expresada en términos de relaciones funcionales y/o causales? Los párrafos del presente ensayo escudriñan algunos elementos relevantes a fin de establecer la suficiencia explicativa que tiene el paradigma computacional conexionista para dilucidar los principios formales imbricados en el estudio de la actividad conciente. El propósito que subyace la elaboración siguiente es sugerir que la viabilidad del conexionismo y del proyecto computacional depende de los siguientes aspectos: (1 El grado de refinamiento con el que se defina la representación y la computabilidad de los estados concientes, (2 Los avances metodológicos y conceptuales de las ciencias del cerebro, y (3 La distinción que se haga entre simulación, modelamiento y representación computacional de la actividad conciente. Con estas ideas en mente, a través del capítulo mostraré un esquema conceptual básico para entender por qué el paradigma conexionista puede ser un candidato plausible para pensar una teoría formal de la actividad conciente. Finalmente, a la luz de los planteamientos presentados, señalaré algunos aspectos importantes para establecer la viabilidad de una teoría computacional de la actividad conciente

  19. Dinámica de fluidos computacional aplicada al estudio de regeneradores térmicos

    Directory of Open Access Journals (Sweden)

    Cesar Nieto Lodoño

    2004-01-01

    Full Text Available En el presente artículo, muestra los resultados logrados durante la simulación de un regenerador térmico de lecho poroso empacado, sometido a convección forzada transitoria y su respectiva verificación experimental. Para visualizar la aplicación de la Dinámica de Fluidos Computacional (en inglés Computational Fluid Dynamics, CFD en regeneradores de calor, se realiza un estudio detallado de los elementos que conforman la malla; analizando su distribución, tamaño y respectivo efecto sobre la precisión de los resultados. Se establecen las simplificaciones y alcances de los modelos empleados. Se comprueba la veracidad de los resultados obtenidos, mediante la validación experimental de estos en un modelo físico idéntico al empleado durante la simulación. Estas etapas permitieron observar que el comportamiento exponencial de la temperatura en los elementos empacados durante el periodo de calentamiento, fue idéntico al observado por Mejía [8]. Los resultados obtenidos aquí, verifican la capacidad de la CFD para el estudio de los regeneradores térmicos.

  20. La Neurociencia Computacional hoy: I. Qué es y por qué es difícil su estudio

    Directory of Open Access Journals (Sweden)

    Jesús Cortés

    2009-01-01

    Full Text Available La Neurociencia Computacional es una disciplina consolidada, con más de 20 años de desarrollo, y que emplea técnicas muy diversas para entender diferentes computaciones cerebrales. Aquí se introduce brevemente mediante dos artículos. En el primero, “Qué es y por qué es difícil su estudio”, se introducen de forma muy general cuáles son sus objetivos como ciencia y los problemas con los que se encuentra. En el segundo, mediante “Un ejemplo muy representativo en el campo” abordamos su metodología y destacamos la trascendencia que la Neurociencia Computacional está teniendo y tendrá dentro de las Neurociencias.

  1. Ferramenta computacional para medição de deslocamentos em ensaios de carga através de técnicas de processamento de imagem

    OpenAIRE

    Fernandes, Helder Gonçalves

    2016-01-01

    Dissertação de Mestrado para a obtenção de grau de Mestre em Engenharia Eletrotécnica Ramo de Automação e Eletrónica Industrial A realização desta dissertação teve como objetivo o desenvolvimento de uma ferramenta computacional, que permita a medição de deslocamentos de uma amostra de um determinado material a analisar (região de interesse - ROI) em um ensaio em carga estático através de processamento de imagem. A ferramenta computacional impleme...

  2. Necesidad de un Centro Nacional de Bioinformática y Biología Computacional para Colombia

    Directory of Open Access Journals (Sweden)

    Lyda Raquel Castro

    2010-08-01

    Full Text Available Los principales y más revolucionarios avances de la biología en este siglo se han derivado de la información proveniente de genomas completos de diferentes organismos. Los descubrimientos que se derivan de la genómica están generando un nuevo paradigma en la biología, sustituyendo la era de la biología centrada en los genes por aquella centrada en los genomas. Este nuevo concepto es base para desarrollos de gran potencial e impacto social en diferentes áreas como la medicina, la agricultura y la industria. El éxito en el desarrollo de métodos de última generación para la secuenciación de genomas, la proteómica y todas las “omicas”, ha contribuido al surgimiento de nuevas posibilidades para el análisis de la enorme cantidad de datos que se están generando mediante el uso de herramientas computacionales, dando origen a una nueva rama de estudio conocida como bioinformática o biología computacional. Este trabajo hace una revisión general del desarrollo de la bioinformática y la biología computacional en Colombia. Inicialmente, a modo de comparación, describimos el desarrollo de esta ciencia en otros países latinoamericanos que son reconocidos en el área. Finalmente, se discuten los principales aspectos que van a jugar un papel importante en el futuro de esta ciencia en nuestro país, y que además justifican la necesidad de crear un centro nacional de bioinformática y biología computacional.

  3. A Utilização da Modelagem Computacional Semiquantitativa no Estudo do Sistema Mola-Massa

    Directory of Open Access Journals (Sweden)

    Camiletti Giuseppi

    2002-01-01

    Full Text Available O artigo apresenta resultados da investigação sobre a integração de ambientes de modelagem computacional ao aprendizado exploratório de Física. Os resultados aqui apresentados são relativos ao estudo da interação e desempenho de alunos de ensino superior durante a utilização do ambiente de modelagem computacional semiquantitativo WLinkIt em uma atividade de conteúdo específico em Física: o sistema mola-massa. Os resultados mostram que os estudantes apresentaram habilidades para desenvolver um modelo sobre a situação proposta e relacionar o comportamento apresentado pelo modelo com o esperado por eles, alterar o modelo e explicar o comportamento apresentado pelas variáveis. Os resultados mostram também que as dificuldades apresentadas foram relacionadas à delimitação do sistema a ser estudado, ao entendimento da influência de uma variável sobre a outra, ao entendimento de quem é o agente causal do sistema, ao entendimento da função de uma ligação entre duas variáveis e ao entendimento dos conceitos envolvidos. Assim, o mapeamento desses aspectos é fundamental para o delineamento de pesquisas futuras no sentido de promover, na prática, a integração de Ambientes de Modelagem Computacional Semiquantitativos na sala de aula, mais especificamente para o estudo de tópicos de Física.

  4. N-gramas sintácticos y su uso en la lingüistica computacional

    OpenAIRE

    Grigori Sidorov

    2013-01-01

    En este artículo, estamos introduciendo un nuevo concepto que se utilizará en la lingüística computacional, se llama n-gramas sintácticos: son n-gramas que se construyen siguiendo un árbol sintáctico. Es equivalente a introducir la información sintáctica en los métodos de aprendizaje automático, que siempre era un problema muy difícil. Discutimos los elementos que pueden formar estos n-gramas: palabras, clases gramaticales (POS tags), nombres de relaciones sintácticas, caracteres. Consideramo...

  5. Desenvolvimento de um sistema de visão computacional para oestudo do comportamento de animais experimentais

    OpenAIRE

    Guilherme Damasceno Silva

    2008-01-01

    Visão Computacional é a área da ciêcia que se dedica a desenvolver teorias e métodos voltados à extração automática de informações contidas em imagens.Nesta pesquisa, foi desenvolvido um sistema de monitoramento de animais experimentais utilizando alguns desses métodos. Esse sistema tem como objetivo automatizar os experimentos utilizados pela fisiologia do comportamento e psicofarmacologia, os quais buscam caracterizar o comportamento dos animais experimentais (geralmente roedores) na explor...

  6. Capacitación en programación para incorporar el pensamiento computacional en las escuelas

    OpenAIRE

    Gladys N. Dapozo; Petris, Raquel H.; Cristina L. Greiner; Espíndola, María C.; Company, Ana María; López, Mariano

    2016-01-01

    En este trabajo se presentan los resultados de una experiencia de enseñanza de programación que busca incorporar el pensamiento computacional en las escuelas. Se realizó una encuesta a los participantes de la capacitación. De los resultados obtenidos se destaca que la totalidad de los docentes considera importante incorporar la programación en las escuelas para promover el pensamiento lógico y como competencia demandada en la actualidad. Asimismo, surge que los docentes se han apropiado de lo...

  7. Modelo computacional para determinação do risco econômico em culturas irrigadas

    OpenAIRE

    Patricia Angélica Alves Marques

    2005-01-01

    As empresas agrícolas atuam sob condições de risco, dessa maneira a utilidade de modelos determinísticos para fins de planejamento torna-se relativamente limitada. Isto implica na necessidade de não se desprezar a aleatoriedade de determinados coeficientes e introduzir o risco na análise do projeto. Com este objetivo, desenvolveu-se uma ferramenta na forma de um Modelo Computacional para Determinação do Risco Econômico em Culturas Irrigadas, para o ambiente Windows XP em linguagem Delphi 7.0...

  8. Herramienta computacional para la evaluación post-sísmica de daños en edificios

    OpenAIRE

    Carreño Tibaduiza, Martha Liliana; Omar D. Cardona; Marulanda, Mabel C.; Barbat Barbat, Horia Alejandro

    2007-01-01

    En este artículo se desarrolla un método y una herramienta computacional orientada a apoyar la evaluación de daños y de la seguridad de los edificios después de sismos fuertes. Los datos de entrada del programa de computador corresponden a información subjetiva e incompleta del estado del edificio, obtenida por profesionales posiblemente inexpertos en el campo de la construcción. Los niveles de daño de los componentes estructurales normalmente son descritos por calificaciones ling...

  9. Estimación del riesgo de no superar una asignatura de evaluación continua mediante aprendizaje computacional

    OpenAIRE

    López Leiva, José Mario

    2017-01-01

    El presente trabajo representa la finalización de los estudios del Grado en Ingeniería Informática impartida en la Universidad Politécnica de Madrid, del alumno José Mario López Leiva. Por tanto, este documento el culmen de un proceso de formación que recoge la adquisición de conocimiento en distintas ramas de las Ciencias de la Computación, y en concreto, esta obra versa acerca de uno de los temas en boga dentro de esta rama del saber: el aprendizaje computacional (o automátic...

  10. Modelagem Computacional para Produção e Pesquisa em Avicultura

    Directory of Open Access Journals (Sweden)

    Rondón EOO

    2002-01-01

    Full Text Available A modelagem computacional foi apresentada como uma ferramenta na tomada de decisões para solucionar problemas complexos e cotidianos na produção e pesquisa em avicultura. Aspectos teóricos relacionados à construção e implementação dos diferentes tipos de modelos matemáticos utilizados em avicultura foram descritos de maneira elementar, tentando deixar o artigo acessível às pessoas que não necessariamente possuem um forte conhecimento de estatística experimental. Uma ênfase especial foi dada à discussão das vantagens da modelagem para resolver o problema complexo de determinar exigências nutricionais das aves em diferentes condições. Uma revisão cronológica das publicações relacionadas aos pacotes computacionais desenvolvidos para auxiliar na formulação de estratégias nutricionais em aves mostrou que eles estão baseados na modelagem do crescimento associada aos modelos de estimação de exigências e de custo mínimo de rações. A evolução e sofisticação desses programas têm acompanhado os rápidos avanços computacionais. Contudo, a eficiência de uma simulação depende dos conhecimentos sobre situações reais. Esses conhecimentos são gerados pelas pesquisas tradicionais e muitas vezes é de fundamental importância a conexão de informações provenientes de diferentes disciplinas, direta ou indiretamente, relacionadas à avicultura.

  11. Programa computacional para calcular a potência requerida de máquinas e implementos agrícolas

    Directory of Open Access Journals (Sweden)

    Pablo Pereira Corrêa Klaver

    2013-12-01

    Full Text Available O uso de programas computacionais no setor agrícola permite atingir objetivos específicos na área. Dentre esses, um dos mais complexos é a seleção adequada de máquinas e implementos agrícolas visando à otimização de operações agrícolas, devido, principalmente, à grande variedade de equipamentos existentes no mercado e a gama de tarefas e situações de trabalho que estas são submetidas no campo. O objetivo deste trabalho foi desenvolver um programa computacional para calcular a potência requerida de máquinas e implementos agrícolas normalmente utilizados na condução de operações de campo, desde o preparo do solo até as operações de implantação de culturas. Desenvolvido em linguagem PHP, o programa computacional baseia-se na norma ASAE D497.4 - Agricultural Machinery Management Data como referência para desenvolvimento de cálculos. A partir do programa desenvolvido, tornou-se possível a execução de tarefas para cálculos de avaliação da demanda de potência de máquinas e implementos agrícolas de forma simplificada pela internet.

  12. N-gramas sintácticos y su uso en la lingüistica computacional

    Directory of Open Access Journals (Sweden)

    Grigori Sidorov

    2013-05-01

    Full Text Available En este artículo, estamos introduciendo un nuevo concepto que se utilizará en la lingüística computacional, se llama n-gramas sintácticos: son n-gramas que se construyen siguiendo un árbol sintáctico. Es equivalente a introducir la información sintáctica en los métodos de aprendizaje automático, que siempre era un problema muy difícil. Discutimos los elementos que pueden formar estos n-gramas: palabras, clases gramaticales (POS tags, nombres de relaciones sintácticas, caracteres. Consideramos dos ejemplos de cómo se puede obtener los n-gramas sintácticos basándonos en un árbol sintáctico, tanto para el español como para el inglés. Adicionalmente, presentamos un modelo más utilizando de solución de problemas de la lingüística computacional, específicamente, el modelo de espacio vectorial.

  13. Cenários logísticos alternativos para a cabotagem do estado do Amazonas utilizando simulação computacional

    National Research Council Canada - National Science Library

    Medeiros, Rafael Lima; Santos, José Teixeira Araújo Neto dos; Kuwahara, Nelson; Moita, Márcia Helena Veleda

    2015-01-01

    Este trabalho propõe a análise da viabilidade operacional de cenários logísticos alternativos para o transporte de cabotagem do estado do Amazonas, utilizando a técnica de simulação computacional...

  14. Simulação computacional aplicada na análise do projeto de um restaurante universitário

    Directory of Open Access Journals (Sweden)

    José Victor Silvério

    2016-09-01

    Full Text Available O uso da simulação computacional foi impulsionado pelos avanços da computação e sua grande flexibilidade de utilização. Dentre as diversas aplicações, a análise de projetos ganha destaque. O presente trabalho tem como objetivo aplicar a simulação computacional para análise da capacidade de atendimento de um novo restaurante universitário. Para tanto, foram utilizados a abordagem de pesquisa quantitativa e o procedimento de pesquisa experimental, por meio do uso de simulação computacional. Mediante a análise dos resultados do modelo computacional desenvolvido, foi possível compreender o provável funcionamento do sistema estudado, bem como o fluxo das entidades entre os locais de atendimento. Verificou-se que o espaço físico projetado é adequado para o atendimento. No entanto, o processo de atendimento do local caixa deverá ser revisto, pois em horários de maior procura pelo serviço houve grande formação de fila de espera. Este trabalho apresenta contribuições para a área acadêmica e para a área empresarial.

  15. Modelo computacional para la liofilización de alimentos de geometría finita

    Directory of Open Access Journals (Sweden)

    Héctor E. Gómez H.

    2003-01-01

    Full Text Available La liofilización es una técnica de conservación por deshidratación aplicada a productos químicos, farmacéuticos, médicos, biológicos y alimenticios. El proceso es también llamado criodesecación porque consiste primero en congelar un producto húmedo y luego en vaporizar directamente el hielo a baja presión. Este fenómeno es conocido como sublimación y era ya practicado por los incas del Perú, desde el siglo XIII, para conservar papas. Los productos liofilizados, a diferencia de los deshidratados por otras técnicas de secado, conservan prácticamente en 100% su forma y propiedades naturales, tienen mayor vida de anaquel y son fácilmente rehidratables. En el presente trabajo la liofilización es estudiada experimentalmente y caracterizada por medio de un modelo matemático y computacional. Para ello fue utilizada una hortaliza: la papa Solanum tuberosum, variedad blanca, como material para el modelado de la liofilización por contacto. Se prepararon muestras individuales en forma de placas y cilindros finitos a tres espesores diferentes. Se operó a dos presiones de vacío y tres temperaturas de calentamiento. Se obtuvieron así 36 cinéticas de deshidratación y de temperatura del producto en monocapa, con 8 repeticiones cada una. Se propone un modelo de liofilización que considera tres frentes de sublimación que se retiran uniformemente pero a velocidades interdependientes. Para el estudio se recurrió a las leyes de Fick y de Fourier en estado cuasi-estacionario, considerando despreciable el colapso en el producto. Las temperaturas de cada frente de sublimación se consideran variables. El modelo dinámico resultante es un sistema de tres ecuaciones algebraicas no lineales y tres ecuaciones diferenciales ordinarias. Para la solución del sistema de ecuaciones diferenciales-algebraicas se recurrió a los algoritmos acoplados de Runge-Kutta y Newton-Raphson. Para la estimación de los parámetros de transporte o coeficientes

  16. Visualização computacional de música com suporte à discriminação de elementos de teoria musical

    OpenAIRE

    Gabriel Dias Cantareira

    2014-01-01

    A visualização computacional de informação é um campo em expansão por oferecer meios de se interpretar e analisar vários tipos de dados em grande quantidade e/ou de grande complexidade, compreendendo diversas técnicas e ferramentas para fornecer a um usuário formas de interagir e explorar conjuntos de dados a fim de se obter informações úteis ou importantes. A música, por sua vez, é um domínio complexo e de difícil estudo sob o ponto de vista computacional devido à análise de seu conteúdo pos...

  17. Victimización y “ondas de choque”: simulación computacional de la propagación del miedo al crimen

    Directory of Open Access Journals (Sweden)

    Manuel Chacón-Mateos

    2017-04-01

    Full Text Available Se presenta un modelo computacional sobre la generación y propagación del miedo al crimen, basado en los impactos creados por la victimización criminal. El objetivo: es evaluar y describir los efectos que pueden tener en la propagación del miedo al crimen un conjunto de determinantes relacionados con la victimización (directa e indirecta: tamaño de la red social, tasa de victimización y tiempo de recuperación en victimizados. El método: utilizado fue la simulación computacional, en la cual se trabajó con cuatro combinaciones de parámetros que representan diferentes situaciones. Los resultados: permiten describir la dinámica de interacción entre los factores determinantes considerados, y reflejan que estos influyen de manera no lineal en la propagación del miedo al crimen.

  18. Simulation of transient thermohydraulic events in multiple circuits; Simulacao de eventos termo-hidraulicos transitorios em multiplos circuitos

    Energy Technology Data Exchange (ETDEWEB)

    Veloso, Marcelo A. [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN), Belo Horizonte, MG (Brazil)]. E-mail: velosom@cdtn.br; Zemp, Roger J. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Quimica]. E-mail: zemp@desq.feq.unicamp.br

    2005-07-01

    The PANTERA-2 code is intended to carry out rod bundle subchannel analysis in conjunction with multiloop simulation. It solves simultaneously the conservation equations of mass, axial and lateral momentum, and energy for subchannel geometry coupled with the balance equations that describe the fluid flows in any number of coolant loops connected to a pressure vessel containing the rod bundle. As far as subchannel analysis is concerned, the basic computational strategy of PANTERA-2 comes from COBRA codes, but an alternative implicit solution method oriented to the pressure field has been used to solve the finite difference approximations for the balance laws. The loop model predicts the individual loop flows, total flow through the pressure vessel, and pump rotational speeds as a function of time subsequent to the failure of any number of the coolant pumps. Comparisons of results reveal a good correspondence between the theoretical curves predicted by PANTERA-2 and measured values for pump rotational speeds and mass flow rates in the primary loops of Angra-2 nuclear power plant, when the four main coolant pumps are simultaneously switched off to simulate the flow decline event. (author)

  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. Application of mathematical model for simulation of groundwater flow; Aplicacao de modelo matematico para simulacao do fluxo de agua subterranea

    Energy Technology Data Exchange (ETDEWEB)

    Carvalho Filho, Carlos Alberto de; Branco, Otavio Eurico de Aquino [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN), Belo Horizonte, MG (Brazil); Loureiro, Celso de Oliveira [Minas Gerais Univ., Belo Horizonte, MG (Brazil). Dept. de Engenharia Sanitaria e Ambiental

    2000-07-01

    The main purpose of the present research work is the groundwater flow characterization of the aquifer system of the Engenho Nogueira Creek watershed basin, particularly within the limits of the Pampulha Campus of the Federal University of Minas Gerais and nearby. In order to reach the aforementioned goal, a numerical model was implemented for simulation the groundwater flow, using the MODFLOW code. The local hydrogeology consists of a porous granular aquifer placed above and hydraulically connected to a fractured aquifer, constituting a unique aquifer system, mixed and phreatic type, heterogeneous and anisotropic. The local hydrogeological system is strongly influenced by a complex drain system and by the Engenho Nogueira Creek. After calibration, it was possible to predict the average phreatic depth measured in the observation wells for the period in study with a standard deviation of 1.65 m and a correlation coefficient of 0.94. (author)

  1. Shielding calculations using computer techniques; Calculo de blindajes mediante tecnicas de computacion

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez Portilla, M. I.; Marquez, J.

    2011-07-01

    Radiological protection aims to limit the ionizing radiation received by people and equipment, which in numerous occasions requires of protection shields. Although, for certain configurations, there are analytical formulas, to characterize these shields, the design setup may be very intensive in numerical calculations, therefore the most efficient from to design the shields is by means of computer programs to calculate dose and dose rates. In the present article we review the codes most frequently used to perform these calculations, and the techniques used by such codes. (Author) 13 refs.

  2. Simulation of an antiprotons beam applied to the radiotherapy; Simulacao de um feixe de antiprotons aplicado a radioterapia

    Energy Technology Data Exchange (ETDEWEB)

    Prata, Leonardo de Almeida

    2006-07-15

    Results for the interaction of a antiproton beam with constituent nuclei of the organic matter are presented. This method regards of the application of an computational algorithm to determine quantitatively the differential cross sections for the scattered particles, starting from the interaction of these antiprotons with the nuclei, what will allow in the future to draw the isodose curve for antiproton therapy, once these beams are expected to be used in cancer treatment soon. The calculation will be done through the application of the concepts of the method of intranuclear cascade, providing yield and differential cross sections of the scattered particles, present in the software MCMC. Th algorithm was developed based on Monte Carlo's method, already taking into account a validate code. The following physical quantities are presented: the yield of secondary particles, their spectral and angular distributions for these interactions. For the energy range taken into account the more important emitted particles are protons, neutrons and pions. Results shown that emitted secondary particles can modify the isodose curves, because they present high yield and energy for transverse directions. (author)

  3. Aplicativo computacional para la planeación de la producción en una empresa fabricante de autopartes

    Directory of Open Access Journals (Sweden)

    Andrea Hernández

    2008-11-01

    Full Text Available Este trabajo describe el desarrollo de un aplicativo computacional para la planeación y secuenciación de la producción en una empresa colombiana fabricante de autopartes. El aplicativo integra pronósticos de ventas y órdenes en firme para calcular el plan maestro de producción, que se secuencia en la planta de producción. Un caso de estudio muestra la funcionalidad de la aplicación propuesta y compara los resultados de las secuencias propuestas con las que resultaron de las prácticas actuales. Los resultados muestran que la implementación del aplicativo puede mejorar los niveles de servicio y la satisfacción del cliente si se cumplen ciertos prerrequisitos descritos en el artículo. / This paper describes the development of a computer application for production planning and scheduling in a Colombian auto part company. Such an application integrates sales forecasts and firm orders, to calculate a Master Production Schedule which is validated with a detailed shop floor scheduling plan. A case study illustrates the functionality of the proposed application and compares the computer-calculated production plans with the current practices. The results show that the implementation of the application can improve service levels and customer satisfaction, given some prerequisites described in the paper are met.

  4. Análisis de contenido y lingüística computacional: su rapidez, confiabilidad y perspectivas

    Directory of Open Access Journals (Sweden)

    Brenda Lía Chávez

    2014-10-01

    Full Text Available El análisis de contenido es una técnica que convierte las respuestas abiertas de entrevistas en categorías. Este proceso es de gran utilidad dado que define las categorías de un estudio sobre la base de la percepción de la muestra, evitando la imposición de categorías creadas por el investigador. Sin embargo, este tipo de análisis conlleva un alto costo de tiempo, recursos y personal especializado. Programas como el ATLAS.ti o el NVivo no constituyen una solución eficaz ni eficiente. Los nuevos programas basados en lingüística computacional ofrecen un escenario diferente, dado que el programa "entiende e interpreta" las categorías. Para comprobar su eficacia y eficiencia se compara un análisis de contenido hecho por expertos con el análisis utilizando el programa SPSS Text Analytics for Surveys (TA. Se concluye que bajo la supervisión de un investigador especializado, siguiendo ciertos pasos de afinamiento de la extracción, el TA permite un ahorro de tiempo importante, una mayor confiabilidad y abre las posibilidades para análisis cualitativos con muestras grandes.

  5. Desenvolvimento de um programa computacional didático para o projeto de colunas de absorção

    Directory of Open Access Journals (Sweden)

    Nehemias Curvelo Pereira

    1998-05-01

    Full Text Available A absorção de gases é uma operação unitária da engenharia química na qual há a transferência de massa de uma corrente gasosa para uma corrente líquida. O princípio desta operação é simples e as dificuldades no dimensionamento das colunas de absorção estão associadas à execução de um conjunto de balanços de massa e de energia nas condições de operação do sistema. Elaborou-se, usando a linguagem de programação DELPHI, voltada ao ambiente WINDOWS, e algumas equações encontradas na literatura, um programa computacional de caráter didático para o projeto de torres de absorção isotérmicas, com diversos tipos de recheio e com operação em contracorrente. Os resultados são apresentados tanto em forma numérica como de gráficos, sendo possível sua impressão. Alguns exemplos tirados da literatura foram usados para testar a eficácia do software e observou-se que os erros apresentados pelos resultados do programa variam em torno de 5%

  6. Os adjetivos valenciais do português e sua representação linguístico-computacional

    Directory of Open Access Journals (Sweden)

    Ariani Di Felippo

    2005-11-01

    Full Text Available Em função de aplicações reais como, por exemplo, os sistemas de tradução automática, para as quais sistemas de processamento automático de lingua natural têm sido construídos, é essencial a compilação de léxicos (monolíngiies e bilíngues que sejam computacionalmente tratáveis e, sobretudo, linguisticamente motivados. Essa tarefa, por sua vez, exige a descrição minuciosa das propriedades gramaticais e semânticas dos itens lexicais. Neste artigo, em particular, discutem-se as características léxico-gramaticais dos adjetivos valenciais do português do Brasil e os modelos relevantes para a representação formal específicas dessas características, com vistas à proposição da representação linguístico-computacional para desse tipo de adjetivo em termos do formalismo denominado estrutura de traços.

  7. Os adjetivos valenciais do português e sua representação linguístico-computacional

    Directory of Open Access Journals (Sweden)

    Ariani Di Felippo

    2014-10-01

    Full Text Available Em função de aplicações reais como, por exemplo, os sistemas de tradução automática, para as quais sistemas de processamento automático de lingua natural têm sido construídos, é essencial a compilação de léxicos (monolíngiies e bilíngues que sejam computacionalmente tratáveis e, sobretudo, linguisticamente motivados. Essa tarefa, por sua vez, exige a descrição minuciosa das propriedades gramaticais e semânticas dos itens lexicais. Neste artigo, em particular, discutem-se as características léxico-gramaticais dos adjetivos valenciais do português do Brasil e os modelos relevantes para a representação formal específicas dessas características, com vistas à proposição da representação linguístico-computacional para desse tipo de adjetivo em termos do formalismo denominado estrutura de traços.

  8. Introduciendo la dinámica de fluidos computacional en el análisis de flujos en medio poroso

    Directory of Open Access Journals (Sweden)

    Ramón Salcedo

    2017-01-01

    Full Text Available Este trabajo presenta una introducción a la modelización con Dinámica de Fluidos Computacional (CFD de un fluido atravesando un medio poroso.  Para ello, se propone un caso práctico mediante la simulación de un flujo de aire producido por el ventilador de un pulverizador hidráulico asistido por aire que atraviesa un medio poroso (la vegetación.  El trabajo consiste en dotar de las herramientas necesarias para configurar un modelo CFD para, posteriormente, ajustar la resistencia de la porosidad al paso de la corriente usando datos experimentales. El ajuste contempla tres escenarios: uno, considerando sólo pérdidas inerciales iguales entre los diferentes cuerpos porosos, dos, considerando dichas pérdidas inerciales más las pérdidas viscosas y, tres, considerando sólo pérdidas inerciales diferentes entre los diferentes cuerpos porosos. Finalmente, se comparan las velocidades obtenidas en cada simulación con datos reales, eligiéndose aquella configuración que arroja mayores ajustes.  La metodología planteada pretende poner de manifiesto la importancia de usar con criterio los distintos parámetros propios de la configuración de modelos CFD.

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

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

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

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

  13. La modelización y simulación computacional como metodología de investigación social

    OpenAIRE

    Rodriguez Zoya, Leonardo Gabriel; Roggero, Pascal

    2014-01-01

    il presente trabajo se propone brindar una introducción crítica y sistemática a la metodología de modelado y simulación computacional en ciencias sociales. El uso de métodos computacionales para simular procesos sociales se ha expandido con vigor en los últimos veinte años en las distintas disciplinas de las ciencias sociales; sin embargo, continúa siendo una metodología poco conocida y empleada por los investigadores sociales en América Latina. El objetivo de este trabajo es contribuir a la ...

  14. Modelo computacional para caracterización de células escamosas de citologías cérvico-uterinas

    OpenAIRE

    Martínez Abaunza Víctor Eduardo; Mendoza Castellanos Alfonso; Uribe Pérez Claudia Janeth

    2007-01-01

    El trabajo se realizó entre el Grupo de Investigación en Ingeniería Biomédica (GIIB) y el Grupo de Investigación en Patología Estructural, Funcional y Clínica de la Universidad Industrial de Santander (UIS), junto con la Facultad de Medicina de la Universidad Autónoma de Bucaramanga (UNAB); el objetivo principal es construir un modelo computacional que permita caracterizar las células presentes en una citología cérvico uterina, con el propósito de clasificarlas como normales o displásicas. La...

  15. Propuesta de Intervención Programa de Introducción al Pensamiento Computacional para 2º Ciclo de Educación Infantil

    OpenAIRE

    Vilalta-García, Amankay

    2014-01-01

    El presente trabajo trata el acercamiento del pensamiento computacional a niños de Segundo Ciclo de Educación Infantil, entendiendo este concepto como la unión de diferentes formas de pensamiento: ingenieril, matemático y científico, que permiten la resolución de problemas concretos a través de la abstracción formal y del mundo real-cotidiano. Para ello, se ha partido de una revisión bibliográfica que nos ha permitido establecer un marco teórico donde se recogen: la concepci...

  16. LA DINÁMICA DE FLUIDOS COMPUTACIONAL, SU APLICACIÓN AL ESTUDIO DE LAS CARACTERÍSTICAS DE UN INTERCAMBIADOR DE TUBOS TÉRMICOS

    Directory of Open Access Journals (Sweden)

    David Fernández Rivas

    2005-09-01

    Full Text Available Para el estudio y el diseño de un intercambiador de calor del tipo Termosifón se emplea por primera vez enCuba una novedosa técnica de modelación numérica, la Dinámica de Fluidos Computacional, uso quepudiera ahorrar al país numerosos recursos. Este trabajo continua, con nuevos aportes, una largainvestigación que ha tenido como objetivo central, la instalación de tubos térmicos termosifón (ITTT. Lasimulación computacional, es una poderosa herramienta que se emplea para conocer parámetros de interésen la operación de dicha instalación. Se trabaja con programas de Dinámica de Fluidos Computacional(DFC para acortar el tiempo de experimentación y ahorrar recursos materiales y humanos durante elestudio de diferentes variantes de arreglos geométricos de los tubos térmicos. Se logran conocer lasparticularidades que los diferentes arreglos de tubos introducen al proceso de intercambio de calor. Esteresultado brinda una importante contribución para la futura construcción de un termosifón a escalaindustrial. Esta investigación ha suscitado mucho interés por lo que pudiera significar para la eficiencia de lacaldera las nuevas condiciones impuestas por la quema de combustible cubano.Palabras Claves: Dinámica de Fluidos Computacional, Tubos térmicos, termosifón.__________________________________________________________________________AbstractThe Computational Fluids Dynamic it is used for studying a thermosyphon heat exchanger like a noveltechnique of numeric modeling, for the first time in Cuba. This technique could save a lot of resources. Thiswork is the continuation of a long research in the heat pipes technology. Working with Computational FluidsDynamic (DFC programs, consumes less time in the experimentation and allows saving material andhuman resources for these studies. It is possible to know many particularities of different geometries of tubesarrangements. This investigation will guarantee a future thermosyphon

  17. O jogo digital: a linguagem computacional e a linguagem cinematográfica na criação e construção dos jogos

    OpenAIRE

    Marcos Andre Penna Coutinho

    2011-01-01

    O objetivo desta dissertação é estabelecer aproximações edistanciamentos entre a linguagem do cinema e a linguagem dos jogos digitais. Para tal, primeiro, estudou-se sobre o desenvolvimento histórico da linguagem computacional, base de todos os sistemas informativos digitais. Para o estudo da linguagem do cinema e do jogo, realizou-se uma pesquisa comparativa a partir do estudo de casos de algumas obras, em especial: os filmes Janela indiscreta e Os pássaros, do cineasta Alfred Hitchcock, con...

  18. La did??ctica del flamenco y su multidisciplinariedad: el Proyecto COFLA (An??lisis Computacional de la M??sica Flamenca)

    OpenAIRE

    Guti??rrez Cordero, Rosario; Perea D??az, Benjam??n

    2015-01-01

    En este trabajo se expone un trabajo de investigaci??n sobre el flamenco con una clara aproximaci??n multidisciplinar, el proyecto COFLA. COFLA (An??lisis Computacional de la M??sica Flamenca) (P09-TIC-4840) es un Proyecto de Excelencia subvencionado por la Junta de Andaluc??a (2010- 2013). Dentro del ??rea de Protecci??n de la Herencia Cultural, el flamenco est?? se??alado como de especial consideraci??n en las bases reguladoras de las convocatorias de ayudas de investigaci...

  19. Modelagem computacional de efeitos de distorções não lineares para guitarra elétrica

    Directory of Open Access Journals (Sweden)

    Thomaz Chaves A. Oliveira

    2013-11-01

    Full Text Available Este trabalho tem como objetivo revisar e simular alguns dos métodos de emulação computacional de efeitos de distorção de guitarras elétricas e de amplificadores valvulados que tem caracterizado os timbres deste instrumento nos últimos 50 anos. Recentemente, através da disseminação do processa- mento digital de sinais, estas distorções têm sido reproduzidas através de softwares embarcados ou na forma de pluggins em softwares de estúdio. Para a simulação de distorções, duas abordagens são basicamente utilizadas: caixa preta e caixa branca. Na primeira, waveshapers estáticos simplificam o sistema através de equações não-lineares que aproximam o comportamento do aparelho. Algumas das equações presentes na literatura são simuladas neste trabalho, com as respectivas respostas dos sistemas não-lineares no tempo e na frequência. Na abordagem caixa branca, os parâmetros dos circuitos são levados em conta e a modelagem pode ser realizada através de Wave Digital Filters ou de sistemas de equações diferenciais ordinárias em sua representação no espaço de estados, os quais são solucionados através de métodos numéricos. As simulações caixa branca apresentam re- sultados mais precisos, porém demandam maiores recursos computacionais, sendo necessário um compromisso entre precisão e eficiência para a simulação em tempo real.

  20. Prótese para substituição total de disco intervertebral: desenvolvimento de modelo computacional e análise por elementos finitos Prótese de reemplazo total del disco intervertebral: modelo de desarrollo computacional y análisis de elementos finitos Prosthesis for total intervertebral disc replacement: computacional model development and finite element analysis

    Directory of Open Access Journals (Sweden)

    Tiago Nunes Campello

    2009-03-01

    Full Text Available INTRODUÇÃO: a idéia de um disco intervertebral artificial não é nova. O campo de estudos sobre próteses para artroplastia de coluna desenvolve-se ao passo que novas tecnologias na área de materiais e engenharia médica são desenvolvidas ou introduzidas para o surgimento de novos projetos. OBJETIVO: estabelecer metodologia de desenvolvimento de produto em um projeto de prótese para substituição total de disco intervertebral pela utilização de ferramentas computacionais de engenharia. MÉTODOS: a metodologia de desenvolvimento de prótese para substituição total de disco iniciou-se com a definição do seu modelo virtual, seguida pela a análise mecânica virtual por elementos finitos. RESULTADOS: a prótese de disco foi concebida com três componentes, sendo eles o flange superior, o flange inferior e o núcleo. Aplicando o critério de von Mises para solução da análise virtual, verificou-se que o núcleo da prótese é o componente mais solicitado durante compressão axial e compressão/cisalhamento. CONCLUSÃO: este estudo demonstra a viabilidade do desenvolvimento de um projeto para fabricação de prótese para substituição total de disco intervertebral, por meio de metodologia computacional já consagrada em projetos mecânicos de engenharia, principalmente, nos ramos automotivo e aeronáutico.INTRODUCCIÓN: la idea de un disco intervertebral artificial no es nueva. Los estudios de la columna vertebral artroplastia prótesis están en desarrollo, mientras las nuevas tecnologías en el ámbito de la ingeniería y los materiales médicos son desarr llados o introducidos a la aparición de nuevos proyectos. OBJETIVO: establecer una metodología para el desarrollo de producto en un proyecto de prótesis para reemplazo total del disco intervertebral, a través del uso de herramientas de ingeniería computacional. MÉTODOS: la metodología de desarrollo de prótesis para reemplazo total del disco se inició con la definici

  1. Bucólico: aplicación computacional para el análisis de textos. (hacia un análisis de rasgos de la informatividad

    Directory of Open Access Journals (Sweden)

    Giovanni Parodi S.

    2004-01-01

    Full Text Available La aplicación computacional BUCÓLICO (buscador de concordancias Lingüísticas en Corpus permite organizar tres corpora lingüísticos previamente procesados y etiquetados morfológicamente o analizar otros corpora, no etiquetados computacionalmente, a través del procesamiento de lenguaje natural. Desde un enfoque metodológico de la lingüística de Hábeas Computacional, se indaga, comparativamente a partir de los datos obtenidos con bucólico, en la ocurrencia de cuatro estructuras lingüísticas de alta densidad, compactación o integración informacionalBucólico (Buscador de Concordancias Lingüísticas en Corpus is a computational tool which is helps organize three linguistic corpora, previously processed and automatically tagged morfosintacically, and it analices other linguistic corpora, not computationally tagged though the precessing of natural language. The methodological principles of the modern computational corpus linguistics reserches about the occurrence of four linguistic features, typically associated with high density, integration, compactness and informational load

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

  3. Efectos de la simulación computacional en la comprensión de la distribución binomial y la distribución de proporciones

    OpenAIRE

    Martínez, Johanna; Yáñez, Gabriel

    2014-01-01

    En este trabajo se presenta un proyecto de investigación que se basa en el enfoque instrumental para describir el efecto que tiene la simulación computacional en la comprensión de la distribución binomial y la distribución de proporciones.

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

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

  6. Development of a computer code for shielding calculation in X-ray facilities; Desenvolvimento de um codigo computacional para calculos de blindagem em salas radiograficas

    Energy Technology Data Exchange (ETDEWEB)

    Borges, Diogo da S.; Lava, Deise D.; Affonso, Renato R.W.; Moreira, Maria de L.; Guimaraes, Antonio C.F., E-mail: diogosb@outlook.com, E-mail: deise_dy@hotmail.com, E-mail: raoniwa@yahoo.com.br, E-mail: malu@ien.gov.br, E-mail: tony@ien.gov.br [Instituto de Engenharia Nuclear (IEN/CNEN-RJ), Rio de Janeiro, RJ (Brazil)

    2014-07-01

    The construction of an effective barrier against the interaction of ionizing radiation present in X-ray rooms requires consideration of many variables. The methodology used for specifying the thickness of primary and secondary shielding of an traditional X-ray room considers the following factors: factor of use, occupational factor, distance between the source and the wall, workload, Kerma in the air and distance between the patient and the receptor. With these data it was possible the development of a computer program in order to identify and use variables in functions obtained through graphics regressions offered by NCRP Report-147 (Structural Shielding Design for Medical X-Ray Imaging Facilities) for the calculation of shielding of the room walls as well as the wall of the darkroom and adjacent areas. With the built methodology, a program validation is done through comparing results with a base case provided by that report. The thickness of the obtained values comprise various materials such as steel, wood and concrete. After validation is made an application in a real case of radiographic room. His visual construction is done with the help of software used in modeling of indoor and outdoor. The construction of barriers for calculating program resulted in a user-friendly tool for planning radiographic rooms to comply with the limits established by CNEN-NN-3:01 published in September / 2011.

  7. Development of a computational code for calculations of shielding in dental facilities; Desenvolvimento de um codigo computacional para calculos de blindagem em instalacoes odontologicas

    Energy Technology Data Exchange (ETDEWEB)

    Lava, Deise D.; Borges, Diogo da S.; Affonso, Renato R.W.; Guimaraes, Antonio C.F.; Moreira, Maria de L., E-mail: deise_dy@hotmail.com, E-mail: diogosb@outlook.com, E-mail: raoniwa@yahoo.com.br, E-mail: tony@ien.gov.br, E-mail: malu@ien.gov.br [Instituto de Engenharia Nuclear (IEN/CNEN-RJ), Rio de Janeiro, RJ (Brazil)

    2014-07-01

    This paper is prepared in order to address calculations of shielding to minimize the interaction of patients with ionizing radiation and / or personnel. The work includes the use of protection report Radiation in Dental Medicine (NCRP-145 or Radiation Protection in Dentistry), which establishes calculations and standards to be adopted to ensure safety to those who may be exposed to ionizing radiation in dental facilities, according to the dose limits established by CNEN-NN-3.1 standard published in September / 2011. The methodology comprises the use of computer language for processing data provided by that report, and a commercial application used for creating residential projects and decoration. The FORTRAN language was adopted as a method for application to a real case. The result is a programming capable of returning data related to the thickness of material, such as steel, lead, wood, glass, plaster, acrylic, acrylic and leaded glass, which can be used for effective shielding against single or continuous pulse beams. Several variables are used to calculate the thickness of the shield, as: number of films used in the week, film load, use factor, occupational factor, distance between the wall and the source, transmission factor, workload, area definition, beam intensity, intraoral and panoramic exam. Before the application of the methodology is made a validation of results with examples provided by NCRP-145. The calculations redone from the examples provide answers consistent with the report.

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

  9. Competencias mínimas en pensamiento computacional que debe tener un estudiante aspirante a la media técnica para mejorar su desempeño en la media técnica de las instituciones educativas de la Alianza Futuro Digital Medellín

    OpenAIRE

    Giraldo Gómez, Leidy Yoana

    2014-01-01

    En la actualidad se considera que todos los estudiantes al culminar la básica secundaria y continuar con su educación superior, deben desarrollar las competencias del siglo 21, permitiendo a los estudiantes colaborar, comunicarse, solucionar problemas y tener un pensamiento crítico; dentro de este tipo de habilidades se encuentra el Pensamiento Computacional -- Esta investigación busca establecer cuáles son las competencias en Pensamiento Computacional que requieren los estudiantes para ingre...

  10. Arquitectura para el manejo de congestión en una red de datos corporativa con participación del usuario, basado en inteligencia computacional

    OpenAIRE

    Ardila Triana, Erick

    2013-01-01

    En este trabajo se realizó el diseño e implementación de un modelo para la detección de congestión para una red de datos de área local con participación del usuario y usando herramientas en inteligencia computacional. Para adelantar esta investigación, primero fue necesario identificar las variables a utilizar como base para la medición de congestión. Para esto se hizo una recolección de datos en la red LAN de la sede Bogotá de la Universidad Nacional de Colombia y se realizó un análisis esta...

  11. Metodología para determinar la fuerza de arrastre de productos agrícolas a partir de la Dinámica de Fluidos Computacional (CFD)

    OpenAIRE

    2014-01-01

    El objetivo del trabajo consiste en obtener una metodología para la determinación, con el apoyo de herramientas de la Dinámica de Fluidos Computacional (CFD), de la fuerza de arrastre en productos agrícolas u otro tipo de sólido sometidos a una corriente de aire. Co- nociendo la distribución de presiones en la superficie y las coordenadas de posición de los nodos de la malla de elementos finitos generada, se elabora una metodología matemática, sobre la base de la geometría analítica y vectori...

  12. Simulación computacional de la fluidodinámica de burbujas en reactores destinados a la producción de hidrógeno

    OpenAIRE

    Sánchez Gallego, Sergio

    2013-01-01

    L’objectiu inicial es establir les especificacions computacionals necessàries de simulació destinada al disseny i fabricació de prototips d’un reactor destinat a produir H2. La reacció entre l’aigua i l’etanol sota l’acció de la radiació solar i el corresponent catalitzador, allibera H2 que deu ser transportat al exterior amb l’ajut d’una corrent gasosa de N2. L’eina de simulació numèrica utilitzada ha estat COMSOL Multyphisics. En particular, s’ha fet servir un mòdul específic...

  13. Metodología para determinar la fuerza de arrastre de productos agrícolas a partir de la Dinámica de Fluidos Computacional (CFD)

    OpenAIRE

    Alexander Laffita Leyva; Arturo Martínez Rodríguez; Vilma Toledo Dieppa; Yolanda Sabín Rendón; Pedro A. Valdés Hernández

    2014-01-01

    El objetivo del trabajo consiste en obtener una metodología para la determinación, con el apoyo de herramientas de la Dinámica de Fluidos Computacional (CFD), de la fuerza de arrastre en productos agrícolas u otro tipo de sólido sometidos a una corriente de aire. Co- nociendo la distribución de presiones en la superficie y las coordenadas de posición de los nodos de la malla de elementos finitos generada, se elabora una metodología matemática, sobre la base de la geometría analítica y vectori...

  14. Análise computacional da evolução da hidromorfologia do Baixo Mondego em resultado da subida do nível do mar

    OpenAIRE

    Silva, Joana Sequeira dos Ramos

    2015-01-01

    O êxito na previsão das consequências da subida do nível do mar à escala global está dependente de uma correcta análise de todos fenómenos que daí poderão resultar. Neste âmbito, o presente estudo incide sobre o efeito da subida do nível do mar na hidromorfologia de rios, parâmetro que não é com frequência um dado de entrada nas simulações numéricas em estudos e projectos de Hidráulica Fluvial. Desenvolveu-se um modelo computacional na linguagem de programação Fortran (FTN 95), que perm...

  15. Desenvolvimento de um instrumento para avaliação da força labial e modelagem computacional do músculo orbicular da boca

    OpenAIRE

    Tatiana Vargas de Castro Perilo

    2012-01-01

    O músculo orbicular da boca, que constitui os lábios humanos, participa ativamente de funções importantes como a sucção, mastigação, deglutição, fala, respiração e mímica facial. O objetivogeral deste estudo foi desenvolver um instrumento para medição da força dos lábios e como objetivos específicos analisar as características do instrumento bem como da força labial e o desenvolvimento de um modelo computacional do músculo orbicular da boca. Para construção do instrumento foi projetado e conf...

  16. Caracterização computacional de padrões estruturais em seqüências de DNA relacionadas a processos em redes metabólicas

    OpenAIRE

    Laurita dos Santos

    2009-01-01

    Nas últimas décadas, uma enorme quantidade de informação sobre o funcionamento de sistemas biológicos foram disponibilizadas em bancos de dados de acesso público. A Computação Aplicada à Biologia ou Bioinformática tem contribuído para análise computacional de dados biológicos cada vez mais ricos em informação. Neste contexto, este trabalho tem por objetivo analisar e caracterizar a estrutura do Ácido Nucléico DNA através de técnicas matemáticas e computacionais. As técnicas de caracterização ...

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

  18. Cuantificación de la eficiencia de la fachada cerámica ventilada mediante técnicas de la mecánica de fluidos computacional

    Directory of Open Access Journals (Sweden)

    Bengochea Escribano, M. A.

    2011-04-01

    Full Text Available In some countries, summer over-heating is a big problem in a building’s energy balance. Ventilated façades are a useful tool when applied to building design, especially in bioclimatic building design. A ventilated facade is a complex, multi-layer structural solution that enables dry installation of the covering elements. The objective of this paper is to quantify the efficiency improvement in the building thermal when this sort of facade is installed. These improvements are due to convection produced in the air gap of the façade. This convection depends on the air movement inside the gap and the heat transmission in this motion. These quantities are mathematically modelled by Computational Fluid Dynamics (CFD techniques using a commercial code: STAR CCM+. The proposed method allows an assessment of the energy potential of the ventilated façade and its capacity for cooling.

    En muchos países, el calentamiento en los edificios que se da en verano se convierte en una fuente de consumo energético importante. La fachada ventilada se convierte en una herramienta de diseño sostenible, especialmente en diseños preocupados por el bioclimatismo. La fachada ventilada es un sistema de envolvente del edificio basada en la combinación de los paneles cerámicos con la cámara de aire con objeto de favorecer un ahorro energético en condiciones adecuadas, especialmente frente a las necesidades de refrigeración. El objetivo de la presente contribución es cuantificar la contribución a la eficiencia energética en el comportamiento térmico de los edificios cuando se instala este tipo de fachada. Estas mejoras se deben a la convección producida por el movimiento del aire en la capa de la fachada. El movimiento convectivo del aire está ligado al intercambio de calor con los paneles de la fachada. Esta cuantificación se realiza por medio de la Fluido Dinámica Computacional utilizando un código comercial: STAR CCM+. La metodolog

  19. Transgenética computacional: uma aplicação ao problema quadrático de alocação

    Directory of Open Access Journals (Sweden)

    Marco César Goldbarg

    2002-07-01

    Full Text Available O presente trabalho apresenta uma nova abordagem, denominada Transgenética Computacional. A metáfora baseia-se na utilização de informações meméticas e no emprego dos fluxos extra e intracelulares para planejar e executar manipulações genéticas no contexto dos algoritmos evolucionários. A pesquisa desenvolve duas linhas de algoritmos: a primeira utilizando-se de ambos os fluxos para informar o processo de busca evolucionária; a segunda utiliza-se exclusivamente da manipulação intracelular. São apresentados os agentes da Transgenética Computacional. São examinadas propriedades resultantes da interação cromossomo x agente de manipulação que se mostram semelhantes às do processo imunológico natural. Ao final são relatados resultados computacionais para o Problema Quadrático de Alocação.This paper introduces the Computational Transgenetic approach. The metaphor is based on the use of memetic pieces of information and on the extra and intracellular flows to design and accomplish genetic manipulation in the chromosomes of a given population of an evolutionary algorithm. The research develops two algorithmic approaches. The first algorithmic approach uses both the intra and extra-cellular flows to guide an evolutionary search process. The second one uses, uniquely, intracellular manipulation. Computational Transgenetic agents are presented. Properties resulting from chromosome x agent interactions, similar to the natural immunologic process, are examined. Finally, the paper reports the results of computational experiments of applying both techniques to the Quadratic Assignment Problem.

  20. Programa GENES: Aplicativo Computacional em Estatística Aplicada à Genética (GENES - Software for Experimental Statistics in Genetics

    Directory of Open Access Journals (Sweden)

    Cosme Damião Cruz

    1998-03-01

    Full Text Available The main purpose of the GENES software is to help people working with genetic analysis and data processing in breeding programs, using several biometrics models. This software has several help windows that are very friendly to the user. More information about this program is available in the book" Programa GENES - Aplicativo Computacional em Genética e Estatística, 442. 1997". Purchase orders are welcome at the following address: editora@mail.ufv.br. Shareware copies of the GENES software are available at http://www.genetica.dbg.ufv.br.RESUMO O programa GENES é um software destinado à análise e processamento de dados por meio de diferentes modelos biométricos. Seu uso é de grande importância em estudos genéticos aplicados ao melhoramento vegetal e animal, por permitir estimativa de parâmetros para entendimento de fenômenos biológicos e fundamentais em processo de tomada de decisão e na predição do sucesso e viabilidade da estratégia de seleção. O programa pode ser obtido pela rede Internet (http://www.genetica.dbg.ufv.br ou por solicitação pelo endereço: Departamento de Biologia Geral, Universidade Federal de Viçosa, 36571-000 Viçosa, MG, Brasil. O programa conta com telas de ajuda, tornando-o de fácil utilização. Informações adicionais sobre seu uso estão disponíveis no livro" Programa GENES - Aplicativo Computacional em Genética e Estatística, 442, 1997" adquirido por E-mail enviado para editora@mail.ufv.br.

  1. As abordagens teóricas e os formalismos para o tratamento computacional do significado lexical Theoretical approaches and formalisms for the computational treatment of lexical meaning

    Directory of Open Access Journals (Sweden)

    Ariani Di Felippo

    2010-01-01

    Full Text Available No âmbito do Processamento Automático de Línguas Naturais (PLN, o desenvolvimento de recursos léxico-semânticos é premente. Ao conceber os sistemas de PLN como um exercício de "engenharia da linguagem humana", acredita-se que o desenvolvimento de tais recursos pode ser beneficiado pelos modelos de "representação do conhecimento", desenvolvidos pela Engenharia do Conhecimento. Esses modelos, em particular, fornecem simultaneamente o arcabouço teórico-metodológico e a metalinguagem formal para o tratamento computacional do significado das unidades lexicais. Neste artigo, após a apresentação da concepção linguístico-computacional de léxico, elucidam-se os principais paradigmas de representação do conhecimento, enfatizando a abordagem do significado e a metalinguagem formal vinculadas a cada um deles.The development of lexical-semantic resources for natural language processing is urgent. Conceiving the computational systems which process natural languages as an exercise of "human language engineering", the development of such resources can benefit from the "knowledge representation models" provided by Knowledge Engineering. These models provide both the theoretical-methodological premises and the formal metalanguage for the computational treatment of word meaning. In this paper, we first present the linguistic-computational conception of "lexicon". Then, we describe the main knowledge representation paradigms emphasizing the theoretical approach to word meaning and the formalism related to each of them.

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

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

  4. Development of a voxel phantom specific for simulation of eye brachytherapy; Desenvolvimeto de um fantoma de voxel especifico para simulacao de braquiterapia ocular

    Energy Technology Data Exchange (ETDEWEB)

    Santos, Marcilio S.; Lima, Fernando R.A., E-mail: msilveira.fisica@gmail.com, E-mail: falima@cnen.gov.br [Centro Regional de Ciencias Nucleares do Nordeste (CRCN-NE/CNEN-PE), Recife, PE (Brazil); Universidade Federal de Pernambuco (UFPE), Recife, PE (Brazil). Departamento de Energia Nuclear; Vieira, Jose W., E-mail: jose-wilson59@live.com [lnstituto Federal de Educacao, Ciencia e Tecnologia de Pernambuco (IFPE), Recife, PE (Brazil)

    2013-11-01

    The ophthalmic brachytherapy involves inserting a plate with seeds of radioactive material in the patient's eye for the treatment of tumors. The radiation dose to be taken by the patient is prescribed by physicians and time of application of the material is calculated from calibration curves supplied by the manufacturers of the plates. To estimate the dose absorbed by the patient, in a series of diagnostic tests, it is necessary to perform simulations using a computational model of exposure. These models are composed primarily by a anthropomorphic phantom, and a Monte Carlo code. The coupling of a phantom voxel whole body to a Monte Carlo code is a complex process because the computer model simulations with exposure takes time, knowledge of the code used and various adjustments to be implemented. The problem is aggravated even more complex when you want to radiate one region of the body. In this work we developed a phantom, specifically the region containing the eyeball, from MASH (Male Adult voxel). This model was coupled to the Monte Carlo code EGSnrc (Electron Gamma Shower) together with an algorithm simulator source of I-125 , considering only its effect of higher energy range.

  5. Modelação Computacional de um Dessalinizador com Evaporação por Spray para Dessalinização de Água do Mar

    OpenAIRE

    Moreira, Miguel; Joyce, A.; Pina, H.

    1994-01-01

    O desenvolvimento dum evaporador com evaporação por "Spray" motivou a elaboração dum seu modelo computacional. A comparação dos resultados da simulação com resultados experimentais revelou um idêntico comportamento qualitativo e erros relativos de 20%. Simulações computacionais posteriores evidenciam a possibilidade de atingir desempenhos energéticamente atractivos.

  6. Sistema computacional para índices de cárie dentária: banco de dados e análise estatística A computer software system for dental caries rates: data bases and statistical analysis

    Directory of Open Access Journals (Sweden)

    Maria Lucia M.M. Sundefeld

    1996-10-01

    Full Text Available Apresenta-se um sistema computacional, denominado ICADPLUS, desenvolvido para elaboração de banco de dados, tabulação de dados, cálculo do índice CPO e análise estatística para estimação de intervalos de confiança e comparação de resultados de duas populações.Tem como objetivo apresentar método simplificado para atender necessidades de serviços de saúde na área de odontologia processando fichas utilizadas por cirurgiões dentistas em levantamentos epidemiológicos de cárie dentária. A característica principal do sistema é a dispensa de profissional especializado na área de odontologia e computação, exigindo o conhecimento mínimo de digitação por parte do usuário, pois apresenta "menus" simples e claros como também relatórios padronizados, sem possibilidade de erro. Possui opções para fichas de CPO segundo Klein e Palmer, CPO proposto pela OMS, CPOS segundo Klein, Palmer e Knutson, e ceo. A validação do sistema foi feita por comparação com outros métodos, permitindo recomendar sua adoção.A computer software system developed ICADAPLUS, is presented in order to create and tabulate data bases, calculate the DMF rate, perform statistical comparison of two populations, and calculate confidence intervals. The system offers a simplified method for health services in the area of dentistry, using dental records to carry out epidemiological surveys of tooth decay. The system's main feature is that it does not require specialists either in the area of dentistry or computing, demanding of the user only basic data-entry typing skills, since it presents simple menus, and standardized reports, with no possibility of error.The system comprises four steps: Data-entry, Processing, Reports and Utilities. In Data-entry the regions, towns and institutions supplying the data are initially registered, once only. Each record receives a code number, and it is this code which is available to the user through a Function Key, by

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

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

  9. Dosimetry in non-homogeneous media with alanine/EPR mini dosemeters and simulation with PENELOPE Monte Carlo code;Dosimetria em meios nao-homogeneos com minidosimetros de alanina/EPR e simulacao Monte Carlo com o codigo PENELOPE

    Energy Technology Data Exchange (ETDEWEB)

    Vega Ramirez, J.L.; Chen, F.; Nicolucci, P.; Baffa, O. [Universidade de Sao Paulo (FFCLRP/USP), Ribeirao Preto, SP (Brazil). Faculdade de Filosofia, Ciencias e Letras. Dept. de Fisica e Matematica

    2009-07-01

    The dosimetric system of L-alanine mini dosimeter and K-Band EPR spectrometer was tested for the dosimetry in non-homogeneous media through the determination of the Percentage Depth Dose (PDD) curve for a small radiation field. The alanine mini dosimeters were produced by mechanical pressure of a mixture of L-alanine (95%) and PVA (5%) to nominal dimensions of 1 mm diameter and 3 mm length and 3 - 4 mg. For detecting the EPR signal of the mini dosimeters irradiated to 25 Gy, a K-Band (24 GHz) spectrometer was used. The dosimeters were irradiated in a {sup 60}Co radiotherapy unit using 80 cm source skin distance and field sizes of 2.5 x 2.5 cm{sup 2}. The inhomogeneous phantom consisted of acrylic and cork sheets of 30 x 30 x 1 cm{sup 3}; six cork sheets were sandwiched between five and nine acrylic sheets, which were placed at the top and bottom regions respectively. PDD curves with radiographic film and PENELOPE simulation were also determined. The PDD results for alanine mini dosimeters agreed better than 5.9% with film and PENELOPE. (author)

  10. Simplified analytical model to simulate radionuclide release from radioactive waste trenches; Modelo simplificado para simulacao da liberacao de radionuclideos de repositorios de rejeitos radioativos

    Energy Technology Data Exchange (ETDEWEB)

    Sa, Bernardete Lemes Vieira de

    2001-07-01

    In order to evaluate postclosure off-site doses from low-level radioactive waste disposal facilities, a computer code was developed to simulate the radionuclide released from waste form, transport through vadose zone and transport in the saturated zone. This paper describes the methodology used to model these process. The radionuclide released from the waste is calculated using a model based on first order kinetics and the transport through porous media was determined using semi-analytical solution of the mass transport equation, considering the limiting case of unidirectional convective transport with three-dimensional dispersion in an isotropic medium. The results obtained in this work were compared with other codes, showing good agreement. (author)

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

  12. Metaloproteinasas de la matriz en Odontología y sus consideraciones desde el campo de la química computacional

    Directory of Open Access Journals (Sweden)

    Antonio Díaz Caballero

    Full Text Available Las metaloproteinasas de la matriz son una familia de proteasas zinc-dependientes encargadas de la remodelación de los componentes proteicos de la matriz extracelular de todos los tejidos, su actividad catalítica es controlada por inhibidores tisulares de metaloproteinasas de la matriz. En condiciones patológicas se pierde el equilibrio existente entre MMPs con respecto a la de estos inhibidores endógenos, este desequilibrio es evidente en enfermedades orales como la caries dental, gingivitis, periodontitis, entre otras, por lo tanto la posibilidad de lograr una inhibición selectiva de la actividad de estas enzimas con inhibidores sintéticos constituye un enfoque prometedor en el tratamiento de distintas enfermedades de la cavidad oral. Se presenta a continuación una revisión bibliográfica cuyo objetivo es analizar el papel que juegan las metaloproteinasas de la matriz en el desarrollo de patologías orales e identificar el aporte que ha hecho el análisis computacional de estas enzimas en el campo de la odontología. Para tal fin se llevó a cabo una búsqueda de la literatura disponible en bases de datos como Pubmed, Sience Direct, Ovid y Ebsco Host empleando palabras claves como: patologías orales, cáncer oral, adhesión dentinaria, metaloproteinasas de la matriz, inhibidor sintético de metaloproteinasas y modelado molecular. Se seleccionaron 35 artículos para orientar la presente revisión. Al terminar se pudo concluir que existe correlación positiva entre la desregulación de determinadas MMPs y la progresión de ciertas enfermedades orales, esto ha impulsado la identificación y el diseño insílico de inhibidores efectivos para estas proteínas, partiendo de análisis relación estructura-actividad y acoplamiento molecular computacional. Hasta la fecha se ha logrado demostrar que los inhibidores de MMPs más potentes presentan grupos hidroxamatos. Teniendo en cuenta lo anterior, el diseño de compuestos que bloqueen la

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

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

  15. Average accelerator simulation Truebeam using phase space in IAEA format; Simulacao do acelerador medico Truebeam utilizando espacos de fases em formato IAEA

    Energy Technology Data Exchange (ETDEWEB)

    Santana, Emico Ferreira; Milian, Felix Mas; Paixao, Paulo Oliveira; Costa, Raranna Alves da; Velasco, Fermin Garcia, E-mail: efsantana@uesc.br, E-mail: f.mas.milian@gmail.com, E-mail: popaixao@uesc.br, E-mail: racosta@uesc.br, E-mail: fermingv@gmail.com [Universidade Estadual de Santa Cruz (UESC), Ilheus, BA (Brazil)

    2015-07-01

    In this paper is used a computational code of radiation transport simulation based on Monte Carlo technique, in order to model a linear accelerator of treatment by Radiotherapy. This work is the initial step of future proposals which aim to study several treatment of patient by Radiotherapy, employing computational modeling in cooperation with the institutions UESC, IPEN, UFRJ e COI. The Chosen simulation code is GATE/Geant4. The average accelerator is TrueBeam of Varian Company. The geometric modeling was based in technical manuals, and radiation sources on the phase space for photons, provided by manufacturer in the IAEA (International Atomic Energy Agency) format. The simulations were carried out in equal conditions to experimental measurements. Were studied photons beams of 6MV, with 10 per 10 cm of field, focusing on a water phantom. For validation were compared dose curves in depth, lateral profiles in different depths of the simulated results and experimental data. The final modeling of this accelerator will be used in future works involving treatments and real patients. (author)

  16. Simplificações e Adaptações para Redução do Custo Computacional do Pré-processamento de Voz na Plataforma Arduino

    Directory of Open Access Journals (Sweden)

    Pedro Ítalo Ribeiro Albuquerque

    2016-06-01

    Full Text Available Atualmente, existe um crescente interesse por aplicações em que a interação homem-máquina seja realizada via a voz humana. No entanto, alguns equipamentos, como telefones celulares e eletrodomésticos, possuem limitações de armazenamento e processamento, dificultando a implementação deste tipo de sistema. Neste trabalho, foram implementadas simplificações matemáticas e estratégias de programação em duas etapas típicas de um sistema de reconhecimento da fala, a pré-ênfase e o janelamento. Oobjetivo desta implementação foi analisar o impacto das mesmas no desempenho e, consequentemente, no custo computacional as referidas etapas. Diante das adaptações efetuadas, o tempo de execução foi reduzido para 1/5 do tempo original da pré-ênfase e para 1/10 no caso do janelamento. 

  17. Objetivos y características de la química computacional y su aplicación al estudio de los materiales de carbono

    Directory of Open Access Journals (Sweden)

    D. Suarez

    2012-09-01

    Full Text Available El objetivo principal de la Química Computacional(QC es predecir todo tipo de propiedadesmoleculares de sistemas químicos. Adicionalmente,la QC ofrece información útil para racionalizar ointerpretar tendencias y enunciar relaciones deestructura-actividad. Para ello, la QC emplea unaamplia gama de técnicas teóricas en constantedesarrollo y mejora. La naturaleza del modelomolecular de interés y la del problema o propiedada estudiar condicionan la selección del método(s autilizar. Muchas de las herramientas de la QC puedenser aplicadas por todo tipo de científicos, no sólopor especialistas. Es necesario un conocimientobásico de los fundamentos de los métodos teóricos,capacidad de análisis crítico de los resultados, ciertahabilidad en el manejo del software y acceso arecursos de hardware optimizados para cálculo dealtas prestaciones. La caracterización de los nuevosmateriales de carbono (nanotubos, grafenos, etc.ha venido haciendo un uso intensivo de la QC. Perola aplicación de la QC es igualmente interesantepara comprender las bases moleculares delcomportamiento de todo tipo de materiales decarbono.

  18. Técnicas de Inteligencia Computacional Aplicadas a Modelos de Estimación de Coagulante en el Proceso de Potabilización de Agua

    Directory of Open Access Journals (Sweden)

    Carlos Alberto Villarreal Campos

    2013-01-01

    Full Text Available En este artículo se presentan cuatro modelos para la estimación de la dosificación de coagulante en el proceso de potabilización de agua, los cuales utilizan para su implementación, técnicas de inteligencia computacional que incluyen redes neuronales artificiales, lógica difusa tipo Sugeno, lógica difusa tipo Mamdani y estructuras neuro-difusas tipo ANFIS. La metodología descrita en la obtención de los modelos se basa en la extracción de la experiencia almacenada en los datos de operación de la planta (para el caso de los modelos basados en redes neuronales, lógica difusa Sugeno y estructuras ANFIS y en el conocimiento expresado en forma lingüística por un operador experimentado de la planta (para el caso de la lógica difusa Mamdani. Los resultados obtenidos en las diferentes simulaciones realizadas demuestran que algunos de los modelos implementados pueden ser incluidos en sistemas de control que permiten superar algunas de las limitaciones que actualmente presentan los métodos de dosificación utilizados más ampliamente en las plantas de potabilización; la prueba de jarras y el streaming current detector.

  19. Lingüística computacional y esteganografía lingüística. Distribuyendo información oculta con recursos mínimos

    Directory of Open Access Journals (Sweden)

    Muñoz Muñoz, Alfonso

    2013-04-01

    Full Text Available Computational linguistics and linguistic steganography could allow to design useful systems in the protection / privacy of digital communications and digital language watermarking. However, building these systems is not always possible provided a series of conditions are not met. This article investigates whether it is possible to design procedures to hide information in natural language using minimal linguistic and computational resources. An algorithm is proposed and implemented, arguing for the usefulness and security of such proposals.La lingüística computacional puede ser aprovechada junto a la ciencia de la esteganografía lingüística para diseñar sistemas útiles en la protección/privacidad de las comunicaciones digitales y en el marcado digital de textos. No obstante, para poder llevar a cabo tal tarea se requiere de una serie de condiciones que no siempre se dan. En este artículo se investiga si es posible diseñar procedimientos que permitan ocultar información en lenguaje natural utilizando la mínima cantidad de recursos tanto lingüísticos como computacionales. Se propone un algoritmo y se implementa, razonando posteriormente a favor de la utilidad y la seguridad de propuestas de este tipo.

  20. DelPapa - Aplicativo computacional para a análise de dados de experimentos no delineamento blocos ao acaso, usando o método Papadakis

    Directory of Open Access Journals (Sweden)

    Lindolfo Storck

    2015-05-01

    Full Text Available O aplicativo computacional para a análise de dados de experimentos executados no delineamento blocos ao acaso, por meio do método usual e de Papadakis, foi desenvolvido em sua primeira versão (não publicada, na linguagem de programação Pascal. Considerando que o método de Papadakis foi eficiente para as principais culturas agrícolas (milho, soja, feijão e trigo e, para tornar o aplicativo mais amigável, a versão em Pascal foi reprogramada em Java, cuja denominação é DelPapa. Este aplicativo realiza a análise de variância segundo o delineamento blocos ao acaso pelo método usual (estima parâmetros genéticos, medidas de qualidade experimental e testes dos pressupostos da análise de variância e pelo método de Papadakis. Usando as médias ajustadas pela covariável (média dos erros das parcelas vizinhas, também realiza o teste Scott e Knott (P=0,05 para agrupar os tratamentos.

  1. Sistema computacional para índices de cárie dentária: banco de dados e análise estatística

    Directory of Open Access Journals (Sweden)

    Sundefeld Maria Lucia M.M.

    1996-01-01

    Full Text Available Apresenta-se um sistema computacional, denominado ICADPLUS, desenvolvido para elaboração de banco de dados, tabulação de dados, cálculo do índice CPO e análise estatística para estimação de intervalos de confiança e comparação de resultados de duas populações.Tem como objetivo apresentar método simplificado para atender necessidades de serviços de saúde na área de odontologia processando fichas utilizadas por cirurgiões dentistas em levantamentos epidemiológicos de cárie dentária. A característica principal do sistema é a dispensa de profissional especializado na área de odontologia e computação, exigindo o conhecimento mínimo de digitação por parte do usuário, pois apresenta "menus" simples e claros como também relatórios padronizados, sem possibilidade de erro. Possui opções para fichas de CPO segundo Klein e Palmer, CPO proposto pela OMS, CPOS segundo Klein, Palmer e Knutson, e ceo. A validação do sistema foi feita por comparação com outros métodos, permitindo recomendar sua adoção.

  2. Otimização de entropia: implementação computacional dos princípios MaxEnt e MinxEnt

    Directory of Open Access Journals (Sweden)

    Mattos Rogério Silva de

    2002-01-01

    Full Text Available Os princípios de otimização de entropia MaxEnt de Jaynes (1957a,b e MinxEnt de Kullback (1959 encontram aplicações em várias áreas de investigação científica. Ambos envolvem a otimização condicionada de medidas de entropia que são funções intrinsecamente não-lineares de probabilidades. Como constituem problemas de programação não-linear, suas soluções demandam algoritmos de busca iterativa e, além disso, as condições de não-negatividade e de soma um para as probabilidades restringem de modo particular o espaço de soluções. O artigo apresenta em detalhe (com a ajuda de dois fluxogramas uma implementação computacional eficiente desses dois princípios no caso de restrições lineares com verificação prévia de existência de solução dos problemas de otimização. Os autores também disponibilizam rotinas de fácil uso desenvolvidas em linguagem MatLabâ .

  3. ANÁLISE DOS PARÂMETROS DE FUNCIONAMENTO E SIMULAÇÃO COMPUTACIONAL EM UM PROTÓTIPO DE TURBINA OPERANDO A AR COMPRIMIDO

    Directory of Open Access Journals (Sweden)

    Wesley Saldanha Nogueira Oliveira

    2016-12-01

    Full Text Available RESUMO. Este trabalho apresenta os resultados iniciais da comparação de alguns parâmetros de funcionamento do protótipo de uma turbina de ação simples, operando com ar comprimido como fluido de trabalho, realizados na unidade do SENAI de Barra do Piraí/RJ. O protótipo foi desenvolvido integralmente no Centro Universitário Geraldo Di Biase - UGB - Campus de Barra do Piraí/RJ, que inicialmente teve como o fluido de trabalho o vapor d’água, que nos testes inicias se mostrou ineficiente. A simulação computacional do sistema foi feita através do software SolidWorks na Universidade Federal Fluminense - UFF - Campus de Volta Redonda/RJ, o que permitiu determinar a faixa de trabalho que apresentou maior eficiência nos resultados experimentais do sistema por meio da relação entre pressão de operação, velocidade angular transmitida pelo fluido ao eixo da turbina e a potência da mesma. Os valores nas simulações em velocidade tangencial na região rotacional apresentaram-se convergentes aos valores experimentais medidos no protótipo.

  4. Simulation of transient inadvertent safety injection system during power operation; Simulacao do transitorio de operacao inadvertida do sistema de injecao de seguranca durante operacao em potencia

    Energy Technology Data Exchange (ETDEWEB)

    Vanni, Enio Antonio [ELETROBRAS Termonuclear S.A. (ELETRONUCLEAR), Rio de Janeiro, RJ (Brazil). E-mail: vanni@eletronuclear.gov.br

    2000-07-01

    The Condition II transient Inadvertent Safety Injection System Operation During Power Operation described on item 15.2.14 of Angra 1 Final Safety Analysis Report (FSAR) has been analyzed. Simulations with RETRAN computer code have been performed to evaluate the consequences to the transient as the Boron Injection Tank (BIT) concentration is reduced from 20000 to 2000 ppm. The first simulation has been carried out for a BIT concentration of 20000 ppm, in order to compare RETRAN results with those presented on FSAR. It has been verified that RETRAN models used and the hypotheses adopted were correct. The second simulation has been performed for a BIT concentration of 2000 ppm. It has been proved that even for this lower concentration level the Departure from Nucleate Boiling ratio (DNBR) limit (1,3) has not been violated. (author)

  5. Simulation of adsorption process of benzene present in effluent of the petrochemical industry; Simulacao do processo de adsorcao do benzeno presente em efluentes da industria petroquimica

    Energy Technology Data Exchange (ETDEWEB)

    Luz, Adriana D. da; Mello, Josiane M.M. de; Souza, Antonio Augusto Ulson de; Souza, Selene M.A. Guelli Ulson de [Universidade Federal de Santa Catarina (UFSC), Florianopolis, SC (Brazil); Silva, Adriano da [Universidade Comunitaria Regional de Chapeco (UNOCHAPECO), SC (Brazil)

    2008-07-01

    The adsorption processes have shown quite efficient in the removal of pollutant in liquid effluents, especially hydrocarbons of difficult removal, such as benzene. This work presents a phenomenological model that describes the process of benzene removal through the adsorption in a fixed bed column, being used coal activated as adsorbent. The model considers the internal and external resistances of mass transfer to the adsorbent particle. The method of Finite Volumes is used in the discretization of the equations. The numerical results obtained through the simulation presented good correlation when compared with experimental data found in the literature, demonstrating that the developed computational code, together with the mathematical modeling, represents an important tool for the project of adsorption columns. (author)

  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. Modeling and simulation of the atomization process in the ceramic tile industry; Modelagem e simulacao do processo de atomizacao na industria de revestimento ceramico

    Energy Technology Data Exchange (ETDEWEB)

    Favalli, Renata Cristina

    2002-07-01

    given by the experimental test and analyses allowing the consistency of computer code and models to be verified. The first numerical tests were carried out for the evaporation of water droplets in a flow of hot air. After that, the water is changed to alumina slurry and the air velocity, temperature and humidity, as well as the droplets mass and temperature history, are obtained. For such condition, several sets of injection angle and type of flow of the droplets were simulated; it shows the versatility of the programme. At last, some experimental tests carried in the laboratory dryer were simulated to verify the model and computer code consistency; the difference between the rate of water vapor calculated by the programme (and the one obtained through the measurements of wet and dry bulb temperatures is 10%, approximately, confirming the consistency of both the computer code and mathematical model. The influence of many operating parameters on continuous and disperse phases were studied. The parameters varied were: gas flow rate; initial temperature of the drying media; slurry feed rate; different amount and sizes for the droplets and initial velocity of droplets. The results of the parametric study were compared to the experimental ones and also confirm the model consistency. (author)

  10. Numerical simulation in steam injection wellbores by mechanistic approach; Simulacao numerica do escoamento de vapor em pocos por uma abordagem mecanicista

    Energy Technology Data Exchange (ETDEWEB)

    Souza Junior, J.C. de; Campos, W.; Lopes, D.; Moura, L.S.S. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Thomas, A. Clecio F. [Universidade Estadual do Ceara (UECE), CE (Brazil)

    2008-07-01

    This work addresses to the development of a hydrodynamic and heat transfer mechanistic model for steam flow in injection wellbores. The problem of two-phase steam flow in wellbores has been solved recently by using available empirical correlations from petroleum industry (Lopes, 1986) and nuclear industry (Moura, 1991).The good performance achieved by mechanistic models developed by Ansari (1994), Hasan (1995), Gomez (2000) and Kaya (2001) supports the importance of the mechanistic approach for the steam flow problem in injection wellbores. In this study, the methodology to solve the problem consists in the application of a numerical method to the governing equations of steam flow and a marching algorithm to determine the distribution of the pressure and temperature along the wellbore. So, a computer code has been formulated to get numerical results, which provides a comparative study to the main models found in the literature. Finally, when compared to available field data, the mechanistic model for downward vertical steam flow in wellbores gave better results than the empirical correlations. (author)

  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. Estudio computacional de la difusión del óxido nítrico y sus implicaciones en los procesos de comunicación y acoplamiento celular, aprendizaje y memoria : modelos y teorías

    OpenAIRE

    Fernández López, Pablo Carmelo

    2014-01-01

    Programa de doctorado: Cibernética y Telecomunicaciones. [ES] Esta tesis avanza en el conocimiento de la dinámica del NO (Óxido Nítrico) en cerebro y sus implicaciones en el funcionamiento y estructura de las Redes Neuronales Biológicas (BNN) y Artificiales (ANN). Se presenta un Marco Matemático-Computacional para el estudio del comportamiento del NO. Se proponen tres modelos computacionales, de capacidad creciente, en el continuo y en el discreto: Modelo basado en funciones de Bessel, Mod...

  14. A utilização do modelo de simulação computacional para análise e modificação de um sistema de produção de pinturas automotivas

    OpenAIRE

    Soares, Bernardo Bregoli

    2013-01-01

    O presente trabalho descreve a utilização da simulação computacional aplicada ao ambiente da fábrica em uma empresa de pinturas automotivas, visando analisar propostas de modificação futura na fábrica, para o atendimento de um novo patamar de demanda de produção. O processo de pintura ocorre em uma linha de produção intermitente, com movimentação por meio de pontes rolantes automáticas. Tal sistema flow shop é composto principalmente das operações de jateamento, pintura e-coat ...

  15. Simulação computacional do comportamento de formação de classes de equivalência pelo procedimento go/no-go com estímulos compostos

    OpenAIRE

    Renato Roberto Vernucio

    2015-01-01

    A partir do treino de relações condicionais podem emergir relações que não foram diretamente treinadas, formando-se classes de equivalência. As pesquisas sobre equivalência de estímulos comumente adotaram o procedimento matching-to-sample (MTS) e utilizam humanos como sujeitos experimentais. Mais recentemente, alguns estudos utilizaram modelos computacionais para simular o comportamento de formação de classes de equivalência. O modelo computacional comumente utilizado chama-se RELNET, que sim...

  16. Estudio computacional de la disipación térmica de espumas metálicas diseñadas mediante el método de Voronoi

    OpenAIRE

    Levices, Quentin

    2016-01-01

    Las espumas metálicas son materiales complejos que existen desde hace varias décadas. Son utilizadas en un amplio rango de aplicaciones incluida la disipación de calor de dispositivos electrónicos. Este proyecto trata del estudio computacional de tres tipos de estructura de espumas metálicas de células abiertas diseñadas por el método de Voronoi como disipadores de calor. Este modelo es muy utilizado para modelizar espumas metálicas, permite obtener estructuras porosas con poro...

  17. Herramientas de monitoreo y control estadístico de atributos en procesos de alta calidad: estudio de resultados, implementación computacional y aplicación práctica

    OpenAIRE

    Joekes, Silvia

    2016-01-01

    Tesis (DCI)--FCEFN-UNC, 2016 Investiga los procedimientos posibles más adecuados y eficientes para el monitoreo y control estadístico de atributos en procesos de alta calidad, en función de la magnitud de los parámetros, el diseño de la muestra y las medidas de desempeño sobre la base de un estudio comparativo de resultados. Desarrolla medios propios de implementación computacional de estos procedimientos y aplicarlos a datos simulados y a datos provenientes de procesos industriales de int...

  18. Modelagem dinâmica e simulação computacional de poços de petróleo verticais e direcionais com elevação por bombeio mecânico

    OpenAIRE

    Filipe, C. A. Lins; Kayo, G. SIlva; Medeiros, Adelardo Adelino Dantas de; Costa, Rutácio O.

    2009-01-01

    LINS, Filipe C. A. et al. Modelagem dinâmica e simulação computacional de poços de petróleo verticais e direcionais com elevação por bombeio mecânico. In: CONGRESSO BRASILEIRO DE PESQUISA E DESENVOLVIMENTO EM PETRÓLEO E GÁS, 5. 2009, Fortaleza, CE. Anais... Fortaleza: CBPDPetro, 2009. This paper presents a dynamic model of vertical oil wells using artificial elevation by suckerrod pumping. The modeling of the system is separated by modules that provide a good understanding of the sys...

  19. Herramienta computacional de evaluación termoeconómica para la selección de plantas de agua fría con caudal variable en circuito primario.

    OpenAIRE

    Molina Cuadro, Alvaro Junior

    2015-01-01

    Este trabajo consiste en el desarrollo de una herramienta computacional de evaluación termoeconómica para la selección de plantas productoras de agua fría en sistemas de aire acondicionado que son actualmente utilizados en los edificios del sector terciario (hoteles, oficinas, centros comerciales, hospitales) denominados sistemas de aire acondicionado por agua fría en primario variable, con subsistema de refrigeración por compresión mecánica. Con esta herramienta computac...

  20. Modelagem estratigráfica de clinoformas deposicionais : construção e aplicação de um modelo computacional baseado em mecânica estatística

    OpenAIRE

    2004-01-01

    Sob a premissa de que a geometria do perfil deposicional das clinoformas pode conter informações sobre a composição textural dos sedimentos que as compõem, bem como sobre a energia da coluna d’água, foi desenvolvido um modelo computacional para a análise teórica dos fatores controladores do tipo de curvatura dos foresets das clinoformas, e, por extensão dos taludes submarinos. Um modelo análogo de suspensão dinâmica foi implementado experimentalmente com um programa em código Matlab, denomina...

  1. Visualização Científica aplicada à Imagiologia Magnética, Matéria Condensada, Oceanografia e Campos Eléctricos usando a biblioteca Computacional VTK

    OpenAIRE

    Sandra Marta Nobre Plecha; Teixeira, J. M.; Pereira, A.M.; Francisco Paulo Marques de Oliveira; João Manuel Ribeiro da Silva Tavares; Jorge Manuel Gomes Barbosa

    2005-01-01

    Neste artigo utiliza-se a biblioteca computacional VTK (Visualization ToolKit) em quatro domínios de aplicação distintos: imagiologia magnética, matéria condensada, oceanografia e campos eléctricos. Na área da imagiologia, a aplicação desenvolvida permite realizar algumas operações usuais de processamento de imagem, nomeadamente operações algébricas e de filtragem. No domínio da matéria condensada, foi elaborado um programa que facilita o estudo da estrutura cristalina, a simulação de transiç...

  2. Modelo computacional para la identificación de endofenotipos en pacientes con artritis reumatoide utilizando información del antígeno leucocitario humano HLA clase II

    OpenAIRE

    Morales Muñoz, Luis Antonio

    2014-01-01

    La Artritis Reumatoide es una enfermedad autoinmune que afecta del 0.4% al 1% de la población humana y existen marcadores genéticos implicados en esta enfermedad. Se han utilizado varios modelos de inteligencia computacional para la clasificación e identificación de endofenotipos (relación entre fenotipo y marcadores genéticos) en pacientes con Artritis Reumatoide y controles sanos a partir de información genética, principalmente el HLA DRB1 (Antígeno Leucocitario Humano), así como la teoría ...

  3. Una investigación científica acerca del progreso de métodos de ensamble basados en inteligencia computacional para predicción de series de tiempo económicas y financieras

    OpenAIRE

    Rodríguez Muñoz, Luisa Fernanda

    2012-01-01

    Contexto: La combinación de pronósticos es un importante método que se usa cuando están disponibles los pronósticos de varios modelos alternativos, con el objetivo de mejorar la precisión del pronóstico. El ensamble mediante el promedio es un método de inteligencia computacional bien conocido para agregar los pronósticos de varios expertos. Ambas metodologías comparten principios y técnicas similares en un grado importante; sin embargo, no hay estudios orientados a determinar el estado actual...

  4. Sistema computacional de gerenciamento para acompanhamento de desempenho de máquinas agrícolas instrumentadas com sensores Computer system management for monitoring performance of agricultural machinery instrumented with sensors

    OpenAIRE

    Oni Reasilvia de Almeida Oliveira Sichonany; José Fernando Schlosser; Roseclea Duarte Medina; Iria Brucker Roggia; Jaziel Souza Lôbo; Fernado Beux dos Santos

    2011-01-01

    O G-SADA é um sistema computacional de gerenciamento que auxilia o gerente da propriedade rural e o operador da máquina agrícola nas tomadas de decisão, informando sobre valores de operações fora dos padrões. O sistema tem como características permitir a) o acompanhamento do desempenho da máquina enquanto ela está em operação no campo, com funcionalidades em tempo real, b) a mobilidade do usuário por poder ser acessado a partir de qualquer tipo de computador, incluindo dispositivos móveis, co...

  5. Modelo computacional para la identificación de endofenotipos en pacientes con artritis reumatoide utilizando información del antígeno leucocitario humano HLA clase II

    OpenAIRE

    Morales Muñoz, Luis Antonio

    2014-01-01

    La Artritis Reumatoide es una enfermedad autoinmune que afecta del 0.4% al 1% de la población humana y existen marcadores genéticos implicados en esta enfermedad. Se han utilizado varios modelos de inteligencia computacional para la clasificación e identificación de endofenotipos (relación entre fenotipo y marcadores genéticos) en pacientes con Artritis Reumatoide y controles sanos a partir de información genética, principalmente el HLA DRB1 (Antígeno Leucocitario Humano), así como la teoría ...

  6. Construção linguístico-computacional de um ontoglossário inglês-português do domínio léxico-conceitual LOVE LIFE

    OpenAIRE

    Giroto, Maira Coutinho Ferreira [UNESP

    2013-01-01

    O objetivo desta pesquisa, que se desenvolveu nas dimensões linguística, linguísticocomputacional e computacional dos estudos do processamento automático de língua natural, foi explorar a construção e a codificação no editor de ontologias Protégé- Frames do ontoglossário para uma parcela das unidades léxicas (ULs) do inglês e das suas correspondentes do português que expressam um subconjunto de conceitos do domínio léxico-conceitual dos relacionamentos amorosos, que denominamos love life, rot...

  7. Material simulation for scatter and degrader plates construction;Simulacao de materiais para construcao de folhas espalhadoras e degradadoras de energia

    Energy Technology Data Exchange (ETDEWEB)

    Fonseca, Gabriel P.; Yoriyaz, Helio; Siqueira, Paulo T.D.; Antunes, Paula C.G. [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil). Centro de Engenharia Nuclear; Furnari, Laura; Reis, Gabriela S. [Hospital das Clinicas da USP, Sao Paulo, SP (Brazil). Inst. de Radiologia. Servico de Radioterapia

    2009-07-01

    There are many radiosensitive diseases associated to the skin such as mycosis fungoids and the syndrome of Sezary that are part of a sub-group of cutaneous diseases type T-cell lymphoma. Several studies indicate the eradication of the disease when treated with linear accelerators emitting electron beams with energies between 4 to 10 MeV. However, this treatment technique presents innumerable technical challenges since the disease in general reaches all patient's body, becoming necessary a very large field size radiation beam, and also, it should deliver superficial doses limited to the skin depth. To reach the uniformity in the dose distribution, many techniques had already been developed. Based on these previous studies and guided by the report nr. 23 of the AAPM (American Association of Physicists in Medicine), the present study will develop an energy scattering and degrading plates, supplying subsidies for a future installation for skin treatment at the 'Servico de Radioterapia do Hospital das Clinicas de Sao Paulo'. As part of the plates design, first of all, the energy spectrum of the 6 MeV electron beam of the VARIAN 2100C accelerator was reconstructed through Monte Carlo simulations using the MCNP4C code and based on experimental data. Once the spectrum is built the design of the plates has been performed analyzing several materials, on the basis of radial and axial dose distribution, production of rays-x and dose attenuation. The simulations was validated with experimental measurements using copper and aluminum. (author)

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

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

  10. PROJETO DE CORREIAS TRANSPORTADORAS: UM ESTUDO COMPUTACIONAL DE COMPARAÇÃO DOS MÉTODOS CEMA E PRÁTICO

    Directory of Open Access Journals (Sweden)

    Ricardo Amâncio Malagoni

    2014-07-01

    Full Text Available Para o projeto de correias transportadoras, são comumente empregados dois métodos: Método Prático e Método CEMA (Conveyor Equipment Manufacture Association. O Método Prático, mais simplificado, aplica-se a transportadores simples e de pequena capacidade. Neste, calcula-se primeiramente a potência necessária para o transporte e, a partir desta, as tensões na correia. O método CEMA, mais sofisticado, é aplicável a transportadores de vários lances, curtos ou longos, onde calcula-se inicialmente as tensões em cada lance da correia, e, após isto, calcula-se a potência de acionamento. Com isto, um dos objetivos do presente trabalho foi a criação de um programa computacional, o qual realiza o projeto de correias transportadoras através dos métodos Prático e CEMA. Por meio deste programa, foram realizadas simulações para os materiais: rocha fosfática e minério de ferro (itabiritos para diferentes configurações de correias transportadoras. Como dados de saída do programa, tem-se as seguintes especificações de projeto: largura da correia, distância do material à borda da correia, capacidade mássica, velocidade da correia e potência do motor. Tanto o Método Prático quanto o Método CEMA se mostraram de suma importância para o projeto de correias transportadoras, sendo o primeiro de grande valia na estimativa inicial de um projeto, enquanto o outro, apesar da maior complexidade, é o mais recomendado para o projeto final de correias transportadoras.

  11. Desenvolvimento de um sistema computacional para dimensionamento e evolução de rebanhos bovinos Development of software for dimensioning and evolution of bovine herds

    Directory of Open Access Journals (Sweden)

    Marcos Aurélio Lopes

    2000-10-01

    Full Text Available Os objetivos deste estudo foram desenvolver um sistema computacional que efetue o dimensionamento e a evolução de rebanhos bovinos e criar uma ferramenta que possibilite ao usuário efetuar simulações em um sistema de produção de carne e/ou leite. Foi utilizada a linguagem CA Clipper. As rotinas foram desenvolvidas de forma conversacional, com acesso aos diversos programas, por meio de menus auto-explicativos. O sistema desenvolvido pode auxiliar o técnico e o pecuarista no dimensionamento e na evolução de um rebanho bovino com precisão e considerável rapidez; possibilita ao usuário efetuar inúmeras simulações; e constitui -se em importante ferramenta no auxílio da tomada de decisões.The objectives of this study were to develop a software that accomplishes both the dimensioning and evolution of cattle herds and develop a tool which makes it possible for the user to perform simulations with production systems of milk and or beef. The language employed was CA Clipper. The routines have been developed in a conversational form, with an access to the several programs by means of self-explicative menus. The developed system can aid both the technician and the raiser in dimensioning and evolution of a cattle herd with precision and outstanding rapidity; it allows to the user to perform a number of simulations; and it is considered an important tool in the assistance to decision-making.

  12. Un análisis computacional de las líneas prehistóricas: diseños geométricos y lenguaje

    Directory of Open Access Journals (Sweden)

    Víctor Manuel LONGA

    2013-06-01

    Full Text Available El enfoque usual en Paleoantropología y Arqueología ha sido analizar los restos prehistóricos desde la perspectiva de la conducta con la que pudieron asociarse –simbólica, tecnológica, social, etc. En lo que respecta al lenguaje, la presencia de objetos simbólicos en el registro arqueológico se ha tomado como indicador automático de la existencia de lenguaje complejo en la Prehistoria. Este trabajo presenta un enfoque muy diferente: analizar los restos prehistóricos desde la perspectiva de los procesos y las capacidades computacionales mentales requeridas para producir esos objetos. Esta perspectiva deja de lado la ‘semántica’ de las piezas –su posible carácter simbólico o representacional–, para centrarse en el análisis de rasgos puramente formales que revelen una complejidad computacional semejante a la del lenguaje. El artículo analiza desde esa perspectiva (1 los diseños geométricos producidos en el Paleolítico medio e inferior de Eurasia por especies como Homo neanderthalensis y quizás Homo heidelbergensis, y (2 los diseños geométricos producidos durante la Edad de la Piedra Media africana por los Humanos Anatómicamente Modernos. La comparación en términos computacionales entre ambos tipos de diseños permite inferir el tipo de lenguaje asociado a esas especies.

  13. Simulação do comportamento mecânico de misturas asfálticas usando um modelo computacional multi-escala

    Directory of Open Access Journals (Sweden)

    Flávio Vasconcelos de Souza

    2009-10-01

    Full Text Available As misturas asfálticas, por serem materiais heterogêneos, possuem comportamento global dependente do comportamento dos constituintes individuais, de suas frações volumétricas e das interações físico-químicas entre os constituintes, dentre outros fatores. Deste modo, para que se possa compreender melhor o comportamento desses materiais, é necessário o uso de metodologias capazes de considerar as características e fenômenos ocorrentes nas escalas menores. Uma metodologia que vem sendo bastante estudada e aplicada na comunidade científica internacional são os chamados modelos multi-escala. O objetivo do presente trabalho é descrever um modelo computacional multi-escala e aplicá-lo à simulação de ensaios comumente usados em misturas asfálticas, quais sejam, os ensaios de compressão diametral e de fadiga por flexão em viga. Para o caso de compressão diametral, os resultados numéricos se mostraram em concordância com os resultados observados experimentalmente. Para o caso de carregamento cíclico, não foi feita uma comparação com experimentos, mas os resultados numéricos mostram a capacidade do modelo em simular qualitativamente os fenômenos de trincamento por fadiga e acúmulo de deformações permanentes.

  14. Análise da renovação das águas do Sistema Estuarino de Santos usando modelagem computacional

    Directory of Open Access Journals (Sweden)

    Fernando Roversi

    2016-06-01

    Full Text Available A investigação de processos inerentes a um sistema estuarino permite inferir de forma mais precisa sua complexa dinâmica, possibilitando o balizamento de estratégias de ação em planos de gestão e projetos ambientais em regiões costeiras. Este trabalho apresenta um estudo da hidrodinâmica do Sistema Estuarino de Santos (SP, com enfoque na análise da renovação de suas águas, pelo efeito da maré e pelas vazões fluviais afluentes. Por meio do SisBaHiA® (Sistema Base de Hidrodinâmica Ambiental foi implementado um modelo hidrodinâmico computacional para a reprodução dos padrões de circulação do sistema. A partir de simulações com o Modelo de Transporte Euleriano, foram então calculadas as taxas de renovação de suas águas, para os períodos representativos de verão e de inverno. Os resultados, apresentados na forma de mapas e na forma de séries temporais de renovação, indicaram que após 30 dias todo o sistema apresenta uma renovação total maior que 95%. Diferenças sazonais puderam ser verificadas apenas em regiões mais internas do estuário, e.g., no Canal de Piaçaguera.

  15. Obtención de un modelo computacional con el software SIGMA/W, para reproducir los resultados del ensayo con la viga Benkelman.

    Directory of Open Access Journals (Sweden)

    Reynier Moll Martínez

    2014-01-01

    Full Text Available Entre los principales métodos para el diseño de los pavimentos están los empíricos-mecanicistas que utilizan la teoría del retrocálculo. Esta teoría permite caracterizar los materiales de las capas del pavimento y evaluar el comportamiento resistente de la estructura con la ayuda de la modelación computacional. En el trabajo se evalúan varios modelos geométricos para seleccionar con cuál se obtienen los resultados que más se aproximan a los logrados mediante el ensayo con la viga Benkelman. La modelación se realizó con el software SIGMA/W; empleando la información de estudio de suelos realizada con el Penetrómetro Dinámico de Cono (DCP del inglés Dynamic Cone Penetrometer, en el primer proyecto de reciclado con asfalto espumado realizado en Cuba. Se consideró un modelo lineal- elástico, y la magnitud de cargas que reconoce la norma cubana de diseño de pavimentos flexibles (NC: 334/2004 [1]. Los resultados de la modelación se compararon con la información de la evaluación deflectométrica realizada a la vía en cuestión. Los resultados demuestran la posibilidad de simplificar el número de mediciones con la viga Benkelman; además, el modelo geométrico obtenido puede ser parte del procedimiento a proponer para el diseño de pavimentos reciclados en frío, en Cuba.

  16. Monte Carlo simulation of the Varian Clinac 600C accelerator using dynamic wedges; Simulacao Monte Carlo do acelerador Varian Clinac 600C utilizando cunhas dinamicas

    Energy Technology Data Exchange (ETDEWEB)

    Moreno, S. [Universidade da Beira Interior (UBI), Covilha (Portugal); Chaves, A.; Lopes, M.C. [Instituto Portugues de Oncologia Doutor Francisco Gentil (IPO), Coimbra (Portugal); Peralta, L. [Laboratorio de Instrumentacao e Fisica Experimental de Particulas (LIP), Lisboa (Portugal)]|[Universidade de Lisboa (Portugal). Faculdade de Ciencias

    2004-07-01

    C linac. For such, the influence of the virtual wedge on a 4 MV photon beam, produced by the Varian Clinac 600C linac, was studied using the MC codes GEANT3 and DPM. A good agreement was obtained between the experimental and simulated data in the dose lateral profiles at 1 cm depth and using a 10 X 10 cm{sup 2} field size. (author)

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

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

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

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

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

  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. La comprensión de conceptos a partir de la elaboración de representaciones en un ambiente computacional1

    Directory of Open Access Journals (Sweden)

    Luis Bayardo Sanabria Rodríguez

    2015-09-01

    Full Text Available Este artículo presenta un estudio encaminado a validar un sistema de aprendizaje basado en modelos de representación estructurada. La investigación busca evaluar la comprensión de los aprendices cuando interactúan en ambientes hipermediales en acciones que les permiten obtener su propia ontología a partir de un texto o de la lectura de un ambiente hipermedial creado por un experto, elaborar una representación y transferirla a un modelo computacional. Está dirigido a estudiantes de primer semestre de Licenciatura en Diseño y Electrónica, quienes interactúan en dos ambientes de aprendizaje apoyados en tecnologías de la información: uno, orientado al estudio de un texto lineal sobre sistemas mecánicos y posterior representación y construcción de un hipertexto sobre la comprensión del texto; y otro, dirigido al estudio de un hipertexto sobre el mismo tema y posterior representación de lo comprendido. El método incluye un estudio cuantitativo por medio del análisis de varianza realizado con la prueba F para establecer diferencias de los puntajes alcanzados en la prueba de comprensión de los grupos, combinado con la cuantificación de los conceptos, relaciones entre conceptos y los descriptores que definen cada concepto, para determinar diferencias en la representación de los dos grupos. Los resultados indican que en el primer caso no existen diferencias significativas en la comprensión de los dos grupos. Con relación a la representación de conceptos, se evidencian diferencias significativas a favor del grupo que estudió el hipertexto elaborado por un experto, lo cual indica que sus representaciones fueron sintácticamente más ricas a diferencia de aquellos que estudiaron un texto lineal y elaboraron su propio hipertexto.

  2. Modelo computacional para caracterización de células escamosas de citologías cérvico-uterinas

    Directory of Open Access Journals (Sweden)

    Martínez Abaunza Víctor Eduardo

    2005-12-01

    Full Text Available El trabajo se realizó entre el Grupo de Investigación en Ingeniería Biomédica (GIIB y el Grupo de Investigación en Patología Estructural, Funcional y Clínica de la Universidad Industrial de Santander (UIS, junto con la Facultad de Medicina de la Universidad Autónoma de Bucaramanga (UNAB; el objetivo principal es construir un modelo computacional que permita caracterizar las células presentes en una citología cérvico uterina, con el propósito de clasificarlas como normales o displásicas. Las láminas que contenían las muestras celulares las recolectaron los patólogos y se tomaron fotografías digitales por medio de una cámara de video acoplada a un microscopio y conectada a un dispositivo de adquisición. En la segmentación de las imágenes se utilizaron tres algoritmos de binarización que permitieron detectar los núcleos celulares; debido a que estos algoritmos presentaron fallas en la detección del citoplasma, se utilizó binarización manual. La descripción de la textura celular se logró con la distribución del histograma, en cada uno de los planos de color, y en los bordes se emplearon descriptores de Fourier. Se presentan los resultados de la primera fase, implementados en la clasificación e identificación de células normales. En las fases posteriores se aplicará la caracterización de cada uno de los estadios de las células clasificadas inicialmente como displásicas, para lograr discriminar las reactivas de las que realmente tienen cambios de lesión. Palabras clave: tratamiento de imágenes, morfología matemática, citología cérvico uterina, displasia, cáncer de cérvix.

  3. Estudio del comportamiento mecánico de un sistema recubierto mediante simulación computacional del ensayo de rayado//Mechanical Behavior study of a coated system by computer simulation of the scratch test

    Directory of Open Access Journals (Sweden)

    Eduardo A. Pérez Ruiz

    2015-05-01

    Full Text Available Una forma de evaluar un sistema recubierto es a través del ensayo de rayado. Los resultados obtenidos dependen de variables como: propiedades y geometría del indentador, tasa de carga, tasa de desplazamiento, propiedades de los materiales del sistema a evaluar como dureza, módulo elástico, microestructura, rugosidad superficial, espesor, entre otras. El presente trabajo analizó, a través de simulación computacional del ensayo de rayado, el efecto que tiene la geometría del indentador (cónica y esférica, la carga de rayado (20 N y 50 N, el espesor del recubrimiento (2,1 µm y 4,6 µm y el coeficiente de fricción (0,3 y 0,5 en el comportamiento de los esfuerzos y la deformación plástica en la superficie de un sistema recubierto. Los resultados sugieren que el coeficiente de fricción como variable de ensayo tiene una alta importancia en el comportamiento mecánico del sistema recubierto.Palabras claves: ensayo de rayado, simulación computacional, sistema recubierto.______________________________________________________________________________AbstractOne way to evaluate a coated system is through the scratch test. The results obtained depend of the variables including mechanical properties and geometry of indenter, loading, displacement, material properties in the system as hardness, elastic modulus, microstructure, roughness surface, thickness, among others, which are indicated in ASTM C1624 / 05. This paper analyzes through scratch test simulation, the effect of the indenter geometry (conical and spherical, the loading (20 N and 50 N, the thickness coating (2,1 µm and 4,6 µm and the friction coefficient values (0,3 and 0,5 in the stresses and plastic deformation behavior at the surface of a coated system. The results suggest that the coefficient of friction has a high importance in the mechanical performance of the coated system.Key words: scratch test, computacional simulation, coated system.

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

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

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

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

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

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

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

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

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

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

  14. Fatores de risco para doença arterial coronariana em idosos: análise por enfermeiros utilizando ferramenta computacional Factores de riesgo para enfermedad arterial coronaria en ancianos: análisis por enfermeras utilizando herramienta computacional Risk factors for coronary artery disease in the elderly: analysis by nurses using computational tool

    Directory of Open Access Journals (Sweden)

    Silvia Sidnéia da Silva

    2010-12-01

    Full Text Available Este trabalho objetivou analisar a ocorrência dos fatores de risco para doença arterial coronariana em população idosa participante de uma ação comunitária utilizando ferramenta computacional por enfermeiros. Para o desenvolvimento do trabalho utilizou-se uma base de dados coletada em um evento comunitário. As informações se referem a fatores de risco, dados antropométricos, aferição de valores de glicemia, colesterol e pressão arterial, ocorrência de doença cardíaca e outras. A estrutura multidimensional foi elaborada e gerenciada pela ferramenta Analysis Services. A população idosa correspondeu a 40,4% do total, um terço dessa população estava com valores alterados de pressão arterial sistêmica, 53,8% apresentavam índice de massa corporal acima de 25 Kg/m², 40,3% referiram hipertensão e 20,3%, diabetes mellitus. Conclui-se que o controle de fatores de risco para DAC em clientes idosos é essencial e que a tecnologia da informação pode apoiar na tomada de decisões estratégicas de promoção de saúde.Este trabajo tuvo como objetivo analizar la ocurrencia de los factores de riesgo para enfermedad arterial coronaria en la población anciana participante de una acción comunitaria con una herramienta computacional para las enfermeras. Para el desarrollo del trabajo se utilizó una base de datos colectada en un evento comunitario. Las informaciones se refieren a factores de riesgo, datos antropométricos, contraste de valores de glucemia, colesterol y presión arterial, ocurrencia de enfermedad cardiaca y otras. La estructura multidimensional fue elaborada y administrada por la herramienta Analysis Services. La población anciana correspondió a 40,4% del total, un tercio de esta población estaba con valores alterados de presión arterial sistémica, 53,8% presentaban índice de masa corporal arriba de 25Kg/m², 40,4% se referían a hipertensión y 20,3% diabetes mellitus. Se concluye que el control de factores de

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

  16. Sistema para localização robótica de veículos autônomos baseado em visão computacional por pontos de referência

    OpenAIRE

    Leandro Nogueira Couto

    2012-01-01

    A integração de sistemas de Visão Computacional com a Robótica Móvel é um campo de grande interesse na pesquisa. Este trabalho demonstra um método de localização global para Robôs Móveis Autônomos baseado na criação de uma memória visual, através da detecção e descrição de pontos de referência de imagens capturadas, com o método SURF, associados a dados de odometria, em um ambiente interno. O procedimento proposto, associado com conhecimento específico sobre o ambiente, permite que a localiza...

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

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

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

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

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

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

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

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

  5. Diseño de un Programa Computacional para Evaluar la Gestión de Mantenimiento Basado en la Seguridad de Funcionamiento Design of a Computational Program to Evaluate Maintenance Management based on Dependability

    Directory of Open Access Journals (Sweden)

    F. Espinosa

    2004-01-01

    Full Text Available Se ha definido una serie de índices y su implementación computacional, que permitan medir y explicar el valor de la eficiencia global de un sistema productivo en el cual se aplica la Seguridad de Funcionamiento (SdF. Estos índices corresponden a aspectos inherentes a la SdF, como ser confiabilidad, seguridad, mantenibilidad y disponibilidad, los cuales entregan los llamados Índices Directos. El conjunto de índices provenientes del proceso productivo, tales como calidad del producto, ciclo de tiempo de las operaciones y costos involucrados, estos últimos llamados Índices Complementarios. En la formulación de estos índices se integran datos de pérdidas de tiempo, producto de acciones o causas no deseadas y que perjudican al proceso productivo. Se da una definición alternativa para cada uno de los índices ya mencionados y entregando cada uno de ellos una información más relevante para el encargado del mantenimiento de la empresa.A series of indicators have been defined, as well as their computacional implementation, which allow to measure the efficency and to define a value of the overall efficiency of a productive system to which the concept of Dependability is applied. The indicators which represent inherent aspects of Dependability including reliability, safety, maintainability, and availability are named Direct Indicators. The set of productive process indicators, including quality of the product, time cycle involved in operations, and costs, are named Complementary Indicators. In the formulation of these indicators, data on losses of time are integrated,which represent the results of actions or unwanted causes, and which harm the productive process. An alternative definition for each of the indicators mentioned above is given, and each of them isprovided with more relevant information for the person in charge of the company maintenance.

  6. Ponto de efeito salino nulo: determinação analítico-computacional a partir de dados de titulação potenciométrica

    Directory of Open Access Journals (Sweden)

    M. E. Alves

    2002-06-01

    Full Text Available O ponto de efeito salino nulo (PESN de amostras de solo é normalmente determinado por método gráfico e corresponde ao valor de pH referente ao ponto de interseção de curvas de titulação potenciométrica. Embora a elaboração dos gráficos em planilhas eletrônicas diminua a subjetividade existente no traçado manual, um tempo considerável é necessário quando a determinação do PESN envolve grande número de amostras. Este trabalho objetivou o desenvolvimento de um programa computacional para a determinação analítica do PESN de amostras de solo, com vistas em eliminar a subjetividade do método gráfico, proporcionar rapidez às determinações e permitir o conhecimento do grau de precisão dos valores calculados. Com o procedimento de cálculo desenvolvido, determinaram-se os valores de PESN a partir de resultados experimentais de titulação potenciométrica obtidos por outros autores. A comparação dos valores calculados pelo programa com os apresentados nos trabalhos consultados, os quais foram obtidos pelos autores por meio do método gráfico convencional, demonstrou ser o método analítico-computacional proposto bastante adequado para a determinação rápida e não-subjetiva do PESN de amostras de solo.

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

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

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

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

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

  12. Computational program to design heat pumps by compression (ciclo 1.0); Programa computacional para diseno de bombas de calor por compresion (ciclo 1.0)

    Energy Technology Data Exchange (ETDEWEB)

    De Alba Rosano, Mauricio [CIE, UNAM, Temixco, Morelos (Mexico)

    2000-07-01

    A new computational program has been developed in order to design single stage compression heat pumps. This software, named CICLO 1.0 allows the design of water-water, water-air, air-water and air-air heat pumps, for industrial and residential applications. CICLO 1.0 simulates three types of compressors: reciprocating, screw and scroll. Also has a data base created with REFPROP software which includes eleven refrigerants. The condenser and evaporator simulation includes global conductance (UA) determination, and when one or both are shell and tube's type, this software shows the even number of tube passes by shell. The software determines the best compressor and refrigerant setup taking the COP as a parameter; in order to obtain this, is necessary to know the inlet/outlet conditions of the fluid to be heated, the inlet conditions of the fluid that gives heat, and the electric motor efficiency that drives the compressor. The afforded results by CICLO 1.0 are: operation conditions from compression cycle, that means, pressures and temperatures at the inlet/outlet from every heat pump component are determined: as well as refrigerant mass flux, COP, power required by compressor, volumetric and isentropic efficiencies, heat exchangers global conductance and more data. CICLO 1.0 has been executed with heat pump data that nowadays are operating, and the results from the simulation have been very similar each other with data reported from operational facilities. [Spanish] Se ha desarrollado un nuevo programa computacional para el diseno de bombas de calor por compresion de vapor de una sola etapa. Este programa, CICLO 1.0, permite el diseno de bombas de calor de tipo: agua-agua, agua-aire, aire-agua y aire-aire, que se utilicen para aplicaciones industriales, de servicios y residenciales. CICLO 1.0 simula tres tipos de compresores: reciprocante, de tornillo y scroll: cuenta con una base de datos de refrigerantes creada con el programa REFPROP la cual incluye once

  13. Computational package for the dynamic analysis of synchronous generators and their controls; Paquete computacional para el analisis de generadores sincronos y sus controles

    Energy Technology Data Exchange (ETDEWEB)

    Perez Guillen, Jesus Artemio

    1997-12-31

    This thesis presents a computational package for the dynamic analysis of synchronous generators and their controls in a machine - infinite bus system. The package is integrated by a graphic interface for Windows environment and several models for the different components of the generation system. The development of the graphic interface was carried out with object oriented programming under Windows environment, available from Borland C++, which generates a group of menus that integrates an environment of interactive and versatile simulation. The package contains mathematical models of third, fourth, fifth and sixth order for synchronous generators of round and salient poles. Several mathematical models for the excitation systems DC1A, AC1A and ST1A, according to the IEEE classification, are included. Models for thermal and hydraulic turbines with governor of speed are also included, as well as a mathematical model for the power system stabilizer and magnetic saturation on synchronous generators. Numerical methods like Euler, Modified Euler and Runge Kutta of second and fourth order are used to solve the characteristics differential equations of the system under study. Algorithms for graphic generation includes phasor diagram, capability and saturation curves for synchronous machine. Computer models are validated and sensitivity analysis is carried out in order to assess the ef ect of type of model for synchronous machine, excitation systems, power system stabilizer, magnetic saturation in the synchronous generator and different numerical methods of integration. The computational package is useful in teaching and research on the dynamic response of synchronous machines and their controls. [Espanol] En este trabajo se presenta el desarrollo de un paquete computacional para el analisis dinamico de generadores sincronos y sus controles en el esquema de una unidad de generacion - bus infinito. El paquete esta integrado por una interfaz grafica para ambiente Windows y un

  14. Programa computacional para o dimensionamento de colhedoras considerando a pontualidade na colheita de soja Computer model to select combine harvesters considering the timeliness of soybean

    Directory of Open Access Journals (Sweden)

    Iackson O. Borges

    2006-04-01

    Full Text Available A colheita de soja (Glycine max (L. Merril é uma operação crítica que pode sofrer atrasos resultando em perdas na quantidade e na qualidade do material colhido. Embora o valor das perdas seja desconhecido no País, os produtores empregam colhedoras com reserva de capacidade para concluir a operação no menor prazo possível. O excesso de capacidade aumenta os custos fixos e a falta dela aumenta os custos das perdas por atraso e, em ambos os casos, reduzem a renda líquida da operação, ao que se denomina custo de pontualidade. O problema do dimensionamento consiste em ajustar o custo do capital extra investido na capacidade da máquina para garantir a pontualidade e o custo das perdas por atraso, buscando maximizar a renda líquida. Devido à importância da cultura e da pontualidade, o objetivo deste trabalho foi avaliar a influência do atraso no dimensionamento da frota e no custo da operação de colheita. Para tanto, desenvolveu-se um modelo computacional em linguagem Borland® Delphi 5.0, em que a entrada de dados inclui os atributos da região agroclimática, da colhedora e das cultivares de soja. O resultado é a renda líquida como indicador da pontualidade na operação para a colhedora selecionada. O programa foi utilizado para simular cenários numa propriedade na região de Ponta Grossa - PR, e os valores obtidos revelaram que a frota de colhedoras da propriedade opera com capacidade ociosa, produzindo renda líquida abaixo do potencial.Soybean harvest is considered a critical operation that might suffer some delays causing a reduction in crop yield or quality. Although the value of losses is unknown in the country, combine harvesters with high capacity are applied by the producers and they aim to conclude the operation as fast as possible. If the harvesters have greater capacity than the required, the fixed cost is increased, and if it is the opposite, it might reduce the crop yield. In both cases, there is a decrease in

  15. Computational modeling for irrigated agriculture planning. Part II: risk analysis Modelagem computacional para planejamento em agricultura irrigada: Parte II - Análise de risco

    Directory of Open Access Journals (Sweden)

    João C. F. Borges Júnior

    2008-09-01

    Full Text Available Techniques of evaluation of risks coming from inherent uncertainties to the agricultural activity should accompany planning studies. The risk analysis should be carried out by risk simulation using techniques as the Monte Carlo method. This study was carried out to develop a computer program so-called P-RISCO for the application of risky simulations on linear programming models, to apply to a case study, as well to test the results comparatively to the @RISK program. In the risk analysis it was observed that the average of the output variable total net present value, U, was considerably lower than the maximum U value obtained from the linear programming model. It was also verified that the enterprise will be front to expressive risk of shortage of water in the month of April, what doesn't happen for the cropping pattern obtained by the minimization of the irrigation requirement in the months of April in the four years. The scenario analysis indicated that the sale price of the passion fruit crop exercises expressive influence on the financial performance of the enterprise. In the comparative analysis it was verified the equivalence of P-RISCO and @RISK programs in the execution of the risk simulation for the considered scenario.Técnicas de avaliação de riscos procedentes de incertezas inerentes à atividade agrícola devem acompanhar os estudos de planejamento. A análise de risco pode ser desempenhada por meio de simulação, utilizando técnicas como o método de Monte Carlo. Neste trabalho, teve-se o objetivo de desenvolver um programa computacional, denominado P-RISCO, para utilização de simulações de risco em modelos de programação linear, aplicar a um estudo de caso e testar os resultados comparativamente ao programa @RISK. Na análise de risco, observou-se que a média da variável de saída, valor presente líquido total (U, foi consideravelmente inferior ao valor máximo de U obtido no modelo de programação linear. Constatou

  16. Embodiment in cognitive linguistic: from experientialism to computational neuroscience Corporeidade em linguística cognitiva: do experiencialismo à neurociência computacional

    Directory of Open Access Journals (Sweden)

    Heloísa Pedroso de Moraes Feltes

    2010-01-01

    cognitivo. A teoria, nesses termos, modela como os seres humanos constroem e processam estruturas de conhecimento que regulam sua vida individual e coletiva. Em seguida, discute-se a Teoria Neural da Linguagem, em que a corporeidade é reconstruída a partir de um paradigma de cinco níveis, em que o conexionismo estruturado carrega o peso da descrição e explanação computacional. Em vista disso, retomam-se problemas clássicos sobre implementações computacionais para modelos de funcionamento da linguagem humana, em abordagens reducionistas-fisicalistas. Como conclusão, defende-se que a corporificação, como fenômeno de investigação, que se problematize sua formulação em termos de níveis, tratando-a, em vez disso, como interfaces, de modo que: (a os compromissos epistemológicos deveriam ser sincronicamente mantidos nas interfaces; (b em função de (a, o nível das computações deveria ser tomado como um dos problemas a serem tratados no plano do conexionismo estruturado; (c a estratégia de um paradigma em níveis de redução e os resultados obtidos a partir dela implicam uma espécie de modularização do programa de pesquisa; e (d esses módulos seriam interdependentes apenas em vista dos níveis criados para atender a determinados objetivos. Como resultado, assume-se que é possível fazer-se Lingüística Cognitiva sem aderir ao conexionismo estruturado ou à simulação neurocomputacional, desde que se operaria com construções de interfaces entre domínios de investigação, e não com um paradigma em níveis, com traços reducionistas.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  1. Development of a computer code for determining the thickness of shielding used in cardiac angiography techniques; Desenvolvimento de um codigo computacional para determinacao da espessura de barreiras utilizadas em tecnicas de angiografia cardiaca

    Energy Technology Data Exchange (ETDEWEB)

    Lava, Deise D.; Borges, Diogo da S.; Affonso, Renato R.W.; Moreira, Maria de L.; Guimaraes, Antonio C.F., E-mail: deise_dy@hotmail.com, E-mail: diogosb@outlook.com, E-mail: raoniwa@yahoo.com.br, E-mail: malu@ien.gov.br, E-mail: tony@ien.gov.br [Instituto de Engenharia Nuclear (IEN/CNEN-RJ), Rio de Janeiro, RJ (Brazil)

    2014-07-01

    The construction of an effective shielding against the interaction of ionizing radiation in X-ray rooms requires consideration of many variables. The methodology used for specification of a primary and secondary shielding thickness of a X-ray room considers the following factors: use factor, occupational factor, distance between the source and the wall, workload, Kerma in the air and distance between the patient and the receptor. The program built from this data, has the objective of identifying and using variables in functions obtained through linear regressions of graphics offered by NCRP Report-147 (Structural Shielding Design for Medical X-Ray Imaging Facilities) for the shielding calculation of the room walls as wall dark room and adjacent areas. With the methodology constructed a program validation is done by comparison of results with a base case provided by that report. The values of the thicknesses obtained comprise various materials such as steel, wood and concrete. Once validated an application is made in a real case of X-ray room. His visual construction is done with the help of software used in modeling of interiors and exteriors. The construction of shielding calculating program has the goal of being an easy tool for planning of X-ray rooms in order to meet the established limits by CNEN-NN-3:01 published in September 2011.

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

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

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

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

  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. Development of a methodology for simulation of gas cooled reactors with purpose of transmutation; Desenvolvimento de uma metodologia para simulacao de reatores refrigerados a gas com proposito de transmutacao

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Clarysson Alberto da

    2009-07-01

    This work proposes a methodology of MHR (Modular Helium Reactor) simulation using the WIMSD-5B (Winfrith Improved Multi/group Scheme) nuclear code which is validated by MCNPX 2.6.0 (Monte Carlo N-Particle transport eXtend) nuclear code. The goal is verify the capability of WIMSD-5B to simulate a reactor type GT-MHR (Gas Turbine Modular Helium Reactor), considering all the fuel recharges possibilities. Also is evaluated the possibility of WIMSD-5B to represent adequately the fuel evolution during the fuel recharge. Initially was verified the WIMSD-5B capability to simulate the recharge specificities of this model by analysis of neutronic parameters and isotopic composition during the burnup. After the model was simulated using both WIMSD-5B and MCNPX 2.6.0 codes and the results of k{sub eff}, neutronic flux and isotopic composition were compared. The results show that the deterministic WIMSD-5B code can be applied to a qualitative evaluation, representing adequately the core behavior during the fuel recharges being possible in a short period of time to inquire about the burned core that, once optimized, can be quantitatively evaluated by a code type MCNPX 2.6.0. (author)

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

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

  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. Actas de la Segunda conferencia internacional en ciencia de la computacion (proceedings of the 2nd international conference on computer science)

    Energy Technology Data Exchange (ETDEWEB)

    1982-01-01

    The following topics were dealt with: relational databases; memory unit environments; artificial intelligence systems; programming theory; functional programming; distributed systems; and abstract data types. 13 papers were presented, of which 13 are published in full in the present proceedings. Abstracts of individual papers can be found under the relevant classification codes in this or other issues.

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

  6. Modelo computacional para suporte à decisão em áreas irrigadas. Parte I: Desenvolvimento e análise de sensibilidade Computer model for decision support on irrigated areas Part I: Development and sensitivity analysis

    Directory of Open Access Journals (Sweden)

    João C. F. Borges Júnior

    2008-02-01

    Full Text Available Este trabalho se refere ao desenvolvimento de um modelo computacional para suporte à tomada de decisão, quanto ao planejamento e manejo de projetos de irrigação e/ou drenagem. O modelo computacional, denominado MCID, é aplicável em nível de unidade de produção, gerando informações sobre como diferentes práticas de manejo da irrigação e configurações do sistema de drenagem afetam a produtividade e o retorno financeiro. Essas informações podem ser empregadas em estudos de otimização de padrão de cultivo em nível de propriedade agrícola, em relação ao retorno financeiro e ao uso da água, associados à análise de risco com base em simulações. O balanço hídrico e de sais na zona radicular e as estimativas da profundidade do lençol freático e vazão nos drenos, são conduzidos em base diária. A análise de sensibilidade indicou que os parâmetros de entrada que mais influenciaram o requerimento de irrigação totalizado para o ciclo, foram espaçamento entre drenos, porosidade drenável, número da curva, condutividade hidráulica horizontal do solo saturado, profundidade da camada impermeável e os parâmetros n e alfa do modelo de van Genuchten-Mualem.This paper refers to the development of a decision support model for planning and managing irrigation and/or drainage schemes. The computer model, called MCID, is applicable to a production unit level, generating information on how different irrigation management practices and drainage designs affect crop yield and financial return. This information may be applied in studies of crop patterns at farm level, taking into consideration financial return and water use, associated to risk analysis based on simulations. The water and salt balance in the root zone, as well as the water table depth and drain discharge predictions, are carried out on a daily basis. The sensitivity analysis pointed out that the most influential parameters on the seasonal irrigation requirement

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

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

  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 compositi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  9. Propiedades macroestructurales de un Vertisuelo requeridas para la simulación computacional de la interacción suelo-apero de labranza mediante el Método de Elementos Finitos (MEF

    Directory of Open Access Journals (Sweden)

    Alain Ariel de la Rosa Andino

    2011-01-01

    Full Text Available En el presente trabajo se investigan las propiedades macroestructurales de un Vertisuelo de la costa norte villaclareña, requeridas para la simulación computacional de la interacción suelo-apero de labranza mediante el método de elementos finitos. Se recurre al ensayo de compresión triaxial, rápido, sin consolidar, no drenado, para determinar las propiedades objeto de estudio. Los resultados finales permiten conocer los valores y tendencias de la cohesión, ángulo de fricción interna, y módulo de Young para un rango de humedad y densidad del suelo que oscila entre 18 a 50% y 0,9 a 1,2 g/cm3, respectivamente. Tanto las tendencias como los valores encontrados están altamente condicionados por el contenido de humedad y densidad del suelo, concordando con los resultados obtenidos por otros autores en suelos de naturaleza semejante.

  10. Una implementación computacional de un modelo de atención visual Bottom-up aplicado a escenas naturales/A Computational Implementation of a Bottom-up Visual Attention Model Applied to Natural Scenes

    Directory of Open Access Journals (Sweden)

    Juan F. Ramírez Villegas

    2011-12-01

    Full Text Available El modelo de atención visual bottom-up propuesto por Itti et al., 2000 [1], ha sido un modelo popular en tanto exhibe cierta evidencia neurobiológica de la visión en primates. Este trabajo complementa el modelo computacional de este fenómeno desde la dinámica realista de una red neuronal. Asimismo, esta aproximación se basa en la existencia de mapas topográficos que representan la prominencia de los objetos del campo visual para la formación de una representación general (mapa de prominencia, esta representación es la entrada de una red neuronal dinámica con interacciones locales y globales de colaboración y competencia que convergen sobre las principales particularidades (objetos de la escena.The bottom-up visual attention model proposed by Itti et al. 2000 [1], has been a popular model since it exhibits certain neurobiological evidence of primates’ vision. This work complements the computational model of this phenomenon using a neural network with realistic dynamics. This approximation is based on several topographical maps representing the objects saliency that construct a general representation (saliency map, which is the input for a dynamic neural network, whose local and global collaborative and competitive interactions converge to the main particularities (objects presented by the visual scene as well.

  11. APMO: UN PROGRAMA COMPUTACIONAL PARA EL ESTUDIO DE EFECTOS CUÁNTICOS NUCLEARES MEDIANTE LA TEORÍA DEL ORBITAL MOLECULAR ELECTRÓNICO Y NO ELECTRÓNICO.

    Directory of Open Access Journals (Sweden)

    Sergio González

    2009-04-01

    Full Text Available Con el fin de estudiar teóricamente fenómenos en donde los núcleos atómicos presentan comportamiento cuántico, hemos desarrollado el paquete computacional APMO (Any-Particle Molecular Orbital. Este implementa el método de orbitales moleculares nucleares y electrónicos (OMNE a un nivel de teoría Hartree-Fock (HF, en el que tanto núcleos como electrones se representan como funciones de onda.Para comprobar la correcta implementación del método, se realizaron  cálculos de estructura electrónica regular y núcleo-electrónica de las moléculas H2 y LiH. Las componentes de energía calculadas siguen las  tendencias y están en el mismo orden de magnitud de cálculos similares reportados en la literatura.A diferencia de otros paquetes que implementan el método OMNE, el nuestro fué diseñado para estudiar sistemas con cualquier número de especies cuánticas. 

  12. SCD I1: uma Ferramenta Computacional Educacional para a Visualização, Modelagem e Inversão de Funções Matemáticas

    Directory of Open Access Journals (Sweden)

    Bruno Nunes Myrrha Ribeiro

    2015-07-01

    Full Text Available Este artigo apresenta o sistema computacional educacional SCDI 1 – Sistema de Cálculo Diferencial e Integral 1. Sua proposta pedagógica está direcionada a complementar o processo ensino-aprendizagem na disciplina de Cálculo I (Cálculo Diferencial e Integral, disciplina básica dos cursos de engenharia. Em sua primeira versão aborda tópicos elementares de funções matemáticas, possibilitando também, sua aplicação em conteúdos relativos às disciplinas de Matemática do ensino médio. Em sua primeira versão, seu objetivo principal é visualizar e modelar diversas funções em uma variável e suas inversas, em suas representações: algébrica, gráfica e numérica, permitindo a alteração dos coeficientes, área de visualização e bissetrizes. Como desenvolvimento e implementação futura, destacam-se assuntos relativos à combinação e composição, limites, continuidade, derivada e integral, de funções em uma variável.

  13. DispoGrafo: una nueva herramienta computacional para el análisis de relaciones semánticas en el lexico disponible DispoGrafo: A new computational tool for the analysis of semantic relations in lexical availability

    Directory of Open Access Journals (Sweden)

    MAX S ECHEVERRIA

    2008-01-01

    Full Text Available Se desarrolló un programa computacional destinado a apoyar el análisis psicolingüístico de los términos elicitados mediante encuestas de léxico disponible. Utilizando un algoritmo basado fundamentalmente en las relaciones de secuencia de las palabras disponibles, nuestro programa, DispoGrafo, ingresa los términos elicitados y genera luego automáticamente grafos cuyos nodos representan palabras y cuyas aristas simbolizan las relaciones entre ellas. Los grafos se interpretan como redes semánticas cuya configuración expresa las relaciones semánticas subyacentes en el corpus. El software permite, además, eliminar las conexiones débiles (de menor peso para así dejar sólo las relaciones más robustas y visualizar de este modo las relaciones más relevantes.A computer program was developed to support psycholinguistic analyses of words elicited in lexical availability tests. By means of an algorithm based on word sequence relations, our program, DispoGrafo, inputs elicited words to automatically generate graphs in which nodes represent words and lines the links between them. Graphs are then interpreted as semantic networks displaying the latent semantic ties underlying the data. The software also allows users to remove weak connections so that only those representing stronger relations remain to ensure a better representation of semantics.

  14. Identificação dos parâmetros de design de dutos de luz solar através do emprego da simulação computacional

    Directory of Open Access Journals (Sweden)

    Gandhi Escajadillo Toledo

    2013-08-01

    Full Text Available Os dutos de luz solar podem reduzir o consumo de energia gasta em iluminação, como também melhorar o conforto visual nos ambientes. Para a previsão do desempenho lumínico destes sistemas, recomenda-se a utilização de simulações computacionais, como o programa Troplux. O presente artigo tem como objetivo determinar os parâmetros de design para os dutos de luz solar através da simulação computacional. O método aplicado neste trabalho foi dividido em duas etapas. Na primeira etapa foi comparado o desempenho luminoso de três modelos virtuais de dutos de luz solar, com características ópticas iguais, mas com geometrias diferentes, visando identificar a geometria de duto mais eficiente. Na segunda etapa foi simulado o desempenho do duto de luz eleito, tendo como referência as especificações da CIE (Comissão Internacional de Iluminação para os tipos de céu e incidência solar. Os resultados das simulações foram então empregados para identificar os principais parâmetros de design para o os dutos de luz solar.

  15. Identificação dos parâmetros de design de dutos de luz solar através do emprego da simulação computacional

    Directory of Open Access Journals (Sweden)

    Gandhi Escajadillo Toledo

    2013-12-01

    Full Text Available Os dutos de luz solar podem reduzir o consumo de energia gasta em iluminação, como também melhorar o conforto visual nos ambientes. Para a previsão do desempenho lumínico destes sistemas, recomenda-se a utilização de simulações computacionais, como o programa Troplux. O presente artigo tem como objetivo determinar os parâmetros de design para os dutos de luz solar através da simulação computacional. O método aplicado neste trabalho foi dividido em duas etapas. Na primeira etapa foi comparado o desempenho luminoso de três modelos virtuais de dutos de luz solar, com características ópticas iguais, mas com geometrias diferentes, visando identificar a geometria de duto mais eficiente. Na segunda etapa foi simulado o desempenho do duto de luz eleito, tendo como referência as especificações da CIE (Comissão Internacional de Iluminação para os tipos de céu e incidência solar. Os resultados das simulações foram então empregados para identificar os principais parâmetros de design para o os dutos de luz solar.

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

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

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

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

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

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

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

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

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

  5. Modelling and simulation the radioactive source-term of fission products in PWR type reactors; Modelagem e simulacao do termo-fonte radioativo de produtos de fissao em reatores nucleares do tipo PWR

    Energy Technology Data Exchange (ETDEWEB)

    Porfirio, Rogilson Nazare da Silva

    1996-07-01

    The source-term was defined with the purpose the quantify all radioactive nuclides released the nuclear reactor in the case of accidents. Nowadays the source-term is limited to the coolant of the primary circuit of reactors and may be measured or modelled with computer coders such as the TFP developed in this work. The calculational process is based on the linear chain techniques used in the CINDER-2 code. The TFP code considers forms of fission products release from the fuel pellet: Recoil, Knockout and Migration. The release from the gap to the coolant fluid is determined from the ratio between activity measured in the coolant and calculated activity in the gap. Considered the operational data of SURRY-1 reactor, the TFP code was run to obtain the source=term of this reactor. From the measured activities it was verified the reliability level of the model and the employed computational logic. The accuracy of the calculated quantities were compared to the measured data was considered satisfactory. (author)

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

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

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

  9. Computational study of incidence of secondary neoplasms in cancer therapy of uterine cervix; Estudo computacional da incidencia de tumores secundarios em tratamentos de cancer de colo uterino

    Energy Technology Data Exchange (ETDEWEB)

    Santos, W.S.; Valeriano, C.C.S.; Caldas, L.V.E. [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil); Neves, L.P.; Perini, A.P., E-mail: lucio.neves@ufu.br [Universidade Federal de Uberlandia (UFU), MG (Brazil). Instituto de Fisica; Belinato, W. [Instituto Federal de Educacao, Ciencia e Tecnologia da Bahia (IFBA), Vitoria da Conquista, BA (Brazil); Silva, R.M.V. [Instituto do Cancer do Ceara, Fortaleza, CE (Brazil)

    2016-07-01

    There is a serious, and growing, concern about the increased risk of the emergence of a second cancer, induced by radiation associated with the radiation treatment. To assess the radiation doses to organs outside the target volume, in this work, we modeled several computational exposure scenarios, based on Monte Carlo simulation (MCNPX code). We used a VARIAN 2100c accelerator, and a female virtual anthropomorphic phantom to simulate a treatment of uterine cancer. The results presented show that the computational exposure scenario provides a versatile and accurate tool to assess the risk of secondary cancer. (author)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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. Quantification of ventilated facade efficiency by using computational fluid mechanics techniques; Cuantificacion de la eficiencia de la fachada ceramica ventilada mediante tecnicas de la mecanica de fluidos computacional

    Energy Technology Data Exchange (ETDEWEB)

    Mora Perez, M.; Lopez Patino, G.; Bengochea Escribano, M. A.; Lopez Jimenez, P. A.

    2011-07-01

    In some countries, summer over-heating is a big problem in a buildings energy balance. Ventilated facades are a useful tool when applied to building design, especially in bio climatic building design. A ventilated facade is a complex, multi-layer structural solution that enables dry installation of the covering elements. The objective of this paper is to quantify the efficiency improvement in the building thermal when this sort of facade is installed. These improvements are due to convection produced in the air gap of the facade. This convection depends on the air movement inside the gap and the heat transmission in this motion. These quantities are mathematically modelled by Computational Fluid Dynamics (CFD) techniques using a commercial code: STAR CCM+. The proposed method allows an assessment of the energy potential of the ventilated facade and its capacity for cooling. (Author) 23 refs.

  8. ALGORITHMIC LOGIC TO SOLVE COMPUTATIONAL PROGRAMMING PROBLEMS: A DIDACTIC PROPOSAL / LÓGICA ALGORÍTMICA PARA LA RESOLUCIÓN DE PROBLEMAS DE PROGRAMACIÓN COMPUTACIONAL: UNA PROPUESTA DIDÁCTICA

    Directory of Open Access Journals (Sweden)

    Yaritza Tardo Fernández

    2013-02-01

    Full Text Available The cultural, technological and eminently social character of the computer programming problems solving process, joined with the complexity and difficulties detected in their teaching, has contributed to increase the concern about the study of the processes of communication, transmission and understanding of computer programming and to attract the attention of a wide scientific community in correspondence with the growing development that this reaches at the present time. That is the reason why this paper has the objective of discover, from the didactic point of view, the integrators axes of an algorithmic logic that solves the contradiction that is revealed in the formative process between the mathematic modeling and their algorithmic systematization to empower an efficient performance of the professionals of Computer Science and Computer Engineering. In this sense a new didactic proposal is based, that consist in an algorithmic logic, in which are specified and explained those essentials processes that should be carry out to solve computer programming problems. Based on the theoretical fundaments, we concluded that these processes constitute didactics moments, required in order to solve the contradiction mentioned before.RESUMENEl carácter eminentemente social, cultural y tecnológico del proceso de resolución de problemas de programación computacional, junto a la complejidad y dificultades detectadas en su enseñanza, han contribuido a despertar la preocupación por el estudio de los procesos de comunicación, transmisión y comprensión de la Programación y a interesar a una amplia comunidad científica en correspondencia con el creciente desarrollo que ésta alcanza en la actualidad. Razón por la cual este trabajo tiene como objetivo que se develen, desde el punto de vista didáctico, los ejes integradores de una lógica algorítmica que sea contentiva de la solución a la contradicción que se revela en el proceso formativo entre la

  9. Podemos prever a taxa de cambio brasileira? Evidência empírica utilizando inteligência computacional e modelos econométricos Can we forecast Brazilian exchange rates? Empirical evidences using computational intelligence and econometric models

    Directory of Open Access Journals (Sweden)

    Leandro dos Santos Coelho

    2008-12-01

    Full Text Available As abordagens de inteligência computacional, tais como sistemas nebulosos e redes neurais artificiais, têm-se gradualmente estabelecido como ferramentas robustas para a tarefa de aproximação de sistemas não-lineares complexos e previsão de séries temporais. Em aplicações envolvendo a área de Finanças, evidências empíricas anteriores indicam que modelos de inteligência computacional são mais precisos, dada sua maior capacidade em capturar não-linearidades e outros fatos estilizados presentes em séries financeiras. Nesse sentido, este artigo investiga a hipótese de que os modelos matemáticos de redes neurais perceptron multicamadas, redes neurais função de base radial e o sistema nebuloso Takagi-Sugeno (TAKAGI; SUGENO, 1985 são capazes de fornecer uma previsão fora-da-amostra mais acurada que os modelos auto-regressivos de médias móveis (ARMA e auto-regressivo de médias móveis supondo heterocedasticidade condicional auto-regressiva (ARMA-GARCH. O desempenho de previsão um-passo-à-frente dos modelos foi comparado utilizando-se séries de retorno da taxa de câmbio real/dólar (R$/US$ com freqüências de 15 minutos, 60 minutos, 120 minutos, diária e semanal. Resultados indicam que o desempenho dos modelos está diretamente relacionado à freqüência observada das séries. Além disso, os modelos de redes neurais obtiveram um desempenho superior em relação aos demais modelos considerados. A avaliação da estratégia de negociação estabelecida com base nas previsões geradas pelos modelos indicou que estratégias baseadas em modelos de redes neurais forneceram retornos superiores em relação àquelas baseadas em modelos ARMA e ARMA-GARCH e também em relação à estratégia buy-and-hold.Computational intelligence approaches, such as artificial neural networks and fuzzy systems, have become popular tools in approximating complicated nonlinear systems and time series forecasting. In Finance applications, there is

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

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

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

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

  14. Avaliação computacional da compactação da cromatina e de características morfométricas da cabeça de espermatozoides de coelho (Oryctolagus cuniculus

    Directory of Open Access Journals (Sweden)

    C.Y Kanayama

    2011-02-01

    Full Text Available Investigou-se a correlação entre a morfometria da cabeça e a intensidade da condensação e heterogeneidade da cromatina em espermatozoides de coelho (Oryctolagus cuniculus. Para tal, utilizaram-se 35 esfregaços de sêmen de coelhos da raça Nova Zelândia, corados com azul de toluidina e avaliados por análise de imagem computacional. As imagens foram obtidas digitalmente em tons de cinza e avaliadas por algoritmos desenvolvidos em ambiente de programação Scilab. As mensurações obtidas da cabeça dos espermatozoides foram área, perímetro, comprimento, largura, relação comprimento largura, elipsidade, fator de forma, descritores Fourier e simetria lateral e anteroposterior. Também foram avaliadas a intensidade da compactação e a heterogeneidade da cromatina espermática. Os espermatozoides de coelho apresentaram compactação e heterogeneidade cromatínica mais intensas do que os de touro e observou-se correlação significativa entre características morfométricas da cabeça e compactação e heterogeneidade cromatínica. Conclui-se que a cromatina é importante para a constituição morfológica da cabeça de espermatozoides de coelho e que a cromatina espermática de coelho é naturalmente mais heterogênea e menos compactada que a de touro

  15. Sobre a construção de um recurso léxico de elementos nominais agentivos e de ação para o processamento computacional do Português Brasileiro

    Directory of Open Access Journals (Sweden)

    Andrea Feitosa Santos

    2015-07-01

    Full Text Available O principal objetivo deste trabalho é descrever o processo de elaboração de um léxico computacional de elementos nominais agentivos e de ação do Português Brasileiro, construído principalmente para contribuir com a expansão dos recursos léxicos existentes para esta língua. Busca-se, além disso, mostrar como a descrição das línguas encontra espaço dentro do Processamento de Linguagem Natural fazendo uso das Tecnologias de Estados Finitos. O léxico abrange os seguintes aspectos da derivação dos chamados falsos aumentativos: (i formação sufixal com –ão de nomes agentivos; (ii formação sufixal com –ão de adjetivos agentivos; (iii formação sufixal com –ão de nomes de ação. Para derivar os diferentes sentidos presentes nestes três contextos, constatados no português padrão, argumentamos a favor de uma derivação para o sufixo –ão em que este associa-se a uma base verbal. Assim, o léxico foi criado com um duplo objetivo: fornecer subsídios linguísticos para uma aplicação do Processamento de Linguagem Natural e contribuir com a caracterização de elementos nominais agentivos e de ação da língua portuguesa.

  16. DETERMINACIÓN DEL TIEMPO DE MEZCLA EN UN TANQUE DE ALMACENAMIENTO PARA AGUA POTABLE MEDIANTE DINÁMICA DE FLUIDOS COMPUTACIONAL -CFD- Determining the Blend Time in a Drinking Water Storage Tank through Computational Fluid Dynamic (CFD

    Directory of Open Access Journals (Sweden)

    Santiago Laín

    2011-12-01

    Full Text Available Para estimar el comportamiento hidráulico de un tanque de almacenamiento de agua potable se usó un programa para la simulación de dinámica computacional de fluidos, evaluando numéricamente los perfiles de velocidad y el tiempo de mezcla. Los perfiles de velocidad mostraron un valor máximo a la salida de 0,76 m.s-1 y velocidades de 0,2 m.s-1 cerca de las paredes, propiciando zonas de recirculación cerca del chorro de entrada. La inyección del trazador y el coeficiente de variación para 17 puntos de monitoreo en el tanque resultaron en un tiempo de mezcla de 19,06 horas y se verificó que cerca de las paredes la mezcla es menos eficiente que en la trayectoria del chorro de entrada. El volumen necesario que debe entrar al tanque para que haya buena mezcla resultó inversamente proporcional a la masa de agua almacenada.In order to estimate the hydraulic behavior of a drinking water storage tank, Computational Fluid Dynamic (CFD simulation program was used to numerically evaluate blend speed and time profiles. Speed profiles showed a maximum value when leaving at 0.76 m.s-1 and 0.2 m.s-1 speeds near walls, creating recirculation areas near the inlet stream. Injection of tracer and the variation coefficient for 17 monitoring points in the tank resulted in a blend time of 19.06 hours and it was found that the blend near walls is less efficient than in the inlet stream trajectory. Necessary volume to enter the tank in order to achieve a good blend was inversely proportional to the water mass stored.

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

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

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

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

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

  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. Computational model for transient studies of IRIS pressurizer behavior; Modelo computacional para el estudio de transitorios en el compensador de presion IRIS

    Energy Technology Data Exchange (ETDEWEB)

    Rives Sanz, R.; Montesino Otero, M.E.; Gonzalez Mantecon, J.; Rojas Mazaira, L., E-mail: mmontesi@instec.cu [Higher Institute of Technology and Applied Science, La Habana (Cuba). Department of Nuclear Engineering; Lira, C.A. Brayner de Oliveira [Universidade Federal de Pernambuco (UFPE), Recife, PE (Brazil)

    2014-07-01

    International Reactor Innovative and Secure (IRIS) excels other Small Modular Reactor (SMR) designs due to its innovative characteristics regarding safety. IRIS integral pressurizer makes the design of larger pressurizer system than the conventional PWR, without any additional cost. The IRIS pressurizer volume of steam can provide enough margins to avoid spray requirement to mitigate in-surge transient. The aim of the present research is to model the IRIS pressurizer's dynamic using the commercial finite volume Computational Fluid Dynamic code CFX 14. A symmetric tridimensional model equivalent to 1/8 of the total geometry was adopted to reduce mesh size and minimize processing time. The model considers the coexistence of three phases: liquid, steam, and vapor bubbles in liquid volume. Additionally, it takes into account the heat losses between the pressurizer and primary circuit. The relationships for interfacial mass, energy, and momentum transport are programmed and incorporated into CFX by using expressions in CFX Command Language (CCL) format. Moreover, several additional variables are defined for improving the convergence and allow monitoring of boron dilution sequences and condensation-evaporation rate in different control volumes. For transient states a non - equilibrium stratification in the pressurizer is considered. This paper discusses the model developed and the behavior of the system for representative transients sequences such as the in/out-surge transients and boron dilution sequences. The results of analyzed transients of IRIS can be applied to the design of pressurizer internal structures and components. (author)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  3. A stochastic model for neutron simulation considering the spectrum and nuclear properties with continuous dependence of energy; Um modelo estocastico de simulacao neutronica considerando o espectro e propriedades nucleares com dependencia continua de energia

    Energy Technology Data Exchange (ETDEWEB)

    Camargo, Dayana Queiroz de

    2011-01-15

    This thesis has developed a stochastic model to simulate the neutrons transport in a heterogeneous environment, considering continuous neutron spectra and the nuclear properties with its continuous dependence on energy. This model was implemented using Monte Carlo method for the propagation of neutrons in different environment. Due to restrictions with respect to the number of neutrons that can be simulated in reasonable computational processing time introduced the variable control volume along the (pseudo-) periodic boundary conditions in order to overcome this problem. The choice of class physical Monte Carlo is due to the fact that it can decompose into simpler constituents the problem of solve a transport equation. The components may be treated separately, these are the propagation and interaction while respecting the laws of energy conservation and momentum, and the relationships that determine the probability of their interaction. We are aware of the fact that the problem approached in this thesis is far from being comparable to building a nuclear reactor, but this discussion the main target was to develop the Monte Carlo model, implement the code in a computer language that allows extensions of modular way. This study allowed a detailed analysis of the influence of energy on the neutron population and its impact on the life cycle of neutrons. From the results, even for a simple geometrical arrangement, we can conclude the need to consider the energy dependence, i.e. an spectral effective multiplication factor should be introduced each energy group separately. (author)

  4. Simulation and evaluation of mammography quality from an X-ray equipment of a instrument calibration laboratory; Simulacao e avaliacao das qualidades da mamografia do equipamento de raios-x de um laboratorio de calibracao de instrumentos

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Natalia F. da; Castro, Maysa C. de; Caldas, Linda V.E., E-mail: na.fiorini@gmail.com, E-mail: maysadecastro@gmail.com, E-mail: lcaldas@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

    2014-07-01

    The Instrument Calibration Laboratory (ICL) of the Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP, Brazil has developed some work in order to establish a primary standard system for low energy X-ray employing a ionization chamber of free air. For this, one of the most important steps is the determination of factors of correction of its answer. Simulation is a frequently used tool for this because some correction factors can not be determined experimentally. For the correct simulation of these correction factors is necessary some input parameters such as geometry, the material composition of the dosimeter, the experimental arrangement and the radiation source are specified correctly. For the ionization chamber available on the LCI, the geometry, the material components and the experimental arrangement can be obtained easily. On the other hand, spectrum of radiation energy source, which must be inserted into the computer code has not been obtained. Thus, this study aims to determine this radiation spectrum, thus enabling the characterization of the new primary standard for low power X-radiation of ICL.

  5. Calibration method for a in vivo measurement system using mathematical simulation of the radiation source and the detector; Metodo de calibracao de um sistema de medida in vivo atraves da simulacao matematica da fonte de radiacao e do detector

    Energy Technology Data Exchange (ETDEWEB)

    Hunt, John

    1998-12-31

    A Monte Carlo program which uses a voxel phantom has been developed to simulate in vivo measurement systems for calibration purposes. The calibration method presented here employs a mathematical phantom, produced in the form of volume elements (voxels), obtained through Magnetic Resonance Images of the human body. The calibration method uses the Monte Carlo technique to simulate the tissue contamination, the transport of the photons through the tissues and the detection of the radiation. The program simulates the transport and detection of photons between 0.035 and 2 MeV and uses, for the body representation, a voxel phantom with a format of 871 slices each of 277 x 148 picture elements. The Monte Carlo code was applied to the calibration of in vivo systems and to estimate differences in counting efficiencies between homogeneous and non-homogeneous radionuclide distributions in the lung. Calculations show a factor of 20 between deposition of {sup 241} Am at the back compared with the front of the lung. The program was also used to estimate the {sup 137} Cs body burden of an internally contaminated individual, counted with an 8 x 4 Nal (TI) detector and an {sup 241} Am body burden of an internally contaminated individual, who was counted using a planar germanium detector. (author) 24 refs., 38 figs., 23 tabs.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  15. An estimation of the percentage of dose in intraoral radiology exams using Monte Carlo simulation; Avaliacao do percentual de dose em exames de radiologia intra-oral usando simulacao Monte Carlo

    Energy Technology Data Exchange (ETDEWEB)

    Bonzoumet, S.P.J.; Braz, D.; Lopes, R.T. [Coordenacao dos Programas de Pos-Graduacao de Engenharia (LIN/COPPE/UFRJ), RJ (Brazil). Programa de Engenharia Nuclear. Lab. de Instrumentacao Nuclear; Anjos, M.J. [Coordenacao dos Programas de Pos-Graduacao de Engenharia (LIN/COPPE/UFRJ), RJ (Brazil). Programa de Engenharia Nuclear. Lab. de Instrumentacao Nuclear; Universidade do Estado do Rio de Janeiro (UERJ), RJ (Brazil). Inst. de Fisica; Padilha, Lucas, E-mail: sielso@lin.ufrj.br [Universidade Federal do Rio de Janeiro (HUCFF/UFRJ), RJ (Brazil). Hospital Universitario Clementino Fraga Filho

    2005-07-01

    In this work we used the EGS4 code in a simulated study of dose percentage in intraoral examination to 10 energy range to 140 keV. The simulation was carried out on a model consisting of different geometry (cheek, tooth and mouth cavity) under normal incidence X-ray beam over the surface of the various simulated materials. It was observed that for energy smaller than 30 keV most of the energy is deposited on the cheek. In 30 keV there is a point of maximum radiation absorption in the tooth (approximately 60% of the energy of the incident radiation is deposited on the tooth) in relation to other simulated materials. It means that in this energy there is a better contrast in the radiographic image of the tooth and a smaller dose on the cheek. In 40 keV the deposited energy in the tooth is roughly equal to the energy that is transmitted (to the radiographic film or buccal cavity) causing a degradation in the radiographic image and/or a higher dose in the oral cavity. For energies above 40 keV, the amount of energy transmitted (to the oral cavity and/or radiographic film) is higher than the energy deposited in other materials, i.e, it only contributes to increasing of dose in the regions close to the oral cavity and the radiographic image degradation. These results can provide important information for radiological procedures applied in dentistry where the image quality is a relevant factor to a dental evaluation needs as well as reducing dose in the oral cavity.

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

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

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

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

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

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

  2. Sistematização do dimensionamento técnico e econômico de sistemas fotovoltaicos isolados por meio de programa computacional Systematization of the technical and economic sizing of isolated photovoltaic systems through specific software

    Directory of Open Access Journals (Sweden)

    José A. Marini

    2005-04-01

    Full Text Available Uma das principais questões referentes à energia solar é como compará-la, técnica e economicamente, com outras fontes de energia, tanto alternativas quanto com as convencionais (como a rede elétrica. O propósito deste trabalho foi desenvolver um programa computacional que reúne os principais dados técnicos e econômicos, para identificar, por meio de métodos de análise microeconômica, a viabilidade comercial no dimensionamento de sistemas fotovoltaicos, além de considerar os benefícios provenientes da própria geração energética. Na análise microeconômica da energia solar, foram identificados os custos da energia proveniente da rede convencional durante o período de vida útil dos componentes do sistema gerador de eletricidade fotovoltaica, pelo estudo dos custos de investimentos iniciais e manutenção do sistema. Para comparação com as fontes convencionais - rede elétrica e grupo diesel - foram usados três cenários de custos de painéis fotovoltaicos e dois para o fator de disponibilidade do grupo diesel. Pelos resultados, verifica-se que, quanto mais baixo o custo dos painéis e mais distante o local situar-se da rede elétrica, o sistema fotovoltaico torna-se a opção mais vantajosa.One of the main referring subjects to the solar energy is how to compare it economically with other sources of energy, as much alternatives as with conventionals (like the electric grid. The purpose of this work was to develop a software which congregates the technical and economic main data to identify, through methods of microeconomic analysis, the commercial viability in the sizing of photovoltaic systems, besides considering the benefits proceeding from the proper energy generation. Considering the period of useful life of the components of the generation system of photovoltaic electricity, the costs of the energy proceeding from the conventional grid had been identified. For the comparison of the conventional sources, electric grid

  3. Rotina computacional e equação simplificada para modelar o transporte de sedimentos num Latossolo Vermelho Distrófico Computational routine and simplified equation for modeling sediment transport capacity in a Dystrophic Hapludox

    Directory of Open Access Journals (Sweden)

    Gilmar E. Cerquetani

    2006-08-01

    Full Text Available Os objetivos do presente trabalho foram desenvolver rotina computacional para a solução da equação de Yalin e do diagrama de Shields e avaliar uma equação simplificada para modelar a capacidade de transporte de sedimento num Latossolo Vermelho Distrófico que possa ser utilizada no Water Erosion Prediction Project - WEPP, assim como em outros modelos de predição da erosão do solo. A capacidade de transporte de sedimento para o fluxo superficial foi representada como função-potência da tensão cisalhante, a qual revelou ser aproximação da equação de Yalin. Essa equação simplificada pôde ser aplicada em resultados experimentais oriundos de topografia complexa. A equação simplificada demonstrou acuracidade em relação à equação de Yalin, quando calibrada utilizando-se da tensão média cisalhante. Testes de validação com dados independentes demonstraram que a equação simplificada foi eficiente para estimar a capacidade de transporte de sedimento.The objectives of the present work were to develop a computational routine to solve Yalin equation and Shield diagram and to evaluate a simplified equation for modeling sediment transport capacity in a Dystrophic Hapludox that could be used in the Water Erosion Prediction Project - WEPP, as well as other soil erosion models. Sediment transport capacity for shallow overland flow was represented as a power function of the hydraulic shear stress and which showed to be an approximation to the Yalin equation for sediment transport capacity. The simplified equation for sediment transport could be applied to experimental data from a complex topography. The simplified equation accurately approximated the Yalin equation when calibrated using the mean hydraulic shear stress. Validation tests using independent data showed that the simplified equation had a good performance in predicting sediment transport capacity.

  4. Improvement in hippocampal kindling analysis through computational processing data Aprimorando a análise do modelo de kindling hipocampal com o auxílio de processamento computacional

    Directory of Open Access Journals (Sweden)

    Joacir Graciolli Cordeiro

    2009-09-01

    Full Text Available The kindling phenomenon is classically investigated in epileptology research. The present study aims to provide further information about hippocampal kindling through computational processing data. Adult Wistar rats were implanted with dorsal hippocampal and frontal neocortical electrodes to perform the experiment. The processing data was obtained using the Spike2 and Matlab softwares. An inverse relationship between the number of "wet dog shakes" and the Racine's motor stages development was found. Moreover it was observed a significant increase in the afterdischarge (AD duration and its frequency content. The highest frequencies were, however, only reached at the beginning of behavioral seizures. During the primary AD, fast transients (ripples were registered in both hippocampi superimposed to slower waves. This experiment highlights the usefulness of computational processing applied to animal models of temporal lobe epilepsy and supports a relevant role of the high frequency discharges in temporal epileptogenesis.O fenômeno de kindling é classicamente utilizado no campo da epileptologia experimental. Este trabalho objetiva aprofundar a análise do modelo kindling hipocampal através de processamento computacional. Ratos wistar adultos receberam eletrodos hipocampais dorsais e neocorticais frontais para a realização do experimento. O processamento dos dados encontrados foi realizado pelos softwares Matlab e Spike2. Encontrou-se uma relação inversa entre wet dog shakes e o desenvolvimento dos estágios motores de Racine. A duração e o conteúdo de freqüência das pós-descargas hipocampais aumentaram durante o processo, sendo observadas descargas de alta freqüência (ripples em ambos os hipocampos durante as pós-descargas primárias, superimpostas a ondas lentas. As mais altas freqüências, entretanto, foram apenas atingidas com o início das crises epilépticas. A utilização de sistemas computacionais para a confecção e an

  5. Modelo computacional para suporte à decisão em áreas irrigadas. Parte II: testes e aplicação Computer model for decision support in irrigated areas. Part II: tests and application

    Directory of Open Access Journals (Sweden)

    Paulo A. Ferreira

    2006-12-01

    Full Text Available Apresentou-se, na Parte I desta pesquisa, o desenvolvimento de um modelo computacional denominado MCID, para suporte à tomada de decisão quanto ao planejamento e manejo de projetos de irrigação e/ou drenagem. Objetivou-se, na Parte II, testar e aplicar o MCID. No teste comparativo com o programa DRAINMOD, espaçamentos entre drenos, obtidos com o MCID, foram ligeiramente maiores ou idênticos. Os espaçamentos advindos com o MCID e o DRAINMOD foram consideravelmente maiores que os obtidos por meio de metodologias tradicionais de dimensionamento de sistemas de drenagem. A produtividade relativa total, YRT, obtida com o MCID foi, em geral, inferior à conseguida com o DRAINMOD, devido a diferenças de metodologia ao se estimar a produtividade da cultura em resposta ao déficit hídrico. Na comparação com o programa CROPWAT, obtiveram-se resultados muito próximos para (YRT e evapotranspiração real. O modelo desenvolvido foi aplicado para as condições do Projeto Jaíba, MG, para culturas perenes e anuais cultivadas em diferentes épocas. Os resultados dos testes e aplicações indicaram a potencialidade do MCID como ferramenta de apoio à decisão em projetos de irrigação e/ou drenagem.Part I of this research presented the development of a decision support model, called MCID, for planning and managing irrigation and/or drainage projects. Part II is aimed at testing and applying MCID. In a comparative test with the DRAINMOD model, drain spacings obtained with MCID were slightly larger or identical. The spacings obtained with MCID and DRAINMOD were considerably larger than those obtained through traditional methodologies of design of drainage systems. The relative crop yield (YRT obtained with MCID was, in general, lower than the one obtained with DRAINMOD due to differences in the estimate of crop response to water deficit. In comparison with CROPWAT, very close results for YRT and for actual evapotranspiration were obtained. The

  6. Modelado computacional usando regresión lineal y simbólica a B para determinar ópticamente el tamaño del poro de la piel

    Directory of Open Access Journals (Sweden)

    N. P. Puente Ramírez

    2015-01-01

    Full Text Available La apariencia de los poros de la piel normalmente es causada por glándulas sebáceas hiperactivas, sin embargo, en los últimos años se ha reportado que además se ve afectada por diversas enfermedades, entre ellas la diabetes [1], obesidad [2] o cáncer [3]. Generalmente los principales factores que contribuyen a la dilatación de los poros son la edad, género, acné, la exposición crónica al sol o la predispocisión genética. El desarrollo de un método no invasivo que permita conocer las condiciones de la piel, ayudara a relacionar los factores que determinan el tamaño del poro de la piel. En este trabajo se pretende caracterizar por medio de un modelo computacional y con ayuda de un esquema óptico, el tamaño del poro de la piel. El principio físico consiste en iluminar con leds (543nm el antebrazo de voluntarios, el esparcimiento de luz generado por la piel es colectada en una camara ccd. La captura de imágenes, el procesamiento y el análisis estadístico son parte de la metodología para la obtención de datos. Se propone un modelo matemático que relaciona género, edad, tono de piel y tamaño del poro (calculado estadísticamente en las imágenes colectadas ópticamente. Una base de datos se genera y se utiliza para construir matemáticamente modelos mediante regresión simbólica con optimizacion por enjambre de particulas (PSO y se realiza una comparación por medio de regresión lineal. Algunos indicadores estadísticos como el cuadrado medio de error, error de predicción suma de los cuadrados y porcentaje de variabilidad se utilizan en la comparación. Los resultados indican que el modelo propuesto con el tamaño de los poros de cada individuo puede ayudar a hacer una interpretación objetiva de indicadores de enfermedad que afecten directamente el tamaño del poro en la piel.

  7. Representações digitais e interação incorporada: um estudo etnográfico de práticas científicas de modelagem computacional

    Directory of Open Access Journals (Sweden)

    Marko Monteiro

    2009-10-01

    Full Text Available O objetivo deste trabalho é discutir como objetos virtuais participam interativamente da produção do conhecimento na prática científica. O artigo baseia-se numa observação etnográfica de uma equipe interdisciplinar de cientistas, cujo trabalho envolve modelagem computacional de transferência de calor na próstata humana. A etnografia constatou que, embora visualizações científicas sejam pensadas como uma forma de "simplificar" a apreensão de dados, há um intenso trabalho interpretativo necessário para alcançar sentidos compartilhados a respeito das imagens. Tais sentidos são construídos a partir de comunicação oral e de interações incorporadas com objetos virtuais no decorrer das interações entre os cientistas. Uma melhor compreensão dessas práticas interpretativas é importante na medida em que o uso de visualizações digitais em 3D e de modelos computacionais ganha importância na ciência contemporânea. Tais técnicas são crescentemente utilizadas não somente para descrever verdades sobre a natureza, mas como ferramentas poderosas de intervenção no mundo.This text discusses how virtual objects participate interactively in the production of knowledge in scientific practice. The article is based on the ethnographic observation of an interdisciplinary team of scientists whose work involves computer modelling of heat transfer in the human prostate. The ethnography found that although scientific imaging may be considered a form of 'simplifying' the apprehension of data, an intense interpretative process is required to achieve shared meanings concerning the images. These meanings are constructed through oral communication and embodied interactions with virtual objects during the interactions between scientists. A better understanding of these interpretative practices is needed given the growing importance of the use of 3D digital imaging and computational models in contemporary science. These techniques are

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

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

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

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

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

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

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

  8. Realización computacional en tres dimensiones del Método de los Elementos de Contorno en la teoría de la Elasticidad // Three dimension computational realization of the Method of the Contour elements in the Elasticity theory.

    Directory of Open Access Journals (Sweden)

    I. L. Alemán Romero

    2000-03-01

    Full Text Available En este trabajo se muestra la realización computacional en tres dimensiones del Método de los Elementos de Contorno en laTeoría de la Elasticidad Lineal, para medio homogéneo e isotrópico considerando el efecto de las cargas másicas.La realización computacional del método radica en discretizar el contorno mediante elementos en los que losdesplazamientos y las tracciones se suponen variando de acuerdo a funciones de interpolación. Aplicando el “método decolocación” se obtiene un sistema de ecuaciones lineales que aporta la solución en el contorno, a partir de la cual se puedeobtener la solución en cualquier punto de la región de definición del problema.En el presente trabajo se consideran elementos triangulares, se emplea interpolación lineal, se utiliza la transformación acoordenadas homogéneas y se muestran los algoritmos que conducen al ensamblaje del sistema de ecuaciones que aporta lasolución en el contorno.Palabras claves: Elementos de Contorno(MEC, BEM, realización computacional, elementos triangulares.______________________________________________________________________________AbstractIn this work is shown the computational formulation in three dimensions of the Boundary Element Method in 3D Elastostaticfor isotropic, homogeneous and linear material considering the effect of body forces.The computational formulation of the method is based on the discretization of the boundary into elements over whichdisplacements and tractions are expressed in terms of interpolation functions. Applying the collocation method a system oflineal equations is obtained that brings the solution on the boundary, from which the solution in any point of the definitionregion of the problem can be obtained.In the present work triangular elements are considered, lineal interpolation is employed, the transformation to homogenealcoordinates is used and it is shown the algorithms that guide to the assembling of the equations system that

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

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

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

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

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

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

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

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

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

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

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

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