Academic literature on the topic 'Map enumerations'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Map enumerations.'
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 "Map enumerations"
1
Liu, Yanpei. "On functional equations arising from map enumerations." Discrete Mathematics 123, no. 1-3 (December 1993): 93–109. http://dx.doi.org/10.1016/0012-365x(93)90009-i.
Full text
2
Mahmood, M. Kh, and L. Anwar. "The Iteration Digraphs of Lambert Map Over the Local Ring $mathbb{Z}/p^kmathbb{Z}$ : Structures and Enumerations." Iranian Journal of Mathematical Sciences and Informatics 17, no. 2 (September 1, 2022): 307–14. http://dx.doi.org/10.52547/ijmsi.17.2.307.
Full text
3
Chitekwe-Biti, Beth, Patience Mudimu, George Masimba Nyama, and Takudzwa Jera. "Developing an informal settlement upgrading protocol in Zimbabwe – the Epworth story." Environment and Urbanization 24, no. 1 (April 2012): 131–48. http://dx.doi.org/10.1177/0956247812437138.
Full textAbstract:
This paper describes how a settlement profile, mapping and enumeration of Magada, an informal settlement in the town of Epworth just outside Harare, provided the basis for an upgrading programme. This was both in terms of the needed information and in terms of agreement between the residents and their community organizations and local and national government. The local government’s agreement to support in situ upgrading was the first of its kind in Zimbabwe and it is the first settlement plan to include meaningful participation by residents in articulating their own development priorities and in influencing the design. The work to map and number each plot was undertaken by teams that included residents, supported by members of the Zimbabwe Homeless People’s Federation and its support NGO Dialogue on Shelter Trust, along with planning students. This was supported by high resolution satellite images and a GIS process was developed drawing in data from enumerations covering each household. A concept plan was developed and presented to residents and the local government to allow feedback. A survey of buildings showed where there were clusters of commercial activities and allowed mixed land uses to be accommodated in the upgrading plan. Guidelines were developed to show where the proposals contravened existing official standards and to justify what was proposed. The paper ends with a consideration of what still needs to be accomplished – including agreement on the re-alignment of plots, the means for transferring tenure and how to finance proposals. It is hoped that this initiative will lead to a protocol for in situ upgrading that can be used to inform the upgrading process in other cities in Zimbabwe.
4
Thorvaldsen, Gunnar. "Religion in the Census." Social Science History 38, no. 1-2 (2014): 203–20. http://dx.doi.org/10.1017/ssh.2015.16.
Full textAbstract:
This article aims to clarify the scope of questions about religion in population censuses, and attempts to explain why such questions were included or left out of censuses taken in different nations and periods. The quantitative aspect is a fundamental question for students of religion interested in knowing where it is possible to rely on statistics about the size of confessional groups and their basic characteristics. A common use of the census in connection with religion has been to create aggregates about the size of different congregations by nation, and to cross-tabulate this with other variables such as gender, occupations, ethnicity, or regions. Enumerations with questions about religion were performed in many countries from the mid-nineteenth century, but questions about religious affiliation never entered the US censuses, and were left out of most censuses in many other countries as is indicated in the map in figure 1. We shall try to clarify how pressure was put on statistical bureaus, parliaments, and governments to promote or hinder the inclusion of questions about religion.
5
Cheung, Melissa, Jonathan J. Campbell, Robert J. Thomas, Julian Braybrook, and Jon Petzing. "Assessment of Automated Flow Cytometry Data Analysis Tools within Cell and Gene Therapy Manufacturing." International Journal of Molecular Sciences 23, no. 6 (March 17, 2022): 3224. http://dx.doi.org/10.3390/ijms23063224.
Full textAbstract:
Flow cytometry is widely used within the manufacturing of cell and gene therapies to measure and characterise cells. Conventional manual data analysis relies heavily on operator judgement, presenting a major source of variation that can adversely impact the quality and predictive potential of therapies given to patients. Computational tools have the capacity to minimise operator variation and bias in flow cytometry data analysis; however, in many cases, confidence in these technologies has yet to be fully established mirrored by aspects of regulatory concern. Here, we employed synthetic flow cytometry datasets containing controlled population characteristics of separation, and normal/skew distributions to investigate the accuracy and reproducibility of six cell population identification tools, each of which implement different unsupervised clustering algorithms: Flock2, flowMeans, FlowSOM, PhenoGraph, SPADE3 and SWIFT (density-based, k-means, self-organising map, k-nearest neighbour, deterministic k-means, and model-based clustering, respectively). We found that outputs from software analysing the same reference synthetic dataset vary considerably and accuracy deteriorates as the cluster separation index falls below zero. Consequently, as clusters begin to merge, the flowMeans and Flock2 software platforms struggle to identify target clusters more than other platforms. Moreover, the presence of skewed cell populations resulted in poor performance from SWIFT, though FlowSOM, PhenoGraph and SPADE3 were relatively unaffected in comparison. These findings illustrate how novel flow cytometry synthetic datasets can be utilised to validate a range of automated cell identification methods, leading to enhanced confidence in the data quality of automated cell characterisations and enumerations.
6
Sun, Jinping, Qing Li, Xuwang Zhang, and Wei Sun. "An Efficient Implementation of Track-Oriented Multiple Hypothesis Tracker Using Graphical Model Approaches." Mathematical Problems in Engineering 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/8061561.
Full textAbstract:
The multiple hypothesis tracker (MHT) is currently the preferred method for addressing data association problem in multitarget tracking (MTT) application. MHT seeks the most likely global hypothesis by enumerating all possible associations over time, which is equal to calculating maximum a posteriori (MAP) estimate over the report data. Despite being a well-studied method, MHT remains challenging mostly because of the computational complexity of data association. In this paper, we describe an efficient method for solving the data association problem using graphical model approaches. The proposed method uses the graph representation to model the global hypothesis formation and subsequently applies an efficient message passing algorithm to obtain the MAP solution. Specifically, the graph representation of data association problem is formulated as a maximum weight independent set problem (MWISP), which translates the best global hypothesis formation into finding the maximum weight independent set on the graph. Then, a max-product belief propagation (MPBP) inference algorithm is applied to seek the most likely global hypotheses with the purpose of avoiding a brute force hypothesis enumeration procedure. The simulation results show that the proposed MPBP-MHT method can achieve better tracking performance than other algorithms in challenging tracking situations.
7
CHAMPARNAUD, J. M., and F. COULON. "ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON." International Journal of Foundations of Computer Science 16, no. 06 (December 2005): 1253–66. http://dx.doi.org/10.1142/s0129054105003790.
Full textAbstract:
Our aim is to enumerate all NFAs (nondeterministic finite automata) that recognize a given regular language [Formula: see text]. More precisely, we produce a set 𝔸 of automata such that each automaton A recognizing [Formula: see text] appears in 𝔸 up to the merging of some states and the addition of some transitions, that is, there is a surjective morphism that maps A onto an automaton of 𝔸. We provide a common theoretical framework, based on morphism properties, to previous works of Kameda and Weiner (1970), and of Sengoku (1992), whose issue is the minimization of NFAs. Our paper gives two incomparable enumeration techniques. Both proceed by enumerating a specific class of grid covers of the automaton map. The first one is related to the canonical automaton introduced by Carrez. The second one is based on new outcomes related to the relationship between grid covers and their projections.
8
Karsznia, Izabela. "How does the enumeration unit size influence spatial pattern recognition in choropleth maps? User study." Abstracts of the ICA 1 (July 15, 2019): 1–2. http://dx.doi.org/10.5194/ica-abs-1-161-2019.
Full textAbstract:
<p><strong>Abstract.</strong> The recognition and preservation of the characteristic elements of visualization are one of the fundamental principles of map design, especially in map generalization. As underlined by numerous authors, the importance of preserving or even highlighting the context of the visualization constitutes one of the more significant challenges in cartographic generalization (Mackaness W. A., Ruas A., and Sarjakoski L. T., 2007; Burghardt D., Duchêne C., and Mackaness W. A., 2014). Cartographic generalization, which tailors a map and other graphics to the map’s purpose, detail level, as well as the intended audience’s requirements; is a difficult but necessary task for the map designer. Without careful and meaningful generalization, maps will not convey the essential patterns contained in the data (Maceachren and Ganter, 1990; Mackaness and Edwards, 2002; Zhang and Guilbert, 2016; Yu 2018).</p><p>The research on cartographic generalization and pattern recognition concerning topographic maps is very rich. Since the 1960s, when the period of automated generalization began, the issues connected with pattern recognition and preservation were also being tackled from many aspects. These concerned point pattern preservation, including building typification (Regnauld 2001; Sester 2001; Ai and Liu 2002; Burghardt and Cecconi 2003; Yan and Weibel 2008; Yan and Li 2013; Bereuter and Weibel 2017; Yu 2018), line pattern recognition (Heinzle and Anders 2007; Yang B., Luan X., Li Q.,2010; Touya 2010; Wang 2012; Brewer et al. 2013; Shoman W., and Gülgen F., 2017), and polygon pattern analysis (Steiniger S., et al 2006; Atwood Williams and Wentz 2008; Sayidov and Weibel 2016).</p><p>On the other hand, in thematic mapping, especially in choropleth map design, cartographic generalization and pattern recognition also play an important role as they help to preserve and convey spatial information (Maceachren 1982). The effectiveness with which thematic maps communicate spatial information is reflected in previous research (Maceachren 1982). It is often associated with map complexity, which is influenced by many factors, including the number of classes, the degree of autocorrelation present in the data, the choice of class intervals, and the shape and size of the enumeration units (Mersy 1990). Map complexity is related to spatial pattern recognition and is often ‘regarded as the visual intricacy of the spatial patterns formed by the map symbols’ (Mersy 1990: 15) which form specific patterns that are important to preserve in the thematic map generalization process.</p><p>In thematic maps, generalization takes place when either the number of classes is decreased or the enumeration unit size is increased. While aspects related to optimal data classification methods and the number of classes have been extensively examined (Chang 1976; Chang 1977; Cox 1976; Dent 1999; Slocum et al. 2008; Cabello et al. 2010), the size of the enumeration unit as well as its influence on pattern recognition has not, so far, been the subject of in-depth empirical studies. Robinson (1984) notes that an enumeration unit which is too small in size in thematic map, results in a dispersed image and difficulty in perceiving characteristic elements in the data. A generalization level which is too small causes the image to be blurred and diffuse. As a result the user loses the picture of the whole, the context, and the characteristic elements of the structure – he or she is no longer able to see the relevant spatial patterns. At the same time, a generalization level which is too large, as expressed by the size of the enumeration unit in choropleth maps, also causes the characteristic elements in the data to be lost, as the visualization is too general. In both cases, a too strong simplification of the map pattern might result in the loss of valuable information for the map reader (Bregt and Wopereis 1990). Thus the enumeration unit size for thematic maps should be designed in such a way as to preserve specific global and local spatial patterns.</p><p>The challenge, therefore, is to find the optimal generalization level whereby the spatial patterns present in the data are adequately transformed and can be distinguished by the user. Thus the research goal is an attempt to answer the question as to whether specific presentation methods, namely choropleth maps with particular enumeration unit sizes, result in a more effective recognition of the characteristic patterns or trends in data. We also want to answer the question: do users prefer methods which have specific enumeration unit sizes? The presented research aims to answer where the approximate limit may lie, expressed by the enumeration unit size after which the user loses the possibility of correctly and effectively exploring the spatial patterns presented on thematic maps.</p><p>To answer this research question an empirical user study is being designed. In this study, we would like to investigate the effectiveness of conveying spatial patterns on choropleth maps using different enumeration unit sizes. Within the study, choropleth map variants will be compared to a symbol map presenting the phenomena in a discreet way. The symbol map being used as a reference for the choropleth maps can be treated as a presentation of the raw data. We will consider choropleth maps that have several hexagonal enumeration unit shape. Four enumeration unit sizes will be assessed. The users will be asked to evaluate the similarity of the choropleth map variants to the reference symbol map, and nominate their preferred map. An example of the stimuli to be presented to users is shown in Figure 1.</p><p>The empirical study will be conducted with over 100 high school students. The main assumptions, as well as the preliminary results of the user study, will be discussed. Within the user study, among other tasks, two task types concerning map reading at both a general and a detailed reading level are being planned. One task type concerns map reading, especially the possibilities for conveying spatial patterns at a general reading level. The second task type will concern map comprehension at a detailed reading level. We believe it will allow us to verify which size of enumeration unit works better at a particular map reading level. We also want to explore which enumeration unit size works better for a particular task type. The assumptions will be verified based on the usability performance metrics: the correctness, the speed of the users’ responses as well as the users’ preferences.</p>
9
Gastner, Michael T., Nihal Z. Miaji, and Adi Singhania. "Smooth Pycnophylactic Interpolation Produced by Density-Equalising Map Projections." Kartografija i geoinformacije 21, no. 37 (June 20, 2022): 60–69. http://dx.doi.org/10.32909/kg.21.37.3.
Full textAbstract:
A large amount of quantitative geospatial data is collected and aggregated in discrete enumeration units (e.g. countries or states). Smooth pycnophylactic interpolation aims to find a smooth, nonnegative function such that the area integral over each enumeration unit is equal to the aggregated data. Conventionally, smooth pycnophylactic interpolation is achieved by a cellular automaton algorithm that converts a piecewise constant function into an approximately smooth function defined on a grid of coordinates on an equal-area map. An alternative approach, proposed by Tobler in 1976, is to construct a density-equalising map projection in which areas of enumeration units are proportional to the aggregated data. A pycnophylactic interpolation can be obtained from the Jacobian of this projection. Here, we describe a software implementation of this method. Although solutions are not necessarily optimal in terms of predefined quantitative measures of smoothness, our method is computationally efficient and can potentially be used in tandem with other methods to accelerate convergence towards an optimal solution.
10
Karsznia, Izabela, Izabela Małgorzata Gołębiowska, Jolanta Korycka-Skorupa, and Tomasz Nowacki. "Searching for an Optimal Hexagonal Shaped Enumeration Unit Size for Effective Spatial Pattern Recognition in Choropleth Maps." ISPRS International Journal of Geo-Information 10, no. 9 (August 25, 2021): 576. http://dx.doi.org/10.3390/ijgi10090576.
Full textAbstract:
Thoughtful consideration of the enumeration unit size in choropleth map design is important to ensure the correct communication of spatial information. However, the enumeration unit size and its influence on pattern conveying in choropleth maps have not yet been the subject of in-depth empirical studies. This research aims to address this gap. We focused on the issue concerning whether the ability to recognize spatial patterns on an Equal Area Unit Map is related to the hexagonal enumeration unit size, defined by the number of pixels. The aim is to indicate the range of the enumeration unit sizes, namely, at what point the upper and lower borders of the range where the spatial patterns start, and where the end is visible and recognizable by users. To address this problem, we conducted an empirical study with 488 users. The results show that the enumeration unit size has an impact on the users’ spatial pattern recognition abilities. Choropleth maps with enumeration unit sizes of 26, 52, and 104 pixels were, in the majority, indicated by participants as those most suitable for indicating spatial patterns. This was in contrast to choropleth maps with enumeration unit sizes of 1664 and 3328 pixels, which users indicated as not being useful. However, there were some exceptions to this general finding. Thus, determining the optimal enumeration unit size is a challenging task, and requires further insightful investigations.
Dissertations / Theses on the topic "Map enumerations"
1
Egebrand, August. "Feynman Diagrams and Map Enumeration." Thesis, Uppsala universitet, Teoretisk fysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474.
Full textAbstract:
The goal of this thesis is to count how many graphs exist given a number of verticesor some other restrictions. The graphs are counted by perturbing Gaussian integralsand using the Wick lemma to interpret the perturbations in terms of graphs. Fatgraphs, a specific type of graph, are central in this thesis. A method based onorthogonal polynomials to count fat graphs is presented. The thesis finishes with theformulation and some results related to the three-color problem.
2
Brown, Tova, and Tova Brown. "Asymptotics and Dynamics of Map Enumeration Problems." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/621078.
Full textAbstract:
We solve certain three-term recurrence relations for generating functions of map enumeration problems. These are combinatorial maps, an embedding of a graph into a surface in a particular way. The generating functions enumerate the maps according to an appropriate notion of a distance or height in the map. These problems were studied and the recurrence relations derived in [BDFG03] and [BM06].By viewing the three-term recurrence as giving a two-dimensional discrete dynamical system, these combinatorial problems are set in the context of discrete dynamical systems and integrable systems theory. The integrable nature of the system was made apparent by numerical study, and is confirmed by recognition that the recurrences are autonomous discrete Painleve-I equations. The autonomous discrete Painleve equations are known to be instances of the QRT Mapping, named for Quispel, Roberts, and Thompson [QRT88, QRT89], an integrable structure with explicitly-given invariant. Level sets of such invariants are in general elliptic curves, and thus orbits in the dynamical systems can be parametrized through elliptic functions. The solution to a recurrence relation for combinatorial generating functions is rigorously derived from the general elliptic parametrization of the dynamical system, as the combinatorial initial condition indicates that the combinatorial orbit actually lies on a stable manifold of a hyperbolic fixed point of the system. This special orbit thus lies on a separatrix of the system, which is given by a degeneration in the elliptic nature of the level sets of the invariant function. These solutions have a particularly nice algebraic form, which is seen to be a consequence of the degeneration of the elliptic parametrization. The framework and method are general, applicable to any combinatorial enumeration problem that arises with a similar QRT-type structure.
3
Acosta, Jaramillo Enrique. "Leading Order Asymptotics of a Multi-Matrix Partition Function for Colored Triangulations." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/293410.
Full textAbstract:
We study the leading order asymptotics of a Random Matrix theory partition function related to colored triangulations. This partition function comes from a three Hermitian matrix model that has been introduced in the physics literature. We provide a detailed and precise description of the combinatorial objects that the partition function counts that has not appeared previously in the literature. We also provide a general framework for studying the leading order asymptotics of an N dimensional integral that one encounters studying the partition function of colored triangulations. The results are obtained by generalizing well know results for integrals coming from Hermitian matrix models with only one matrix that give the leading order asymptiotics in terms of a finite dimensional variational problem. We apply these results to the partition function for colored triangulations to show that the minimizing density of the variational problem is unique, and agrees with the one proposed in the physics literature. This provides the first complete mathematically rigorous description of the leading order asymptotics of this matrix model for colored triangulations.
4
Brown, Daniel. "Differential Equations and Depth First Search for Enumeration of Maps in Surfaces." Thesis, University of Waterloo, 1999. http://hdl.handle.net/10012/1063.
Full textAbstract:
A map is an embedding of the vertices and edges of a graph into a compact 2-manifold such that the remainder of the surface has components homeomorphic to open disks. With the goal of proving the Four Colour Theorem, Tutte began the field of map enumeration in the 1960's. His methods included developing the edge deletion decomposition, developing and solving a recurrence and functional equation based on this decomposition, and developing the medial bijection between two equinumerous infinite families of maps. Beginning in the 1980's Jackson, Goulden and Visentin applied algebraic methods in enumeration of non-planar and non-orientable maps, to obtain results of interest for mathematical physics and algebraic geometry, and the Quadrangulation Conjecture and the Map-Jack Conjecture. A special case of the former is solved by Tutte's medial bijection. The latter uses Jack symmetric functions which are a topic of active research. In the 1960's Walsh and Lehman introduced a method of encoding orientable maps. We develop a similar method, based on depth first search and extended to non-orientable maps. With this, we develop a bijection that extends Tutte's medial bijection and partially solves the Quadrangulation Conjecture. Walsh extended Tutte's recurrence for planar maps to a recurrence for all orientable maps. We further extend the recurrence to include non-orientable maps, and express it as a partial differential equation satisfied by the generating series. By appropriately interpolating the differential equation and applying the depth first search method, we construct a parameter that empirically fulfils the conditions of the Map-Jack Conjecture, and we prove some of its predicted properties. Arques and Beraud recently obtained a continued fraction form of a specialisation of the generating series for maps. We apply the depth search method with an ordinary differential equation, to construct a bijection whose existence is implied by the continued fraction.
5
Serrano, Luis. "Transitive Factorizations of Permutations and Eulerian Maps in the Plane." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1128.
Full textAbstract:
The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation with a specified cycle type, with certain conditions on the cycle types of the factors, such as minimality and transitivity.
Goulden and Jackson have given a proof for the number of minimal, transitive factorizations of a permutation into transpositions. This proof involves a partial differential equation for the generating series, called the Join-Cut equation. Furthermore, this argument is generalized to surfaces of higher genus. Recently, Bousquet-Mélou and Schaeffer have found the number of minimal, transitive factorizations of a permutation into arbitrary unspecified factors. This was proved by a purely combinatorial argument, based on a direct bijection between factorizations and certain objects called m-Eulerian trees.
In this thesis, we will give a new proof of the result by Bousquet-Mélou and Schaeffer, introducing a simple partial differential equation. We apply algebraic methods based on Lagrange's theorem, and combinatorial methods based on a new use of Bousquet-Mélou and Schaeffer's m-Eulerian trees. Some partial results are also given for a refinement of this problem, in which the number of cycles in each factor is specified. This involves Lagrange's theorem in many variables.
6
Zhang, Zhihan. "NSEA: n-Node Subnetwork Enumeration Algorithm Identifies Lower Grade Glioma Subtypes with Altered Subnetworks and Distinct Prognostics." Case Western Reserve University School of Graduate Studies / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=case148595901371196.
Full text
7
La, Croix Michael Andrew. "The combinatorics of the Jack parameter and the genus series for topological maps." Thesis, 2009. http://hdl.handle.net/10012/4561.
Full textAbstract:
Informally, a rooted map is a topologically pointed embedding of a graph in a surface. This thesis examines two problems in the enumerative theory of rooted maps.
The b-Conjecture, due to Goulden and Jackson, predicts that structural similarities between the generating series for rooted orientable maps with respect
to vertex-degree sequence, face-degree sequence, and number of edges, and
the corresponding generating series for rooted locally orientable maps, can be
explained by a unified enumerative theory. Both series specialize M(x,y,z;b), a
series defined algebraically in terms of Jack symmetric functions, and the unified
theory should be based on the existence of an appropriate integer valued invariant of rooted maps with respect to which M(x,y,z;b) is the generating series for locally orientable maps. The conjectured invariant should take the value zero when evaluated on orientable maps, and should take positive values when evaluated on non-orientable maps, but since it must also depend on
rooting, it cannot be directly related to genus.
A new family of candidate invariants, η, is described recursively in terms of root-edge deletion. Both the generating series for rooted maps with respect to η and an appropriate specialization of M satisfy the same differential equation with a unique solution. This shows that η gives the appropriate enumerative theory when vertex degrees are ignored, which is precisely the setting required by Goulden, Harer, and Jackson for an application to algebraic geometry. A functional equation satisfied by M and the existence of a bijection between
rooted maps on the torus and a restricted set of rooted maps on the Klein bottle show that η has additional structural properties that are required of the conjectured invariant.
The q-Conjecture, due to Jackson and Visentin, posits a natural combinatorial
explanation, for a functional relationship between a generating series for rooted
orientable maps and the corresponding generating series for 4-regular rooted
orientable maps. The explanation should take the form of a bijection, ϕ, between appropriately decorated rooted orientable maps and 4-regular rooted orientable
maps, and its restriction to undecorated maps is expected to be related to the
medial construction.
Previous attempts to identify ϕ have suffered from the fact that the existing
derivations of the functional relationship involve inherently non-combinatorial
steps, but the techniques used to analyze η suggest the possibility of a new derivation of the relationship that may be more suitable to combinatorial analysis. An examination of automorphisms that must be induced by ϕ gives evidence for a refinement of the functional relationship, and this leads to a more combinatorially refined conjecture. The refined conjecture is then reformulated algebraically so that its predictions can be tested numerically.
Books on the topic "Map enumerations"
1
Bristol and Avon Family History Society. Maps of Enumeration Districts in Bristol and its Suburbs. Bristol: Bristol and Avon Family History Society, 1989.
Find full text
2
Leighton, Hudson. City of Saint Paul, Minnesota enumeration districts, 13th federal census, 1910. Roseville, MN: Park Genealogical Books, 1997.
Find full text
3
Officer, Alberta Chief Electoral. The report of the Chief Electoral Officer on the 2004 provincial enumeration and Monday, November 22, 2004 provincial general election of the twenty-sixth Legislative Assembly. Edmonton]: Office of the Chief Electoral Officer, 2005.
Find full text
4
Olshanski, Grigori. Enumeration of maps. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.26.
Full textAbstract:
This article discusses the relationship between random matrices and maps, i.e. graphs drawn on surfaces, with particular emphasis on the one-matrix model and how it can be used to solve a map enumeration problem. It first provides an overview of maps and related objects, recalling the basic definitions related to graphs and defining maps as graphs embedded into surfaces before considering a coding of maps by pairs of permutations. It then examines the connection between matrix integrals and maps, focusing on the Hermitian one-matrix model with a polynomial potential and how the formal expansion of its free energy around a Gaussian point (quadratic potential) can be represented by diagrams identifiable with maps. The article also illustrates how the solution of the map enumeration problem can be deduced by means of random matrix theory (RMT). Finally, it explains how the matrix model result can be translated into a bijective proof.
5
Yanpei, Liu. Enumerative Theory Of Maps. Springer, 2012.
Find full text
6
Enumerative Theory of Maps. Springer, 2000.
Find full text
7
Givens, Terryl L. Sacramental Ordinances—Salvific. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794935.003.0006.
Full textAbstract:
Mormons do not have formal categories or enumeration of sacraments, but five are essential for salvation and are thus administered for the living and the dead: baptism, conferral of Holy Ghost, priesthood ordination (male only), endowment, and sealing. Baptism is for remission of sins but also signifies adoption into the heavenly family. Earlier, Mormons performed re-baptisms to signify recommitment and baptisms for health. Conferral of the Holy Ghost is by laying on of hands. Priesthood, being an eternal order, is conferred even upon the deceased. The endowment involves washings, anointings, and a series of sacred covenants or obligations—and has precedent in ancient texts and practices. Sealing in this context refers to the binding together in eternal relation a man and woman. Mormon theology of gender as eternal and complementary founds their practice of man-woman marriage only.
8
Bouttier, Jeremie. Knot theory and matrix integrals. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.27.
Full textAbstract:
This article considers some enumeration problems in knot theory, with a focus on the application of matrix integral techniques. It first reviews the basic definitions of knot theory, paying special attention to links and tangles, especially 2-tangles, before discussing virtual knots and coloured links as well as the bare matrix model that describes coloured link diagrams. It shows how the large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalization of the potential. This extends into two directions: first, higher genus and the counting of ‘virtual’ links and tangles, and second, the counting of ‘coloured’ alternating links and tangles. The article analyses the asymptotic behaviour of the number of tangles as the number of crossings goes to infinity
9
Guionnet, Alice. Free probability. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198797319.003.0003.
Full textAbstract:
Free probability was introduced by D. Voiculescu as a theory of noncommutative random variables (similar to integration theory) equipped with a notion of freeness very similar to independence. In fact, it is possible in this framework to define the natural ‘free’ counterpart of the central limit theorem, Gaussian distribution, Brownian motion, stochastic differential calculus, entropy, etc. It also appears as the natural setup for studying large random matrices as their size goes to infinity and hence is central in the study of random matrices as their size go to infinity. In this chapter the free probability framework is introduced, and it is shown how it naturally shows up in the random matrices asymptotics via the so-called ‘asymptotic freeness’. The connection with combinatorics and the enumeration of planar maps, including loop models, are discussed.
10
Ohio Genealogical Society. Muskingum County Chapter., ed. Genealogical gleanings from Highland & Monroe Townships, Muskingum County, Ohio: History, cemetery tombstone inscriptions, maps, censuses of heads of households, 1820-1840, 1850 census enumerations, directories & plats. Zanesville, Ohio: Muskingum County Genealogical Society, 1985.
Find full textBook chapters on the topic "Map enumerations"
1
Malik, Waqar. "Enumerations." In Learn Swift 2 on the Mac, 101–7. Berkeley, CA: Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1627-9_10.
Full text
2
Downs, Martin, and Gareth A. Jones. "Möbius Inversion in Suzuki Groups and Enumeration of Regular Objects." In Symmetries in Graphs, Maps, and Polytopes, 97–127. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30451-9_5.
Full text
3
Braak, Daniel. "What Kind of Insight Provide Analytical Solutions of Quantum Models?" In International Symposium on Mathematics, Quantum Theory, and Cryptography, 5–6. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_2.
Full textAbstract:
Abstract There are several concepts of what constitutes the analytical solution of a quantum model, as opposed to the mere “numerically exact” one. This applies even if one considers only the determination of the discrete spectrum of the corresponding Hamiltonian, setting aside such important questions as the asymptotic dynamics for long times. In the simplest case, the spectrum can be given in closed form, the eigenvalues $$E_{j}, j=0,\ldots ,N\le \infty $$ read $$E_{j} =f(j,\{p_{k}\})$$, where f is a known function of the label $$j\in \mathbb {N}_{0}$$ and the $$\{p_k\}$$ are a set of numbers parameterizing the Hamilton operator. This kind of solution exists only in cases where the classical limit of the model is Liouville-integrable. Some quantum-mechanical many-body systems allow the determination of the spectrum in terms of auxiliary parameters $$[\{k_j\},\{n_l\}]$$ as $$E(\{n_l\}) = f(\{k_{j}(\{n_{l}\})\})$$ where the $$\{k_{j}(\{n_{l}\})\}$$ satisfy a coupled set of transcendental equations, following from a certain ansatz for the eigenfunctions. These systems (integrable in the sense of Yang-Baxter (Eckle 2019)) may have a Hilbert space dimension growing exponentially with the system size L, i.e., $$N\sim e^{L}$$. The simple enumeration of the energies with the label j is replaced by the multi-index $$\{n_{l}\}$$. Although no priori knowledge about the spectrum is available, its statistical properties can be computed exactly (Berry and Tabor 1977). Other integrable and also non-integrable models exist where N depends polynomially on L and the energies $$E_j$$ are the zeroes of an analytically computable transcendental function, the so-called G-function $$G(E,\{p_k\})$$ (Braak 2013a, 2016), which is proportional to the spectral determinant. Although no closed formula for $$E_j$$ as function of the index j exists, detailed qualitative insight into the distribution of the eigenvalues can be obtained (Braak 2013b). Possible applications of these concepts to information compression and cryptography are outlined.
4
"Scanning and Enumeration Phase." In Constructing an Ethical Hacking Knowledge Base for Threat Awareness and Prevention, 149–77. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7628-0.ch006.
Full textAbstract:
In ethical hacking, the reconnaissance phase is followed by the scanning and enumeration phase where the information collected from reconnaissance phase is used to examine the target or target network further for getting specific details such as computer names, IP addresses, open ports, user accounts, running services, OS details, system architecture, vulnerabilities, etc. This chapter introduces different scanning and enumeration tools used in the scanning phase of the ethical hacking process in detail. One may use scanning and enumeration tools and techniques involving packet crafting tools, packet analyzers, port scanners, network mappers, sweepers, and vulnerability scanners during this phase. The chapter introduces tools like Hping3, NMAP security scanner, Colasoft packet builder to create custom packets, vulnerability scanners such as Nessus, Netbios enumeration technique, Hyena, remote administration of network devices using advanced IP scanner, global network inventory, network mapping using the dude network monitor, banner grabbing using ID serve, SNMP enumeration technique, creating NetBIOS null session to enumerate, etc. The chapter also provides the details of maintaining privacy and anonymity while carrying out such scanning and enumeration attacks.
5
Wilson, Robin. "2. Four types of problem." In Combinatorics: A Very Short Introduction, 7–27. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.003.0002.
Full textAbstract:
‘Four types of problem’ explains that combinatorics is concerned with four types of problem: existence problems (does x exist?); construction problems (if x exists, how can we construct it?); enumeration problems (how many x are there?); and optimization problems (which x is best?). Existence problems discussed include tilings, placing dominoes on a chess board, the knight’s tour problem, the Königsberg bridges problem, the Gas–Water–Electricity problem, and the map-colour problem. Construction problems include solving mazes, and the two types of enumeration problems considered are counting problems and listing problems. Examples of an optimization problem include the minimum connector problem and the travelling salesman problem. The efficiency of algorithms is also explained.
6
N., Shyamala Devi, and Sharmila K. "Tapering Malicious Language for Identifying Fake Web Content." In Advances in Digital Crime, Forensics, and Cyber Terrorism, 206–16. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-6684-6444-1.ch011.
Full textAbstract:
The neoteric occurrence, the pandemic, and global crisis entails the extensive use of web portals to unfurl information. While this has built the cognizance of the common man, the infinitely unnoticed enumeration of malicious content on the web has escalated copiously. Spurious data and fake information has done more harm than what is actually unraveled to the public; however, scrupulously meticulous measures to agonize their source and delve into mitigating these data has become quite a challenge. This indignation delves into step-wise analysis of identifying the hoax through systematically programmed algorithms using natural language processing.
7
Zhong, Chunfu, and Zhiwu Li. "Petri Net Based Deadlock Prevention Approach for Flexible Manufacturing Systems." In Reconfigurable Embedded Control Systems, 416–33. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-086-0.ch015.
Full textAbstract:
In flexible manufacturing systems, deadlocks usually occur due to the limited resources. To cope with deadlock problems, Petri nets are widely used to model these systems. This chapter focuses on deadlock prevention for flexible manufacturing systems that are modeled with S4R nets, a subclass of generalized Petri nets. The analysis of S4R leads us to derive an iterative deadlock prevention approach. At each iteration step, a non-max-controlled siphon is derived by solving a mixed integer linear programming. A monitor is constructed for the siphon such that it is max-controlled. Finally, a liveness-enforcing Petri net supervisor can be derived without enumerating all the strict minimal siphons.
8
Forsdick, Charles. "Vertical Travel, Listing and the Enumeration of the Everyday." In What Forms Can Do, 131–46. Liverpool University Press, 2020. http://dx.doi.org/10.3828/liverpool/9781789620658.003.0009.
Full textAbstract:
Drawing on the work of Georges Perec, and focusing on other authors such as Julio Cortazar and François Maspero, the chapter begins with an analysis of the phenomenon of vertical travel. It explores the ways in which the disruption of the traditional (horizontal) axis of the journey provides access to often unseen aspects of the everyday. In discerning a poetics of such a practice, the chapter privileges processes of listing and enumeration. Perec's use of observational catalogues is seen in particular as a challenge to any understanding of the list as a ‘subsumptive’ form that identifies a thing by subordinating it under a particular category. Instead, he demonstrates how lists may articulate what is observed in very different ways: arranging, combining, and ordering words, observations and things sequentially not only subverts categorical hierarchies, but also has positively generative qualities in creating new epistemological orderings. The chapter concludes with a discussion of the power of the list to subvert established orders of knowledge and to suggest alternative means of making sense of the everyday.
9
Mix, Kelly S. "The Cognitive Foundations of Early Childhood Numeracy." In Handbook of Research on Innovative Approaches to Early Childhood Development and School Readiness, 317–48. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-7998-8649-5.ch014.
Full textAbstract:
This chapter provides an overview of the challenges facing young children as they acquire early number concepts, and the power of domain general processes to support this learning. Four specific domain general cognitive processes are reviewed—statistical learning, structure mapping, language acquisition, and spatial cognition. For each one, there is evidence presented for the process itself in the literature on early childhood learning, and evidence presented for its contribution to number learning in the literature on number concept development. These processes alone might explain the origins of numeracy without appealing to inborn enumeration or quantitative representations. In either case, these processes clearly play a major role and may be useful leverage points for teachers, caregivers, and parents seeking to support children's learning.
10
Rai, Jitendra Kumar, Atul Negi, and Rajeev Wankar. "Using Machine Learning Techniques for Performance Prediction on Multi-Cores." In Applications and Developments in Grid, Cloud, and High Performance Computing, 259–73. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2065-0.ch017.
Full textAbstract:
Sharing of resources by the cores of multi-core processors brings performance issues for the system. Majority of the shared resources belong to memory hierarchy sub-system of the processors such as last level caches, prefetchers and memory buses. Programs co-running on the cores of a multi-core processor may interfere with each other due to usage of such shared resources. Such interference causes co-running programs to suffer with performance degradation. Previous research works include efforts to characterize and classify the memory behaviors of programs to predict the performance. Such knowledge could be useful to create workloads to perform performance studies on multi-core processors. It could also be utilized to form policies at system level to mitigate the interference between co-running programs due to use of shared resources. In this work, machine learning techniques are used to predict the performance on multi-core processors. The main contribution of the study is enumeration of solo-run program attributes, which can be used to predict concurrent-run performance despite change in the number of co-running programs sharing the resources. The concurrent-run involves the interference between co-running programs due to use of shared resources.
Conference papers on the topic "Map enumerations"
1
Afrati, F. N., D. Fotakis, and J. D. Ullman. "Enumerating subgraph instances using map-reduce." In 2013 29th IEEE International Conference on Data Engineering (ICDE 2013). IEEE, 2013. http://dx.doi.org/10.1109/icde.2013.6544814.
Full text
2
Yang, Xiao, Jaroslaw Zola, and Srinivas Aluru. "Parallel Metagenomic Sequence Clustering Via Sketching and Maximal Quasi-clique Enumeration on Map-Reduce Clouds." In Distributed Processing Symposium (IPDPS). IEEE, 2011. http://dx.doi.org/10.1109/ipdps.2011.116.
Full text
3
Sleijfer, Stefan. "Abstract CN3-2: Enumeration and characterization of CTCs." In Abstracts: AACR International Conference on Translational Cancer Medicine--; Mar 21–24, 2010; Amsterdam, The Netherlands. American Association for Cancer Research, 2010. http://dx.doi.org/10.1158/1078-0432.tcme10-cn3-2.
Full text
4
Pan, Long, and Eunice E. . Santos. "An anytime-anywhere approach for maximal clique enumeration in social network analysis." In 2008 IEEE International Conference on Systems, Man and Cybernetics (SMC). IEEE, 2008. http://dx.doi.org/10.1109/icsmc.2008.4811845.
Full text
5
Farid, Amro M. "An Axiomatic Design Approach to Production Path Enumeration in Reconfigurable Manufacturing Systems." In 2013 IEEE International Conference on Systems, Man and Cybernetics (SMC 2013). IEEE, 2013. http://dx.doi.org/10.1109/smc.2013.659.
Full text
6
Gocht, Stephan, Ciaran McCreesh, and Jakob Nordström. "Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions." 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/158.
Full textAbstract:
Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as degree sequences and path counts. We show that all of this reasoning can be justified compactly using the cutting planes proofs studied in complexity theory. This allows us to extend a state of the art subgraph isomorphism enumeration solver with proof logging support, so that the solutions it outputs may be audited and verified for correctness and completeness by a simple third party tool which knows nothing about graph theory.
7
Garcia, Alfonso, Trevor Place, Michael Holm, Jennifer Sargent, and Andrew Oliver. "Pipeline Sludge Sampling for Assessing Internal Corrosion Threat." In 2014 10th International Pipeline Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/ipc2014-33113.
Full textAbstract:
Internal corrosion sometimes occurs under deposits of solid particles on the bottom of transmission pipelines. The solids trap water with soluble products and other nutrients which can support the development of microbial communities and may lead to Microbiologically Influenced Corrosion (MIC). Corrosion processes associated with the metabolic activities of specific bacteria have been discussed elsewhere, but the simple presence of large microbial populations may increase the risk of internal corrosion owing to the ability of biofilms to extract and concentrate water at the pipe floor. As a method to monitor the internal corrosion threat in transmission pipelines and recommend mitigating activities for corrosion management, reliable microbial content and corrosion activity correlations are desired. Sludge samples have been obtained from cleaning pigs at the pipe trap and analyzed using Biological Activity Reaction Test (BART™) (or serial dilution test), Dean-Stark analysis, XRD and EDX. These tests provide information about certain bacterial populations, water / solid / hydrocarbon content, and crystalline/elemental composition of these solids, respectively. Despite best efforts, bacterial population/activity of pipeline sludge samples exhibit high variability and are difficult to correlate to actual internal corrosion in a pipeline. Considering that bacterial populations in pipeline sludge may be a meaningful representation of the internal corrosion threat to a transmission pipeline, a more rigorous approach on the sludge sampling procedure is necessary to improve the accuracy and reliability of the bacterial assays. It is also important to control such variables as storage temperature of the samples, exposure to air, and storage duration prior to enumeration — as these may affect the viability of the sample and enumeration results. This report presents historical pipeline sludge analysis data and suggests a method to evaluate data containing high variability. Practical recommendations to reduce data variability through handling and storage of sludge samples are also discussed.
8
Joshi, N., S. Watanabe, P. A. Reyfman, A. Bharat, G. S. Budinger, and A. Misharin. "Single Nuclei RNA-Seq for Unbiased Enumeration of Cell Types in Archival Frozen Human Lung Tissues." In American Thoracic Society 2019 International Conference, May 17-22, 2019 - Dallas, TX. American Thoracic Society, 2019. http://dx.doi.org/10.1164/ajrccm-conference.2019.199.1_meetingabstracts.a6077.
Full text
9
Clarke, Mary Ann D., and Christopher J. Freitas. "N-Phase Interface Tracking Method Based on Prime Enumeration of Microcells." In ASME 2004 Heat Transfer/Fluids Engineering Summer Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/ht-fed2004-56136.
Full textAbstract:
This paper presents a general method for tracking N incompressible materials and their associated interfaces, where N may be an integer greater than 2. Two key components are fundamental to the method. First, is the concept of a microgrid element or cell, which is uniquely identified or associated with a fluid material. Second, is a method for uniquely identifying a microcell through the use of prime numbers. The approach implements a microcell methodology embedded on a regular grid to further subdivide and then tag the material components of the computational system via a prime numbering algorithm. The microcells motion are then tracked, driven by local velocity conditions computed at the macrogrid level, and rectifying small anomalies by a coupled evaluation of local volume fraction fields and global mass conservation. Volume fractions can be calculated at any time step by an evaluation of the prime number distribution so that average cellular density and viscosity values can be regularly updated at the macrogrid level. This paper, then, presents the details of the microgrid method and illustrates its capabilities through two-dimensional, N-component, problem simulations.
10
Shen, Yunhang, Rongrong Ji, Xiaopeng Hong, Feng Zheng, Xiaowei Guo, Yongjian Wu, and Feiyue Huang. "A Part Power Set Model for Scale-Free Person Retrieval." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/471.
Full textAbstract:
Recently, person re-identification (re-ID) has attracted increasing research attention, which has broad application prospects in video surveillance and beyond. To this end, most existing methods highly relied on well-aligned pedestrian images and hand-engineered part-based model on the coarsest feature map. In this paper, to lighten the restriction of such fixed and coarse input alignment, an end-to-end part power set model with multi-scale features is proposed, which captures the discriminative parts of pedestrians from global to local, and from coarse to fine, enabling part-based scale-free person re-ID. In particular, we first factorize the visual appearance by enumerating $k$-combinations for all $k$ of $n$ body parts to exploit rich global and partial information to learn discriminative feature maps. Then, a combination ranking module is introduced to guide the model training with all combinations of body parts, which alternates between ranking combinations and estimating an appearance model. To enable scale-free input, we further exploit the pyramid architecture of deep networks to construct multi-scale feature maps with a feasible amount of extra cost in term of memory and time. Extensive experiments on the mainstream evaluation datasets, including Market-1501, DukeMTMC-reID and CUHK03, validate that our method achieves the state-of-the-art performance.
Reports on the topic "Map enumerations"
1
Calomeni, Alyssa, Andrew McQueen, Ciera Kinley-Baird, and Gerard Clyde. Identification and preventative treatment of overwintering cyanobacteria in sediments : a literature review. Engineer Research and Development Center (U.S.), August 2022. http://dx.doi.org/10.21079/11681/45063.
Full textAbstract:
Freshwaters can experience growths of toxin-producing cyanobacteria or harmful algal blooms (HABs). HAB-producing cyanobacteria can develop akinetes, which are thick-enveloped quiescent cells akin to seeds in vascular plants or quiescent colonies that overwinter in sediment. Overwintering cells produce viable “seed beds” for HAB resurgences and preventative treatments may diminish HAB intensity. The purpose of this literature review was to identify (1) environmental factors triggering germination and growth of overwintering cells, (2) sampling, identification, and enumeration methods, and (3) feasibility of preventative algaecide treatments. Conditions triggering akinete germination (light ≥0.5 μmol m-2s-1, temperature 22-27℃) differ from conditions triggering overwintering Microcystis growth (temperature 15-30℃, nutrients, mixing). Corers or dredges are used to collect surficial (0-2 cm) sediment layers containing overwintering cells. Identification and enumeration via microscopy are aided by dilution, sieving, or density separation of sediment. Grow-out studies simulate environmental conditions triggering cell growth and provide evidence of overwintering cell viability. Lines of evidence supporting algaecide efficacy for preventative treatments include (1) field studies demonstrating scalability and efficacy of algaecides against benthic algae, (2) data suggesting similar sensitivities of overwintering and planktonic Microcystis cells to a peroxide algaecide, and (3) a mesocosm study demonstrating a decrease in HAB severity following preventative treatments. This review informs data needs, monitoring techniques, and potential efficacy of algaecides for preventative treatments of overwintering cells.
2
Jorgensen, Frieda, Andre Charlett, Craig Swift, Anais Painset, and 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, June 2021. http://dx.doi.org/10.46756/sci.fsa.xls618.
Full textAbstract:
Campylobacter spp. are the most common bacterial cause of foodborne illness in the UK, with chicken considered to be the most important vehicle for this organism. The UK Food Standards Agency (FSA) agreed with industry to reduce Campylobacter spp. contamination in raw chicken and issued a target to reduce the prevalence of the most contaminated chickens (those with more than 1000 cfu per g chicken neck skin) to below 10 % at the end of the slaughter process, initially by 2016. To help monitor progress, a series of UK-wide surveys were undertaken to determine the levels of Campylobacter spp. on whole UK-produced, fresh chicken at retail sale in the UK. The data obtained for the first four years was reported in FSA projects FS241044 (2014/15) and FS102121 (2015 to 2018). The FSA has indicated that the retail proxy target for the percentage of highly contaminated raw whole retail chickens should be less than 7% and while continued monitoring has demonstrated a sustained decline for chickens from major retailer stores, chicken on sale in other stores have yet to meet this target. This report presents results from testing chickens from non-major retailer stores (only) in a fifth survey year from 2018 to 2019. In line with previous practise, samples were collected from stores distributed throughout the UK (in proportion to the population size of each country). Testing was performed by two laboratories - a Public Health England (PHE) laboratory or the Agri-Food & Biosciences Institute (AFBI), Belfast. Enumeration of Campylobacter spp. was performed using the ISO 10272-2 standard enumeration method applied with a detection limit of 10 colony forming units (cfu) per gram (g) of neck skin. Antimicrobial resistance (AMR) to selected antimicrobials in accordance with those advised in the EU harmonised monitoring protocol was predicted from genome sequence data in Campylobacter jejuni and Campylobacter coli isolates The percentage (10.8%) of fresh, whole chicken at retail sale in stores of smaller chains (for example, Iceland, McColl’s, Budgens, Nisa, Costcutter, One Stop), independents and butchers (collectively referred to as non-major retailer stores in this report) in the UK that are highly contaminated (at more than 1000 cfu per g) with Campylobacter spp. has decreased since the previous survey year but is still higher than that found in samples from major retailers. 8 whole fresh raw chickens from non-major retailer stores were collected from August 2018 to July 2019 (n = 1009). Campylobacter spp. were detected in 55.8% of the chicken skin samples obtained from non-major retailer shops, and 10.8% of the samples had counts above 1000 cfu per g chicken skin. Comparison among production plant approval codes showed significant differences of the percentages of chicken samples with more than 1000 cfu per g, ranging from 0% to 28.1%. The percentage of samples with more than 1000 cfu of Campylobacter spp. per g was significantly higher in the period May, June and July than in the period November to April. The percentage of highly contaminated samples was significantly higher for samples taken from larger compared to smaller chickens. There was no statistical difference in the percentage of highly contaminated samples between those obtained from chicken reared with access to range (for example, free-range and organic birds) and those reared under standard regime (for example, no access to range) but the small sample size for organic and to a lesser extent free-range chickens, may have limited the ability to detect important differences should they exist. Campylobacter species was determined for isolates from 93.4% of the positive samples. C. jejuni was isolated from the majority (72.6%) of samples while C. coli was identified in 22.1% of samples. A combination of both species was found in 5.3% of samples. C. coli was more frequently isolated from samples obtained from chicken reared with access to range in comparison to those reared as standard birds. C. jejuni was less prevalent during the summer months of June, July and August compared to the remaining months of the year. Resistance to ciprofloxacin (fluoroquinolone), erythromycin (macrolide), tetracycline, (tetracyclines), gentamicin and streptomycin (aminoglycosides) was predicted from WGS data by the detection of known antimicrobial resistance determinants. Resistance to ciprofloxacin was detected in 185 (51.7%) isolates of C. jejuni and 49 (42.1%) isolates of C. coli; while 220 (61.1%) isolates of C. jejuni and 73 (62.9%) isolates of C. coli isolates were resistant to tetracycline. Three C. coli (2.6%) but none of the C. jejuni isolates harboured 23S mutations predicting reduced susceptibility to erythromycin. Multidrug resistance (MDR), defined as harbouring genetic determinants for resistance to at least three unrelated antimicrobial classes, was found in 10 (8.6%) C. coli isolates but not in any C. jejuni isolates. Co-resistance to ciprofloxacin and erythromycin was predicted in 1.7% of C. coli isolates. 9 Overall, the percentages of isolates with genetic AMR determinants found in this study were similar to those reported in the previous survey year (August 2016 to July 2017) where testing was based on phenotypic break-point testing. Multi-drug resistance was similar to that found in the previous survey years. It is recommended that trends in AMR in Campylobacter spp. isolates from retail chickens continue to be monitored to realise any increasing resistance of concern, particulary to erythromycin (macrolide). Considering that the percentage of fresh, whole chicken from non-major retailer stores in the UK that are highly contaminated (at more than 1000 cfu per g) with Campylobacter spp. continues to be above that in samples from major retailers more action including consideration of interventions such as improved biosecurity and slaughterhouse measures is needed to achieve better control of Campylobacter spp. for this section of the industry. The FSA has indicated that the retail proxy target for the percentage of highly contaminated retail chickens should be less than 7% and while continued monitoring has demonstrated a sustained decline for chickens from major retailer stores, chicken on sale in other stores have yet to meet this target.
3
Lewis, Dustin, Radhika Kapoor, and Naz Modirzadeh. Advancing Humanitarian Commitments in Connection with Countering Terrorism: Exploring a Foundational Reframing concerning the Security Council. Harvard Law School Program on International Law and Armed Conflict, December 2021. http://dx.doi.org/10.54813/uzav2714.
Full textAbstract:
The imperative to provide humanitarian and medical services on an urgent basis in armed conflicts is anchored in moral tenets, shared values, and international rules. States spend tens of billions of dollars each year to help implement humanitarian programs in conflicts across the world. Yet, in practice, counterterrorism objectives increasingly prevail over humanitarian concerns, often resulting in devastating effects for civilian populations in need of aid and protection in war. Not least, confusion and misapprehensions about the power and authority of States relative to the United Nations Security Council to set policy preferences and configure legal obligations contribute significantly to this trajectory. In this guide for States, we present a framework to reconfigure relations between these core commitments by assessing the counterterrorism architecture through the lens of impartial humanitarianism. We aim in particular to provide an evidence base and analytical frame for States to better grasp key legal and policy issues related to upholding respect for principled humanitarian action in connection with carrying out the Security Council’s counterterrorism decisions. We do so because the lack of knowledge regarding interpretation and implementation of counterterrorism resolutions matters for the coherence, integrity, and comprehensiveness of humanitarian policymaking and protection of the humanitarian imperative. In addition to analyzing foundational concerns and evaluating discernible behaviors and attitudes, we identify avenues that States may take to help achieve pro-humanitarian objectives. We also endeavor to help disseminate indications of, and catalyze, States’ legally relevant positions and practices on these issues. In section 1, we introduce the guide’s impetus, objectives, target audience, and structure. We also describe the methods that we relied on and articulate definitions for key terms. In section 2, we introduce key legal actors, sources of law, and the notion of international legal responsibility, as well as the relations between international and national law. Notably, Security Council resolutions require incorporation into national law in order to become effective and enforceable by internal administrative and judicial authorities. In section 3, we explain international legal rules relevant to advancing the humanitarian imperative and upholding respect for principled humanitarian action, and we sketch the corresponding roles of humanitarian policies, programs, and donor practices. International humanitarian law (IHL) seeks to ensure — for people who are not, or are no longer, actively participating in hostilities and whose needs are unmet — certain essential supplies, as well as medical care and attention for the wounded and sick. States have also developed and implemented a range of humanitarian policy frameworks to administer principled humanitarian action effectively. Further, States may rely on a number of channels to hold other international actors to account for safeguarding the humanitarian imperative. In section 4, we set out key theoretical and doctrinal elements related to accepting and carrying out the Security Council’s decisions. Decisions of the Security Council may contain (binding) obligations, (non-binding) recommendations, or a combination of the two. UN members are obliged to carry out the Council’s decisions. Member States retain considerable interpretive latitude to implement counterterrorism resolutions. With respect to advancing the humanitarian imperative, we argue that IHL should represent a legal floor for interpreting the Security Council’s decisions and recommendations. In section 5, we describe relevant conduct of the Security Council and States. Under the Resolution 1267 (1999), Resolution 1989 (2011), and Resolution 2253 (2015) line of resolutions, the Security Council has established targeted sanctions as counterterrorism measures. Under the Resolution 1373 (2001) line of resolutions, the Security Council has adopted quasi-“legislative” requirements for how States must counter terrorism in their national systems. Implementation of these sets of resolutions may adversely affect principled humanitarian action in several ways. Meanwhile, for its part, the Security Council has sought to restrict the margin of appreciation of States to determine how to implement these decisions. Yet international law does not demand that these resolutions be interpreted and implemented at the national level by elevating security rationales over policy preferences for principled humanitarian action. Indeed, not least where other fields of international law, such as IHL, may be implicated, States retain significant discretion to interpret and implement these counterterrorism decisions in a manner that advances the humanitarian imperative. States have espoused a range of views on the intersections between safeguarding principled humanitarian action and countering terrorism. Some voice robust support for such action in relation to counterterrorism contexts. A handful call for a “balancing” of the concerns. And some frame respect for the humanitarian imperative in terms of not contradicting counterterrorism objectives. In terms of measures, we identify five categories of potentially relevant national counterterrorism approaches: measures to prevent and suppress support to the people and entities involved in terrorist acts; actions to implement targeted sanctions; measures to prevent and suppress the financing of terrorism; measures to prohibit or restrict terrorism-related travel; and measures that criminalize or impede medical care. Further, through a number of “control dials” that we detect, States calibrate the functional relations between respect for principled humanitarian action and countering terrorism. The bulk of the identified counterterrorism measures and related “control dials” suggests that, to date, States have by and large not prioritized advancing respect for the humanitarian imperative at the national level. Finally, in section 6, we conclude by enumerating core questions that a State may answer to help formulate and instantiate its values, policy commitments, and legal positions to secure respect for principled humanitarian action in relation to counterterrorism contexts.