Relevant bibliographies by topics / Labelling

Academic literature on the topic 'Labelling'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 May 2024

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

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 "Labelling"

1

Farhan, Muhammad, Henning Koehler, Robert Ohms, and Qing Wang. "Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks." Proceedings of the ACM on Management of Data 1, no. 4 (December 8, 2023): 1–25. http://dx.doi.org/10.1145/3626731.

Full text
Abstract:
Answering the shortest-path distance between two arbitrary locations is a fundamental problem in road networks. Labelling-based solutions are the current state-of-the-arts to render fast response time, which can generally be categorised into hub-based labellings, highway-based labellings, and tree decomposition labellings. Hub-based and highway-based labellings exploit hierarchical structures of road networks with the aim to reduce labelling size for improving query efficiency. However, these solutions still result in large search spaces on distance labels at query time, particularly when road networks are large. Tree decomposition labellings leverage a hierarchy of vertices to reduce search spaces over distance labels at query time, but such a hierarchy is generated using tree decomposition techniques, which may yield very large labelling sizes and slow querying. In this paper, we propose a novel solution hierarchical cut 2-hop labelling (HC2L) to address the drawbacks of the existing works. Our solution combines the benefits of hierarchical structures from both perspectives - reduce the size of a distance labelling at preprocessing time and further reduce the search space on a distance labelling at query time. At its core, we propose a new hierarchy, balanced tree hierarchy, which enables a fast, efficient data structure to reduce the size of distance labelling and to select a very small subset of labels to compute the shortest-path distance at query time. To speed up the construction process of HC2L, we further propose a parallel variant of our method, namely HC2L^p. We have evaluated our solution on 10 large real-world road networks through extensive experiments. The results show that our method is 1.5-4 times faster in terms of query processing while being comparable in terms of labelling construction time and achieving up to 60% smaller labelling size compared to the state-of-the-art approaches.
APA, Harvard, Vancouver, ISO, and other styles
2

Semenyuta, Marina F. "FIBONACCI AND SUPER FIBONACCI GRACEFUL LABELLINGS OF SOME TYPES OF GRAPHS." Journal of Automation and Information sciences 1 (January 1, 2021): 105–21. http://dx.doi.org/10.34229/0572-2691-2021-1-10.

Full text
Abstract:
We consider the basic theoretical information regarding the Fibonacci graceful graphs. An injective function is said a Fibonacci graceful labelling of a graph of a size , if it induces a bijective function on the set of edges , where by the rule , for any adjacent vertices A graph that allows such labelling is called Fibonacci graceful. In this paper, we introduce the concept of super Fibonacci graceful labelling, narrowing the set of vertex labels, i.e. Four types of problems to be studied are selected. In the problem of the first type, the following question is raised: is there a graph that allows a certain kind of labelling, and under what conditions does this take place? The problem of the second type is the problem of construction: it is necessary, for a given system of requirements for the graph, to construct (at least one) its labelling that would satisfy this system. The following two types of problems relate to enumeration problems: for a given graph, determine the number of different Fibonacci and / or super Fibonacci graceful labellings; build all the different labellings of a given kind. As a result of solving these problems, functions were found that generate Fibonacci and super Fibonacci graceful labellings for graphs of cyclic structure; necessary and sufficient conditions for the existence of Fibonacci graceful labelling for disjunctive union of cycles, super Fibonacci graceful labelling for cycles, Eulerian graphs are obtained; the number of non-equivalent labellings of the cycle is determined; conditions for the existence of a super Fibonacci graceful labelling of a one-point connection of arbitrary connected super Fibonacci graceful graphs … …, are presented
APA, Harvard, Vancouver, ISO, and other styles
3

Su, Jing, Hongyu Wang, and Bing Yao. "On Elegant Labelling and Magic Labelling of Large-Scale Graphs." Discrete Dynamics in Nature and Society 2022 (March 28, 2022): 1–10. http://dx.doi.org/10.1155/2022/6301674.

Full text
Abstract:
In this paper, we deduce the equivalence relationship among strongly c-elegant labelling, super-edge magic total labelling, edge antimagic total labelling, and super t , 1 -magical labelling. We study some properties of the graph with a strongly c-elegant labelling. On the basis of small-scale graphs with strongly c-elegant labelling, several types of large-scale graphs are constructed through graph operations, and we further prove the existence of their strongly c-elegant labelling. In addition, we also define a transformation of strongly c-elegant labelling, which provides a method for the transformation between several strongly c-elegant labellings of a graph.
APA, Harvard, Vancouver, ISO, and other styles
4

RIZVI, SYED TAHIR RAZA, MADIHA KHALID, KASHIF ALI, MIRKA MILLER, and JOE RYAN. "ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS." Bulletin of the Australian Mathematical Society 92, no. 1 (May 5, 2015): 11–18. http://dx.doi.org/10.1017/s0004972715000325.

Full text
Abstract:
Lladó and Moragas [‘Cycle-magic graphs’, Discrete Math.307 (2007), 2925–2933] showed the cyclic-magic and cyclic-supermagic behaviour of several classes of connected graphs. They discussed cycle-magic labellings of subdivided wheels and friendship graphs, but there are no further results on cycle-magic labellings of other families of subdivided graphs. In this paper, we find cycle-magic labellings for subdivided graphs. We show that if a graph has a cycle-(super)magic labelling, then its uniform subdivided graph also has a cycle-(super)magic labelling. We also discuss some cycle-supermagic labellings for nonuniform subdivided fans and triangular ladders.
APA, Harvard, Vancouver, ISO, and other styles
5

McCarthy, Brian J., and Brian C. Burdett. "Eco-labelling and textile eco-labelling." Review of Progress in Coloration and Related Topics 28, no. 1 (October 23, 2008): 61–70. http://dx.doi.org/10.1111/j.1478-4408.1998.tb00119.x.

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

Sapunov, Seregy. "Collectives of automata on infinite grid graph with deterministic vertex labeling." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 33 (December 27, 2019): 170–87. http://dx.doi.org/10.37069/1683-4720-2019-33-14.

Full text
Abstract:
Automata walking on graphs are a mathematical formalization of autonomous mobile agents with limited memory operating in discrete environments. Under this model broad area of studies of the behaviour of automata in finite and infinite labyrinths (a labyrinth is an embedded directed graph of special form) arose and intensively developing. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. Automata operating in labyrinths can distinguish directions, that is, they have a compass. This paper examines vertex labellings of infinite square grid graph thanks to these labellings a finite automaton without a compass can walk along graph in any arbitrary direction. The automaton looking over neighbourhood of the current vertex and may move to some neighbouring vertex selected by its label. We propose a minimal deterministic traversable vertex labelling that satisfies the required property. A labelling is said to be deterministic if all vertices in closed neighbourhood of every vertex have different labels. It is shown that minimal deterministic traversable vertex labelling of square grid graph uses labels of five different types. Minimal deterministic traversable labelling of subgraphs of infinite square grid graph whose degrees are less than four are developed. The key problem for automata and labyrinths is the problem of constructing a finite automaton that traverse a given class of labyrinths. We say that automaton traverse infinite graph if it visits any randomly selected vertex of this graph in a finite time. It is proved that a collective of one automaton and three pebbles can traverse infinite square grid graph with deterministic labelling and any collective with fewer pebbles cannot. We consider pebbles as automata of the simplest form, whose positions are completely determined by the remaining automata of the collective. The results regarding to exploration of an infinite deterministic square grid graph coincide with the results of A.V. Andzhan (Andzans) regarding to traversal of an infinite mosaic labyrinth without holes. It follows from above that infinite grid graph after constructing a minimal traversable deterministic labelling on it and fixing two pairs of opposite directions on it becomes an analogue of an infinite mosaic labyrinth without holes.
APA, Harvard, Vancouver, ISO, and other styles
7

Sapunov, Sergiy. "Experiments on Recognition of Infinite Grid Graph Labelling." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 35 (October 25, 2021): 67–78. http://dx.doi.org/10.37069/1683-4720-2021-35-6.

Full text
Abstract:
In recent years, topics related to automaton analysis of geometric environment have attracted widespread attention. The interaction of an automaton and an environment is often represented as a process of an automaton walks along a graph (labyrinth) of environment. Treating environment as vertex-labelled graph was suggested as one approach to addressing the problem of automaton analysis of environment properties. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. This paper considers a four-way infinite lattice graph as a model of an environment for a graph-walking automaton. All vertices of this graph are labelled with labels from a known set but concrete labelling function is not a priori known. The automaton looking over neighbourhood of the current vertex and may travel to some neighbouring vertex selected by its label. The objective of the automaton is to determine two pairs of opposite directions on the aforementioned graph embedded onto integer lattice, i.e. recognizing the graph labelling. In previous work we have proposed a labelling thanks to which a finite automaton can walk on graph in any arbitrary direction. We have called this labelling deterministic. We have proved that minimal deterministic vertex labelling of infinite lattice graph uses labels of five different types. The paper demonstrates that there exists 240 different minimal deterministic labellings of the infinite lattice graph with a fixed set of labels. We prove that a single automaton cannot recognize minimal deterministic labelling of the infinite lattice graph, but automaton with one pebble can. The novelty associated with this paper is a new type of experiment with vertex labelled graphs designed to recognition their labelling. The method of constructing and performing recognition experiment for labelled infinite grid graph is proposed.
APA, Harvard, Vancouver, ISO, and other styles
8

Weinrich, Ramona, and Achim Spiller. "Developing food labelling strategies: Multi-level labelling." Journal of Cleaner Production 137 (November 2016): 1138–48. http://dx.doi.org/10.1016/j.jclepro.2016.07.156.

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

Baroni, Pietro, and Regis Riveret. "Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems." Journal of Artificial Intelligence Research 66 (November 30, 2019): 793–860. http://dx.doi.org/10.1613/jair.1.11428.

Full text
Abstract:
In computational models of argumentation, the justification of statements has drawn less attention than the construction and justification of arguments. Significant losses of sensitivity or expressibility on statement statuses can be incurred by otherwise appealing formalisms. In order to reappraise statement statuses and, more generally, to support a uniform modelling of different phases of the argumentation process we introduce multi-labelling systems, a generic formalism devoted to represent reasoning processes consisting of a sequence of labelling stages. In the argumentation context, two families of multi-labelling systens, called argument-focused and statement-focused approach are identified and compared. Then they are shown to be able to encompass several prominent literature proposals as special cases, thereby enabling a systematic comparison evidencing their merits and limits. Further, we show that the proposed model supports tunability of statement justification by specifying a few alternative statement justification labellings, and we illustrate how they can be seamlessly integrated into different formalisms.
APA, Harvard, Vancouver, ISO, and other styles
10

Afzal, Hafiz Usman, Muhammad Javaid, Abdulaziz Mohammed Alanazi, and Maryam Gharamah Alshehri. "Computing Edge Weights of Symmetric Classes of Networks." Mathematical Problems in Engineering 2021 (March 19, 2021): 1–22. http://dx.doi.org/10.1155/2021/5562544.

Full text
Abstract:
Accessibility, robustness, and connectivity are the salient structural properties of networks. The labelling of networks with numeric numbers using the parameters of edge or vertex weights plays an eminent role in the study of the aforesaid properties. The systems interlinked in a network are transformed into a graphical network, and specific numeric labels assigned to the converted network under certain rules assist us in the regulation of data traffic, bandwidth, and coding/decoding of signals. Two major classes of such network labellings are magic and antimagic. The notion of super a , 0 edge-antimagic labelling on networks was identified in the late nineties. The present article addresses super a , 0 edge antimagicness of union of the networks’ star S n , the path P n , and copies of paths and the rooted product of cycle C n with K 2 , m . We also provide super a , 0 edge-antimagic labelling of the rooted product of cycle C n and planar pancyclic networks. Further, we design a super a , 0 edge-antimagic labelling on a pancyclic network containing chains of C 6 and three different symmetrically designed lattices. Moreover, our findings have also been recapitulated in the shape of 3- D plots and tables.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Labelling"

1

Муліна, Наталія Ігорівна, Наталия Игоревна Мулина, Nataliia Ihorivna Mulina, and S. V. Chernobuk. "Labelling." Thesis, Вид-во СумДУ, 2009. http://essuir.sumdu.edu.ua/handle/123456789/16801.

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

Freckleton, A. M. "Nutrition labelling." Thesis, University of Bradford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378111.

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

Johansson, Frida, and Stella Brandting. "Labelling Sustainability." Thesis, Högskolan i Borås, Institutionen Textilhögskolan, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-16793.

Full text
Abstract:
The concept of sustainability has become apparent in the fast fashion business. In recent years many companies have started to label the more sustainable garments in order to make it easier for the consumer to make conscious decisions while shopping. However, this raises many questions due to unclear use of sustainability terms and the contradiction between environmental and ethical aspects in regards to the fashion industry. The purpose of the thesis is to raise a discussion concerning the use of sustainability labels within fast fashion. In order to reach the purpose, the following questions were developed: “What do different sustainability labels mean according to the fast fashion business?”, “What knowledge do the customers have about different sustainability labels?” and “Do the labels have an impact in the buying decision making process?”We have done an explorative study to investigate a phenomenon and highlight a potential problem in this field of studies. Since the aim of the empirical research is to gain insight of the consumers' attitudes and knowledge, the study is to a large extent qualitative. We conducted a survey in which purposive sampling was used as we wanted the respondents to fulfil certain criteria. In addition to the survey, we also conducted research on a number of fast fashion companies to get an idea of what information the customers would be naturally exposed to. The results from the study show that sustainability labels within fast fashion have not experienced their intended success among their largest consumer group. It has not yet reached desired effects on the consumption behaviour, the interest for sustainability nor the knowledge among the young female respondents. One can therefore discuss the utility of using labels within fast fashion.
Program: Master in Fashion Management with specialisation in Fashion Marketing and Retailing
APA, Harvard, Vancouver, ISO, and other styles
4

Moorut, Ben. "Labelling utility maps /." Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Moorut.pdf.

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

Gray, Robert A. "Flourophore labelling of biopolymers." Thesis, Coventry University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308085.

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

陳達宗 and Tat-chung Chan. "Automatic labelling of mandarin." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31213959.

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

Chappell, David Clive. "Fluorescent labelling of proteins." Thesis, City University London, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292598.

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

Fowle, Chris. "Carbohydrate directed photoaffinity labelling." Thesis, University of Bath, 2018. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760976.

Full text
Abstract:
Glycoproteins have diverse and essential roles within biological systems. They are formed by enzymatic addition of saccharides to proteins during, or shortly after, translation. However, saccharides can also react with proteins non-enzymatically, a process termed glycation, which can cause impaired function and improper folding. Glycated proteins further react to form advanced glycation end-products, which have been implicated in the pathogenesis and progress of many diseases. Due to this pathological effect, glycation has been studied as a potential biomarker of these diseases. Photoaffinity labelling is a technique that is used to investigate the structure, and presence, of biological molecules; a precedent exists for its use in the study of carbohydrates in biological systems. Chapter 1 outlines the background of this thesis exploring previous studies of glycation, its effects, and methods used in recognition and photoaffinity labelling. Chapter 2 details the design and synthesis of a novel photoaffinity probe, and the optimisation of this synthesis. The target molecule was successfully produced and simpler alternatives to the initial synthetic route with similar yields are discussed. In Chapter 3 the use of the photoaffinity probe is studied. Labelling trials were performed on three proteins: human serum albumin (HSA), macrophage migration inhibitory factor (MIF), and casein. Mass spectrometry showed that the experiments with both HSA and MIF were successful, while the procedure appeared to lead to degradation of casein. Additionally, our work into developing techniques for identifying labelled samples is detailed. A diol-doped electrophoresis gel was not successful created, however, staining protein samples in polyacrylamide gel electrophoresis with curcumin showed promise. Chapter 4 explores the electrochemistry of the photoaffinity probe and details the use of the probe in functionalising a fluorine doped tin oxide (FTO) glass electrode. Cyclic voltammograms of Alizarin Red S (ARS), obtained using a treated electrode, suggest that surface functionalisation was successful.
APA, Harvard, Vancouver, ISO, and other styles
9

Chan, Tat-chung. "Automatic labelling of mandarin /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18037306.

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

Kvale, Knut. "Segmentation and labelling of speech." Doctoral thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 1993. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-977.

Full text
Abstract:

During the last decades, significant research efforts have been aimed at devoloping speech technology products such as speech input and output systems. In order to train and evaluate these systems huge speech databases have been compiled in laboratories all over the world. However, neither the recording protocols nor the annotation conventions used have been standardised, making assessments of speech technology products across laboratories and languages difficult. The aim of this thesis work is to contribute towards a standardisation of segmentation and labelling of multi-lingual speech corpora.

Segmentation is here defined as the process of dividing the speech pressure waveform into directly succeeding discrete parts. These segments are labelled with phoneme symbols. Continuous speech from five different languages; English, Danish, Swedish, Italien, and Norwegian, have been studied with respect to segmentation and labelling.

Due to coarticulation effects, exact segmentation of speech as defined above is theoretically impossible, but the segmentation and labelling provides a link between the speech waveform and the phonological labels which is nevertheless essential for both speech research and for the development of speech technology. Thus, this thesis takes a pragmatic approach to the segmentation and labelling of speech and suggests methods to make the annotation process accurate and reliable enough for practical use.

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

Books on the topic "Labelling"

1

Ashwell, Margaret. Nutrition labelling. London: British Nutrition Foundation, 1990.

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

Ashwell, Margaret. Nutrition labelling. London: British Nutrition Foundation, 1990.

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

Organization, World Health, Food and Agriculture Organization of the United Nations., and Joint FAO/WHO Codex Alimentarius Commission., eds. Food labelling. 5th ed. Rome: World Health Organization, 2007.

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

Fouundation, British Nutrition, ed. Nutrition labelling. London: British Nutrition Foundation, 1993.

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

Britain, Great. Labelling: Food Labelling (Amendment) Regulations (Northern Ireland)1989. [Belfast]: HMSO, 1989.

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

Laurent, Brice, and Alexandre Mallard, eds. Labelling the Economy. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1498-2.

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

Great, Britain Parliament. Food Labelling Bill. London: Stationery Office, 2001.

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

Great, Britain Parliament. Food Labelling Bill. London: Stationery Office, 2000.

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

Canada, Canada Health, ed. Labelling of cosmetics. [Ottawa]: Health Canada, 2006.

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

Parliament, Great Britain. Food Labelling Bill. London: Stationery Office, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Labelling"

1

Nahler, Gerhard. "labelling." In Dictionary of Pharmaceutical Medicine, 104. Vienna: Springer Vienna, 2009. http://dx.doi.org/10.1007/978-3-211-89836-9_766.

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

Silverstone, Rob. "Nutritional Labelling." In Healthy Eating, 52–54. London: Macmillan Education UK, 1990. http://dx.doi.org/10.1007/978-1-349-11463-4_7.

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

Hansson, Sven Ove. "Food Labelling." In Encyclopedia of Food and Agricultural Ethics, 1–8. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-6167-4_317-2.

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

Nahler, Gerhard. "labelling phenomenon." In Dictionary of Pharmaceutical Medicine, 104. Vienna: Springer Vienna, 2009. http://dx.doi.org/10.1007/978-3-211-89836-9_767.

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

Ehret-Sabatier, L., B. Kieffer, M. P. Goeldner, and C. G. Hirth. "Photosuicide Labelling." In Photochemical Probes in Biochemistry, 107–22. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-0925-0_8.

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

Takeda, Mitsuhiro, and Masatsune Kainosho. "Isotope Labelling." In Protein NMR Spectroscopy: Practical Techniques and Applications, 23–53. Chichester, UK: John Wiley & Sons, Ltd, 2011. http://dx.doi.org/10.1002/9781119972006.ch2.

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

Kittler, Josef. "Relaxation Labelling." In Pattern Recognition Theory and Applications, 99–108. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-83069-3_9.

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

Goldberg, Ted. "Parental Labelling." In Demystifying Drugs, 98–115. London: Palgrave Macmillan UK, 1999. http://dx.doi.org/10.1007/978-1-349-27618-9_7.

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

Goldberg, Ted. "Societal Labelling." In Demystifying Drugs, 116–26. London: Palgrave Macmillan UK, 1999. http://dx.doi.org/10.1007/978-1-349-27618-9_8.

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

Holkham, Tony. "Managing Labelling." In Label Writing and Planning, 114–19. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4613-1231-4_33.

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

Conference papers on the topic "Labelling"

1

Weffort-Santos, Celso A., Christiane N. Campos, and Rafael C. S. Schouery. "Proper gap-labellings: on the edge and vertex variants." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6343.

Full text
Abstract:
Given a simple graph G, an ordered pair (π, cπ) is said to be a gap- [k]-edge-labelling (resp. gap-[k]-vertex-labelling) ofG ifπ is an edge-labelling (vertex-labelling) on the set {1, . . . , k}, and cπ is a proper vertex-colouring such that every vertex of degree at least two has its colour induced by the largest difference among the labels of its incident edges (neighbours). The decision problems associated with these labellings are NP-complete for k ≥ 3, and even when k = 2 for some classes of graphs. This thesis presents a study of the computational complexity of these problems, structural properties for certain families of graphs and several labelling algorithms and techniques. First, we present an NP-completeness result for the family of subcubic bipartite graphs. Second, we present polynomial-time algorithms for families ofgraphs. Third, we introduce a new parameter associated with gap-[k]-vertex-labellings ofgraphs.
APA, Harvard, Vancouver, ISO, and other styles
2

Schulz, Claudia, and Francesca Toni. "On the Responsibility for Undecisiveness in Preferred and Stable Labellings in Abstract Argumentation (Extended Abstract)." 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/892.

Full text
Abstract:
Different semantics of abstract Argumentation Frameworks (AFs) provide different levels of decisiveness for reasoning about the acceptability of conflicting arguments.The stable semantics is useful for applications requiring a high level of decisiveness, as it assigns to each argument the label "accepted" or the label "rejected". Unfortunately, stable labellings are not guaranteed to exist, thus raising the question as to which parts of AFs are responsible for the non-existence. In this paper, we address this question by investigating a more general question concerning preferred labellings (which may be less decisive than stable labellings but are always guaranteed to exist), namely why a given preferred labelling may not be stable and thus undecided on some arguments. In particular, (1) we give various characterisations of parts of an AF, based on the given preferred labelling, and (2) we show that these parts are indeed responsible for the undecisiveness if the preferred labelling is not stable. We then use these characterisations to explain the non-existence of stable labellings.
APA, Harvard, Vancouver, ISO, and other styles
3

Riveret, Regis, Son Tran, and Artur d'Avila Garcez. "Neuro-Symbolic Probabilistic Argumentation Machines." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/90.

Full text
Abstract:
Neural-symbolic systems combine the strengths of neural networks and symbolic formalisms. In this paper, we introduce a neural-symbolic system which combines restricted Boltzmann machines and probabilistic semi-abstract argumentation. We propose to train networks on argument labellings explaining the data, so that any sampled data outcome is associated with an argument labelling. Argument labellings are integrated as constraints within restricted Boltzmann machines, so that the neural networks are used to learn probabilistic dependencies amongst argument labels. Given a dataset and an argumentation graph as prior knowledge, for every example/case K in the dataset, we use a so-called K-maxconsistent labelling of the graph, and an explanation of case K refers to a K-maxconsistent labelling of the given argumentation graph. The abilities of the proposed system to predict correct labellings were evaluated and compared with standard machine learning techniques. Experiments revealed that such argumentation Boltzmann machines can outperform other classification models, especially in noisy settings.
APA, Harvard, Vancouver, ISO, and other styles
4

Baumann, Ringo, and Anne-Marie Heine. "On Conflict-free Labellings – Realizability, Construction and Patterns of Redundancy." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/70.

Full text
Abstract:
The paper deals with the topic of realizability in abstract argumentation. More precisely, we consider the most basic kind of labellings, so-called conflict-free labellings. The understanding of these labellings is essential as any mature labelling-based semantics selects its output among these labellings. We show how to decide whether a given set of labellings is the conflict-free outcome of a certain Dungean framework. To this end we introduce several new criteria like L-tightness, reject-witness and reject-compositionality. These properties play a decisive role in the central characterization theorem. Moreover, we present a construction method, showing how to realize a conflict-free realizable labelling-set. Finally, we study the representational freedom in case of such labellings. This leads to an uniqueness result for a certain sub-class and a surprising connection to strong equivalence in case of extension-based semantics.
APA, Harvard, Vancouver, ISO, and other styles
5

Sorodoc, Ionut, Jey Han Lau, Nikolaos Aletras, and Timothy Baldwin. "Multimodal Topic Labelling." In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Papers. Stroudsburg, PA, USA: Association for Computational Linguistics, 2017. http://dx.doi.org/10.18653/v1/e17-2111.

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

Gomes, Dipta, and Md Manzurul Hasan. "Graceful Cascading Labelling Algorithm: Construction of Graceful Labelling of Trees." In 2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST). IEEE, 2021. http://dx.doi.org/10.1109/icrest51555.2021.9331105.

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

Kongsgard, Kyrre Wahl, Nils Agne Nordbotten, and Stian Fauskanger. "Policy-based labelling: A flexible framework for trusted data labelling." In 2015 International Conference on Military Communications and Information Systems (ICMCIS). IEEE, 2015. http://dx.doi.org/10.1109/icmcis.2015.7158708.

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

Okumura, Naoya, and Takao Miura. "Labelling document using ontology." In 2015 Fifth International Conference on Digital Information Processing and Communications (ICDIPC). IEEE, 2015. http://dx.doi.org/10.1109/icdipc.2015.7323016.

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

Zhang, G., and AM Wallace. "Extending Semantic Edge Labelling." In British Machine Vision Conference 1995. British Machine Vision Association, 1995. http://dx.doi.org/10.5244/c.9.64.

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

Goto, Kentaro, and Masato Uchida. "Tsallis Entropy Based Labelling." In 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE, 2020. http://dx.doi.org/10.1109/icmla51294.2020.00015.

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

Reports on the topic "Labelling"

1

Social, Basis, and Bright Harbour. Precautionary Allergen Labelling Report and Non-Gluten Containing Ingredients Labelling Report. Food Standards Agency, June 2022. http://dx.doi.org/10.46756/sci.fsa.dxq232.

Full text
Abstract:
Precautionary allergen labelling (PAL) and precautionary allergen information aims to communicate whether one or more of the fourteen allergens regulated in the UK could be unintentionally present in a food product - for example, via ‘may contain’ or ‘produced in a factory which’ statements. This research explored experiences, interpretations, and views of PAL with businesses and consumers with food hypersensitivities in order to understand and improve how it is applied in future. In addition, the FSA conducted qualitative research with coeliac consumers on experiences, interpretations, and views of NCGI (non-gluten containing ingredients) notices. This research was conducted in tandem with wider research on precautionary allergen labelling (PAL) notices but has been reported separately given the different information provided by PAL and NCGI.
APA, Harvard, Vancouver, ISO, and other styles
2

Svinddal, Siri B. Allergen labelling and use of advisory labelling "May contain traces of [allergen]". Nordic Council of Ministers, January 2013. http://dx.doi.org/10.6027/tn2012-566.

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

Møller, Hanne, Nina Lødrup, Pernille Lundquist Madsen, Åsa Rosengren, and Annika Nurttila. Date labelling in the Nordic countries. Nordic Council of Ministers, February 2015. http://dx.doi.org/10.6027/tn2015-504.

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

Meek, Dr Tim. Syringe labelling in critical care areas review. The Association of Anaesthetists of Great Britain and Ireland, November 2016. http://dx.doi.org/10.21466/g.sliccar.2016.

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

Numan, Muhammad, Saad Ihsan Butt, and Andrea Semaničová-Feňovčiková. Super d‑ntimagic Labelling of Toroidal Fullerenes. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, September 2019. http://dx.doi.org/10.7546/crabs.2019.09.04.

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

Ali, S., and E. Shankland. sup 89 Zr chelates for antibody labelling. Office of Scientific and Technical Information (OSTI), January 1990. http://dx.doi.org/10.2172/6649657.

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

Matzke, James Lee. SSR-6 Marking, Labelling, and Placarding of transport vehicle. Office of Scientific and Technical Information (OSTI), March 2019. http://dx.doi.org/10.2172/1499296.

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

Ortiz-Sobrino, MA, C. Fuente-Cobo, and JM Martínez-Otero. Content rating and labelling in the main Spanish televisions. Revista Latina de Comunicación Social, August 2015. http://dx.doi.org/10.4185/rlcs-2015-1055en.

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

Osman, Magda, and Sarah Jenkins. Consumer responses to food labelling: A rapid evidence review. Food Standards Agency, July 2022. http://dx.doi.org/10.46756/sci.fsa.aiw861.

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

Turner, Thomas, Harriet Pickles, and Ipsos UK. Vegan labelling: use and understanding by consumers with food hypersensitivities. Food Standards Agency, March 2024. http://dx.doi.org/10.46756/sci.fsa.jny211.

Full text
Abstract:
In December 2023, the Food Standards Agency commissioned Ipsos UK to conduct an online survey with individuals who have or buy for those with food hypersensitivities (FHS) to allergens of animal origin to explore their use and understanding of vegan labelling as a proxy for allergen labelling.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Labelling' for particular source types:
Journal articles Dissertations / Theses Books
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