Multilevel Modeling on Underdispersion Data

Binomial negative regression is able to handle poisson regression problem with underdispersion assumption. When the data has hierarchy and level that need to be calculated, regression is no longer appropriate to solve this problem, therefore binomial negative regression is used. To solve multilevel binomial negative regression modeling, several steps need to be fulfill: poisson assumption test and underdispersion assumption test, parameter estimation with expectation-maximization algorithm, variance components estimation, feasibility test with likelihood ratio test, significance parameter test with wald test and determining the best model. This research modeled the numbers of neonatal death in district as cluster 1 and small public health center as cluster 2, in the correlation with the number of visit on trimester 1 and 3, number of pregnant mother who have Tetanus Diphtheria vaccination, assumed number of neonatal babies with complication disease, numbers of babies who got Hepatitis B vaccination less than 24 hour, numbers of babies who got BCG vaccination and also number of visit neonatal 1 and 3.  The result shows that number of neonatal death is only affected by number of babies who had Hepatitis B vaccination less than 24 hou

Security Limitations of Classical-Client Delegated Quantum Computing

Secure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical delegation of quantum computation is classical-client remote state preparation ($RSP_{CC}$), where a client remotely prepares a quantum state using a classical channel. However, the privacy loss incurred by employing $RSP_{CC}$ as a sub-module is unclear. In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner (ICS'11). We first identify the goal of $RSP_{CC}$ as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using $RSP_{CC}$. First, we uncover a fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states. Any classically constructed ideal RSP resource must leak to the server the full classical description (possibly in an encoded form) of the generated quantum state, even if we target computational security only. As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem. Second, the above result does not rule out that a specific $RSP_{CC}$ protocol can replace the quantum channel at least in some contexts, such as the Universal Blind Quantum Computing (UBQC) protocol of Broadbent et al. (FOCS '09). However, we show that the resulting UBQC protocol cannot maintain its proven composable security as soon as $RSP_{CC}$ is used as a subroutine. Third, we show that replacing the quantum channel of the above UBQC protocol by the $RSP_{CC}$ protocol QFactory of Cojocaru et al. (Asiacrypt '19), preserves the weaker, game-based, security of UBQC.Comment: 40 pages, 12 figure

Аудіовізуальні особливості пейзажистики ранніх балад Т. Шевченка

(uk) У статті осмислюються аудіовізуальні особливості пейзажотворення в ранній творчості Тараса Шевченка. На матеріалі балад «Причинна», «Тополя», «Утоплена» розглядається сугестивна майстерність поета, здатність до живописання словом, створення ілюзії присутності реципієнта в художньому світі твору.(en) Audiovisual features of the landscape descriptionin the early Shevchenko’s ballads. The paper interprets audiovisual features of the landscape description in the early works of Taras Shevchenko. Suggestive poetic skill, capability of word skill, creating the illusion of recipient’s presence in the worldof the art works are considered on the material of the ballads "The Girl under a Spell", "Poplar", "A Drowned Girl"

Quantum walks: a comprehensive review

Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists, mathematicians and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.Comment: Paper accepted for publication in Quantum Information Processing Journa

Photonic quantum information processing: a review

Photonic quantum technologies represent a promising platform for several applications, ranging from long-distance communications to the simulation of complex phenomena. Indeed, the advantages offered by single photons do make them the candidate of choice for carrying quantum information in a broad variety of areas with a versatile approach. Furthermore, recent technological advances are now enabling first concrete applications of photonic quantum information processing. The goal of this manuscript is to provide the reader with a comprehensive review of the state of the art in this active field, with a due balance between theoretical, experimental and technological results. When more convenient, we will present significant achievements in tables or in schematic figures, in order to convey a global perspective of the several horizons that fall under the name of photonic quantum information.Comment: 36 pages, 6 figures, 634 references. Updated version with minor changes and extended bibliograph

Mathematical competencies as perceived by engineering students, lecturers, and practicing engineers

Mathematical competencies (MCs) are essential for engineering students to be competent and qualified engineers after graduation. The term mathematical competence refers to the ability to understand, judge, do and use mathematical concepts in relevant contexts and situations, which is the predominant goal of mathematical education for engineers. This paper will discuss the required MCs of engineers at the workplace as compared to acquired MCs of engineering undergraduates and also the difference in expectation of engineering lecturers from engineering students at graduation. A qualitative approach was used to investigate the required, acquired and expected mathematical competencies as well as the mismatch between these competencies. Semi structured interviews were carried out to collect data from 20 engineers, 41 engineering students and 4 engineering lecturers. The findings indicated that there were differences between the perceptions of acquired and the required MCs. The results showed that there is a need to review the focus of engineering mathematics curriculum to prospective engineers taking into account the attainment of mathematical competencies. These competencies need to be included as explicit learning outcomes in addition to the development of mathematical concepts, aptitude and skills