Search results for " complexity."
showing 10 items of 603 documents
Predicting perceived visual complexity of abstract patterns using computational measures: The influence of mirror symmetry on complexity perception
2017
Visual complexity is relevant for many areas ranging from improving usability of technical displays or websites up to understanding aesthetic experiences. Therefore, many attempts have been made to relate objective properties of images to perceived complexity in artworks and other images. It has been argued that visual complexity is a multidimensional construct mainly consisting of two dimensions: A quantitative dimension that increases complexity through number of elements, and a structural dimension representing order negatively related to complexity. The objective of this work is to study human perception of visual complexity utilizing two large independent sets of abstract patterns. A w…
Systems chemical analytics: introduction to the challenges of chemical complexity analysis
2019
Understanding complex (bio/geo)systems is a pivotal challenge in modern sciences that fuels a constant development of modern analytical technology, finding innovative solutions to resolve and analyse. In this introductory paper to the Faraday Discussion "Challenges in the analysis of complex natural systems", we aim to present concepts of complexity, and complex chemistry in systems subjected to biotic and abiotic transformations, and introduce the analytical possibilities to disentangle chemical complexity into its elementary parts (i.e. compositional and structural resolution) as a global integrated approach termed systems chemical analytics.
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.
Dynamics and topological mass of skyrmionic spin structures (presentation video)
2014
Skyrmions are topologically protected particle-like configurations, with a topological complexity described by their Skyrmion number. In magnetic systems, they have been numerically predicted to exhibit rich dynamics, such as the gyrotropic and breathing modes, dominated by their topology. Recent experimental advances brought their static manipulation well under control. However, their dynamical behaviour is largely unexplored experimentally. In this work, we provide with the first direct observation of eigenmode skyrmion dynamics. In particular, we present dynamical imaging data with high temporal and spatial resolution to demonstrate the GHz gyrotropic mode of a single skyrmion bubble, as…
Multiscale Information Storage of Linear Long-Range Correlated Stochastic Processes
2019
Information storage, reflecting the capability of a dynamical system to keep predictable information during its evolution over time, is a key element of intrinsic distributed computation, useful for the description of the dynamical complexity of several physical and biological processes. Here we introduce a parametric approach which allows one to compute information storage across multiple timescales in stochastic processes displaying both short-term dynamics and long-range correlations (LRC). Our analysis is performed in the popular framework of multiscale entropy, whereby a time series is first "coarse grained" at the chosen timescale through low-pass filtering and downsampling, and then …
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
Representing 2D Digital Objects
2000
The paper describes the combination a multi-views approach to represent connected components of 2D binary images. The approach is based on the Object Connectivity Graph (OCG), which is a sub-graph of the connectivity graph generated by the Discrete Cylindrical Algebraic Decomposition(DCAD) performed in the 2D discrete space. This construction allows us to find the number of connected components, to determine their connectivity degree, and to solve visibility problem. We show that the CAD construction, when performed on two orthogonal views, supply information to avoid ambiguities in the interpretation of each image component. The implementation of the algorithm is outlined and the computati…
New delay-dependent stability conditions for time-varying delay systems
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/360924 Open Access This paper addresses the delay-dependent stability for systems with time-varying delay. First, by taking multi-integral terms into consideration, new Lyapunov-Krasovskii functional is defined. Second, in order to reduce the computational complexity of the main results, reciprocally convex approach and some special transformations are introduced, and new delay-dependent stability criteria are proposed, which are less conservative and have less decision variables than some previous results. Finally, two well-known example…
One-Counter Verifiers for Decidable Languages
2013
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS’s for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca’s). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…
Syntactic complexity in Finnish-background EFL learners’ writing at CEFR levels A1–B2
2022
Eurooppalaisen viitekehyksen (EVK) merkitys kielikoulutukselle on lisännyt tutkimusta sen taitotasojen kielellisistä piirteistä; tarkempi tieto näistä piirteistä auttaisi EVK:n soveltamista opetusmateriaalien, kurssien ja arviointin laatimiseen. Tutkimuksessa selvitettiin eroavatko EVK:n tasot toisistaan syntaksin kompleksisuuden perusteella. Suomalaiset 14- ja 17-vuotiaat englannin oppijat (N=379) kirjoittivat kolme kirjoitelmaa, jotka arvioitiin EVK:n taitotasoille. Arviointiaineisto tutkittiin monitahoisella Rasch-analyysillä ja tekstien piirteet selvitettiin automaattisilla analyysiohjelmilla. Tuloksien perusteella alimpia EVK-tasoja (A1–A2) erotti selvimmin toisistaan lauseiden ja T-yk…