Relevant bibliographies by topics / Search of maximal codes

Academic literature on the topic 'Search of maximal codes'

Author: Grafiati
Published: 30 May 2022
Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Search of maximal codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Search of maximal codes"

1

WONG, SHUI-WAI. "AKITA: A CAREER COUNSELING CASE FOR PRACTICE AND THEORETICAL REFLECTION." Hong Kong Journal of Social Work 54, no. 01n02 (January 2020): 51–66. http://dx.doi.org/10.1142/s0219246220000066.

Full text
Abstract:
A case in the Hong Kong Chinese context is presented in this paper to illustrate the use of both quantitative (Holland's SDS) and qualitative career assessment (Card Sorts) to help a 16-year-old girl overcome career indecision. Guided by both Holland's Hexagonal Career Types Theory and Socio-Cognitive Career Theory, a career counsellor can promote a client's positive changes after two counseling sessions. This case supports Tracey's (2002) and Nauta et al.'s (2002) postulated bidirectional causal path between self-efficacy and interests. In addition, it highlights that partial match instead of perfect match between Self-directed search (SDS) scores and choice of academic major is more pragmatic or effective while performing quantitative assessment. Finally, it points to the need for establishing local SDS norms, examining the Holland codes for occupations in Hong Kong, and researching the link between congruence and maximal career outcomes in future research.
APA, Harvard, Vancouver, ISO, and other styles
2

Abideen, Ahmed Zainul, Jaafar Pyeman, Veera Pandiyan Kaliani Sundram, Ming-Lang Tseng, and Shahryar Sorooshian. "Leveraging Capabilities of Technology into a Circular Supply Chain to Build Circular Business Models: A State-of-the-Art Systematic Review." Sustainability 13, no. 16 (August 11, 2021): 8997. http://dx.doi.org/10.3390/su13168997.

Full text
Abstract:
The recent technological inclusions in supply chains are encouraging practitioners to continuously rethink and redesign these supply chains. Organizations are trying to implement sustainable manufacturing and supply chain practices to utilize their resources to the full extent in order to gain a competitive advantage. Circular supply chain management acts as the main pathway to achieve optimal circular business models; however, research in this area is still in its infancy and there is a need to study and analyze how the benefits of technology can be leveraged in conventional models to impact circular supply chains and build smart, sustainable, circular business models. To gain better familiarity with the future research paradigms, a detailed systematic literature review was conducted on this topic to identify the dynamics of this field and domains deserving further academic attention. A holistic and unique review technique was used by the authors to capture maximal insights. A total of 96 publications from 2010 to 2021 were selected from the Web of Science core collection database through strict keyword search codes and exclusion criteria, with neat integration of systematic and bibliometric analyses. The findings of this study highlight the knowledge gaps and future research directions, which are presented at the end of this paper.
APA, Harvard, Vancouver, ISO, and other styles
3

Bruyère, Véronique, and Dominique Perrin. "Maximal bifix codes." Theoretical Computer Science 218, no. 1 (April 1999): 107–21. http://dx.doi.org/10.1016/s0304-3975(98)00253-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alderson, T. L., and A. A. Bruen. "Maximal AMDS codes." Applicable Algebra in Engineering, Communication and Computing 19, no. 2 (February 15, 2008): 87–98. http://dx.doi.org/10.1007/s00200-008-0058-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Moulis, Guillaume, Maryse Lapeyre-Mestre, Jean-Louis Montastruc, Bertrand Godeau, and Laurent Sailler. "Vaccination Rates in Primary Immune Thrombocytopenia Adult Patients Exposed to Rituximab or Splenectomy. a Nationwide Population-Based Study in France." Blood 124, no. 21 (December 6, 2014): 2180. http://dx.doi.org/10.1182/blood.v124.21.2180.2180.

Full text
Abstract:
Abstract Background: International guidelines on immune thrombocytopenia (ITP) management recommend vaccination against Streptococcus pneumoniae (S.p.), Haemophilus influenza b (Hib) and Neisseiria meningitidis (N.m.) before splenectomy. French guidelines, published in 2009, state that these vaccines should be administered at least two weeks before splenectomy. They also recommend these vaccinations at least two weeks before rituximab, because 80% of rituximab-treated patients may relapse and may be candidate to splenectomy, while seroconversion is compromised the semester following rituximab. The aim of this study was to assess the application of these recommendations in France. Methods:The study was conducted in the database of the French national health insurance system (SNIIRAM). The French Adult Immune Thrombocytopenia: a French pHarmacoepidemiological study (FAITH, n°ENCEPP/SDPP/4574) is aimed at following in the SNIIRAM the cohort of all incident primary persistent or chronic ITP adult patients treated in France from 2009. The SNIIRAM collects prospectively all data regarding hospitalizations, disabling diseases, drug and procedure reimbursements. They are linkable with demographic data. On the 2009-2011 SNIIRAM data, ITP patients were identified with hospital and disabling disease diagnosis codes (D69.3 code of the International Classification of diseases, version-10 – ICD-10). The date of diagnosis was refined thanks to out-hospital drug exposures. Secondary ITPs were excluded thanks to diagnosis codes of diseases associated to ITP, searched in the year before and the semester after the diagnosis. We restricted to incident patients, excluding those with a diagnosis during the first semester of the study. Lastly, the FAITH cohort includes the patients persistently treated (at least three monthly consecutive dispensing of ITP drug, or exposure to rituximab or splenectomy). Among the 1106 patients of the FAITH cohort identified from July 2009 to June 2011, 427 non-splenectomized patients were exposed to rituximab and 178 underwent splenectomy (67 out of these had been previously exposed to rituximab). We assessed vaccine exposure to S.p., Hib and N.m. and detailed the moment of vaccinations. Vaccination was said “recommended” when it occurs prior to 2 weeks before rituximab or splenectomy. Other indications for vaccination (e.g. chronic pulmonary disease for S.p.vaccine) were searched through disabling diseases and in-hospital diagnosis codes before exposure to rituximab or splenectomy, using validated ICD-10 algorithms. Results: Among the 423 non-splenectomized patients exposed to rituximab, 137 (31.6%) were vaccinated against S.p., 80 (18.9%) against Hib, and 16 (3.8%) against N.m. Only 54 (12.8%) patients benefitted from a recommended vaccination against S.p. A similar pattern of recommended/non-recommended vaccination was observed for Hib and N.m. vaccines. Among the patients vaccinated after the first rituximab infusion, 28.5% (S.p.), 33.7% (Hib) and 37.5% (N.m.) were vaccinated during the 6 months following rituximab, corresponding to the time of maximal B-cell depletion. Forty-one patients (9.7%) had another reason for being vaccinated (mainly heart failure, n=23 and chronic pulmonary disease, n=13). Among them, 6 were vaccinated against S.p., 3 against Hib and none against N.m. Among the 111 splenectomized patients not previously exposed to rituximab, vaccination rates were 52.2% for S.p., 30.6% for Hib and 8.1% for N.m. When vaccinated against S.p., most patients (90.6%) benefitted from a recommended vaccination schedule (80.9% and 81.8% for Hib and N.m. vaccinations, respectively). Among the 67 patients exposed to rituximab before splenectomy, vaccination rates were 64.2% for S.p., 38.8% for Hib and 10.5% for N.m. Among S.p vaccinated patients, 79.6% had a recommended vaccination schedule before splenectomy (70.3% and 77.8% for Hib and N.m. vaccinations, respectively). However, 53.3 % of these recommended vaccinations occurred during the semester following a rituximab infusion (maximal B-cell depletion period). Seven of the 178 splenectomized patients had another reason for being vaccinated. Among them, 4 were vaccinated against S.p. and Hib, and 1 against N.m. Conclusions: Vaccination coverage is low before splenectomy or rituximab in ITP patients in France. Most of the vaccinations are dispensed during a non-recommended period. Disclosures No relevant conflicts of interest to declare.
APA, Harvard, Vancouver, ISO, and other styles
6

Burderi, Fabio. "Monoids and Maximal Codes." Electronic Proceedings in Theoretical Computer Science 63 (August 17, 2011): 83–92. http://dx.doi.org/10.4204/eptcs.63.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lam, Nguyen Huong. "Finite maximal solid codes." Theoretical Computer Science 262, no. 1-2 (July 2001): 333–47. http://dx.doi.org/10.1016/s0304-3975(00)00277-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guesnet, Yannick. "On maximal synchronous codes." Theoretical Computer Science 307, no. 1 (September 2003): 129–38. http://dx.doi.org/10.1016/s0304-3975(03)00097-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Foldes, Stephan, and Navin Singhi. "On maximal instantaneous codes." Electronic Notes in Discrete Mathematics 27 (October 2006): 27–28. http://dx.doi.org/10.1016/j.endm.2006.08.040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Yun. "Compositions of maximal codes." Theoretical Computer Science 411, no. 1 (January 2010): 228–38. http://dx.doi.org/10.1016/j.tcs.2009.09.031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Search of maximal codes"

1

Кравчук, Володимир Вікторович. "Комплекс програм для визначення нероздільних завадостійких кодів." Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/35023.

Full text
Abstract:
Бакалаврський проєкт включає пояснювальну записку (55 с., 45 рис., 4 додатки). В даній роботі досліджена тема завадостійкого кодування та пошуку максимальної кліки на графі. Розглянуто різні типи кодування, описана проблема аналітичної швидкості коду, проаналізовано алгоритм Брона-Кербоша для пошуку клік. На основі особливостей еквівалентних кодів та графа Хемінга, запропоновано способи покращення алгоритму для вирішення задачі пошуку максимального нероздільного завадостійкого коду. Було вирішено розробити комплекс програм, який допоможе спростити визначення та дослідження нероздільних завадостійких кодів. Було сформовано конкретні вимоги та функціональність для комплексу, а саме: можливість пошуку максимальних нероздільних завадостійких кодів відповідно до заданих користувачем параметрів, зупинка роботи комплексу в певний момент часу із збереженням проміжних даних з якими працював алгоритм, завантаження збережених даних та продовження роботи після зупинки, можливість виконання різних операцій над кодами, таких як визначення мінімальної кодової відстані, визначення кодової відстані кодослова до коду, сортування коду, надання користувачу простого та зрозумілого графічного інтерфейсу для зручності роботи з програмою. Комплекс програм реалізований мовою програмування Java, яка підтримується усіма популярними операційними системами, з використанням стандартної бібліотеки JavaFX, для розробки графічних інтерфейсів.
The bachelors project includes an explanatory note (97 pages, 41 drawings, 7 annexes). In this work, the topics of error correction and error detection coding, finding maximal clique of graph have been researched. Different types of coding were considered, the problem of analytic speed of code was described and Bron-Kerbosh algorithm was analyzed. Based on specifics of equivalents codes and Hamming graph the methods of algorithm optimization for finding maximal undivided error correcting code were suggested. It has been decided to develop a complex of program which will help to calculate and research error correcting codes. The concrete requirements and functionality for the complex were formulated: possibility to search maximal undivided error correcting code according to parameters provided by user, stop work of complex in the moment with saving intermediate data algorithm are working with, loading the saved data and continue work after algorithm had been stopped, the possibility to perform some operations with codes like compute the minimal code distance, compute minimal code distance between a word and a code, sort code, provide simple and understandable graphical user interface for comfortable working with program. The complex of programs is implemented by Java programming language which is supported by all the most popular operation systems using native library JavaFX for developing graphical user interface.
APA, Harvard, Vancouver, ISO, and other styles
2

Mumba, Nephtale Bvalamanja. "Codes, graphs and designs from maximal subgroups of alternating groups." University of the Western Cape, 2018. http://hdl.handle.net/11394/6165.

Full text
Abstract:
Philosophiae Doctor - PhD (Mathematics)
The main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first examine the binary codes from the row span of biadjacency matrices and their transposes for some classes of bipartite graphs. In this case we consider a sub-matrix of an adjacency matrix of a graph as the generator of the code. We then shift our attention to uniform subset graphs by exploring the automorphism groups of graph covers and some classes of uniform subset graphs. In the sequel, we explore equal codes from adjacency matrices of non-isomorphic uniform subset graphs and finally consider codes generated by an adjacency matrix formed by adding adjacency matrices of two classes of uniform subset graphs.
APA, Harvard, Vancouver, ISO, and other styles
3

Guesnet, Yannick. "Codes et interprétations." Rouen, 2001. http://www.theses.fr/2001ROUES019.

Full text
Abstract:
Les travaux présentés dans ce mémoire se situent dans le cadre de la théorie des codes à longueurs variables. Nous introduisons deux nouvelles classes de codes : celle des codes à délai d'interprétation fini et celle des codes adjacents. Nous montrons que ces codes satisfont une extension au théorème du défaut. Nous montrons également l'équivalence entre la notion de maximalité dans la classe des codes à délai d'interprétation fini et celle de maximalité dans la classe des codes en général pour les codes à délai d'interprétation fini coupants. Nous proposons en outre deux méthodes de complétions : l'une permet de compléter tout code à délai d'interprétation fini coupant en un code à délai d'interprétation fini maximal et l'autre permet de compléter tout code synchronisant en un code maximal et synchronisant. Ces deux méthodes préservent la rationalité des ensembles. Nous nous intéressons dans un dernier temps aux codes denses : nous montrons qu'il n'y a pas équivalence entre la maximalité dans la classe des codes circulaires et la maximalité dans la classe des codes dans le cas des codes circulaires denses. Enfin, nous donnons une méthode permettant de compléter tout code bifixe coupant et non maximal en un code dense, bifixe, maximal dans la classe des codes bifixes et non maximal dans la classe des codes.
APA, Harvard, Vancouver, ISO, and other styles
4

Dhanasetty, Abhishek. "Enumerating Approximate Maximal Cliques in a Distributed Framework." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1617104719399743.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bärmann, Daniel. "Aufzählen von DNA-Codes." Master's thesis, Universität Potsdam, 2006. http://opus.kobv.de/ubp/volltexte/2006/1026/.

Full text
Abstract:
In dieser Arbeit wird ein Modell zum Aufzählen von DNA-Codes entwickelt. Indem eine Ordnung auf der Menge aller DNA-Codewörter eingeführt und auf die Menge aller Codes erweitert wird, erlaubt das Modell das Auffinden von DNA-Codes mit bestimmten Eigenschaften, wie Überlappungsfreiheit, Konformität, Kommafreiheit, Stickyfreiheit, Überhangfreiheit, Teilwortkonformität und anderer bezüglich einer gegebenen Involution auf der Menge der Codewörter. Ein auf Grundlage des geschaffenen Modells entstandenes Werkzeug erlaubt das Suchen von Codes mit beliebigen Kombinationen von Codeeigenschaften. Ein weiterer wesentlicher Bestandteil dieser Arbeit ist die Untersuchung der Optimalität von DNA-Codes bezüglich ihrer Informationsrate sowie das Finden solider DNA-Codes.
In this work a model for enumerating DNA codes is developed. By applying an order on the set of DNA codewords and extending this order on the set of codes, this model assists in the discovery of DNA codes with properties like non-overlappingness, compliance, comma-freeness, sticky-freeness, overhang-freeness, subword-compliance, solidness and others with respect to a given involution on the set of codewords. This tool can be used to find codes with arbitrary combinations of code properties with respect to the standard Watson-Crick-DNA involution. The work also investigates DNA codes with respect to the optimizing of the information rate, as well as finding solid DNA codes.
APA, Harvard, Vancouver, ISO, and other styles
6

Santos, Josenildo Brandão. "Construção de STBCs de Ordem Maximal em Álgebras Centrais Simples." Universidade Federal da Paraí­ba, 2012. http://tede.biblioteca.ufpb.br:8080/handle/tede/7404.

Full text
Abstract:
Made available in DSpace on 2015-05-15T11:46:12Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 680540 bytes, checksum: fd1c663b0bd1b5f52cc2e595af12efd6 (MD5) Previous issue date: 2012-09-28
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
In this dissertation, a way to build dense STBCs with full diversity of maximal order in central simple algebra will be presented. We constructed a retriculated ST code with a nonzero determinant for a quad antenna MISO transmission. Also, we will present a general algorithm to test the limit of a given order, since by the use of a maximum order instead of just the algebraic integer ring, we can increase the capacity of the code without a loss in the minimum determinant. Furthermore, by using the ideal of a maximum order we can further improve the code, as we increase the minimum determinant.
Nesta dissertação, será apresentada uma maneira para construir STBCs denso com diversidade completa, de ordem maximal em álgebras centrais simples. Construiremos um código reticulado ST com determinante não nulo para uma aplicação de quatro an- tenas de transmissão MISO. Apresentaremos também, um algoritmo geral para testar a maximalidade de uma ordem dada, uma vez que com o uso de uma ordem maximal em vez de apenas o anel dos inteiros algébricos, conseguimos um aumento na capacidade do código sem perda no determinante mínimo. Além disso, utilizando o ideal de uma ordem maximal melhoramos ainda mais o código, à medida que aumentamos o determinante mínimo.
APA, Harvard, Vancouver, ISO, and other styles
7

Chi, Zhanjiang. "Performance Analysis of Maximal-Ratio Combining and Space-Time Block Codes with Transmit Antenna Selection over Nakagami-m Fading Channels." School of Electrical and Information Engineering, 2007. http://hdl.handle.net/2123/2012.

Full text
Abstract:
Master of Engineering (Research)
The latest wireless communication techniques such as highspeed wireless internet application demand higher data rates and better quality of service (QoS). However, transmission reliability is still degraded by harsh propagation channels. Multiple-input multiple-output (MIMO) systems can increase the system capacity and improve transmission reliability. By transmitting multiple copies of data, a MIMO system can effectively combat the effects of fading. Due to the high hardware cost of a MIMO system, antenna selection techniques have been applied in MIMO system design to reduce the system complexity and cost. The Nakagami-m distribution has been considered for MIMO channel modeling since a wide range of fading channels, from severe to moderate, can be modeled by using Nakagami-m distribution. The Rayleigh distribution is a special case of the Nakagami-m distribution. In this thesis, we analyze the error performance of two MIMO schemes: maximal-ratio combining with transmit antenna selection (the TAS/MRC scheme) and space-time block codes with transmit antenna selection (the TAS/STBC scheme) over Nakagami-m fading channels. In the TAS/MRC scheme, one of multiple transmit antennas, which maximizes the total received signal-to-noise ratio (SNR), is selected for uncoded data transmission. First we use a moment generating function based (MGF-based) approach to derive the bit error rate (BER) expressions for binary phase shift keying (BPSK), the symbol error rate (SER) expressions for M-ray phase shift keying (MPSK) and M-ray quadrature amplitude modulation (MQAM) of the TAS/MRC scheme over Nakagami-m fading channels with arbitrary and integer fading parameters m. The asymptotic performance is also investigated. It is revealed that the asymptotic diversity order is equal to the product of the Nakagami fading parameter m, the number of transmit antenna Lt and the number of receive antenna Lr as if all transmit antenna were used. Then a Gaussian Q-functions approach is used to investigate the error performance of the TAS/STBC scheme over Nakagami-m fading channels. In the TAS/STBC scheme, two transmit antennas, which maximize the output SNR, are selected for transmission. The exact and asymptotic BER expressions for BPSK are obtained for the TAS/STBC schemes with three and four transmit antennas. It is shown that the TAS/STBC scheme can provide a full diversity order of mLtLr.
APA, Harvard, Vancouver, ISO, and other styles
8

Panagos, Adam G., and Kurt Kosbar. "A METHOD FOR FINDING BETTER SPACE-TIME CODES FOR MIMO CHANNELS." International Foundation for Telemetering, 2005. http://hdl.handle.net/10150/604782.

Full text
Abstract:
ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada
Multiple-input multiple output (MIMO) communication systems can have dramatically higher throughput than single-input, single-output systems. Unfortunately, it can be difficult to find the space-time codes these systems need to achieve their potential. Previously published results located good codes by minimizing the maximum correlation between transmitted signals. This paper shows how this min-max method may produce sub-optimal codes. A new method which sorts codes based on the union bound of pairwise error probabilities is presented. This new technique can identify superior MIMO codes, providing higher system throughput without increasing the transmitted power or bandwidth requirements.
APA, Harvard, Vancouver, ISO, and other styles
9

Xingyu, Luo, and Zhang Qishan. "A PARALLEL -SEQUENTIAL SEARCH ALGORITHM IN A HIGH DYNAMIC GPS RECEIVER." International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/607533.

Full text
Abstract:
International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California
It is need to design acquisition and tracking for code loop and carrier loop to detect the high dynamic Global Position System (GPS) signal. Acquiring signal quickly and shortening acquisition time in the cold case are key technology of a high dynamic GPS receiver. Moreover, fast acquisition of C/A code is the base of code tracking and carrier acquisition and tracking. This paper describes elements and implementation of a new parallel-sequential search Algorithm to acquire C/A code of the high dynamic GPS signal. And combined with a 12-channel correlator named GP2021 produced by GEC Co., the arithmetic implementation to acquire C/A code of the high dynamic GPS signal used sequential search based on DSP technology is also given.
APA, Harvard, Vancouver, ISO, and other styles
10

Chan, Evelyn Yu-San. "Heuristic optimisation for the minimum distance problem." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Search of maximal codes"

1

Nicholas, Ted. How to get your own trademark: Complete with trademark application forms, request for trademark search, federal regulations and codes, everything you need. Chicago, Ill: Enterprise-Dearborn, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Office, Home. Draft codes of practice for the detention, treatment, questioning, and identification of persons by the police, for the searching of premises and seizure of property, and for the exercise of powers of stop and search. London: Home Office, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ontario. Human rights code, 1990: Rev. Statutes of Ontario, 1990, Chapter H.19, as amended by: 1993, ch. 27, sched.; 1993, ch.35,s.56; 1994, ch.10,s.22; 1994, ch.27,s.65; 1995, ch.4,s.3, and the following regulation (as amended): Search and entry warrants (R.R.O. 1990,Reg. 642) = Codes des droits de la personne : lois refondues de l'Ontario de 1990, chapitre H.19, tel qu'il est modifié par: l'annexe du chap. 27 de 1993; l'art. 56 du chap. 35 de 1993; l'art. 22 du chap. 10 de 1994; l'art. 65 du chap. 27 de 1994; l'art. 3 du chap. 4 de 1995, et le règlement suivant (tel qu'il est modifié): Mandat de perquisition et d'entrée (R.R.O. 1990, règl. 642). Toronto, Ont: Printed by the Queen's Printer for Ontario, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

ND, Robert J. Newton JD. In Search of the Hidden Codes of God in the Mathematics of Gematria: Discovering tbe True Da Vinci Code. Beyond the Bounds of Earth Publishing, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Draft codes of practice for the detention, treatment, questioning, and identification of persons by the police, for the searching of premises and seizure ... the exercise of powers of stop and search. Home Office, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pediatric ICD-10-CM 2018: A Manual for Provider-Based Coding. American Academy of Pediatrics, 2017. http://dx.doi.org/10.1542/9781610021074.

Full text
Abstract:
For the pediatric provider, coder, and biller, here's the most helpful and easy-to-use manual on ICD-10-CM yet. Featuring a laser-sharp pediatrics focus, it provides codes and guidelines in a simplified, yet familiar format. This purpose-built tool streamlines the coding process by condensing the vast ICD-10-CM code set to only pediatric-centered guidelines and codes. This yields a 50% reduction of codes to search for faster, efficient coding. The guidelines are included directly at the chapter and code level, helping ensure that coders will always use the right codes in the right situations. Tabular, indexed navigation helps you find needed items fast. KEY FEATURES: Updated for the October 1, 2017 release of ICD-10-CM codes Pediatrics-focused and provider-based coding guidance Integrated codes and guidelines
APA, Harvard, Vancouver, ISO, and other styles
7

Parpworth, Neil. 19. Police powers. Oxford University Press, 2018. http://dx.doi.org/10.1093/he/9780198810704.003.0019.

Full text
Abstract:
The Police and Criminal Evidence Act 1984 (PACE) confers many powers upon the police. This chapter discusses the codes of practice of PACE, police powers of stop and search, the power to arrest members of the public, and the powers to enter property. Whether or not a particular power is exercised will be a matter of discretion for an individual officer. The exercise of this discretion and the extent to which this is subject to review by the courts will be examined. Finally, the chapter looks at two offences which may be committed against the police : assaulting an officer; and wilful obstruction of an officer.
APA, Harvard, Vancouver, ISO, and other styles
8

Hawthorne, Nathaniel, and Cindy Weinstein. The Scarlet Letter. Edited by Brian Harding. Oxford University Press, 2008. http://dx.doi.org/10.1093/owc/9780199537808.001.0001.

Full text
Abstract:
Thou and thine, Hester Prynne, belong to me.' With these chilling words a husband claims his wife after a two-year absence. But the child she clutches is not his, and Hester must wear a scarlet 'A' upon her breast, the sin of adultery visible to all. Under an assumed name her husband begins his search for her lover, determined to expose what Hester is equally determined to protect. Defiant and proud, Hester witnesses the degradation of two very different men, as moral codes and legal imperatives painfully collide. Set in the Puritan community of seventeenth-century Boston, The Scarlet Letter also sheds light on the nineteenth-century in which it was written, as Hawthorne explores his ambivalent relations with his Puritan forebears. The text of this edition is taken from the Centenary Edition of Hawthorne's works, the most authoritative critical edition.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Search of maximal codes"

1

Bruyère, Véronique, and Michel Latteux. "Variable-length maximal codes." In Automata, Languages and Programming, 24–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61440-0_115.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Boyvalenkov, Peter, and Ivan Landgev. "On maximal spherical codes I." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 158–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60114-7_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fanali, Stefania. "On Linear Codes from Maximal Curves." In Cryptography and Coding, 91–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10868-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Anselmo, Marcella. "Constructing Finite Maximal Codes from Schützenberger Conjecture." In Lecture Notes in Computer Science, 197–214. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45446-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dileep Reddy, M., and G. Sreenivasulu. "Performance of Rake Receiver for Maximal Codes." In Learning and Analytics in Intelligent Systems, 375–81. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46943-6_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Anselmo, Marcella, Dora Giammarresi, and Maria Madonia. "Encoding Pictures with Maximal Codes of Pictures." In SOFSEM 2018: Theory and Practice of Computer Science, 552–65. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73117-9_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Boyvalenkov, Peter, and Danyo Danev. "On maximal codes in polynomial metric spaces." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 29–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63163-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Giorgetti, Marta. "Interesting Examples on Maximal Irreducible Goppa Codes." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 215–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02181-7_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gompert, Joel M. "Local Search with Maximal Independent Sets." In Principles and Practice of Constraint Programming – CP 2004, 795. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30201-8_74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kaveh, Ali, and Taha Bakhshpoori. "Cuckoo Search Algorithm." In Metaheuristics: Outlines, MATLAB Codes and Examples, 67–77. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-04067-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Search of maximal codes"

1

Shen, Fumin, Wei Liu, Shaoting Zhang, Yang Yang, and Heng Tao Shen. "Learning Binary Codes for Maximum Inner Product Search." In 2015 IEEE International Conference on Computer Vision (ICCV). IEEE, 2015. http://dx.doi.org/10.1109/iccv.2015.472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hashemi, Seyyed Ali, Nghia Doan, Warren J. Gross, John Cioffi, and Andrea Goldsmith. "A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes." In 2021 IEEE Globecom Workshops (GC Wkshps). IEEE, 2021. http://dx.doi.org/10.1109/gcwkshps52748.2021.9682042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nafkha, Amor. "Near maximum likelihood detection algorithm based on 1-flip local search over uniformly distributed codes." In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655353.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Long, Dongyang, and Weijia Jia. "Optimal maximal and maximal prefix codes equivalent to Huffman codes." In Proceedings of ICASSP '02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.5745161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dongyang Long and Weijia Jia. "Optimal maximal and maximal prefix codes equivalent to Huffman codes." In IEEE International Conference on Acoustics Speech and Signal Processing ICASSP-02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.1005199.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sabiri, Mohammed. "Maximal Codes for Finite Chain Rings." In 2019 International Conference on Advanced Communication Technologies and Networking (CommNet). IEEE, 2019. http://dx.doi.org/10.1109/commnet.2019.8742351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Makriyannis, Nikolaos, and Bertrand Meyer. "Some constructions of maximal witness codes." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6033928.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lv, Liangdong, Ruihu Li, Qiang Fu, and Xueliang Li. "Maximal entanglement entanglement-assisted quantum codes from quaternary BCH codes." In 2015 IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2015. http://dx.doi.org/10.1109/iaeac.2015.7428647.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gao, Jie, Fei Hao, Geyong Min, and Zhipeng Cai. "Maximal Multipolarized Cliques Search in Signed Networks." In SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3404835.3463014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Medya, Sourav, Tiyani Ma, Arlei Silva, and Ambuj Singh. "A Game Theoretic Approach For Core Resilience." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/480.

Full text
Abstract:
K-cores are maximal induced subgraphs where all vertices have degree at least k. These dense patterns have applications in community detection, network visualization and protein function prediction. However, k-cores can be quite unstable to network modifications, which motivates the question: How resilient is the k-core structure of a network, such as the Web or Facebook, to edge deletions? We investigate this question from an algorithmic perspective. More specifically, we study the problem of computing a small set of edges for which the removal minimizes the k-core structure of a network. This paper provides a comprehensive characterization of the hardness of the k-core minimization problem (KCM), including innaproximability and parameterized complexity. Motivated by these challenges, we propose a novel algorithm inspired by Shapley value---a cooperative game-theoretic concept--- that is able to leverage the strong interdependencies in the effects of edge removals in the search space. We efficiently approximate Shapley values using a randomized algorithm with probabilistic guarantees. Our experiments, show that the proposed algorithm outperforms competing solutions in terms of k-core minimization while being able to handle large graphs. Moreover, we illustrate how KCM can be applied in the analysis of the k-core resilience of networks.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Search of maximal codes"

1

Landjev, Ivan, and Assia Rousseva. On the Maximal Cardinality of Binary Two-weight Codes. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, October 2021. http://dx.doi.org/10.7546/crabs.2021.10.01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Paulins, V. Ann, Julie L. Hillery, and Aaron Sturgill. Using Personal Mission Statements and Codes of Ethics as Career Search Tools. Ames: Iowa State University, Digital Repository, November 2015. http://dx.doi.org/10.31274/itaa_proceedings-180814-64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Trabia, M. B., M. Kiley, J. Cardle, and M. Joseph. Report on task assignment No. 3 for the Waste Package Project; Parts A & B, ASME pressure vessel codes review for waste package application; Part C, Library search for reliability/failure rates data on low temperature low pressure piping, containers, and casks with long design lives. Office of Scientific and Technical Information (OSTI), July 1991. http://dx.doi.org/10.2172/138422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Elroy-Stein, Orna, and Dmitry Belostotsky. Mechanism of Internal Initiation of Translation in Plants. United States Department of Agriculture, December 2010. http://dx.doi.org/10.32747/2010.7696518.bard.

Full text
Abstract:
Original objectives Elucidation of PABP's role in crTMV148 IRES function in-vitro using wheat germ extract and krebs-2 cells extract. Fully achieved. Elucidation of PABP's role in crTMV148 IRES function in-vivo in Arabidopsis. Characterization of the physical interactions of PABP and other potential ITAFs with crTMV148 IRES. Partly achieved. To conduct search for additional ITAFs using different approaches and evaluate the candidates. Partly achieved. Background of the topic The power of internal translation via the activity of internal ribosomal entry site (IRES) elements allow coordinated synthesis of multiple gene products from a single transcription unit, and thereby enables to bypass the need for sequential transformation with multiple independent transgenes. The key goal of this project was to identify and analyze the IRES-trans-acting factors (ITAFs) that mediate the activity of a crucifer-infecting tobamovirus (crTMV148) IRES. The remarkable conservation of the IRES activity across the phylogenetic spectrum (yeast, plants and animals) strongly suggests that key ITAFs that mediate its activity are themselves highly conserved. Thus, crTMV148 IRES offers opportunity for elucidation of the fundamental mechanisms underlying internal translation in higher plants in order to enable its rational manipulation for the purpose of agricultural biotechnology. Major conclusions and achievements. - CrTMV IRES requires PABP for maximal activity. This conclusion was achieved by PABP depletion and reconstitution of wheat germ- and Krebs2-derived in-vitro translation assays using Arabidopsis-derived PABP2, 3, 5, 8 and yeast Pab1p. - Mutations in the internal polypurine tract of the IRES decrease the high-affinity binding of all phylogenetically divergent PABPs derived from Arabidopsis and yeast in electro mobility gel shift assays. - Mutations in the internal polypurine tract decrease IRES activity in-vivo. - The 3'-poly(A) tail enhances crTMV148 IRES activity more efficiently in the absence of 5'-methylated cap. - In-vivo assembled RNPs containing proteins specifically associated with the IRES were purified from HEK293 cells using the RNA Affinity in Tandem (RAT) approach followed by their identification by mass spectroscopy. - This study yielded a list of potential protein candidates that may serve as ITAFs of crTMV148 IRES activity, among them are a/b tubulin, a/g actin, GAPDH, enolase 1, ribonuclease/angiogenin inhibitor 1, 26S proteasome subunit p45, rpSA, eEF1Bδ, and proteasome b5 subunit. Implications, both scientific and agriculture. The fact that the 3'-poly(A) tail enhances crTMV148 IRES activity more efficiently in the absence of 5'-methylated cap suggests a potential joint interaction between PABP, the IRES sequence and the 3'-poly(A). This has an important scientific implication related to IRES function in general.
APA, Harvard, Vancouver, ISO, and other styles
5

Nelson, Gena. Special Education Math Interventions. Boise State University, March 2021. http://dx.doi.org/10.18122/sped_facpubs/133/boisestate.

Full text
Abstract:
The purpose of document is to provide readers with the coding protocol that authors used to code 22 mathematics intervention meta-analyses focused on participants with or at-risk of disabilities. The author drafted this coding protocol based on the meta-analysis quality indicators recommended by Talbott et al. (2018, pp. 248–249); specifically, the author considered the variables presented in Table 1 of Talbott et al. and supplemented the information so that the variables and definitions were specific to the purpose of this systematic review. We coded each meta-analysis for 53 variables across eight categories, including: Quality of Clear Research Questions, Quality of Eligibility Criteria, Quality of Search Procedures, Quality of Screening Criteria, Quality of Coding Procedures, Quality of Research Participants and Contexts, Quality of Data Analysis Plan, and Quality of Reporting Results. The mean interrater reliability across all codes using this protocol was 87.8% (range across categories = 74% –100%).
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Search of maximal codes' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography