Search results for "complexity"
showing 10 items of 1094 documents
Measuring orthographic transparency and morphological-syllabic complexity in alphabetic orthographies
2017
This narrative review discusses quantitative indices measuring differences between alphabetic languages that are related to the process of word recognition. The specific orthography that a child is acquiring has been identified as a central element influencing reading acquisition and dyslexia. However, the development of reliable metrics to measure differences between language scripts hasn’t received much attention so far. This paper therefore reviews metrics proposed in the literature for quantifying orthographic transparency, syllabic complexity, and morphological complexity of alphabetic languages. The review included searches of Web of Science, PubMed, PsychInfo, Google Scholar, and var…
The development of narrative productivity, syntactic complexity, referential cohesion and event content in four- to eight-year-old Finnish children
2013
This study focuses on the development of narrative structure and the relationship between narrative productivity and event content. A total of 172 Finnish children aged between four and eight participated. Their picture-elicited narrations were analysed for productivity, syntactic complexity, referential cohesion and event content. Each measure showed a developmental trend. Concerning consecutive age groups, significant differences were observed between four- and five-year-olds in productivity and event content and between five- and six-year-olds in referential cohesion. Multiple regression analysis showed that the relationship between productivity and event content was important, and espe…
MLU and IPSyn measuring absolute complexity
2009
This article compares the results of Mean Length of Utterance (MLU) and Index of Productive Syntax (IPSyn) with the structural complexity of spontaneous utterances produced by 30-month-old Finnish children in a semi-structured playing situation. The comparison was carried out in order to determine the aspects of structural complexity which can be detected with MLU and IPSyn. This research adopts the frameworks of absolute complexity together with a multidimensional view of utterance structure and, furthermore, applies it through Utterance Analysis (UA). The results of the comparison between the metrics and changes in structural complexity discovered by UA reveal that MLU and IPSyn do functi…
The PLVC display color characterization model revisited
2008
This work proposes a study of the Piecewise Linear assuming Variation in Chromaticity (PLVC) dis- play color characterization model. This model has not been widely used as the improved accuracy compared with the more common PLCC (Piecewise Linear assuming Chromaticity Constancy) model is not significant for CRT (Cathode Ray Tube) display technology, and it requires more computing power than this model. With today's computers, computational complexity is less of a problem, and today's display technologies show a different colori- metric behavior than CRTs. The main contribution of this work is to generalize the PLVC model to multiprimary displays and to provide extensive experimental results…
The fluted fragment revisited
2019
AbstractWe study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, motivated by the work of W. V. Quine. We show that the satisfiability problem for this fragment has nonelementary complexity, thus refuting an earlier published claim by W. C. Purdy that it is in NExpTime. More precisely, we consider ${\cal F}{{\cal L}^m}$, the intersection of the fluted fragment and the m-variable fragment of first-order logic, for all $m \ge 1$. We show that, for $m \ge 2$, this subfragment forces $\left\lfloor {m/2} \right\rfloor$-tuply exponentially large models, and that its satisfiability problem is $\left\lfloor {m/2} \right\rfloor$-NExpTime-hard. We…
From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization
2007
AbstractWe introduce a combinatorial optimization framework that naturally induces a class of optimal word permutations with respect to a suitably defined cost function taking into account various measures of relatedness between words. The Burrows and Wheeler transform (bwt) (cf. [M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994]), and its analog for labelled trees (cf. [P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198–207]), are special cases i…
Low‐complexity detection for uplink massive MIMO SCMA systems
2020
Paid Open Access UNIT agreement
Self-organization of repetitive spike patterns in developing neuronal networks in vitro
2010
The appearance of spontaneous correlated activity is a fundamental feature of developing neuronal networks in vivo and in vitro. To elucidate whether the ontogeny of correlated activity is paralleled by the appearance of specific spike patterns we used a template-matching algorithm to detect repetitive spike patterns in multi-electrode array recordings from cultures of dissociated mouse neocortical neurons between 6 and 15 days in vitro (div). These experiments demonstrated that the number of spiking neurons increased significantly between 6 and 15 div, while a significantly synchronized network activity appeared at 9 div and became the main discharge pattern in the subsequent div. Repetiti…
MULTI-SCALE ANALYSIS OF LUNG COMPUTED TOMOGRAPHY IMAGES
2007
A computer-aided detection (CAD) system for the identification of lung internal nodules in low-dose multi-detector helical Computed Tomography (CT) images was developed in the framework of the MAGIC-5 project. The three modules of our lung CAD system, a segmentation algorithm for lung internal region identification, a multi-scale dot-enhancement filter for nodule candidate selection and a multi-scale neural technique for false positive finding reduction, are described. The results obtained on a dataset of low-dose and thin-slice CT scans are shown in terms of free response receiver operating characteristic (FROC) curves and discussed.
Semiglobal practical integral input-to-state stability for a family of parameterized discrete-time interconnected systems with application to sampled…
2015
Abstract Semiglobal practical integral input-to-state stability (SP-iISS) for a feedback interconnection of two discrete-time subsystems is given. We construct a Lyapunov function from the sum of nonlinearly-weighted Lyapunov functions of individual subsystems. In particular, we consider two main cases. The former gives SP-iISS for the interconnected system when both subsystems are semiglobally practically integral input-to-state stable. The latter investigates SP-iISS for the overall system when one of subsystems is allowed to be semiglobally practically input-to-state stable. Moreover, SP-iISS for discrete-time cascades and a feedback interconnection including a semiglobally practically i…