Literatura académica sobre el tema "Combination sequences"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Combination sequences".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Combination sequences"
Tachikawa, Shin-Ichi y Gen Marubayashi. "Majority logic combination sequences using m-sequences for rapid acquisition in direct sequence/spread spectrum communication systems". Electronics and Communications in Japan (Part I: Communications) 74, n.º 7 (julio de 1991): 42–56. http://dx.doi.org/10.1002/ecja.4410740705.
Texto completoStadje, Wolfgang. "On two combination rules for {$0$}-{$1$}-sequences". Bulletin of the Belgian Mathematical Society - Simon Stevin 3, n.º 3 (1996): 295–99. http://dx.doi.org/10.36045/bbms/1105554387.
Texto completoVenkataraman, Ganesh, Zachary Shriver, Rahul Raman y Ram Sasisekharan. "Sequencing Complex Polysaccharides". Science 286, n.º 5439 (15 de octubre de 1999): 537–42. http://dx.doi.org/10.1126/science.286.5439.537.
Texto completoKassaei, Gholamreza y Mohammad Amouzadeh. "The combination of Discourse Markers in Persian". International Review of Pragmatics 12, n.º 1 (13 de febrero de 2020): 135–63. http://dx.doi.org/10.1163/18773109-01201102.
Texto completoHill, Janet E., Robyn P. Seipp, Martin Betts, Lindsay Hawkins, Andrew G. Van Kessel, William L. Crosby y Sean M. Hemmingsen. "Extensive Profiling of a Complex Microbial Community by High-Throughput Sequencing". Applied and Environmental Microbiology 68, n.º 6 (junio de 2002): 3055–66. http://dx.doi.org/10.1128/aem.68.6.3055-3066.2002.
Texto completoCarbonera Luvizon, Diogo, Hedi Tabia y David Picard. "Learning features combination for human action recognition from skeleton sequences". Pattern Recognition Letters 99 (noviembre de 2017): 13–20. http://dx.doi.org/10.1016/j.patrec.2017.02.001.
Texto completoNILSSON, MARKUS. "RETRIEVING HEART RATE SEQUENCES". International Journal on Artificial Intelligence Tools 15, n.º 06 (diciembre de 2006): 1091–106. http://dx.doi.org/10.1142/s0218213006003132.
Texto completoWang, Lei, Deborah Rothemund, Heather Curd y Peter R. Reeves. "Sequence Diversity of the Escherichia coli H7 fliC Genes: Implication for a DNA-Based Typing Scheme for E. coli O157:H7". Journal of Clinical Microbiology 38, n.º 5 (2000): 1786–90. http://dx.doi.org/10.1128/jcm.38.5.1786-1790.2000.
Texto completoSancetta, Alessio. "RECURSIVE FORECAST COMBINATION FOR DEPENDENT HETEROGENEOUS DATA". Econometric Theory 26, n.º 2 (30 de septiembre de 2009): 598–631. http://dx.doi.org/10.1017/s0266466609100105.
Texto completoQiu, Chengshu, Wenjuan Yan, Wangqiu Deng, Bin Song y Taihui Li. "Genetic Diversity Analysis ofHypsizygus marmoreuswith Target Region Amplification Polymorphism". Scientific World Journal 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/619746.
Texto completoTesis sobre el tema "Combination sequences"
Cresp, Gregory. "On combination and interference free window spreading sequences". University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0152.
Texto completoBrejova, Bronislava. "Evidence Combination in Hidden Markov Models for Gene Prediction". Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1036.
Texto completoWe propose a flexible framework to incorporate several different sources of such evidence into a gene finder based on a hidden Markov model. Various sources of evidence are expressed as partial probabilistic statements about the annotation of positions in the sequence, and these are combined with the hidden Markov model to obtain the final gene prediction. The opportunity to use partial statements allows us to handle missing information transparently and to cope with the heterogeneous character of individual sources of evidence. On the other hand, this feature makes the combination step more difficult. We present a new method for combining partial probabilistic statements and prove that it is an extension of existing methods for combining complete probability statements. We evaluate the performance of our system and its individual components on data from the human and fruit fly genomes.
The use of sequence evolutionary conservation as a source of evidence in gene finding requires efficient and sensitive tools for finding similar regions in very long sequences. We present a method for improving the sensitivity of existing tools for this task by careful modeling of sequence properties. In particular, we build a hidden Markov model representing a typical homology between two protein coding regions and then use this model to optimize a component of a heuristic algorithm called a spaced seed. The seeds that we discover significantly improve the accuracy and running time of similarity search in protein coding regions, and are directly applicable to our gene finder.
Fusel, André Thiago. "O ensino e a aprendizagem da análise combinatória dentro do contexto de telefonia". Universidade Federal de São Carlos, 2013. https://repositorio.ufscar.br/handle/ufscar/5944.
Texto completoFinanciadora de Estudos e Projetos
This present dissertation, structured in the methodology of well-known research as Didactic Engineering, it presents the development of an unpublished class for the teacher on combination analysis in the High School. The objective of this work is to elaborate a didactic material that aids the students in the learning of some concepts of combination analysis in a significant way. The elaborated didactic sequence is inserted in the telephony context and it approaches the current subject on the increment of the 9th digit in the numbers of cellular of the area of the State of São Paulo with code of area 11. The whole sequence was thought so that the student will be the protagonist of its learning, making observations, you conjecture, debating with the colleagues, manipulating materials and solving the problems proposed in the leaves of activities in an autonomous way. The didactic sequence was applied for two groups of 2nd year of the High School in the School Educational Center SESI Bragança Paulista. For they accomplish the activities, the students were divided in groups. All the sheets of activities accomplished by the students and the registrations of observations facts by the teacher during the application of the activities were good as tools to verify the objective plans were reached.
A presente dissertação, estruturada na metodologia de pesquisa conhecida como Engenharia Didática, apresenta o desenvolvimento de uma aula inédita para o professor sobre análise combinatória no Ensino Médio. O objetivo deste trabalho é elaborar um material didático, que auxilie os alunos no aprendizado de alguns conceitos de análise combinatória de forma significativa. A sequência didática elaborada está inserida no contexto de telefonia e aborda o assunto atual sobre o acréscimo do 9º dígito nos números de celulares da região do Estado de São Paulo com código de área 11. Toda a sequência foi pensada de forma que o aluno seja o protagonista de sua aprendizagem, fazendo observações, conjecturas, debatendo com os colegas, manipulando materiais e solucionando os problemas propostos nas folhas de atividades de maneira autônoma. A sequência didática foi aplicada para duas turmas de 2º ano do Ensino Médio na Escola Centro Educacional SESI Bragança Paulista. Para realizarem as atividades, os alunos foram divididos em grupos. Todas as folhas de atividades realizadas pelos alunos e os registros de observações feitos pelo professor durante a aplicação das atividades serviram como ferramentas para verificar se os objetivos traçados foram atingidos.
Arisaka, Ryuta. "Proof-theoretical observations of BI and BBI base-logic interactions, and development of phased sequence calculus to define logic combinations". Thesis, Teesside University, 2013. http://hdl.handle.net/10149/315552.
Texto completoRazgulyaeva, Anna. "Les enchaînements dialogiques avec les connecteurs : une étude de "mais", "oui", "non"". Thesis, Toulouse 2, 2012. http://www.theses.fr/2012TOU20007.
Texto completoThis dissertation presents a semantic-pragmatic study of dialogic uses of mais, oui, non and their four combinations : mais oui, mais non, oui mais et non mais. The dialogic sequences “X – Mais Y” raise the question of the uniqueness of the oppositive connector, because the relationship between the utterances X and Y is very different from that which is established between both utterances in the “X mais Y” monologic configurations. In this dissertation, the two types of linking with mais are analyzed in the framework of dynamic semantics, which aims to describe the meaning of linguistic expressions from their ability to change the context. The enunciative operation of mais is specified from the constraints on the surrounding linguistic context that the examination of various contextual uses of mais in monologue and dialogue revealed. This examination leads to the conclusion that the specificity of dialogic sequences with mais is not related to the semantics of the connector, but the progress of speech, which is different in monologue and dialogue. Combinations of mais with oui and non are considered after a previous detailed analysis of validation marker and rejection marker. The way these two markers interact with the left context reflects their semantic asymmetry, confirmed by the possibility of using them as competing forms to confirm a negative utterance. In combination of oui and non with mais, the second element determines the type of relationship: oui mais and non mais mark the opposition, while mais oui and mais non reflect validation and rejection. However, the first element has a clear implication on the interpretation of the second one. In that sense mais oui and mais non responses present the validated or rejected information as already accepted in the context or, on the contrary, excluded, and therefore impossible to consider. On the other hand, in reactions with oui mais and non mais the oppositive connector regards the information accessible next to the use of the first marker
Chung, Kuo-Chen y 鍾國珍. "Combination of Error Correction Codes and Partial Transmit Sequences for Reduction of Peak-to-Average Power Ratio in OFDM Systems". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/pmk8z5.
Texto completo國立中興大學
電機工程學系所
106
In this dissertation, We propose to reduce PAPR in OFDM systems and reduce the computational complexity in conventional Partial Transmission Sequence (C-PTS) techniques. First, we presents a modified PTS algorithm for PAPR reduction of M-QAM OFDM signals by partitioning an OFDM block into non-disjoint OFDM sub-blocks. Since an M-QAM constellation can be written as sum of several QPSK constellations, we can then apply different disjoint partitions on the QPSK OFDM blocks, which result in an equivalent non-disjoint partition on the M-QAM OFDM block. Compared to a disjoint sub-block partition in conventional PTS, simulation results show that the modified PTS with a non-disjoint partition achieves better PAPR reduction in adjacent, interleaved, and random partitioning schemes. Second, we propose the parallel PTS (P-PTS) and serial PTS (S-PTS) methods to reduce the C-PTS complexity, based on the fact that the weighting factors are chosen as codewords of a linear block code. Compared to the C-PTS, the P-PTS and S-PTS methods not only reduce the computational complexity but also provide error correction capability for the weighting factors. Third, we present the PAPR reduction of OFDM signals by executing PTS in tree structure and minimal trellis of block codes. The proposed method uses a linear code with the tree structure and good minimal trellis to select the transmitted OFDM signal with minimum PAPR and to transmit side information with error correction. The goals of combining strategy of tree structure and trellis in PTS are twofold: to provide a low complexity PTS for weighting vector search and to highlight error protection capability for side information. Simulation results show that the proposed scheme achieves good PAPR reduction with lower complexity, compared to other PTS approaches.
Lin, Wei y 林瑋. "Combination of Convolutional Codes With Partial Transmit Sequence for PAPR Reductionin OFDM System". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/95579250224455705158.
Texto completo國立中興大學
通訊工程研究所
103
In this thesis, we propose combination of Convolutional Code(CC) with orthogonal frequency division multiplexing (OFDM) system. This method provides the error correction capability for the input data and the phase factor. One of the drawbacksinOFDM system is the high peak- to-average powerratio (PAPR).when the same sub- carrier phases are adding together.Itcauses the high PAPR in OFDM system. We select PartialTransmitSequence(PTS) systemas the main system to reducethe PAPR, and then use thetree structure to control phase factor number to reduce the comput -ational complexity. Finally, this method does not need to transmit additional sideinformation to the receiver.
Li, Yeng-Ting y 李彥霆. "Combination of Partial Transmit Sequence with Linear Block Codes for PAPR Reduction in OFDM System". Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5441109%22.&searchmode=basic.
Texto completo國立中興大學
電機工程學系所
107
Orthogonal Frequency Division Multiplexing (OFDM) is a multi-carrier system capable of high-rate data transmission, and has many advantages. One of the important shortcomings is the Peak To Average Power (PAPR). In order to solve this problem, we have many methods such as SLM, PTS, etc. This article is mainly based on PTS. Compared with the traditional partial transmission sequence (PTS), this paper uses tree and trellis structure of error correction (ECC), it can reduce the peak-to-average power ratio and search complexity either, and based on this, it is applied to data of larger length.
Lee, Su-I. y 李書逸. "Design of Structures and Clutching Sequences of Combinational Epicyclic-Type Automatic Transmissions for Automobiles". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/28382040630454381804.
Texto completo國立中山大學
機械與機電工程學系研究所
98
An epicyclic-type automatic transmission is a device which is connected from engine to driving wheels, and the main purpose is to maintain the revolution speed of engine to be in a desired working range while accelerating or decelerating the automobile. The epicyclic -type automatic transmissions in production are mostly Ravigneaux-type epicyclic mechanisms, and in recent year, the development of automatic transmissions for automobile is oriented to the orientation of setting an single epicyclic gear mechanism instead of the input to bring various inputs of revolution speed to increase the total number of speed ratios of an automatic transmission, and such type of epicyclic is called combinational epicyclic-type automatic transmissions for automobiles. For the incompletion in the relative design methodology, a systematic methodology of designing mechanism and clutching-sequence of combinational epicyclic-type automobile transmission is described. First, fundamental principle of the combination and operations of automatic transmissions are analyzed to establish the design requirements. Second, a procedure of structure synthesis of combinational epicyclic-type automobile transmission is brought up which the planar graphic method is applied for. Third, based on Speed Ratio Relationship of each clutching sequence, a procedure of gearing-sequence is introduced. Finally, on the basis of the analytic method, the teeth of gears is to be clarified. The result of this work obtains five types of the combinational epicyclic-type automatic transmissions which could reach six speeds.
Hong, Zhi-Hao y 洪志豪. "Combination of Iteration and Modified Tree Structure with Partial Transmit Sequence for PAPR Reduction in OFDM System". Thesis, 2016. http://ndltd.ncl.edu.tw/handle/10475986268877293896.
Texto completo國立中興大學
通訊工程研究所
104
In this paper, we proposed three methods of orthogonal frequency division multiplexing (OFDM) system combined partial transmit sequence (PTS) with low complexity. In the PTS, as sub-blocks increase, the performance of reducing peak-to-average power ratio (PAPR) is getting better, but complexity grow exponentially. The first method is to reduce the complexity of PTS by iteration, and uses the information obtained from last time to get better performance, so it can use less sub-blocks to get the same performance as PTS .The second method is to reduce much complexity by modified tree structure than RC-PTS. The last is to reduce complexity of tree structure by Fano algorithm, and changes the parallel form of tree structure into series form. In this method, we also add the threshold to let complexity lower.
Libros sobre el tema "Combination sequences"
Activities manual to accompany programmable logic controllers. 4a ed. New York, NY: McGraw-Hill Higher Education, 2011.
Buscar texto completoHolland, John H. 4. Agents, networks, degree, and recirculation. Oxford University Press, 2014. http://dx.doi.org/10.1093/actrade/9780199662548.003.0004.
Texto completoKirillov, A. A., M. L. Gerver, S. I. Gelfand y N. N. Konstantinov. Sequences, Combinations, Limits (Library of School Mathematics, V. 3). Dover Publications, 2002.
Buscar texto completoWang, Jason T. L., Bruce A. Shapiro y Dennis Shasha, eds. Pattern Discovery in Biomolecular Data. Oxford University Press, 1999. http://dx.doi.org/10.1093/oso/9780195119404.001.0001.
Texto completoDin, Roshidi, Siti Sakira Kamaruddin, Angela Amphawan y Mohd Nizam Omar. Basic discrete structures. UUM Press, 2015. http://dx.doi.org/10.32890/9789670876177.
Texto completoKao, Mou-Chieh. Development of DNA-tagged liposome biosensing devices and enzyme-linked dot blot assay in combination with nucleic acid sequence-based amplification for rapid detection of viable shiga toxin-producing escherichia coli. Ithaca, NY : Cornell University, 2000, 2003.
Buscar texto completoGuthrie, Graeme. The Firm Divided. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190641184.001.0001.
Texto completoWeirich, Paul. Rational Responses to Risks. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190089412.001.0001.
Texto completoMee, Nicholas. Celestial Tapestry. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198851950.001.0001.
Texto completoThrelfall, E. J., J. Wain y C. Lane. Salmonellosis. Oxford University Press, 2011. http://dx.doi.org/10.1093/med/9780198570028.003.0030.
Texto completoCapítulos de libros sobre el tema "Combination sequences"
Giese, Martin A., Barbara Knappmeyer y Heinrich H. Bülthoff. "Automatic Synthesis of Sequences of Human Movements by Linear Combination of Learned Example Patterns". En Biologically Motivated Computer Vision, 538–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36181-2_54.
Texto completoKo, Kwang-Eun y Kwee-Bo Sim. "Emotion Recognition in Facial Image Sequences Using a Combination of AAM with FACS and DBN". En Intelligent Robotics and Applications, 702–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16584-9_67.
Texto completoYao, Yung-Cheng, Ho-Lung Hung y Jyh-Horng Wen. "OFDM System with Reduce Peak-to-Average Power Ratio Using Optimum Combination of Partial Transmit Sequences". En Lecture Notes in Computer Science, 459–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38703-6_54.
Texto completoZimmermann, Georg. "Stereo matching based on a combination of simple features used for matching in temporal image sequences". En Computer Vision — ECCV 90, 616–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/bfb0014924.
Texto completoHsu, Chen-Ming, Chien-Yu Chen, Ching-Chi Hsu y Baw-Jhiune Liu. "Efficient Discovery of Structural Motifs from Protein Sequences with Combination of Flexible Intra- and Inter-block Gap Constraints". En Advances in Knowledge Discovery and Data Mining, 530–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11731139_62.
Texto completoO’Regan, Gerard. "Sequences, Series and Permutations and Combinations". En Undergraduate Topics in Computer Science, 117–30. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34209-8_7.
Texto completoO’Regan, Gerard. "Sequences, Series and Permutations and Combinations". En Texts in Computer Science, 85–97. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44561-8_5.
Texto completoZheng, Jeffrey y Jie Wan. "Visual Maps of Variant Combinations on Random Sequences". En Variant Construction from Theoretical Foundation to Applications, 333–50. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2282-2_22.
Texto completoHunt, D. F., J. Shabanowitz, M. A. Moseley, A. L. McCormack, H. Michel, P. A. Martino, K. B. Tomer y J. W. Jorgenson. "Protein and Peptide Sequence Analysis by Tandem Mass Spectrometry in Combination with Either Capillary Electrophoresis or Micro-Capillary HPLC". En Methods in Protein Sequence Analysis, 257–66. Basel: Birkhäuser Basel, 1991. http://dx.doi.org/10.1007/978-3-0348-5678-2_26.
Texto completoQiao, Yongliang, Cindy Cappelle y Yassine Ruichek. "Visual Localization Using Sequence Matching Based on Multi-feature Combination". En Advanced Concepts for Intelligent Vision Systems, 324–35. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48680-2_29.
Texto completoActas de conferencias sobre el tema "Combination sequences"
Cresp, G., Zepernick H-J y Hai Huyen Dam. "Combination Oppermann sequences for spread spectrum systems". En Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523705.
Texto completoLiu, Jihong y Yong Wang. "Assembly Planning and Assembly Sequences Combination Using Assembly Feature Interference". En 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics. IEEE, 2007. http://dx.doi.org/10.1109/cadcg.2007.4407951.
Texto completoSalmam, Fatima Zahra, Abdellah Madani y Mohamed Kissi. "New distances combination for facial expression recognition from image sequences". En 2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA). IEEE, 2016. http://dx.doi.org/10.1109/aiccsa.2016.7945716.
Texto completoKong, Yinghui y Lei Wang. "Moving Target Classification in Video Sequences Based on Features Combination and SVM". En 2010 International Conference on Computational Intelligence and Software Engineering (CiSE). IEEE, 2010. http://dx.doi.org/10.1109/cise.2010.5676969.
Texto completoMittal, Udar, Tenkasi V. Ramabadran y James P. Ashley. "Coding pulse sequences using a combination of factorial pulse coding and arithmetic coding". En 2010 International Conference on Signal Processing and Communications (SPCOM). IEEE, 2010. http://dx.doi.org/10.1109/spcom.2010.5560556.
Texto completoPeng, Xiaoming y Qian Ma. "Aligning Overlapping Image Sequences by the Combination of Feature-Based and Direct Methods". En 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.449.
Texto completoGoyal, Rohit, B. Hemanth Kumar y Makarand M. Lokhande. "Combination of switching sequences in SVPWM to reduce line current ripple for IM drives". En 2017 6th International Conference on Computer Applications in Electrical Engineering-Recent Advances (CERA). IEEE, 2017. http://dx.doi.org/10.1109/cera.2017.8343347.
Texto completoD’Souza, Roshan M. y Zaryab Ahmad. "Applications of Genetic Algorithms in Process-Planning: Tool Sequence Selection for 2.5D Pocket Machining". En ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99368.
Texto completoYamano, Hidemasa, Hiroyuki Nishino y Kenichi Kurisaka. "Development of Probabilistic Risk Assessment Methodology of Decay Heat Removal Function Against Combination Hazards of Strong Wind and Rainfall for Sodium-Cooled Fast Reactors". En 2017 25th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/icone25-66059.
Texto completoSegeborn, Johan, Johan S. Carlson, Kristina Wa¨rmefjord y Rikard So¨derberg. "Evaluating Genetic Algorithms on Welding Sequence Optimization With Respect to Dimensional Variation and Cycle Time". En ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48393.
Texto completoInformes sobre el tema "Combination sequences"
Merkulova, Yuliya. Система цифровых моделей - новая технология для баланса данных. Yuliya Merkulova, abril de 2021. http://dx.doi.org/10.12731/er0430.26042021.
Texto completoJorgensen, Frieda, Andre Charlett, Craig Swift, Anais Painset y Nicolae Corcionivoschi. A survey of the levels of Campylobacter spp. contamination and prevalence of selected antimicrobial resistance determinants in fresh whole UK-produced chilled chickens at retail sale (non-major retailers). Food Standards Agency, junio de 2021. http://dx.doi.org/10.46756/sci.fsa.xls618.
Texto completo