4,318 research outputs found
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
Simulated and measured soil organic carbon (SOC) stocks (0–20 cm) under the control, N, NP, NPK, NPKM, hNPKM and NPKS treatments at Qiyang.
No full text<p>Simulated and measured soil organic carbon (SOC) stocks (0–20 cm) under the control, N, NP, NPK, NPKM, hNPKM and NPKS treatments at Qiyang.</p
Simulated and measured soil organic carbon (SOC) stocks (0–20 cm) under the control, N, NP, NPK, NPKM, hNPKM and NPKS treatments at Yangling.
No full text<p>Simulated and measured soil organic carbon (SOC) stocks (0–20 cm) under the control, N, NP, NPK, NPKM, hNPKM and NPKS treatments at Yangling.</p
Real-time Trading System based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-hard Combinatorial Optimization
No full textFinancial portfolio construction problems are often formulated as quadratic
and discrete (combinatorial) optimization that belong to the nondeterministic
polynomial time (NP)-hard class in computational complexity theory. Ising
machines are hardware devices that work in quantum-mechanical/quantum-inspired
principles for quickly solving NP-hard optimization problems, which potentially
enable making trading decisions based on NP-hard optimization in the time
constraints for high-speed trading strategies. Here we report a real-time stock
trading system that determines long(buying)/short(selling) positions through
NP-hard portfolio optimization for improving the Sharpe ratio using an embedded
Ising machine based on a quantum-inspired algorithm called simulated
bifurcation. The Ising machine selects a balanced (delta-neutral) group of
stocks from an -stock universe according to an objective function involving
maximizing instantaneous expected returns defined as deviations from
volume-weighted average prices and minimizing the summation of statistical
correlation factors (for diversification). It has been demonstrated in the
Tokyo Stock Exchange that the trading strategy based on NP-hard portfolio
optimization for =128 is executable with the FPGA (field-programmable gate
array)-based trading system with a response latency of 164 s.Comment: 12 pages, 5 figures. arXiv admin note: text overlap with
arXiv:2307.0592
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.
Mapping of nucleoside phosphorylase (Np-1) and esterase 10 (Es-10) on mouse chromosome 14.
No full textA method for detecting two alleles at Np-1 (nucleoside phosphorylase) and three alleles at Es-10 (esterase 10) from mouse blood by cellulose acetate electrophoresis is described. The allelic constitution at these loci for 44 inbred strains and stocks was determined. The location of Np-1 on chromosome 14 was established by backcross experiments in which alleles at Np-1 and Robertsonian translocations were segregating. Es-10 was shown to be linked to Np-1, and the following genetic map of Chr 14 was constructed: centromere-(8.9 +/- 4.0 cM)-[Np-1, Wc]-(10.2 +/- 1.9 cM)-Es-10-(15.5 +/- 3.7 cM)-s. The homologous human loci, NP and ES-D, are not linked
The genomes of three stocks comprising the most widely utilized live sporozoite Theileria parva vaccine exhibit very different degrees and patterns of sequence divergence
No full textThere are no commercially available vaccines against human protozoan parasitic diseases, despite the success of vaccination-induced long-term protection against infectious diseases. East Coast fever, caused by the protist Theileria parva, kills one million cattle each year in sub-Saharan Africa, and contributes significantly to hunger and poverty in the region. A highly effective, live, multi-isolate vaccine against T. parva exists, but its component isolates have not been characterized. Here we sequence and compare the three component T. parva stocks within this vaccine, the Muguga Cocktail, namely Muguga, Kiambu5 and Serengeti-transformed, aiming to identify genomic features that contribute to vaccine efficacy.; We find that Serengeti-transformed, originally isolated from the wildlife carrier, the African Cape buffalo, is remarkably and unexpectedly similar to the Muguga isolate. The 420 detectable non-synonymous SNPs were distributed among only 53 genes, primarily subtelomeric antigens and antigenic families. The Kiambu5 isolate is considerably more divergent, with close to 40,000 SNPs relative to Muguga, including <8,500 non-synonymous mutations distributed among <1,700 (42.5 %) of the predicted genes. These genetic markers of the component stocks can be used to characterize the composition of new batches of the Muguga Cocktail.; Differences among these three isolates, while extensive, represent only a small proportion of the genetic variation in the entire species. Given the efficacy of the Muguga Cocktail in inducing long-lasting protection against infections in the field, our results suggest that whole-organism vaccines against parasitic diseases can be highly efficacious despite considerable genome-wide differences relative to the isolates against which they protect
NP-MOVEMENT AND THE POSSESSIVE GENITIVE
No full textU članku se raspravlja o mjestu genitiva u izgradnji složenih NP te posebice o
odnosu s drugim konkurentnim sintaktičkim sredstvima. U žarištu istraživanja,
u kojem su primijenjene neke od modularnih sastavnica teorije načela i
paramatera (TNP): X'-teorija, padežna teorija i teorija tematskih uloga, nalazi
se NP-pomicanje posvojnoga genitiva s temeljno generiranog položaja na
mjesto odrednika, odnosno na projekciju gdje se nalazi posvojni sufiks. Autor
smatra kako između DP i NP u objašnjavanju toga fenomena valja uvesti novi
sloj - funkcionalnu kategoriju Poss, a NP–pomicanje objašnjava se težnjom
svake imenice da bude što bolje određena, aktualizirana. Provjerava se i utjecaj
morfosintaktičkog obilježja određenosti kod morfoloških posvojnih oblika na
druge sročne atribute.The paper discusses the place of the genitive in the derivation of complex NPs, particularly
in relation to other, competing syntactic means. The study that relies on some modular
components of the theory or principles and parametres (X' theory, case theory, and the theory
of thematic roles) focuses on the NP-movement of the possessive genitive out of the basegenerated
position into the specifier position or into the projection occupied by the
possessive suffix. The author argues that in order to explan the phenomenon a new level
should be recognized between DP and NP—the functional category Poss. NP-movement is
explained as the tendency of nouns to be as determined and actualised as possible. The
influence of the morphosyntactic property of determination of possessive forms on other
congruent attributes is examined
- …
