Search results for "Abstract algebra"
showing 10 items of 452 documents
Two simple criteria to estimate an objective's performance when imaging in non design tissue clearing solutions
2019
Tissue clearing techniques are undergoing a renaissance motivated by the need to image fluorescent neurons, and other cells, deep in the sample without physical sectioning. Optical transparency is achieved by equilibrating tissues with high refractive index (RI) solutions. When the microscope objective is not perfectly matched to the RI of the cleared sample, aberrations are introduced. We present two simple-to-calculate numerical criteria predicting: (i) the degradation in image quality (brightness and resolution) from optimal conditions of any clearing solution/objective combination; (ii) which objective, among several available, achieves the highest resolution in a given medium. We deriv…
Sustained oscillations in the MAP kinase cascade.
2016
Abstract The MAP kinase cascade is a network of enzymatic reactions arranged in layers. In each layer occurs a multiple futile cycle of phosphorylations. The fully phosphorylated substrate then serves as an enzyme for the layer below. This paper focuses on the existence of parameters for which Hopf bifurcations occur and generate periodic orbits. Furthermore it is explained how geometric singular perturbation theory allows to generalize results from simple models to more complex ones.
Stability of stationary solutions in models of the Calvin cycle
2017
Abstract In this paper results are obtained concerning the number of positive stationary solutions in simple models of the Calvin cycle of photosynthesis and the stability of these solutions. It is proved that there are open sets of parameters in the model of Zhu et al. (2009) for which there exist two positive stationary solutions. There are never more than two isolated positive stationary solutions but under certain explicit special conditions on the parameters there is a whole continuum of positive stationary solutions. It is also shown that in the set of parameter values for which two isolated positive stationary solutions exist there is an open subset where one of the solutions is asym…
Discovering unbounded unions of regular pattern languages from positive examples
1996
The problem of learning unions of certain pattern languages from positive examples is considered. We restrict to the regular patterns, i.e., patterns where each variable symbol can appear only once, and to the substring patterns, which is a subclass of regular patterns of the type xαy, where x and y are variables and α is a string of constant symbols. We present an algorithm that, given a set of strings, finds a good collection of patterns covering this set. The notion of a ‘good covering’ is defined as the most probable collection of patterns likely to be present in the examples, assuming a simple probabilistic model, or equivalently using the Minimum Description Length (MDL) principle. Ou…
Multi-class Text Complexity Evaluation via Deep Neural Networks
2019
Automatic Text Complexity Evaluation (ATE) is a natural language processing task which aims to assess texts difficulty taking into account many facets related to complexity. A large number of papers tackle the problem of ATE by means of machine learning algorithms in order to classify texts into complex or simple classes. In this paper, we try to go beyond the methodologies presented so far by introducing a preliminary system based on a deep neural network model whose objective is to classify sentences into more of two classes. Experiments have been carried out on a manually annotated corpus which has been preprocessed in order to make it suitable for the scope of the paper. The results sho…
Computing the Original eBWT Faster, Simpler, and with Less Memory
2021
Mantaci et al. [TCS 2007] defined the \(\mathrm {eBWT}\) to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. However, since this introduction, it has been used more generally to describe any \(\mathrm {BWT}\) of a collection of strings, and the fundamental property of the original definition (i.e., the independence from the input order) is frequently disregarded. In this paper, we propose a simple linear-time algorithm for the construction of the original \(\mathrm {eBWT}\), which does not require the preprocessing of Bannai et al. [CPM 2021]. As a byproduct, we obtain the first linear-time algorithm for computing the \(\mathrm {BWT}\) of a single string that uses …
Probabilistic liver atlas construction
2017
Background Anatomical atlases are 3D volumes or shapes representing an organ or structure of the human body. They contain either the prototypical shape of the object of interest together with other shapes representing its statistical variations (statistical atlas) or a probability map of belonging to the object (probabilistic atlas). Probabilistic atlases are mostly built with simple estimations only involving the data at each spatial location. Results A new method for probabilistic atlas construction that uses a generalized linear model is proposed. This method aims to improve the estimation of the probability to be covered by the liver. Furthermore, all methods to build an atlas involve p…
From algorithmic computing to direct retrieval: Evidence from number and alphabetic arithmetic in children and adults
1998
A number of theories of mental arithmetic suggest that the ability to solve simple addition and subtraction problems develops from an algorithmic strategy toward a strategy based on the direct retrieval of the result from memory. In the experiment presented here, 2nd and 12th graders were asked to solve two tasks of number and alphabet arithmetic. The subjects transformed series of 1 to 4 numbers or letters (item span) by adding or subtracting an operand varying from 1 to 4 (operation span). Although both the item and operation span were associated with major and identical effects in the case of both numbers and letters at 2nd grade, such effects were clearly observable only in the case of …
A SIMPLE CULTIVATION CHAMBER FOR THE STUDY OF AERIAL REPRODUCTIVE ELEMENTS OF FUNGI
1970
Finite-element design sensitivity analysis for non-linear potential problems
1990
Design sensitivity analysis is performed for the finite-element system arising from the discretization of non-linear potential problems using isoparametric Lagrangian elements. The calculated sensitivity formulae are given in a simple matrix form. Applications to the design of electromagnets and airfoils are given.