Relevant bibliographies by topics / Partial Completeness

Academic literature on the topic 'Partial Completeness'

Author: Grafiati
Published: 11 March 2023

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 'Partial Completeness.'

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 "Partial Completeness"

1

Mecheraoui, Rachid, Aiman Mukheimer, and Stojan Radenović. "From G-Completeness to M-Completeness." Symmetry 11, no. 7 (June 27, 2019): 839. http://dx.doi.org/10.3390/sym11070839.

Full text
Abstract:
The purpose of this paper is to obtain a sufficient condition for a G-Cauchy sequence to be an M-Cauchy sequence in fuzzy metric spaces. Our main result provides a partial answer to the open question posed by V. Gregori and A. Sapena. For application, we give a new fuzzy version of the Banach fixed point theorem.
APA, Harvard, Vancouver, ISO, and other styles
2

Haddad, Lucien, and I. G. Rosenberg. "Completeness theory for finite partial algebras." Algebra Universalis 29, no. 3 (September 1992): 378–401. http://dx.doi.org/10.1007/bf01212439.

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

Romov, B. A. "The completeness problem in partial hyperclones." Discrete Mathematics 306, no. 13 (July 2006): 1405–14. http://dx.doi.org/10.1016/j.disc.2005.11.033.

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

Freitag, James. "Completeness in partial differential algebraic geometry." Journal of Algebra 420 (December 2014): 350–72. http://dx.doi.org/10.1016/j.jalgebra.2014.07.025.

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

ISOBE, Shuji, and Eisuke KOIZUMI. "Autoreducibility and Completeness for Partial Multivalued Functions." IEICE Transactions on Information and Systems E100.D, no. 3 (2017): 422–27. http://dx.doi.org/10.1587/transinf.2016fcp0006.

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

Mykhaylyuk, Volodymyr, and Vadym Myronyk. "Compactness and completeness in partial metric spaces." Topology and its Applications 270 (February 2020): 106925. http://dx.doi.org/10.1016/j.topol.2019.106925.

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

Paesano, Daniela, and Pasquale Vetro. "Fixed points and completeness on partial metric spaces." Miskolc Mathematical Notes 16, no. 1 (2015): 369. http://dx.doi.org/10.18514/mmn.2015.710.

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

Hitchcock, John M., A. Pavan, and N. V. Vinodchandran. "Partial Bi-immunity, Scaled Dimension, and NP-Completeness." Theory of Computing Systems 42, no. 2 (July 4, 2007): 131–42. http://dx.doi.org/10.1007/s00224-007-9000-2.

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

Heering, Jan. "Partial evaluation and ω-completeness of algebraic specifications." Theoretical Computer Science 43 (1986): 149–67. http://dx.doi.org/10.1016/0304-3975(86)90173-8.

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

Burdick, Bruce S. "On the use of partial orders in uniform spaces." Applied General Topology 4, no. 1 (April 1, 2003): 99. http://dx.doi.org/10.4995/agt.2003.2013.

Full text
Abstract:
<p>We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditions and four different convergence conditions yield 36 completeness properties, each of which turns out to be equivalent to a known form of completeness. We also use these preordered nets to characterize the functors θ, λ, and v, which are associated with these completeness properties. In the case of λ we give an example to show that the analogous characterization with predirected nets does not work.</p>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Partial Completeness"

1

Campion, Marco. "Partial (In)Completeness in Abstract Interpretation." Doctoral thesis, 2021. http://hdl.handle.net/11562/1049799.

Full text
Abstract:
In the abstract interpretation framework, completeness represents an optimal simulation by the abstract operators over the behavior of the concrete operators. This corresponds to an ideal (often rare) feature where there is no loss of information accumulated in abstract computations with respect to the properties encoded by the underlying abstract domains. In this thesis, we deal with the opposite notion of completeness in abstract interpretation, that is, incompleteness, applied to two different contexts: static program analysis and formal languages over the Chomsky's hierarchy. In static program analysis, completeness is a very rare condition to be satisfied in practice and only the straightforward abstractions are complete for all programs, thus, we usually deal with incompleteness. For this reason, we introduce the notion of partial completeness. Partial completeness is a weaker notion of completeness which requires the imprecision of the analysis to be limited. A partially complete abstract interpretation allows some false alarms to be reported, but their number is bounded by a constant. We collect in partial completeness classes all the programs whose abstract interpretations share the same upper bound of imprecision. We then focus on the investigation of the computational limits of the class of partially complete programs with respect to a given abstract domain. Moreover, we show that the class of all partially complete programs is non-recursively enumerable, and its complement is productive whenever we allow an unlimited imprecision in the abstract domain. Finally, we formalize the local partial completeness class within which we require partial completeness only on some specific inputs. We prove that this last class of programs is a recursively enumerable set under a structural hypothesis on the underlying abstract domain, by showing an algorithm capable of proving the local partial completeness of a program with respect to a given abstract domain and an upper bound of imprecision. In formal language theory, we want to study a possible reformulation, by abstract interpretation, of classes of languages in the Chomsky's hierarchy, and, by exploiting the incompleteness of languages abstractions, we want to define separation results between classes of languages. To this end, we do a first step into this direction by studying the relation between indexed languages (recognized by indexed grammars) and context-free languages. Indexed grammars are a generalization of context-free grammars which recognize a proper subset of context-sensitive languages, the so called indexed languages. %The class of languages recognized by indexed grammars is called indexed languages and they correspond to the languages recognized by nested stack automata. For example, indexed grammars can recognize the language ${a^nb^nc^n mid ngeq 1 }$ which is not context-free, but they cannot recognize ${ (ab^n)^n mid ngeq 1}$ which is context-sensitive. Indexed grammars identify a set of languages that are more expressive than context-free languages, while having decidability results that lie in between the ones of context-free and context-sensitive languages. We provide a fixpoint characterization of the languages recognized by an indexed grammar and we study possible ways to abstract, in the abstract interpretation sense, these languages and their grammars into context-free and regular languages. We formalize the separation class between indexed and context-free languages, i.e., all the languages that cannot be generated by a context-free grammar, as an instance of incompleteness of stack elimination abstraction over indexed grammars.
APA, Harvard, Vancouver, ISO, and other styles
2

"On completeness of partial metric spaces, symmetric spaces and some fixed point results." Thesis, 2016. http://hdl.handle.net/10500/23206.

Full text
Abstract:
The purpose of the thesis is to study completeness of abstract spaces. In particular, we study completeness in partial metric spaces, partial metric type spaces, dislocated metric spaces, dislocated metric type spaces and symmetric spaces that are generalizations of metric spaces. It is well known that complete metric spaces have a wide range of applications. For instance, the classical Banach contraction principle is phrased in the context of complete metric spaces. Analogously, the Banach's xed point theorem and xed point results for Lipschitzian maps are discussed in this context, namely in, partial metric spaces and metric type spaces. Finally, xed point results are presented for symmetric spaces
Mathematical Sciences
Ph. D. (Mathematics)
APA, Harvard, Vancouver, ISO, and other styles
3

Aphane, Maggie. "On completeness of partial metric spaces, symmetric spaces and some fixed point results." Thesis, 2016. http://hdl.handle.net/10500/23223.

Full text
Abstract:
The purpose of the thesis is to study completeness of abstract spaces. In particular, we study completeness in partial metric spaces, partial metric type spaces, dislocated metric spaces, dislocated metric type spaces and symmetric spaces that are generalizations of metric spaces. It is well known that complete metric spaces have a wide range of applications. For instance, the classical Banach contraction principle is phrased in the context of complete metric spaces. Analogously, the Banach's xed point theorem and xed point results for Lipschitzian maps are discussed in this context, namely in, partial metric spaces and metric type spaces. Finally, xed point results are presented for symmetric spaces.
Geography
Ph. D. (Mathematics)
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Partial Completeness"

1

Completeness of root functions of regular differential operators. Essex, England: Longman Scientific & Technical, 1994.

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

Schneider, Dona. Completeness and accuracy of cancer mortality and incidence data: Vital records, tumor registries, and hospital medical records : a selected and partially annotated bibliography. Monticello, Ill., USA: Vance Bibliographies, 1989.

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

Michael, Furmston, Tolhurst G J, and Mik Eliza. 11 Certainty and Completeness. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198724032.003.0011.

Full text
Abstract:
This chapter discusses the issues of uncertainty and incompleteness in contract formation. A contract is said to be void if it is uncertain or incomplete. A term contained in the contract will be uncertain if it totally lacks meaning or if a court cannot determine the meaning the parties intended. Generally, a contract will be void for uncertainty if it is not possible to prescribe meaning to an essential term. A term will be incomplete if it does not adequately deal with an issue that has arisen under the contract and which falls within its subject matter. A contract will be void for being incomplete if any incomplete term or terms are essential to the contract and cannot be supplied by some gap-filling technique. The chapter also covers agreements to agree and agreements to negotiate, and methods by which the courts and the parties resolve uncertainty and incompleteness.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Partial Completeness"

1

Binding, Paul, and Rostyslav Hryniv. "Full- and Partial-Range Completeness." In Linear Operators and Matrices, 121–33. Basel: Birkhäuser Basel, 2002. http://dx.doi.org/10.1007/978-3-0348-8181-4_10.

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

Bonifacio, Adilson Luiz, and Arnaldo Vieira Moura. "Test Suite Completeness and Partial Models." In Software Engineering and Formal Methods, 96–110. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10431-7_8.

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

Cousot, Patrick. "Partial Completeness of Abstract Fixpoint Checking." In Lecture Notes in Computer Science, 1–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44914-0_1.

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

Demuth, M., E. Giere, and K. B. Sinha. "A Semigroup Criterion for the Completeness of Scattering Systems." In Partial Differential Equations and Spectral Theory, 93–102. Basel: Birkhäuser Basel, 2001. http://dx.doi.org/10.1007/978-3-0348-8231-6_11.

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

Hendrix, Joe, Manuel Clavel, and José Meseguer. "A Sufficient Completeness Reasoning Tool for Partial Specifications." In Lecture Notes in Computer Science, 165–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-32033-3_13.

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

Skibsted, Erik. "On the Asymptotic Completeness for Particles in Constant Electromagnetic Fields." In Partial Differential Equations and Mathematical Physics, 286–320. Boston, MA: Birkhäuser Boston, 1996. http://dx.doi.org/10.1007/978-1-4612-0775-7_19.

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

Beurskens, Paul T., and Cornelia Smykalla. "From Partial Structure to Completeness — Direct Methods Applied to Difference Structure Factors." In Direct Methods of Solving Crystal Structures, 281–90. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4899-3692-9_28.

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

Kacprzyk, Janusz, and Grażyna Szkatuła. "An Inductive Learning Algorithm with a Partial Completeness and Consistence via a Modified Set Covering Problem." In Lecture Notes in Computer Science, 661–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11550907_105.

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

Phipps, Thomas E. "On the “Completeness” of Quantum Mechanics." In Wave-Particle Duality, 193–205. Boston, MA: Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3332-0_12.

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

Frankel, Adam, and B. Mark Smithers. "Gastroesophageal Reflux Disease." In Mastering Endo-Laparoscopic and Thoracoscopic Surgery, 219–27. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-3755-2_34.

Full text
Abstract:
AbstractGastroesophageal reflux disease (GORD) is defined as troublesome symptoms and/or injury to the oesophageal mucosa consistent with acid exposure [1]. GORD is common, with an age-adjusted global prevalence of 9% but significant variation across the world [2]. The diagnosis can often be made on clinical grounds and is more likely if there is at least a partial response to a proton pump inhibitor (PPI) [3]. Indications for oesophageal testing have been recently updated in international consensus guidelines, which include guidelines where diagnosis is not clearly established [4]. Fundoplication is the use of the gastric fundus to create a high-pressure zone on or around the lower oesophagus and is usually performed laparoscopically. It can be considered in terms of the completeness of the wrap (generally from 90 to 360°), and if less than 360°, whether the wrap is brought anterior to the oesophagus, posterior, or both. The efficacy and side effect profiles of many of the approaches have been subjected to randomised trials: anterior 90 vs 360° [5]; anterior 180 vs 360° [6]; and posterior 270 vs 360° [7]. The relative merits of each have been recently reviewed by Morino and colleagues [8]. Fundoplication is at least as safe and effective as PPI in relieving the symptoms of GORD [9]. For PPI-refractory GORD, fundoplication is more effective than escalating medical therapy [10].
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Partial Completeness"

1

Marín, Josefa. "Partial quasi-metric completeness and Caristi's type mappings." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756274.

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

Zou, H., A. H. Tewfik, and W. Xu. "Completeness and stability of partial dyadic wavelet domain signal representations." In Proceedings of ICASSP '93. IEEE, 1993. http://dx.doi.org/10.1109/icassp.1993.319498.

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

Guo, Yan, Chenglu Wen, Xiaotian Sun, Cheng Wang, and Jonathan Li. "Partial 3D Object Retrieval and Completeness Evaluation for Urban Street Scene." In IGARSS 2019 - 2019 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2019. http://dx.doi.org/10.1109/igarss.2019.8898701.

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

Keren, Sarah, Sara Bernardini, Kofi Kwapong, and David C. Parkes. "Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents." 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/55.

Full text
Abstract:
A common approach to planning with partial information is replanning: compute a plan based on assumptions about unknown information and replan if these assumptions are refuted during execution. To date, most planners with incomplete information have been designed to provide guarantees on completeness and soundness for the generated plans. Switching focus to performance, we measure the robustness of a plan, which quantifies the plan’s ability to avoid failure. Given a plan and an agent’s belief, which describes the set of states it deems as possible, robustness counts the number of world states in the belief from which the plan will achieve the goal without the need to replan. We formally describe the trade-off between robustness and plan cost and offer a solver that is guaranteed to produce plans that satisfy a required level of robustness. By evaluating our approach on a set of standard benchmarks, we demonstrate how it can improve the performance of a partially informed agent.
APA, Harvard, Vancouver, ISO, and other styles
5

Turečková, Kamila. "Syntéza typologie a kategorizace brownfieldů." In XXIV. mezinárodního kolokvia o regionálních vědách. Brno: Masaryk University Press, 2021. http://dx.doi.org/10.5817/cz.muni.p210-9896-2021-59.

Full text
Abstract:
The aim of the presented paper is to synthesize a partial non-uniform typology of brownfields into a logical and complex framework with reference to the content and classification completeness. The synthesis of typological schemes and their objective categorization into standard classes and groups reflecting the general requirements for the characteristics of brownfields that will allow to define individual brownfields in a uniform way and furtherly works with them analytically on the background of standardized categories. The presented categorization of brownfields is based on the already used division, which expands with new groups and factually harmonizes them. Part of the paper is also the definition of specific types of brownfields, such as blackfield, greyfield or bluefield.
APA, Harvard, Vancouver, ISO, and other styles
6

Delgrande, James. "A Preference-Based Approach to Defeasible Deontic Inference." 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/33.

Full text
Abstract:
In this paper we present an approach to defeasible deontic inference. Given a set of rules R expressing conditional obligations and a formula A giving contingent information, the goal is to determine the most desirable outcome with respect to this information. Semantically, the rules R induce a partial preorder on the set of models, giving the relative desirability of each model. Then the set of minimal A models characterises the best that can be attained given that A holds. A syntactic approach is also given, in terms of maximal subsets of material counterparts of rules in R, and that yields a formula that expresses the best outcome possible given that A holds. These approaches are shown to coincide, providing an analogue to a soundness and completeness result. Complexity is not unreasonable, being at the second level of the polynomial hierarchy when the underlying logic is propositional logic. The approach yields desirable and intuitive results, including for the various “paradoxes” of deontic reasoning. The approach also highlights an interesting difference in how specificity is dealt with in nonmonotonic and deontic reasoning.
APA, Harvard, Vancouver, ISO, and other styles
7

Ravishankar, Mahesh, Sandip Mazumder, and Ankan Kumar. "Finite-Volume Solution of the P3 Equations of Radiative Transfer and Coupling to Reacting Flow Calculations." In ASME 2009 Heat Transfer Summer Conference collocated with the InterPACK09 and 3rd Energy Sustainability Conferences. ASMEDC, 2009. http://dx.doi.org/10.1115/ht2009-88014.

Full text
Abstract:
The method of spherical harmonics (or PN) is a popular method for approximate solution of the radiative transfer equation (RTE) in participating media. A rigorous conservative finite-volume (FV) procedure is presented for discretization of the P3 equations of radiative transfer in two-dimensional geometry—a set of four coupled second-order partial differential equations. The FV procedure, presented here, is applicable to any arbitrary unstructured mesh topology. The resulting coupled set of discrete algebraic equations are solved implicitly using a coupled solver that involves decomposition of the computational domain into groups of geometrically contiguous cells using the Binary Spatial Partitioning algorithm, followed by fully implicit coupled solution within each cell group using a pre-conditioned Generalized Minimum Residual (GMRES) solver. The RTE solver is first verified by comparing predicted results with published Monte Carlo (MC) results for a benchmark problem. For completeness, results using the P1 approximation are also presented. As expected, results agree well with MC results for large/intermediate optical thicknesses, and the discrepancy between MC and P3 results increase as the optical thickness is decreased. The P3 approximation is found to be more accurate than the P1 approximation for optically thick cases. Finally, the new RTE solver is coupled to a reacting flow code and demonstrated for a laminar flame calculation using an unstructured mesh. It is found that the solution of the 4 P3 equations requires 14.5% additional CPU time, while the solution of the single P1 equation requires 9.3% additional CPU time over the 10 equations that are solved for the reacting flow calculations.
APA, Harvard, Vancouver, ISO, and other styles
8

Sood, P. C., R. K. Sheline, R. W. Hoff, and A. K. Jain. "Completeness of two‐particle spectra of deformed nuclei." In Capture gamma‐ray spectroscopy. American Institute of Physics, 1991. http://dx.doi.org/10.1063/1.41164.

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

LIU, MIN, KAIYUN WANG, and BIN ZHAO. "A NOTE ON COMPLETENESS OF L-PARTIALLY ORDERED SETS." In Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0070.

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

Razniewski, Simon, Flip Korn, Werner Nutt, and Divesh Srivastava. "Identifying the Extent of Completeness of Query Answers over Partially Complete Databases." In SIGMOD/PODS'15: International Conference on Management of Data. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2723372.2750544.

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

Reports on the topic "Partial Completeness"

1

Baader, Franz, and Barbara Morawska. Matching with respect to general concept inclusions in the Description Logic EL. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.205.

Full text
Abstract:
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL EL, it was shown in 2000 that the matching problem is NP-complete. It then took almost 10 years before this NP-completeness result could be extended from matching to unification in EL. The next big challenge was then to further extend these results from matching and unification without a TBox to matching and unification w.r.t. a general TBox, i.e., a finite set of general concept inclusions. For unification, we could show some partial results for general TBoxes that satisfy a certain restriction on cyclic dependencies between concepts, but the general case is still open. For matching, we solve the general case in this paper: we show that matching in EL w.r.t. general TBoxes is NP-complete by introducing a goal-oriented matching algorithm that uses non-deterministic rules to transform a given matching problem into a solved form by a polynomial number of rule applications. We also investigate some tractable variants of the matching problem.
APA, Harvard, Vancouver, ISO, and other styles
2

Hanbali, Layth, Elliot Hannon, Susanna Lehtimaki, Christine McNab, and Nina Schwalbe. Independent Monitoring Mechanism for the Pandemic Accord: Accountability for a safer world. United Nations University International Institute of Global Health, November 2022. http://dx.doi.org/10.37941/rr/2022/1.

Full text
Abstract:
To address the challenges in pandemic preparedness and response (PPR), the World Health Assembly (WHA), at a special session in November 2021, established an Intergovernmental Negotiating Body (the INB) and tasked it with drafting a new legal instrument for PPR. During its second meeting in July 2022, the INB decided to develop the accord under Article 19 of the WHO Constitution, which grants the WHO the authority to negotiate a legally-binding Convention or Agreement and requires ratification by countries according to their local laws to enter into force. The aim is to complete negotiations and adopt a new pandemic instrument at the WHA in May 2024. The new legally binding agreement aims to address many of the failures exposed by the COVID-19 pandemic. However, the adoption of such an agreement is not the end of the process but the beginning. The negotiations on the instrument must establish a mechanism to monitor countries' compliance with the accord, particularly on the legally-binding elements. In this paper, we recommend creating such a mechanism as part of the accord: an independent committee of experts that monitors state parties' compliance with the pandemic accord and the timeliness, completeness, and robustness of states’ reports on their obligations. Its primary purpose would be to verify state self-reports by triangulating them with a range of publicly available information, making direct inquiries, and accepting confidential submissions. It would report its findings to a body consisting of or that is directly accountable to heads of state, with a particular focus on elevating instances of non-compliance or inadequate reporting. Its reports would also be available to the public. The proposed design builds on the analysis of strengths and weaknesses of existing monitoring approaches to 11 international treaties and mechanisms within and outside of health, a review of the literature, and interviews and input from more than 40 experts from around the world.
APA, Harvard, Vancouver, ISO, and other styles
3

Rudyk, Myroslava. COMMUNICATIVE FEATURES OF UKRAINIAN VIDEO BLOGS ON THE EXAMPLE OF YOUTUBE-CHANNELS OF «TORONTO TV», YANINA SOKOLOVA, AND OSTAP DROZDOV. Ivan Franko National University of Lviv, March 2021. http://dx.doi.org/10.30970/vjo.2021.50.11111.

Full text
Abstract:
The article is devoted to the study of the Ukrainian segment of video blogging as one of the most popular types of the functioning of the modern blogosphere. The content and statistics of popular video blogs were studied on the example of YouTube channels of Ukrainian bloggers and famous journalists. Today we are witnessing the rapid development of technologies that help journalists become better, and the creators of media content to work more quickly and ensure the completeness of the information. With the help of Internet communication, new ways of disseminating information have appeared in journalism. Journalists more often create their blogs on various platforms. Blogosphere video content has become very popular among the Ukrainian audience on YouTube because today the video format is the most effective in terms of communication. The YouTube social network partially replaces television, and the variety of thematic content is ably adapted to a wide audience. The paper analyzes Ukrainian blogs managed by journalists, where they publish different content formats. Therefore, the presentation of various examples of video blogs in our work helps to understand the specifics of Ukrainian blogging at its current stage of development. After all, videos of popular people such as Michael Shchur, Yanina Sokolova, Ostap Drozdov demonstrate the peculiarities of Ukrainian popular video content. For the research, we chose those blogs that are currently relevant to Ukrainian YouTube and have their specifics and uniqueness. The main objective of a blogger is to react quickly to the flow of information because the rating of the channel being monetized depends on it. With the help of statistical data, we can conclude that the Ukrainian audience is interested in a wide range of different information. Viewers now value the independent opinion of bloggers and more often listen to it. Every important event is covered by bloggers promptly. And the format in which it is presented depends on the individual style of the author and the concept of his channel. We can conclude that the video content of the modern blogosphere is developing rapidly. This provides the audience with information for different tastes.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Partial Completeness' for particular source types:
Journal articles
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