Search results for "block"
showing 10 items of 1177 documents
Characterization of Emergence of the Coulomb Blockade in a Pearl-Like DNA-AuNP Assembly
2023
Due to its superior self-assembly properties and vast functionalization pos-sibilities DNA has long been one of the most promising candidates forfabrication of nanoscale electrical components using molecular buildingblocks. There exist already many demonstrations on optical devices based onorganizing metallic nanoparticles (NP) via DNA self-assembly, but despite thepromises only few DNA based electrical devices or studies have been realizedso far. Here we study the gold NP conjugated and metallized DNA TX-tile-structure, which we recently showed to exhibit the room temperature Coulombblockade, the pre-requisition for a single electron transistor. The properties ofthe obtained Coulomb blocka…
Per-flow signalling extension across DiffServ domains
2003
This paper describes a framework devised to extend per-flow admission control operation across Differentiated Services domains. Although the specific case of interoperability with RSVP is under discussion, our proposal can be easily adapted to other hop-by-hop signalling protocols. In our framework, DiffSery border routers accomplish three tasks. First, during the set-up phase, flows are mapped onto PHB groups on the basis of their QoS and traffic specifications. Second, signalling packets are tunnelled into IP packets marked as “probes”, where the “probe” marking is a DCSP value associated to the considered PHB Group. Third, when the flow set-up is complete, flow data packets are marked as…
Template-based synthesis of nickel oxide
2015
Nanocrystalline NiO has been produced using a facile template-based synthesis from nickel nitrate solutions using cellulose as a template. Thus obtained oxides were studied by scanning electron microscopy, x-ray diffraction, Raman scattering spectroscopy, photoluminescence spectroscopy and confocal spectromicroscopy. The filamentary/coral morphology of the samples has been evidenced and is built up of agglomerated nanocrystallites with a size in the range of about 26-36 nm. The presence of two-magnon contribution in Raman scattering spectra suggests the existence of antiferromagnetic ordering at room temperature. Finally, the observed near-infrared photoluminescence band at 850 nm has been …
The role of blockchain for food safety and market efficiency
2022
It is well known that the introduction of Blockchain in the agri-food sector represents a digital innovation aimed at increasing business income through the reduction of production inputs (and therefore of production costs expressed at constant prices) and/or the increase of output (increase in the quantity produced and therefore in revenues expressed at constant prices). According to Schumpeter, innovation and entrepreneurship mainly depend on innovative people, their skills and knowledge. In fact, digital innovation is always aimed at increasing the competitiveness of the company and can concern an improvement in technical and economic efficiency. On an existing company structure, efficie…
Approaching a “naked” boryl anion: amide metathesis as a route to calcium, strontium, and potassium boryl complexes
2020
Abstract Amide metathesis has been used to generate the first structurally characterized boryl complexes of calcium and strontium, {(Me3Si)2N}M{B(NDippCH)2}(thf)n (M=Ca, n=2; M=Sr, n=3), through the reactions of the corresponding bis(amides), M{N(SiMe3)2}2(thf)2, with (thf)2Li‐ {B(NDippCH)2}. Most notably, this approach can also be applied to the analogous potassium amide K{N(SiMe3)2}, leading to the formation of the solvent‐free borylpotassium dimer [K{B(NDippCH)2}]2, which is stable in the solid state at room temperature for extended periods (48 h). A dimeric structure has been determined crystallographically in which the K+ cations interact weakly with both the ipso‐carbons of the flanki…
Adjacent vertices can be hard to find by quantum walks
2018
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs Ω(N) steps, that is, it has no speed-up over the classical exhaustive search. The demonstrated configurations occur for certain placements of two or more adjace…
Longest Motifs with a Functionally Equivalent Central Block
2004
International audience; This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or …
On the additivity of block designs
2016
We show that symmetric block designs $${\mathcal {D}}=({\mathcal {P}},{\mathcal {B}})$$D=(P,B) can be embedded in a suitable commutative group $${\mathfrak {G}}_{\mathcal {D}}$$GD in such a way that the sum of the elements in each block is zero, whereas the only Steiner triple systems with this property are the point-line designs of $${\mathrm {PG}}(d,2)$$PG(d,2) and $${\mathrm {AG}}(d,3)$$AG(d,3). In both cases, the blocks can be characterized as the only k-subsets of $$\mathcal {P}$$P whose elements sum to zero. It follows that the group of automorphisms of any such design $$\mathcal {D}$$D is the group of automorphisms of $${\mathfrak {G}}_\mathcal {D}$$GD that leave $$\mathcal {P}$$P in…
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
Two graphs with a common edge
2014
Let G = G1 ∪ G2 be the sum of two simple graphs G1,G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1,G2 connected by two edges e1 and e2 which form a cycle C4 inside G. We give a method of computing the determinant det A(G) of the adjacency matrix of G by reducing the calculation of the determinant to certain subgraphs of G1 and G2. To show the scope and effectiveness of our method we give some examples