4,594 research outputs found
The hydrolysis of hydroxamic acid complexants in the presence of non-oxidizing metal ions 2: Neptunium (IV) ions.
No full textHydroxamic acids are salt free, organic compounds with affinities for cations such as Fe3+, Np4+ and Pu4+, and have been identified as suitable reagents for the control of Pu and Np in advanced nuclear fuel reprocessing. The results of a UV-visible, near-IR spectrophotometric study of the 1:1 and 2:1 complexes formed between formo- and aceto-hydroxamic acids (FHA, AHA) and Np(IV) ions are interpreted using speciation diagrams for the identification of the species present at different pH and ligand to metal ratios. A kinetic model that describes the instability of the complex due to hydrolysis of the hydroxamate moiety, previously developed for the Fe(III)-AHA complexes (Andrieux et al. in J. Solution Chem. 36:1201-1217, [2007]), is tested here against experimental Np(IV)-FHA data. Consequently, the complexation constant for formation of the 1:1 Np(IV)-FHA complex in nitric acid is estimated at K-1=2715 and indications are that complexation protects the ligand against hydrolysis at 0.1 > pH >-0.1
The Fox or Mr Fox?: Particularization of the bare noun
No full textIn numeral classifier languages a dog-type noun (i.e. a noun that refers to a kind subsuming some similar individuated entities or things) is also an NP by default. This in turn means that unlike in an English-like language, the move from the general (as is indicated by a noun) to the particular (as is indicated by an NP) is not grammatically marked in such a language. The current paper demonstrates how Assamese, a numeral classifier language spoken in Assam, a north eastern province of India, allows the bare noun to be used at the sentential level for different degrees of particularity. Thus, in the following example from Assamese (taken from a popular folk tale) tetiā xiāl-e kole…. [tetiā ‘then’; xiāle ‘fox-NOM’; kole ‘said’] the bare noun xiāl ‘fox’ is used as an NP, precisely as a proper name. The paper thus argues that we have a better English translation of the concerned Assamese sentence in “Mr Fox then said…” rather than in “The fox then said….”. The Assamese data used in the paper comes from the author’s native speaker competency in the language
The Fox or Mr Fox?: Particularization of the bare noun
No full textIn numeral classifier languages a dog-type noun (i.e. a noun that refers to a kind subsuming some similar individuated entities or things) is also an NP by default. This in turn means that unlike in an English-like language, the move from the general (as is indicated by a noun) to the particular (as is indicated by an NP) is not grammatically marked in such a language. The current paper demonstrates how Assamese, a numeral classifier language spoken in Assam, a north eastern province of India, allows the bare noun to be used at the sentential level for different degrees of particularity. Thus, in the following example from Assamese (taken from a popular folk tale) tetiā xiāl-e kole…. [tetiā ‘then’; xiāle ‘fox-NOM’; kole ‘said’] the bare noun xiāl ‘fox’ is used as an NP, precisely as a proper name. The paper thus argues that we have a better English translation of the concerned Assamese sentence in “Mr Fox then said…” rather than in “The fox then said….”. The Assamese data used in the paper comes from the author’s native speaker competency in the language
np-CECADA: Enhancing Ubiquitous Connectivity of LoRa Networks
No full textLong Range Wide Area Networks (LoRaWAN) offer ubiquitous communications for The Internet of Things (IoT). However, there are many challenges in rolling out LoRaWAN - mainly scalability, energy efficiency, Packet Reception Ratio (PRR), and keeping the channel access as simple as unslotted ALOHA. To this end, we design non-persistent Capture Effect Channel Activity Detection Algorithm (np-CECADA), which is a novel, distributed protocol for the MAC layer of LoRaWAN. It utilizes Channel Activity Detection (CAD), which is a built-in imperfect mechanism for channel sensing and minimal feedback from the gateways. In np-CECADA each device independently adapts backoff times based on the traffic in its vicinity and the transmission power based on the heuristically inferred probability of capturing the channel. To achieve this, first, we carried out an extensive on-field evaluation to measure the effectiveness of CAD and capture effect in LoRa. Using them we designed np CECADA and developed ns-3 modules. Packet Reception Ratio of np-CECADA is 15.74× and 5.13× higher than vanilla LoRaWAN and p-CARMA, respectively. Channel utilization is 11.24× higher compared to LMAC. Further, on a testbed of 30 LoRa devices np-CECADA outperforms LoRaWAN up to 5 times.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Embedded System
The Fox or Mr Fox?: Particularization of the bare noun
No full textIn numeral classifier languages a dog-type noun (i.e. a noun that refers to a kind subsuming some similar individuated entities or things) is also an NP by default. This in turn means that unlike in an English-like language, the move from the general (as is indicated by a noun) to the particular (as is indicated by an NP) is not grammatically marked in such a language. The current paper demonstrates how Assamese, a numeral classifier language spoken in Assam, a north eastern province of India, allows the bare noun to be used at the sentential level for different degrees of particularity. Thus, in the following example from Assamese (taken from a popular folk tale) tetiā xiāl-e kole…. [tetiā ‘then’; xiāle ‘fox-NOM’; kole ‘said’] the bare noun xiāl ‘fox’ is used as an NP, precisely as a proper name. The paper thus argues that we have a better English translation of the concerned Assamese sentence in “Mr Fox then said…” rather than in “The fox then said….”. The Assamese data used in the paper comes from the author’s native speaker competency in the language
Improved adjuvanting of seasonal influenza vaccines: Pre-clinical studies of MVA-NP+M1 co-administration with inactivated influenza vaccine.
No full textLicensed seasonal influenza vaccines induce antibody responses against influenza hemagglutinin that are limited in their ability to protect against different strains of influenza. Cytotoxic T lymphocytes (CTLs) recognizing the conserved internal nucleoprotein (NP) and matrix protein (M1) are capable of mediating a cross-subtype immune response against influenza. Modified vaccinia virus Ankara encoding NP and M1 (MVA-NP+M1) is designed to boost pre-existing T-cell responses in adults in order to elicit a cross-protective immune response. We examined the co-administration of hemagglutinin (HA) protein formulations and candidate MVA-NP+M1 influenza vaccines in murine, avian, and swine models. Antibody responses post-immunization were measured by ELISA and pseudotype neutralization assays. Here we demonstrate that MVA-NP+M1 can act as an adjuvant enhancing antibody (Ab) responses to HA while simultaneously inducing potent T-cell responses to conserved internal antigens. We show that this regimen leads to the induction of cytophilic Ab isotypes that are capable of inhibiting hemagglutination and in the context of H5 exhibit cross-clade neutralization. The simultaneous induction of T cells and antibody responses has the potential to improve seasonal vaccine performance and could be employed in pandemic situations
P≠NP
No full textHere, the author tries to build the structure of the Theory of computation based on considering time as a fuzzy concept.
In fact, there are reasons to consider time as a fuzzy concept. In this article, the author doesn’t go to this side but note that Brower and Husserl views on the concept of time were similar [8]. Some reasons have been given for it in [3].
Throughout this article, the author presents the Theory of Computation with Fuzzy Time. Given the classic definition of Turing Machine, the concept of Time is modified to Fuzzy time. This new term calls as Theory TC* [2] and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new theory, some of the major obstacles and unsolved problems have been solved [2]. It should be noted that in this article, the writer considers fuzzy number associated to instants of time as a symmetric one. The point about the symmetry is in the proof of Lemma 3, although it is generalizable.
In particular, the new classes of complexity Theory, P*, NP*, BPP* in the TC* analogues to the definitions of P, NP, BPP defines as their natural alternative definition. Here, we will see P*≠ NP*, P*= BPP*. Finally, we have Theorem 4
P≠NP
No full textHere, the author tries to build the structure of the Theory of computation based on considering time as a fuzzy concept.
In fact, there are reasons to consider time as a fuzzy concept. In this article, the author doesn’t go to this side but note that Brower and Husserl views on the concept of time were similar [8]. Some reasons have been given for it in [3].
Throughout this article, the author presents the Theory of Computation with Fuzzy Time. Given the classic definition of Turing Machine, the concept of Time is modified to Fuzzy time. This new term calls as Theory TC* [2] and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new theory, some of the major obstacles and unsolved problems have been solved [2]. It should be noted that in this article, the writer considers fuzzy number associated to instants of time as a symmetric one. The point about the symmetry is in the proof of Lemma 3, although it is generalizable.
In particular, the new classes of complexity Theory, P*, NP*, BPP* in the TC* analogues to the definitions of P, NP, BPP defines as their natural alternative definition. Here, we will see P*≠ NP*, P*= BPP*. Finally, we have Theorem 4
NP vyhledávací problémy
No full textTitle: NP search problems Author: Tomáš Jirotka Department: Department of Algebra Supervisor: Prof. RNDr. Jan Krajíček, DrSc. Abstract: The thesis summarizes known results in the field of NP search pro- blems. We discuss the complexity of integer factoring in detail, and we propose new results which place the problem in known classes and aim to separate it from PLS in some sense. Furthermore, we define several new search problems. Keywords: Computational complexity, TFNP, integer factorization.
- …
