Search results for "device"
showing 10 items of 1286 documents
Space-Efficient 1.5-Way Quantum Turing Machine
2001
1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i ≥ 0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape , and 1.5QTM can recognize it using constant cells quantity.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Finite Automata with Advice Tapes
2013
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, and establish the relationships between this model and the previously studied ways of providing advice to finite automata.
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Automaton (Semi)groups (Basic Concepts)
2018
In this paper, we give an introduction to basic concepts of automaton semigroups. While we must note that this paper does not contain new results, it is focused on extended introduction in the subject and detailed examples.
Some decisional problems on rational relations
1997
Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.
An inconvenient influence of iridium(III) isomer on OLED efficiency.
2010
The recently reported heteroleptic cyclometallated iridium(III) complex [Ir(2-phenylpyridine)(2)(2-carboxy-4-dimethylaminopyridine)] N984 and its isomer N984b have been studied more in detail. While photo- and electrochemical properties are very similar, DFT/TDDFT calculations show that the two isomers have different HOMO orbital characteristics. As a consequence, solution processed OLEDs made using a mixture of N984 and isomer N984b similar to vacuum processed devices show that the isomer has a dramatic detrimental effect on the performances of the device. In addition, commonly used thermogravimetric analysis is not suitable for showing the isomerization process. The isomer could impact pe…
« Thyroid diseases and food: creating a follow-up and support device for patients ».
2022
Part of project "ThyroSIC - Thyroid Disease Trajectory: Communication and Publicization“, this study looks into the possibility of creating a participative and follow up device in collaboration with patients’ associations but also the hospital center and professionals. This will allow us to respond to the needs related to the lack of awareness of the population, to prevention actions but also to the follow-up and support of patients (such as the need to set up therapeutic education devices).
Tietotekniikan arkipäiväistymisen vaikutukset organisaatioon ja yksilöön
2015
Työntekijöiden omat laitteet ovat alkaneet viimevuosina yleistyä työkäytössä. Samalla myös organisaatiot ovat alkaneet tarjota työntekijöille vaihtoehtoja oman työlaitteen osalta, jotta työntekijät voisivat työskennellä laitteella joka tukee omaa työskentelyä parhaalla tavalla. Tietotekniikan kuluttajistumisella tarkoitetaan yleisesti kuluttajataustaisten tai yksilön omien laitteiden tuomista mukaan yrityskäyttöön. Lisäksi ilmiöstä on käytetty laajempaa kuvausta, joka ottaa huomioon laitteiden lisäksi sovellukset, teknologiat ja artefaktit. Tässä tutkimuksessa ilmiöllä havaittiin olevan moninaisia vaikutuksia organisaatioi-hin ja yksilöihin. Organisaatioiden tehokkuus ja innovaatio kasvaa t…
Detoxifying antitumoral drugs via nanoconjugation: the case of gold nanoparticles and cisplatin
2021
Nanoparticles (NPs) have emerged as a potential tool to improve cancer treatment. Among the proposed uses in imaging and therapy, their use as a drug delivery scaffold has been extensively highlighted. However, there are still some controversial points which need a deeper understanding before clinical application can occur. Here the use of gold nanoparticles (AuNPs) to detoxify the antitumoral agent cisplatin, linked to a nanoparticle via a pH-sensitive coordination bond for endosomal release, is presented. The NP conjugate design has important effects on pharmacokinetics, conjugate evolution and biodistribution and results in an absence of observed toxicity. Besides, AuNPs present unique o…