Gotowe bibliografie tematyczne / Conjunctive normal form

Gotowa bibliografia na temat „Conjunctive normal form”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 20 lutego 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Conjunctive normal form”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Conjunctive normal form"

1

De Ita Luna, Guillermo, J. Raymundo Marcial-Romero i José A. Hernández. "The Incremental Satisfiability Problem for a Two Conjunctive Normal Form". Electronic Notes in Theoretical Computer Science 328 (grudzień 2016): 31–45. http://dx.doi.org/10.1016/j.entcs.2016.11.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Vaisman, Radislav, Ofer Strichman i Ilya Gertsbakh. "Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra". INFORMS Journal on Computing 27, nr 2 (kwiecień 2015): 406–15. http://dx.doi.org/10.1287/ijoc.2014.0633.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Warners, Joost P. "A linear-time transformation of linear inequalities into conjunctive normal form". Information Processing Letters 68, nr 2 (październik 1998): 63–69. http://dx.doi.org/10.1016/s0020-0190(98)00144-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Losee, Robert M., i Abraham Bookstein. "Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models". Information Processing & Management 24, nr 3 (styczeń 1988): 315–21. http://dx.doi.org/10.1016/0306-4573(88)90097-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Bruni, Renato. "On the orthogonalization of arbitrary Boolean formulae". Journal of Applied Mathematics and Decision Sciences 2005, nr 2 (1.01.2005): 61–74. http://dx.doi.org/10.1155/jamds.2005.61.

Pełny tekst źródła
Streszczenie:
The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthogonal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolean function to orthogonal normal form. The problem is of great relevance in several applications, for example, in the reliability theory. Moreover, such problem is strongly connected with the well-known propositional satisfiability problem. Therefore, important complexity issues are involved. A general procedure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formulae.
Style APA, Harvard, Vancouver, ISO itp.
6

Zhang, Zaijun, Daoyun Xu i Jincheng Zhou. "A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form". Entropy 23, nr 3 (4.03.2021): 303. http://dx.doi.org/10.3390/e23030303.

Pełny tekst źródła
Streszczenie:
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.
Style APA, Harvard, Vancouver, ISO itp.
7

Schuler, Rainer. "An algorithm for the satisfiability problem of formulas in conjunctive normal form". Journal of Algorithms 54, nr 1 (styczeń 2005): 40–44. http://dx.doi.org/10.1016/j.jalgor.2004.04.012.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Seth, Abhay Deep, Santosh Biswas i Amit Kumar Dhar. "DADCNF: Diagnoser design for Duplicate Address Detection threat using Conjunctive Normal Form". Computer Networks 222 (luty 2023): 109539. http://dx.doi.org/10.1016/j.comnet.2022.109539.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Gropp, Ursula. "Coinductive formulas and a many-sorted interpolation theorem". Journal of Symbolic Logic 53, nr 3 (wrzesień 1988): 937–60. http://dx.doi.org/10.2307/2274584.

Pełny tekst źródła
Streszczenie:
AbstractWe use connections between conjunctive game formulas and the theory of inductive definitions to define the notions of a coinductive formula and its approximations. Corresponding to the theory of conjunctive game formulas we develop a theory of coinductive formulas, including a covering theorem and a normal form theorem for many sorted languages. Applying both theorems and the results on “model interpolation” obtained in this paper, we prove a many-sorted interpolation theorem for ω1ω-logic, which considers interpolation with respect to the language symbols, the quantifiers, the identity, and countably infinite conjunction and disjunction.
Style APA, Harvard, Vancouver, ISO itp.
10

Wild, Marcel. "The many benefits of putting stack filters into disjunctive or conjunctive normal form". Discrete Applied Mathematics 149, nr 1-3 (sierpień 2005): 174–91. http://dx.doi.org/10.1016/j.dam.2004.06.027.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Conjunctive normal form"

1

Forrester, David M. "Fuzzy Cellular Automata in Conjunctive Normal Form". Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19987.

Pełny tekst źródła
Streszczenie:
Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours. Fuzzy cellular automata (FCA) are a real-valued extension of Boolean cellular automata which "fuzzifies" Boolean logic in the transition function using real values between zero and one (inclusive). To date, FCA have only been studied in disjunctive normal form (DNF). In this thesis, we study FCA in conjunctive normal form (CNF). We classify FCA in CNF both analytically and empirically. We compare these classes to their DNF counterparts. We prove that certain FCA exhibit chaos in CNF, in contrast to the periodic behaviours of DNF FCA. We also briefly explore five different forms of fuzzy logic, and suggest further study. In support of this research, we introduce novel methods of simulating and visualizing FCA.
Style APA, Harvard, Vancouver, ISO itp.
2

Steinke, Peter [Verfasser], Steffen [Gutachter] Hölldobler i Armin [Gutachter] Biere. "Pseudo-Boolean Constraint Encodings for Conjunctive Normal Form and their Applications / Peter Steinke ; Gutachter: Steffen Hölldobler, Armin Biere". Dresden : Technische Universität Dresden, 2020. http://d-nb.info/1227196822/34.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Pham, Duc Nghia, i n/a. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Griffith University. Institute for Integrated and Intelligent Systems, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070216.143447.

Pełny tekst źródła
Streszczenie:
Recent research has shown that it is often preferable to encode real-world problems as propositional satisfiability (SAT) problems and then solve using a general purpose SAT solver. However, much of the valuable information and structure of these realistic problems is flattened out and hidden inside the corresponding Conjunctive Normal Form (CNF) encodings of the SAT domain. Recently, systematic SAT solvers have been progressively improved and are now able to solve many highly structured practical problems containing millions of clauses. In contrast, state-of-the-art Stochastic Local Search (SLS) solvers still have difficulty in solving structured problems, apparently because they are unable to exploit hidden structure as well as the systematic solvers. In this thesis, we study and evaluate different ways to effectively recognise, model and efficiently exploit useful structures hidden in realistic problems. A summary of the main contributions is as follows: 1. We first investigate an off-line processing phase that applies resolution-based pre-processors to input formulas before running SLS solvers on these problems. We report an extensive empirical examination of the impact of SAT pre-processing on the performance of contemporary SLS techniques. It emerges that while all the solvers examined do indeed benefit from pre-processing, the effects of different pre-processors are far from uniform across solvers and across problems. Our results suggest that SLS solvers need to be equipped with multiple pre-processors if they are ever to match the performance of systematic solvers on highly structured problems. [Part of this study was published at the AAAI-05 conference]. 2. We then look at potential approaches to bridging the gap between SAT and constraint satisfaction problem (CSP) formalisms. One approach has been to develop a many-valued SAT formalism (MV-SAT) as an intermediate paradigm between SAT and CSP, and then to translate existing highly efficient SAT solvers to the MV-SAT domain. In this study, we follow a different route, developing SAT solvers that can automatically recognise CSP structure hidden in SAT encodings. This allows us to look more closely at how constraint weighting can be implemented in the SAT and CSP domains. Our experimental results show that a SAT-based mechanism to handle weights, together with a CSP-based method to instantiate variables, is superior to other combinations of SAT and CSP-based approaches. In addition, SLS solvers based on this many-valued weighting approach outperform other existing approaches to handle many-valued CSP structures. [Part of this study was published at the AAAI-05 conference]. 3. Finally, we propose and evaluate six different schemes to encode temporal reasoning problems, in particular the Interval Algebra (IA) networks, into SAT CNF formulas. We then empirically examine the performance of local search as well as systematic solvers on the new temporal SAT representations, in comparison with solvers that operate on native IA representations. Our empirical results show that zChaff (a state-of-the-art complete SAT solver) together with the best IA-to-SAT encoding scheme, can solve temporal problems significantly faster than existing IA solvers working on the equivalent native IA networks. [Part of this study was published at the CP-05 workshop].
Style APA, Harvard, Vancouver, ISO itp.
4

Pham, Duc Nghia. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Thesis, Griffith University, 2006. http://hdl.handle.net/10072/365503.

Pełny tekst źródła
Streszczenie:
Recent research has shown that it is often preferable to encode real-world problems as propositional satisfiability (SAT) problems and then solve using a general purpose SAT solver. However, much of the valuable information and structure of these realistic problems is flattened out and hidden inside the corresponding Conjunctive Normal Form (CNF) encodings of the SAT domain. Recently, systematic SAT solvers have been progressively improved and are now able to solve many highly structured practical problems containing millions of clauses. In contrast, state-of-the-art Stochastic Local Search (SLS) solvers still have difficulty in solving structured problems, apparently because they are unable to exploit hidden structure as well as the systematic solvers. In this thesis, we study and evaluate different ways to effectively recognise, model and efficiently exploit useful structures hidden in realistic problems. A summary of the main contributions is as follows: 1. We first investigate an off-line processing phase that applies resolution-based pre-processors to input formulas before running SLS solvers on these problems. We report an extensive empirical examination of the impact of SAT pre-processing on the performance of contemporary SLS techniques. It emerges that while all the solvers examined do indeed benefit from pre-processing, the effects of different pre-processors are far from uniform across solvers and across problems. Our results suggest that SLS solvers need to be equipped with multiple pre-processors if they are ever to match the performance of systematic solvers on highly structured problems. [Part of this study was published at the AAAI-05 conference]. 2. We then look at potential approaches to bridging the gap between SAT and constraint satisfaction problem (CSP) formalisms. One approach has been to develop a many-valued SAT formalism (MV-SAT) as an intermediate paradigm between SAT and CSP, and then to translate existing highly efficient SAT solvers to the MV-SAT domain. In this study, we follow a different route, developing SAT solvers that can automatically recognise CSP structure hidden in SAT encodings. This allows us to look more closely at how constraint weighting can be implemented in the SAT and CSP domains. Our experimental results show that a SAT-based mechanism to handle weights, together with a CSP-based method to instantiate variables, is superior to other combinations of SAT and CSP-based approaches. In addition, SLS solvers based on this many-valued weighting approach outperform other existing approaches to handle many-valued CSP structures. [Part of this study was published at the AAAI-05 conference]. 3. Finally, we propose and evaluate six different schemes to encode temporal reasoning problems, in particular the Interval Algebra (IA) networks, into SAT CNF formulas. We then empirically examine the performance of local search as well as systematic solvers on the new temporal SAT representations, in comparison with solvers that operate on native IA representations. Our empirical results show that zChaff (a state-of-the-art complete SAT solver) together with the best IA-to-SAT encoding scheme, can solve temporal problems significantly faster than existing IA solvers working on the equivalent native IA networks. [Part of this study was published at the CP-05 workshop].
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Style APA, Harvard, Vancouver, ISO itp.
5

Duong, Thach-Thao Nguyen. "Improving Diversification in Local Search for Propositional Satisfiability". Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365717.

Pełny tekst źródła
Streszczenie:
In recent years, the Propositional Satisfiability (SAT) has become standard for encoding real world complex constrained problems. SAT has significant impacts on various research fields in Artificial Intelligence (AI) and Constraint Programming (CP). SAT algorithms have also been successfully used in solving many practical and industrial applications that include electronic design automation, default reasoning, diagnosis, planning, scheduling, image interpretation, circuit design, and hardware and software verification. The most common representation of a SAT formula is the Conjunctive Normal Form (CNF). A CNF formula is a conjunction of clauses where each clause is a disjunction of Boolean literals. A SAT formula is satisfiable if there is a truth assignment for each variable such that all clauses in the formula are satisfied. Solving a SAT problem is to determine a truth assignment that satisfies a CNF formula. SAT is the first problem proved to be NP-complete [20]. There are many algorithmic methodologies to solve SAT. The most obvious one is systematic search; however another popular and successful approach is stochastic local search (SLS). Systematic search is usually referred to as complete search or backtrack-style search. In contrast, SLS is a method to explore the search space by randomisation and perturbation operations. Although SLS is an incomplete search method, it is able to find the solutions effectively by using limited time and resources. Moreover, some SLS solvers can solve hard SAT problems in a few minutes while these problems could be beyond the capacity of systematic search solvers.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
Style APA, Harvard, Vancouver, ISO itp.
6

Grim, Pavel. "Převod výrazů v C do DIMACS formátu". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-234975.

Pełny tekst źródła
Streszczenie:
This work focuses on proposition of transfer of the expressions entered in the C pro­gramming language into DIMACS format and creation of program in programming language C++ making this transfer. This work contains a description of the C pro­gramming language and its operators. It also con­tains a description of the conjunctive normal form and a descri­ption of the DIMACS format. Following is a proposal for a program for the transfer of expression in the C programming language to the DIMACS format and description of reali­zation of program performing this transfer.
Style APA, Harvard, Vancouver, ISO itp.
7

Steinke, Peter. "Pseudo-Boolean Constraint Encodings for Conjunctive Normal Form and their Applications". 2019. https://tud.qucosa.de/id/qucosa%3A38409.

Pełny tekst źródła
Streszczenie:
In contrast to a single clause a pseudo-Boolean (PB) constraint is much more expressive and hence it is easier to define problems with the help of PB constraints. But while PB constraints provide us with a high-level problem description, it has been shown that solving PB constraints can be done faster with the help of a SAT solver. To apply such a solver to a PB constraint we have to encode it with clauses into conjunctive normal form (CNF). While we can find a basic encoding into CNF which is equivalent to a given PB constraint, the solving time of a SAT solver significantly depends on different properties of an encoding, e.g. the number of clauses or if generalized arc consistency (GAC) is maintained during the search for a solution. There are various PB encodings that try to optimize or balance these properties. This thesis is about such encodings. For a better understanding of the research field an overview about the state-of-the art encodings is given. The focus of the overview is a simple but complete description of each encoding, such that any reader could use, implement and extent them in his own work. In addition two novel encodings are presented: The Sequential Weight Counter (SWC) encoding and the Binary Merger Encoding. While the SWC encoding provides a very simple structure – it is listed in four lines – empirical evaluation showed its practical usefulness in various applications. The Binary Merger encoding reduces the number of clauses a PB encoding needs while having the important GAC property. To the best of our knowledge currently no other encoding has a lower upper bound for the number of clauses produced by a PB encoding with this property. This is an important improvement of the state-of-the art, since both GAC and a low number of clauses are vital for an improved solving time of the SAT solver. The thesis also contributes to the development of new applications for PB constraint encodings. The programming library PBLib provides researchers with an open source implementation of almost all PB encodings – including the encodings for the special cases at-most-one and cardinality constraints. The PBLib is also the foundation of the presented weighted MaxSAT solver optimax, the PBO solver pbsolver and the WBO, PBO and weighted MaxSAT solver npSolver.
Style APA, Harvard, Vancouver, ISO itp.
8

Illner, Petr. "Kompilace KNF do backdoor decomposable monotone circuit". Master's thesis, 2021. http://www.nusl.cz/ntk/nusl-451073.

Pełny tekst źródła
Streszczenie:
An NNF circuit is a directed acyclic graph (DAG), where each leaf is labelled with either true/false or a literal, and each inner node represents either a conjunction (∧) or a disjunction (∨). A decomposable NNF (DNNF) is an NNF satisfying the decomposabi- lity property for each conjunction node. The C-BDMC language generalizes the DNNF language. In a C-BDMC, the leaves can contain CNF formulae from a given base class C. In this paper, we focus only on renamable Horn formulae. We experimentally compare the sizes of d-BDMC and d-DNNF representations. We describe a new compilation langu- age, called cara DNNF (c-DNNF), that generalizes the DNNF language. A c-DNNF circuit can be considered as a compressed representation of a DNNF circuit. We present a new experimental knowledge compiler, called CaraCompiler, for converting a CNF formula into a d-BDMC or a (c)d-DNNF circuit. CaraCompiler is based on the state-of-the-art compiler D4. Also, we mention some extensions for the compiler D4, such as caching hypergraph cuts that can reduce the compilation times. 1
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Conjunctive normal form"

1

Jaffe, Allan S. The use of biomarkers for acute cardiovascular disease. Oxford University Press, 2015. http://dx.doi.org/10.1093/med/9780199687039.003.0035.

Pełny tekst źródła
Streszczenie:
Understanding the proper use of biomarkers requires clinicians to appreciate some critical pre-analytic and analytic issues, as well as how to use the markers properly. The bene?ts of such an approach will not only facilitate the care of patients today, but will also prepare clinicians to understand and embrace the new generation of markers that is coming and that will continue to make this area transformational for cardiology. Two fundamental concepts underlie the clinical use of biomarkers: First, biomarkers should always be used in conjunction with all other clinical information. Second, in order to maximize their diagnostic and prognostic use, biomarkers should be interpreted as quantitative variables. For example, a cardiac troponin level which is 50 times the upper limit of normal has a much higher positive predictive value for the presence of an acute myocardial infarction, compared to a level just above the upper limit of normal.
Style APA, Harvard, Vancouver, ISO itp.
2

Jaffe, Allan S. The use of biomarkers for acute cardiovascular disease. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199687039.003.0035_update_001.

Pełny tekst źródła
Streszczenie:
Understanding the proper use of biomarkers requires clinicians to appreciate some critical pre-analytic and analytic issues, as well as how to use the markers properly. The bene?ts of such an approach will not only facilitate the care of patients today, but will also prepare clinicians to understand and embrace the new generation of markers that is coming and that will continue to make this area transformational for cardiology. Two fundamental concepts underlie the clinical use of biomarkers: First, biomarkers should always be used in conjunction with all other clinical information. Second, in order to maximize their diagnostic and prognostic use, biomarkers should be interpreted as quantitative variables. For example, a cardiac troponin level which is 50 times the upper limit of normal has a much higher positive predictive value for the presence of an acute myocardial infarction, compared to a level just above the upper limit of normal.
Style APA, Harvard, Vancouver, ISO itp.
3

Jaffe, Allan S. The use of biomarkers for acute cardiovascular disease. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780199687039.003.0035_update_002.

Pełny tekst źródła
Streszczenie:
Understanding the proper use of biomarkers requires clinicians to appreciate some critical pre-analytic and analytic issues, as well as how to use the markers properly. The bene?ts of such an approach will not only facilitate the care of patients today, but will also prepare clinicians to understand and embrace the new generation of markers that is coming and that will continue to make this area transformational for cardiology. Two fundamental concepts underlie the clinical use of biomarkers: First, biomarkers should always be used in conjunction with all other clinical information. Second, in order to maximize their diagnostic and prognostic use, biomarkers should be interpreted as quantitative variables. For example, a cardiac troponin level which is 50 times the upper limit of normal has a much higher positive predictive value for the presence of an acute myocardial infarction, compared to a level just above the upper limit of normal.
Style APA, Harvard, Vancouver, ISO itp.
4

Dunne, Tim, i Eglantine Staunton. The Genocide Convention and Cold War Humanitarian Intervention. Redaktorzy Alex J. Bellamy i Tim Dunne. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780198753841.013.3.

Pełny tekst źródła
Streszczenie:
It is conventional in IR literature to observe a sharp break between the Cold War and post-Cold War phases in the evolution of human protection norms. The chapter revisits these arguments in conjunction with the cases of India in Pakistan, Vietnam in Cambodia, and Tanzania in Uganda, where unilateral interventions had humanitarian effects but neither humanitarian justifications nor external legitimation. The predominant view regarding these cases is correct; namely, no evidence can be found for the emergence of a norm of legitimate intervention for protection reasons (in the absence of host state consent). However, this perspective underestimates the extent to which there was a consolidation of norms regarding state responsibilities and how these influenced state practice during the post-1945 period. The end of the Cold War should be seen as less of a stark turning point in the history of responsible sovereignty than has previously been believed.
Style APA, Harvard, Vancouver, ISO itp.
5

Henry, Mark A., i Avinash B. Kumar. Cerebral Salt Wasting. Redaktorzy Matthew D. McEvoy i Cory M. Furse. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780190226459.003.0068.

Pełny tekst źródła
Streszczenie:
Human survival (on a biochemical level) depends on the body’s critical ability to regulate the osmolality and salinity of extracellular fluid. When functioning in a normal state, the osmoregulatory system stringently maintains the serum sodium in a narrow range. Alterations in the serum sodium and water balance have significant and sometimes life-threatening impact on patients—especially when they occur in conjunction with serious intracranial pathology. This chapter, including the case discussion, illustrates the conundrum of hyponatremia and high urine output states complicating neurological illness. A thorough understanding of the pathophysiology, assessment, and treatment of these conditions is essential for the timely delivery of care and optimal patient outcomes.
Style APA, Harvard, Vancouver, ISO itp.
6

Gluckman, Sir Peter, Mark Hanson, Chong Yap Seng i Anne Bardsley. Vitamin B12 (cobalamin) in pregnancy and breastfeeding. Oxford University Press, 2015. http://dx.doi.org/10.1093/med/9780198722700.003.0013.

Pełny tekst źródła
Streszczenie:
Vitamin B12 is required for the synthesis of fatty acids and myelin and so is crucial for normal neurological function and maintenance of the CNS. In conjunction with folate, it is involved in red blood cell formation and DNA synthesis, and in embryogenesis, it is important for proper neural tube formation and brain development. Maternal intake during pregnancy is important, as only newly absorbed vitamin B12, and not that stored in the maternal liver, is concentrated in the placenta. Despite the active transfer during pregnancy, the vitamin B12 content in the newborn is low, and the infant is dependent on breast milk for ongoing needs. Pregnant and lactating women should ensure that their diet contains sufficient (animal) sources of vitamin B12; those consuming vegan or strict vegetarian diets should either take vitamin B12 supplements or seek foods that have been fortified with vitamin B12.
Style APA, Harvard, Vancouver, ISO itp.
7

Frost, Mervyn. Ethics in Asymmetrical War. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190851163.003.0006.

Pełny tekst źródła
Streszczenie:
This chapter extends the analysis of strategy and international security in the twenty-first century, and the ethical problems Western liberal polities face in managing international security and confronting enemies in asymmetric warfare. It focuses on the notion of ‘ethical leverage’; this is a world in which power is levered through ‘ethical criticism.’ Wherever a Western liberal actor can be portrayed as acting in a manner inconsistent with its own standards, it will be damaged strategically. There are things that states and individuals ought not to do if they wish to maintain their ethical standing and the associated influence and power that go with it. It is the flouting of the West’s international norms that provides the only source of international power for the weaker party in such wars. This conjunction of strategy and ethics epitomizes the balance between power and both ethics and social construction found in Freedman.
Style APA, Harvard, Vancouver, ISO itp.
8

Wills, David. Killing Times. Fordham University Press, 2019. http://dx.doi.org/10.5422/fordham/9780823283521.001.0001.

Pełny tekst źródła
Streszczenie:
Killing Times starts from the deceptively simple observation— made by Jacques Derrida—that the death penalty mechanically interrupts mortal time, preempting our normal experience of not knowing when we will die. The book examines more broadly what constitutes mortal temporality and how the “machinery of death” exploits and perverts time. It first examines Eighth Amendment challenges to the death penalty in the U.S, from the late nineteenth-century introduction of execution by firing squad and the electric chair to current cases involving lethal injection. Although defining the instant of death emerges as an insoluble problem, all the machines of execution of the post-Enlightenment period presume to appropriate and control that instant, ostensibly in service of a humane death penalty. That comes into particular focus with the guillotine, introduced in France in 1791–92, at the same moment as the American Bill of Rights. Later chapters analyze how the instant of the death penalty works in conjunction with forms of suspension, or extension of time and how its seeming correlation between egregious crime and painless execution is complicated in various ways. The book’s emphasis on time then allows it to expand the sense of the death penalty into suicide bombing, where the terrorist seeks to bypass judicial process with a simultaneous crime and “punishment”; into targeted killing by drone, where the time-space coordinates of “justice” are compressed and disappear into the black hole of secrecy; and into narrative and fictive spaces of crime, court proceedings, and punishment.
Style APA, Harvard, Vancouver, ISO itp.
9

Mitchell, Jennifer. Ordinary Masochisms. University Press of Florida, 2020. http://dx.doi.org/10.5744/florida/9780813066677.001.0001.

Pełny tekst źródła
Streszczenie:
Ordinary Masochisms argues for literary alternatives to pervasive dictatorial norms about masochism that first surface in Victorian literature, reach their pioneering pinnacle in the modernist moment, and are expressly mourned in post-modern texts. In particular, the literary works discussed all challenge the more popular term “sadomasochism” as a conglomerate form of perversion that was named and studied in the late nineteenth century. Underscoring close textual analyses with modern theories of masochism as empowering, this book argues that Charlotte Brontë Villette (1853), George Moore’s A Drama in Muslin (1886), D.H. Lawrence’s The Rainbow (1915), and Jean Rhys’s Quartet (1928) all experiment with masochistic relationships that extend far beyond reductive early readings of inherently feminine or sexually aberrant masochism. Ordinary Masochisms begins with a historical and theoretical examination of masochism’s treatment during the nineteenth, twentieth, and twenty-first centuries before moving to an examination of the Biblical tale of Samson and Delilah in conjunction with Leopold von Sacher-Masoch’s Venus in Furs (1870), from which masochism garners its name. An intermediary chapter treats Octave Mirbeau’s The Torture Garden (1903) as a case study transitioning between sexological and psychoanalytical discourses of the nineteenth and twentieth centuries, while the conclusion about Ian McEwan’s The Comfort of Strangers (1981) addresses masochism’s seeming inability to recuperate itself from categories of deviance, despite the success of contemporary popular culture representations. The book closes with a brief consideration of masochistic reading, a subtle undercurrent of the project as a whole.
Style APA, Harvard, Vancouver, ISO itp.
10

Horing, Norman J. Morgenstern. Superfluidity and Superconductivity. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198791942.003.0013.

Pełny tekst źródła
Streszczenie:
Chapter 13 addresses Bose condensation in superfluids (and superconductors), which involves the field operator ψ‎ having a c-number component (<ψ(x,t)>≠0), challenging number conservation. The nonlinear Gross-Pitaevskii equation is derived for this condensate wave function<ψ>=ψ−ψ˜, facilitating identification of the coherence length and the core region of vortex motion. The noncondensate Green’s function G˜1(1,1′)=−i<(ψ˜(1)ψ˜+(1′))+> and the nonvanishing anomalous correlation function F˜∗(2,1′)=−i<(ψ˜+(2)ψ˜+(1′))+> describe the dynamics and elementary excitations of the non-condensate states and are discussed in conjunction with Landau’s criterion for viscosity. Associated concepts of off-diagonal long-range order and the interpretation of <ψ> as a superfluid order parameter are also introduced. Anderson’s Bose-condensed state, as a phase-coherent wave packet superposition of number states, resolves issues of number conservation. Superconductivity involves bound Cooper pairs of electrons capable of Bose condensation and superfluid behavior. Correspondingly, the two-particle Green’s function has a term involving a product of anomalous bound-Cooper-pair condensate wave functions of the type F(1,2)=−i<(ψ(1)ψ(2))+>≠0, such that G2(1,2;1′,2′)=F(1,2)F+(1′,2′)+G˜2(1,2;1′,2′). Here, G˜2 describes the dynamics/excitations of the non-superfluid-condensate states, while nonvanishing F,F+ represent a phase-coherent wave packet superposition of Cooper-pair number states and off-diagonal long range order. Employing this form of G2 in the G1-equation couples the condensed state with the non-condensate excitations. Taken jointly with the dynamical equation for F(1,2), this leads to the Gorkov equations, encompassing the Bardeen–Cooper–Schrieffer (BCS) energy gap, critical temperature, and Bogoliubov-de Gennes eigenfunction Bogoliubons. Superconductor thermodynamics and critical magnetic field are discussed. For a weak magnetic field, the Gorkov-equations lead to Ginzburg–Landau theory and a nonlinear Schrödinger-like equation for the pair wave function and the associated supercurrent, along with identification of the Cooper pair density. Furthermore, Chapter 13 addresses the apparent lack of gauge invariance of London theory with an elegant variational analysis involving re-gauging the potentials, yielding a manifestly gauge invariant generalization of the London equation. Consistency with the equation of continuity implies the existence of Anderson’s acoustic normal mode, which is supplanted by the plasmon for Coulomb interaction. Type II superconductors and the penetration (and interaction) of quantized magnetic flux lines are also discussed. Finally, Chapter 13 addresses Josephson tunneling between superconductors.
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Conjunctive normal form"

1

Shultz, Thomas R., Scott E. Fahlman, Susan Craw, Periklis Andritsos, Panayiotis Tsaparas, Ricardo Silva, Chris Drummond i in. "Conjunctive Normal Form". W Encyclopedia of Machine Learning, 209–10. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-30164-8_158.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Pfahringer, Bernhard. "Conjunctive Normal Form". W Encyclopedia of Machine Learning and Data Mining, 260–61. Boston, MA: Springer US, 2017. http://dx.doi.org/10.1007/978-1-4899-7687-1_158.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dantsin, Evgeny, i Alexander Wolpert. "Reconstruction of Boolean Formulas in Conjunctive Normal Form". W Lecture Notes in Computer Science, 592–601. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94776-1_49.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Jabbour, Said, Joao Marques-Silva, Lakhdar Sais i Yakoub Salhi. "Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form". W Logics in Artificial Intelligence, 152–65. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11558-0_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Kuznetsov, Stepan. "Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives". W Formal Grammar, 242–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39998-5_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Lin, Yi, Lucas M. Tabajara i Moshe Y. Vardi. "ZDD Boolean Synthesis". W Tools and Algorithms for the Construction and Analysis of Systems, 64–83. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_4.

Pełny tekst źródła
Streszczenie:
AbstractMotivated by applications in boolean-circuit design, boolean synthesis is the process of synthesizing a boolean function with multiple outputs, given a relation between its inputs and outputs. Previous work has attempted to solve boolean functional synthesis by converting a specification formula into a Binary Decision Diagram (BDD) and quantifying existentially the output variables. We make use of the fact that the specification is usually given in the form of a Conjunctive Normal Form (CNF) formula, and we can perform resolution on a symbolic representation of a CNF formula in the form of a Zero-suppressed Binary Decision Diagram (ZDD). We adapt the realizability test to the context of CNF and ZDD, and show that the Cross operation defined in earlier work can be used for witness construction. Experiments show that our approach is complementary to BDD-based Boolean synthesis.
Style APA, Harvard, Vancouver, ISO itp.
7

Traxler, Patrick. "Variable Influences in Conjunctive Normal Forms". W Lecture Notes in Computer Science, 101–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02777-2_12.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Balas, Egon. "Moving Between Conjunctive and Disjunctive Normal Forms". W Disjunctive Programming, 49–68. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00148-3_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kullmann, Oliver, i Xishun Zhao. "On Variables with Few Occurrences in Conjunctive Normal Forms". W Theory and Applications of Satisfiability Testing - SAT 2011, 33–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21581-0_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Nienhuys-Cheng, Shan-Hwei, Wim Van Laer, Jan Ramon i Luc De Raedt. "Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms". W Inductive Logic Programming, 245–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48751-4_23.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Conjunctive normal form"

1

Pan, Weiyu. "Optimal Conjunctive Normal Form Encoding for Symbolic Execution". W The 33rd International Conference on Software Engineering and Knowledge Engineering. KSI Research Inc., 2021. http://dx.doi.org/10.18293/seke2021-113.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Fu, Zhaohui, i Sharad Malik. "Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions". W 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07). IEEE, 2007. http://dx.doi.org/10.1109/vlsid.2007.81.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Lei, Zhendong, Shaowei Cai i Chuan Luo. "Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints". W 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/159.

Pełny tekst źródła
Streszczenie:
Satisfiability (SAT) and Maximum Satisfiability (MaxSAT) are two basic and important constraint problems with many important applications. SAT and MaxSAT are expressed in CNF, which is difficult to deal with cardinality constraints. In this paper, we introduce Extended Conjunctive Normal Form (ECNF), which expresses cardinality constraints straightforward and does not need auxiliary variables or clauses. Then, we develop a simple and efficient local search solver LS-ECNF with a well designed scoring function under ECNF. We also develop a generalized Unit Propagation (UP) based algorithm to generate the initial solution for local search. We encode instances from Nurse Rostering and Discrete Tomography Problems into CNF with three different cardinality constraint encodings and ECNF respectively. Experimental results show that LS-ECNF has much better performance than state of the art MaxSAT, SAT, Pseudo-Boolean and ILP solvers, which indicates solving cardinality constraints with ECNF is promising.
Style APA, Harvard, Vancouver, ISO itp.
4

Selman, Joe, Mohamed Amer, Alan Fern i Sinisa Todorovic. "PEL-CNF: Probabilistic event logic conjunctive normal form for video interpretation". W 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops). IEEE, 2011. http://dx.doi.org/10.1109/iccvw.2011.6130308.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Gdansky, N. I., i A. A. Denisov. "METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY". W STATE AND DEVELOPMENT PROSPECTS OF AGRIBUSINESS. DSTU-PRINT, 2020. http://dx.doi.org/10.23947/interagro.2020.1.472-475.

Pełny tekst źródła
Streszczenie:
The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.
Style APA, Harvard, Vancouver, ISO itp.
6

Čepek, Ondřej, Štefan Gurský i Petr Kučera. "On Minimum Representations of Matched Formulas (Extended Abstract)". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/706.

Pełny tekst źródła
Streszczenie:
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. We present here two results for matched CNFs: The first result is a shorter and simpler proof of the fact that Boolean minimization remains complete for the second level of polynomial hierarchy even if the input is restricted to matched CNFs. The second result is structural --- we show that if a Boolean function f admits a representation by a matched CNF then every clause minimum CNF representation of f is matched.
Style APA, Harvard, Vancouver, ISO itp.
7

Otten, Jens. "nanoCoP: Natural Non-clausal Theorem Proving". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/695.

Pełny tekst źródła
Streszczenie:
Most efficient fully automated theorem provers implement proof search calculi that require the input formula to be in a clausal form, i.e. disjunctive or conjunctive normal form. The translation into clausal form introduces a significant overhead to the proof search and modifies the structure of the original formula. Translating a proof in clausal form back into a more readable non-clausal proof of the original formula is not straightforward. This paper presents a non-clausal automated theorem prover for classical first-order logic. It is based on a non-clausal connection calculus and implemented with a few lines of Prolog code. Working entirely on the original structure of the input formula yields not only a speed up of the proof search, but the resulting non-clausal proofs are also shorter.
Style APA, Harvard, Vancouver, ISO itp.
8

Kondratiev, Victor. "Using Disjunctive Diagrams for Preprocessing of Conjunctive Normal Forms". W 2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO). IEEE, 2022. http://dx.doi.org/10.23919/mipro55190.2022.9803639.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Xu, Zhe, i Ufuk Topcu. "Transfer of Temporal Logic Formulas in Reinforcement Learning". W 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/557.

Pełny tekst źródła
Streszczenie:
Transferring high-level knowledge from a source task to a target task is an effective way to expedite reinforcement learning (RL). For example, propositional logic and first-order logic have been used as representations of such knowledge. We study the transfer of knowledge between tasks in which the timing of the events matters. We call such tasks temporal tasks. We concretize similarity between temporal tasks through a notion of logical transferability, and develop a transfer learning approach between different yet similar temporal tasks. We first propose an inference technique to extract metric interval temporal logic (MITL) formulas in sequential disjunctive normal form from labeled trajectories collected in RL of the two tasks. If logical transferability is identified through this inference, we construct a timed automaton for each sequential conjunctive subformula of the inferred MITL formulas from both tasks. We perform RL on the extended state which includes the locations and clock valuations of the timed automata for the source task. We then establish mappings between the corresponding components (clocks, locations, etc.) of the timed automata from the two tasks, and transfer the extended Q-functions based on the established mappings. Finally, we perform RL on the extended state for the target task, starting with the transferred extended Q-functions. Our implementation results show, depending on how similar the source task and the target task are, that the sampling efficiency for the target task can be improved by up to one order of magnitude by performing RL in the extended state space, and further improved by up to another order of magnitude using the transferred extended Q-functions.
Style APA, Harvard, Vancouver, ISO itp.
10

Rajna, Franciska. "A kommunikációs gráfok és a fekete-fehér SAT probléma közti összefüggések vizsgálata". W Agria Média 2020 : „Az oktatás digitális átállása korunk pedagógiai forradalma”. Eszterházy Károly Egyetem Líceum Kiadó, 2021. http://dx.doi.org/10.17048/am.2020.321.

Pełny tekst źródła
Streszczenie:
Ebben a cikkben a kommunikációs gráfok és a fekete-fehér SAT probléma közötti összefüggéseket vizsgálom. A kommunikációs gráfok olyan speciális hurokélmentes irányított gráfok, amelyeknek csúcsai logikai változók, az élei pedig a kommunikációt reprezentálják. Ilyen típusú gráfokkal lehet többek között vezeték nélküli szenzorhálózatokat is modellezni. A cikkben bemutatom a fekete-fehér SAT problémát. A fekete-fehér SAT problémák olyan logikai formulák, amelyek majdnem kielégíthetetlenek, csak két megoldásuk van, az úgynevezett fehér hozzárendelés, ahol minden változó igaz, és a fekete hozzárendelés, amelyben minden változó hamis. A fekete-fehér SAT problémák ekvivalensek az olyan konjunktív normálformában lévő logikai formulákkal, amelyekben minden klózban pozitív és negatív literálok vegyesen szerepelnek (például ilyen 3SAT klózok a -++, --+), de sem a fehér klóz, amelyben minden literál pozitív, sem a fekete klóz, amelyben minden literál negatív, nem vezethető le. Továbbá ismertetem, és hatékonyság szempontjából elemzem a kommunikációs gráfok különböző logikai modelljeit (Erős modell, Balatonboglár modell, Egyszerűsített BB modell, Gyenge modell). ----- Investigation of the relationship between communication graphs and the black and white sat ----- In this article, I examine the relationships between communication graphs and the black-andwhite SAT problem. Communication graphs are special loop-free directed graphs whose vertices are logical variables and whose edges represent communication. These types of graphs can be used to model wireless sensor networks (WSNs), among other things. I present the black-and-white SAT problem. Black-and-white SAT problems are logical formulas that are almost unsatisfiable, they have only two solutions, the so-called white assignment, where all variables are true, and the black assignment, in which all variables are false. Black-and-white SAT problems are equivalent to logical formulas in a conjunctive normal form in which positive and negative literals are mixed in each clause (e.g., such 3-SAT clauses are - ++, - +), but not the white clause in which all literals are positive, nor the black clause in which all literals are negative cannot be deduced. I also describe and analyze the different logical models of communication graphs (Strong model, Balatonboglár model, Simplified BB model, Weak model) in terms of efficiency.
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Conjunctive normal form"

1

Tao, Yang, Victor Alchanatis i Yud-Ren Chen. X-ray and stereo imaging method for sensitive detection of bone fragments and hazardous materials in de-boned poultry fillets. United States Department of Agriculture, styczeń 2006. http://dx.doi.org/10.32747/2006.7695872.bard.

Pełny tekst źródła
Streszczenie:
As Americans become increasingly health conscious, they have increased their consumptionof boneless white and skinless poultry meat. To the poultry industry, accurate detection of bonefragments and other hazards in de-boned poultry meat is important to ensure food quality andsafety for consumers. X-ray imaging is widely used for internal material inspection. However,traditional x-ray technology has limited success with high false-detection errors mainly becauseof its inability to consistently recognize bone fragments in meat of uneven thickness. Today’srapid grow-out practices yield chicken bones that are less calcified. Bone fragments under x-rayshave low contrast from meat. In addition, the x-ray energy reaching the image detector varieswith the uneven meat thickness. Differences in x-ray absorption due to the unevenness inevitablyproduce false patterns in x-ray images and make it hard to distinguish between hazardousinclusions and normal meat patterns even by human visual inspection from the images.Consequently, the false patterns become camouflage under x-ray absorptions of variant meatthickness in physics, which remains a major limitation to detecting hazardous materials byprocessing x-ray images alone.Under the support of BARD, USDA, and US Poultry industries, we have aimed todeveloping a new technology that uses combined x-ray and laser imaging to detect bonefragments in de-boned poultry. The technique employs the synergism of sensors of differentprinciples and has overcome the deficiency of x-rays in physics of letting x-rays work alone inbone fragment detection. X-rays in conjunction of laser-based imaging was used to eliminatefalse patterns and provide higher sensitivity and accuracy to detect hazardous objects in the meatfor poultry processing lines.Through intensive research, we have met all the objectives we proposed during the researchperiod. Comprehensive experiments have proved the concept and demonstrated that the methodhas been capable of detecting frequent hard-to-detect bone fragments including fan bones andfractured rib and pulley bone pieces (but not cartilage yet) regardless of their locations anduneven meat thickness without being affected by skin, fat, and blood clots or blood vines.
Style APA, Harvard, Vancouver, ISO itp.
2

Avis, William. Responsible E-Waste Value Chains in Africa. Institute of Development Studies (IDS), styczeń 2022. http://dx.doi.org/10.19088/k4d.2022.015.

Pełny tekst źródła
Streszczenie:
Population growth, increasing prosperity and changing consumer habits globally are increasing demand for consumer electronics. Further to this, rapid changes in technology, falling prices, increased affordability and consumer appetite for new products have exacerbated e-waste management challenges and seen millions of tons of electronic devices become obsolete. This rapid literature review collates evidence from academic, policy focussed and grey literature on e-waste value chains. The report should be read I conjunction with an earlier report on e-waste management. E-waste is any electrical or electronic equipment, including all components, subassemblies and consumables, which are part of the equipment at the time the equipment becomes waste. When e-waste is collected and treated formally, it normally includes the following steps: Collection, Sorting and disassembly, Size reduction, Separation. The following five pillars of a sustainable e-waste management system have been identified: • Business and finance • Policy and regulation • Technology and skills • Monitoring and control • Marketing and awareness As such, to support the development of a responsible e-waste value chain, the following elements must be addressed. • Understanding how e-waste is currently managed • There is no one-size-fits all solution to building a robust e-waste management system based on extended producer responsibility. • An e-waste system built without a participatory approach is likely to be hampered by a series of issues. • An overarching policy is necessary • The choices made for the sector should be founded on two crucial elements – data from on the ground, and inputs from stakeholders. • Enforcement is incumbent on the government mandate The push towards a circular economy has provided stakeholders across the value chain with an impetus to initiate systemic improvements and invest in infrastructure and awareness raising.
Style APA, Harvard, Vancouver, ISO itp.
3

Hodges, Thomas K., i David Gidoni. Regulated Expression of Yeast FLP Recombinase in Plant Cells. United States Department of Agriculture, wrzesień 2000. http://dx.doi.org/10.32747/2000.7574341.bard.

Pełny tekst źródła
Streszczenie:
Research activities in both our laboratories were directed toward development of control of the FLP/frt recombination system for plants. As described in the text of the research proposal, the US lab has been engaged in developing regulatory strategies such as tissue-specific promoters and the steroid-inducible activation of the FLP enzyme while the main research activities in Israel have been directed toward the development and testing of a copper-regulated expression of flp recombinase in tobacco (this is an example of a promoter activation by metal ions). The Israeli lab hat additionally completed experiments of previous studies regarding factors affecting the efficiency of recombinase activity using both a gain-of-function assay (excisional-activation of a gusA marker) and loss of function assay (excision of a rolC marker) in tobacco. Site-specific recombinase systems, in particular the FLP/frt and R/RS systems of yeast and the Cre/lox system of bacteriophage P1, have become an essential component of targeted genetic transformation procedures both in animal and plant organisms. To provide more flexibility in transgene excisions by the recombinase systems as well as gene targeting, and to widen possible applications, the development of controlled or regulated recombination systems is highly desirable and was therefore the subject of this research proposal. There are a few possible mechanisms to regulate expression of a recombinase system. They include: 1) control of the recombination system by having the target sites (e.g. frt) in one plant and the flp recombinase gene in another, and bringing the two together by cross fertilization. 2) regulation of promoter activities by external stimuli such as temperature, chemicals, metal ions, etc. 3) regulation of promoter activities by internal signals, i.e. cell- or tissue-specific, or developmental regulation. 4) regulation of enzyme activity by providing cofactors essential for biochemical reactions to take place such as steroid molecules in conjunction with a steroid ligand-binding protein (domains). During the course of this research our major emphasis have been focused toward studying the feasibility of hybrid seed production in Arabidopsis, using FLP/frt. Male-sterility was induced using the antisence of a pollen- and tapetum-specific gene, bcp1, isolated from Arabidopsis. The sterility inducing gene was flanked by frt sites. Upon cross pollination of flowers of male-sterile plants with pollen from FLP-containing plants, viable seeds were produced, and the progeny hybrid plants developed normally. The major achievement from this work is the first demonstration of using a site-specific recombinase to restore fertility in male-sterile plants (see attached paper, Luo et al., Plant J 2000; 23:423-430). The implication from this finding is that site-specific recombination systems can be applied in crop plants as a useful alternative method for hybrid seed production.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Conjunctive normal form” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii