5,762 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
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.
Packing identical simple polygons is NP-hard
No full textGiven a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap. Previous NP-hardness results were only known in the case where the big polygon is allowed to be non-simple. A novel reduction from Planar-Circuit-SAT is presented where a small polygon is constructed to encode the entire circuit.info:eu-repo/semantics/publishe
Towards a generic programming model for network processors
No full textNetwork Processors (NPs) are emerging as a cost effective network element technology that can be more readily updated and evolved than custom hardware or ASIC-based designs. Moreover, NPs promise support for run-time reconfiguration of low-level networking software. However, it is notoriously difficult to develop software for NPs because of their complex design, architectural heterogeneity, and demanding performance constraints. In this paper we present a run-time component-based approach to programming NPs. The approach promotes conceptual uniformity and design portability across a wide variety of NP types while simultaneously exploiting hardware assists that are specific to individual NPs. To show how our approach can be applied in a wide range of types of NPs we characterise the design space of NPs and demonstrate the applicability of our concepts to the various classes identified. Then, as a detailed case study, we focus on programming the Intel IXP1200 NP. This demonstrates that our approach can be effectively applied, e.g. in terms of performance, in a demanding real-world NP environment
Engineering resveratrol-loaded chitosan nanoparticles for potential use against Helicobacter pylori infection
No full textHelicobacter pylori (H. pylori) is a microorganism directly linked to severe clinical conditions affecting the stomach. The virulence factors and its ability to form biofilms increase resistance to conventional antibiotics, growing the need for new substances and strategies for the treatment of H. pylori infection. The trans-resveratrol (RESV), a bioactive polyphenol from natural sources, has a potential activity against this gastric pathogen. Here, Chitosan nanoparticles (NP) containing RESV (RESV-NP) were developed for H. pylori management. The RESV-NP were prepared using the ionic gelation method and characterized by Dynamic Light Scattering (DLS), Nanoparticle Tracking Analysis (NTA) and, Cryogenic Transmission Electron Microscopy (Cryo – TEM). The encapsulation efficiency (EE) and in vitro release rate of RESV were quantified using high-performance liquid chromatography (HPLC). RESV-NP performance against H. pylori was evaluated by the quantification of the minimum inhibitory/bactericidal concentrations (MIC/MBC), time to kill, alterations in H. pylori morphology in its planktonic form, effects against H. pylori biofilm and in an in vitro infection model. RESV-NP cytotoxicity was evaluated against AGS and MKN-74 cell lines and by hemolysis assay. Acute toxicity was tested using Galleria mellonella model assays. RESV-NP showed a spherical shape, size of 145.3 ± 24.7 nm, polydispersity index (PDI) of 0.28 ± 0.008, and zeta potential (ZP) of + 16.9 ± 1.81 mV in DLS, while particle concentration was 3.12 x 1011 NP/mL (NTA). RESV-NP EE was 72 %, with full release within the first 5 min. In microbiological assays, RESV-NP presented a MIC/MBC of 3.9 µg/mL, a time to kill of 24 h for complete eradication of H. pylori. At a concentration of 2xMIC (7.8 µg/mL), RESV-NP completely eradicated the H. pylori biofilm, and in an in vitro infection model, RESV-NP (4xMIC – 15.6 µg/mL) showed a significant decrease in bacterial load (1 Log10CFU/mL) when compared to the H. pylori J99 control. In addition, they did not demonstrate a toxic character at MIC concentration for both cell lines. The use of the RESV-NP with mucoadhesion profile is an interesting strategy for oral administration of substances targeting gastric disorders, linked to H. pylori infections.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)São Paulo State University (UNESP) School of Pharmaceutical Sciences Department of Drugs and Medicines, SPSão Paulo State University (UNESP) School of Pharmaceutical Sciences Department of Biological Sciences, SPi3S-Instituto de Investigação e Inovação em Saúde Rua Alfredo Allen, 208INEB-Instituto de Engenharia Biomédica Rua Alfredo Allen, 208São Paulo State University (UNESP) School of Pharmaceutical Sciences Department of Drugs and Medicines, SPSão Paulo State University (UNESP) School of Pharmaceutical Sciences Department of Biological Sciences, S
Recommended from our members
Sorption of Np (V) by U (VI) hydroxide solids
No full textThe distribution of {sup 237}Np(V) between aqueous NaHCO{sub 3} solutions and U(VI) hydroxide solids was investigated. Experiments were initiated by addition of U solids to Np solutions and by coprecipitation of U and Np. Analysis by U L{sub III} extended X-ray absorption fine structure (EXAFS) spectroscopy and infrared absorption spectroscopy indicated the solid phase was synthetic schoepite. Equilibrium Np distribution coefficients were 5-44 mL/g in the pH range 6-8. The results are consistent with adsorption of Np by the solids and provide no evidence of Np incorporation in the bulk solid
Changes in case marking in NP: From Old English to Middle English
No full textThis chapter examines how the important changes involving case morphology within the noun phrase/determiner phrase NP/DP-the loss of case agreement morphology and the "posthead" genitive-evolved in the transition period between Old English (OE) and Earl
- …
