Search results for "combinatoric"
showing 10 items of 1776 documents
Semantic anomaly detection in school-aged children during natural sentence reading : A study of fixation-related brain potentials
2018
In this study, we investigated the effects of context-related semantic anomalies on the fixation-related brain potentials of 12–13-year-old Finnish children in grade 6 during sentence reading. The detection of such anomalies is typically reflected in the N400 event-related potential. We also examined whether the representation invoked by the sentence context extends to the orthographic representation level by replacing the final words of the sentence with an anomalous word neighbour of a plausible word. The eye-movement results show that the anomalous word neighbours of plausible words cause similar first-fixation and gaze duration reactions, as do other anomalous words. Similarly, we obser…
A co-registration investigation of inter-word spacing and parafoveal preview: Eye movements and fixation-related potentials
2019
Participants’ eye movements (EMs) and EEG signal were simultaneously recorded to examine foveal and parafoveal processing during sentence reading. All the words in the sentence were manipulated for inter-word spacing (intact spaces vs. spaces replaced by a random letter) and parafoveal preview (identical preview vs. random letter string preview). We observed disruption for unspaced text and invalid preview conditions in both EMs and fixation-related potentials (FRPs). Unspaced and invalid preview conditions received longer reading times than spaced and valid preview conditions. In addition, the FRP data showed that unspaced previews disrupted reading in earlier time windows of analysis, com…
Some approximation properties of ( p , q ) $(p,q)$ -Bernstein operators
2016
This paper is concerned with the $(p,q)$ -analog of Bernstein operators. It is proved that, when the function is convex, the $(p,q)$ -Bernstein operators are monotonic decreasing, as in the classical case. Also, some numerical examples based on Maple algorithms that verify these properties are considered. A global approximation theorem by means of the Ditzian-Totik modulus of smoothness and a Voronovskaja type theorem are proved.
Determination of the Composition of Mixed Hydrogenated and Fluorinated Micelles by Small Angle Neutron Scattering
1997
Structural study, thermal expansion and electrical conductivity of the composition NaSnZr(PO4)3
1993
Abstract The structure of the composition NaSnZr(PO4)3 and its evolution with temperature has been studied. The structure presents the space group R 3 c. The refinement of the structure shows that the Sn and Zr atoms are statistically distributed over the same crystallographic position. The unit cell expands in the c direction and contracts in the a direction, remaining the space group R 3 c at temperatures between 26 and 1000°C. The low value of the electrical conductivity at 400°C, 5.729×10−7S/cm and the low density of the pellets limited the use as electrical conductor.
On the population model with a sine function
2006
In the interval [0,1] function sr(x) = r sin πx behaves similar to logistic function h μ (x) = μx(1‐ x). We prove that for every r > there exists subset ? ⊂ [0,1] such that sr : ? → ? is a chaotic function. Since the logistic function is chaotic in another subset of [0,1] but both functions have similar graphs in [0,1] we conclude that it can lead to errors in practice. First Published Online: 14 Oct 2010
Curves with no tritangent planes in space and their convex envelopes
1990
M. H. Freedman ([3]) proved that for a generic subset of closed curves in ~ 3 with nonvanishing curvature and torsion the number of t r i tangent planes is even and finite. He also guessed, for each even number s _> 0, the existence of an open subset A8 of closed curves with nonvanishing curvature and torsion such tha t each curve in A8 has exact ly s t r i t angent planes. A question tha t can be asked in this context is: Which curves with nonvanishing curvature and torsion have no t r i tangent planes? An example of such a curve is given by the (1,2)-curve on the torus with rat io a, 3 < a < 5 (see [2]). For a generi c curve, we give a pa r t i a l answer to this question here by finding …
The guarded fragment with transitive guards
2004
The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …
An ILS-Based Metaheuristic for the Stacker Crane Problem
2012
[EN] In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented.
Self-stabilizing Balls & Bins in Batches
2016
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work, [Azar et al.; JoC'99] proposed the sequential strategy Greedy[d] for n = m. When thrown, a ball queries the load of d random bins and is allocated to a least loaded of these. [Azar et al.; JoC'99] showed that d=2 yields an exponential improvement compared to d=1. [Berenbrink et al.; JoC'06] extended this to m ⇒ n, showing that the maximal load difference is independent of m for d=2 (in contrast…