Search results for "computer science"
showing 10 items of 22367 documents
The plants of the future. : genome editing in biotechnology
2021
The evolution of life has led to the formation of complex systems where plants are essentials. Homo sapiens’ success is based on its ability to obtain food. In what remains of this century, the world population will increase by a quarter of the current total, reaching 10 billion people. This is itself a major challenge, amplified by the environmental conditions resulting from global change and the threat to sustainability derived from the use of the planet’s natural resources. Thus, we wonder if we will be able to respond to this challenge and, to that end, how the plants of the future should look. Recent advances in sequencing techniques allow us to identify genomes at a low cost, and geno…
Shaping 1,2,4-Triazolium Fluorinated Ionic Liquid Crystals
2023
The synthesis and thermotropic behaviour of some di-alkyloxy-phenyl-1,2,4-triazolium trifluoromethane-sulfonate salts bearing a seven-carbon atom perfluoroalkyl chain on the cation is herein described. The fluorinated salts presenting a 1,2,4-triazole as a core and differing in the length of two alkyloxy chains on the phenyl ring demonstrated a typical liquid crystalline behaviour. The mesomorphic properties of this set of salts were studied by differential scanning calorimetry and polarized optical microscopy. The thermotropic properties are discussed on the grounds of the tuneable structures of the salts. The results showed the existence of a monotropic, columnar, liquid crystalline phase…
Two-view “cylindrical decomposition” of binary images
2001
This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.
Simultaneous readout of two charge qubits
2006
We consider a system of two solid state charge qubits, coupled to a single read-out device, consisting of a single-electron transistor (SET). The conductance of each tunnel junction is influenced by its neighboring qubit, and thus the current through the transistor is determined by the qubits' state. The full counting statistics of the electrons passing the transistor is calculated, and we discuss qubit dephasing, as well as the quantum efficiency of the readout. The current measurement is then compared to readout using real-time detection of the SET island's charge state. For the latter method we show that the quantum efficiency is always unity. Comparing the two methods a simple geometric…
Uncertainty quantification on a spatial Markov-chain model for the progression of skin cancer
2019
AbstractA spatial Markov-chain model is formulated for the progression of skin cancer. The model is based on the division of the computational domain into nodal points, that can be in a binary state: either in ‘cancer state’ or in ‘non-cancer state’. The model assigns probabilities for the non-reversible transition from ‘non-cancer’ state to the ‘cancer state’ that depend on the states of the neighbouring nodes. The likelihood of transition further depends on the life burden intensity of the UV-rays that the skin is exposed to. The probabilistic nature of the process and the uncertainty in the input data is assessed by the use of Monte Carlo simulations. A good fit between experiments on mi…
Factors Affecting Attrition among First Year Computer Science Students: the Case of University of Latvia
2015
<p class="R-AbstractKeywords"><span lang="EN-GB">The purpose of our study was to identify reasons for high dropout of students enrolled in the first year of the computer science study program to make it possible to determine students, who are potentially in risk. Several factors that could affect attrition, as it was originally assumed, were studied: high school grades (admission score), compensative course in high school mathematics, intermediate grades for core courses, prior knowledge of programming. However, the results of our study indicate that none of the studied factors is determinant to identify those students, who are going to abandon their studies, with great precisio…
Clausal coordination in Finnish Sign Language
2016
This paper deals with the coordination of clauses in Finnish Sign Language (FinSL). Building on conversational data, the paper first shows that linking in conjunctive coordination in FinSL is primarily asyndetic, whereas in adversative and disjunctive coordination FinSL prefers syndetic linking. Secondly, the paper investigates the nonmanual prosody of coordination: nonmanual activity is shown both to mark the juncture of the coordinand clauses and to draw their contours. Finally, the paper addresses certain forms of clausal coordination in FinSL that are sign language-specific. It is suggested that the sign language-specific properties of coordination are caused both by the fact that signe…
A Simple Noise Model with Memory for Biological Systems
2005
A noise source model, consisting of a pulse sequence at random times with memory, is presented. By varying the memory we can obtain variable randomness of the stochastic process. The delay time between pulses, i. e. the noise memory, produces different kinds of correlated noise ranging from white noise, without delay, to quasi-periodical process, with delay close to the average period of the pulses. The spectral density is calculated. This type of noise could be useful to describe physical and biological systems where some delay is present. In particular it could be useful in population dynamics. A simple dynamical model for epidemiological infection with this noise source is presented. We …
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
An Interactive Framework for Offline Data-Driven Multiobjective Optimization
2020
We propose a framework for solving offline data-driven multiobjective optimization problems in an interactive manner. No new data becomes available when solving offline problems. We fit surrogate models to the data to enable optimization, which introduces uncertainty. The framework incorporates preference information from a decision maker in two aspects to direct the solution process. Firstly, the decision maker can guide the optimization by providing preferences for objectives. Secondly, the framework features a novel technique for the decision maker to also express preferences related to maximum acceptable uncertainty in the solutions as preferred ranges of uncertainty. In this way, the d…