Search results for "Device"
showing 10 items of 1286 documents
Impact of Transport Costs on International Trade: The Case of Spanish Ceramic Exports
2003
This paper aims to investigate the determinants of maritime and overland transport costs and the role they play in deterring trade across countries. We estimate a transport cost function using data on maritime and overland transport of the ceramic sector (tiles) obtained from interviews held with Spanish logistics operators. We also study the relationship between transport costs and trade and estimate an import demand model for ceramic products. Additionally, we present a discussion on the sensitivity of trade flows and transportation costs to the existence of back-hauling, special conditions for transport and number of reloads.1 The study of modal transport (overland versus maritime) and i…
Polymeric microcontainers improve oral bioavailability of furosemide.
2016
Microcontainers with an inner diameter of 223 μm are fabricated using the polymer SU-8, and evaluated in vitro, in situ and in vivo for their application as an advanced oral drug delivery system for the poorly water soluble drug furosemide. An amorphous sodium salt of furosemide (ASSF) is filled into the microcontainers followed by applying a lid using Eudragit L100. It is possible to control the drug release in vitro, and in vitro absorption studies show that the microcontainers are not a hindrance for absorption of ASSF. In situ perfusion studies in rats are performed with ASSF-filled microcontainers coated with Eudragit and compared to a furosemide solution. The absorption rate constant …
Colloidal Nanoplatelet/Conducting Polymer Hybrids: Excitonic And Material Properties
2016
WOS:000370678700053 Here we present the first account of conductive polymer/colloidal nanoplatelet hybrids. For this, we developed DEH-PPV-based polymers with two different anchor groups (sulfide and amine) acting as surfactants for CdSe nanoplatelets, which are atomically flat semiconductor nanocrystals. Hybridization of the polymers with the nanoplatelets in the solution phase was observed to cause strong photoluminescence quenching in both materials. Through steady-state photoluminescence and excitation spectrum measurements, photoluminescence quenching was shown to result from dominant exciton dissociation through charge transfer at the polymer/nanoplatelet interfaces that possess a sta…
Vigor F7 projekta ietekme uz redzes funkcijām
2017
Maģistra darbs ir uzrakstīts angļu valodā uz 38 lapām. Tas satur 12 attēlus, 9 tabulas, 26 atsauces uz literatūras avotiem un 4 pielikumus. Galvenais darba mērķis ir nodemonstrēt F7 ierīces ietekmi uz redzes sistēmu un tās funkcijām. Tika veikti divi eksperimenti: Eksperiments I (30 dalībnieki, 10 – 40 g.v.), lai izvērtētu Vigor F7 ierīces ietekmi uz redzes funkcijām; Eksperiments II (20 dalībnieki, sportisti, 14 – 48 g.v.), lai izvērtētu Vigor F7 ierīces ietekmi uz dinamisko iemaņu efektivitāti. Abos eksperimentos novēroja statistiski nozīmīgi atšķirīgus rezultātus gan redzes funkcijām, gan dinamiskajām iemaņām, ja izmantoja F7 ierīci.
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to "width" complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called "reordering"), which allows to build Boolean function $g$ from Boolean Function $f$, such that if for $f$ we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function $g$, but for any order. Using it we construct the total function $REQ$ which deterministic OBDD complexity is $2^{\Omega(n/\log n)}$ and present quantu…
NP has log-space verifiers with fixed-size public quantum registers
2011
In classical Arthur-Merlin games, the class of languages whose membership proofs can be verified by Arthur using logarithmic space (AM(log-space)) coincides with the class P \cite{Co89}. In this note, we show that if Arthur has a fixed-size quantum register (the size of the register does not depend on the length of the input) instead of another source of random bits, membership in any language in NP can be verified with any desired error bound.
One-counter verifiers for decidable languages
2012
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS's for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca's). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…
New Results on the Minimum Amount of Useful Space
2014
We present several new results on minimal space requirements to recognize a nonregular language: (i) realtime nondeterministic Turing machines can recognize a nonregular unary language within weak $\log\log n$ space, (ii) $\log\log n$ is a tight space lower bound for accepting general nonregular languages on weak realtime pushdown automata, (iii) there exist unary nonregular languages accepted by realtime alternating one-counter automata within weak $\log n$ space, (iv) there exist nonregular languages accepted by two-way deterministic pushdown automata within strong $\log\log n$ space, and, (v) there exist unary nonregular languages accepted by two-way one-counter automata using quantum an…
New results on classical and quantum counter automata
2019
We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter automaton and one-way deterministic one-counter automaton. We also obtain new results on classical counter automata regarding language recognition. It was conjectured that one-way probabilistic one blind-counter automata cannot recognize Kleene closure of equality language [A. Yakaryilmaz: Superiority of one-way and realtime quantum machines. RAIRO - Theor. Inf. and Applic. 46(4): 615-641 (2012)]. We show that this conjecture is false, and also show several s…
Real-Time Vector Automata
2013
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected $k \times k$ matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.