نتایج جستجو برای:

تعداد نتایج: 330  

Journal: :Measurement Science and Technology 2022

Abstract The large Landau energy spacing, stemming from the linear energy-momentum dispersion of quasi-particles in graphene, allows an efficient realization quantum Hall effect at a small density charge carriers. Promising scalable epitaxial graphene on silicon carbide (SiC), however, requires molecular doping, which is generally unstable under ambient conditions, to compensate for electron tr...

2007
Ran Raz

An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit example for a polynomial f(x1, ..., xn), with coefficients in {0, 1}, such that over any field: 1. f can be computed by a polynomial-size multilinear circuit of depth O(log n). 2. Any multilinear formula for f is of size nΩ(logn). This gives a super-polynomial gap ...

Journal: :Journal of neuroimmunology 2014
Lucia Lisi Antonella Tramutola Pierluigi Navarra Cinzia Dello Russo

In the present study we carried out a screening of different Antiretroviral drugs (ARVs) for their potential pro-inflammatory effects on microglial cells. Efavirenz, neviparine, darunavir and atazanavir increased nitric oxide (NO) production in microglial cells activated with Gp120CN54 and interferon-γ. The stimulatory effect on NO production appeared to be mediated by inhibition of arginase (A...

2016
David G. Harris Johannes Schneider Hsin-Hao Su

The (∆+1)-coloring problem is a fundamental symmetry breaking problem in distributed computing. We give a new randomized coloring algorithm for (∆ + 1)-coloring running in O( √ log ∆) + 2O( √ log logn) rounds with probability 1 − 1/nΩ(1) in a graph with n nodes and maximum degree ∆. This implies that the (∆ + 1)-coloring problem is easier than the maximal independent set problem and the maximal...

2009
Panos Giannopoulos Christian Knauer Günter Rote

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cylinder. ii) Given two n-point sets in Rd, decide whether they can be separated by two hyperplanes. iii) Given a system of n linear inequalities with d variables, find a maximum-size feasible subsystem. We show that (the...

2002
B. S. Zou F. Hussain

For excited nucleon states N of arbitrary spin coupling to nucleon (N) and meson (M), we propose a Lorentz covariant orbital-spin (L-S) scheme for the effective NNM couplings. To be used for the partial wave analysis of various N production and decay processes, it combines merits of two conventional schemes, i.e., covariant effective Lagrangian approach and multipole analysis with amplitudes ex...

2011
Paolo D'Arco

In this paper we propose an efficient forward-private RFID mutual authentication protocol. The protocol is secure under standard assumptions. It builds over a recent work, extends it to achieve mutual authentication, and improves it by introducing a resynchronization mechanism between tag and reader, through which the server-side computation from O(Nω) is reduced to O(N + ω), where N is the tot...

1996
KAI-CHING LIN

Let Ω be a bounded smooth domain in Rn, and u(x) a C1 function with compact support in Ω. Moser’s inequality states that there is a constant co, depending only on the dimension n, such that 1 |Ω| ∫ Ω e nω 1 n−1 n−1 u n n−1 dx ≤ co, where |Ω| is the Lebesgue measure of Ω, and ωn−1 the surface area of the unit ball in Rn. We prove in this paper that there are extremal functions for this inequalit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید