Search results for "complexi"
showing 10 items of 1116 documents
Assessing complexity in learning outcomes : a comparison between the SOLO taxonomy and the model of hierarchical complexity
2015
An important aspect of higher education is to educate students who can manage complex relationships and solve complex problems. Teachers need to be able to evaluate course content with regard to complexity, as well as evaluate students’ ability to assimilate complex content and express it in the form of a learning outcome. One model for evaluating complexity is the Structure of Observed Learning Outcomes (SOLO) taxonomy. The aim of this analysis is to address the limitations of the SOLO taxonomy in detecting the more subtle differences of the learning outcomes and to clarify the concept of learning modes. This is done by analysing the SOLO taxonomy by means of the model of hierarchical comp…
The Anthropological Setting of Polysynthesis
2017
Abstract A sociolinguistically oriented study of polysynthesis literature reveals one rather striking observation. Varieties often cited as being incontrovertibly polysynthetic include languages from many different language families and different areas of the world. But many of these languages have a number of social characteristics in common: they are spoken in relatively small, traditional, non-industrialized communities, over relatively small territories. This chapter suggests that this is not a coincidence. There seems to be considerable agreement in the literature, for instance, that polysynthetic languages are ‘highly’, ‘extremely’, or ‘extraordinarily’ complex. And the literature on …
Full field of view super-resolution imaging via two static masks
2008
The usage of two static gratings for obtaining super resolved imaging dates back to the work by Bachl and Lukosz in 1967. However, in that approach, a severe reduction in the field of view was the necessary condition for improving the resolution. In this paper we present two approaches that are also based upon two static gratings but without the need to sacrifice in the field of view. The key idea for not paying with the field of view is performed in two ways: First, by using white light illumination that averages the ghost images obtained outside the region of interest since the positions of those images are wavelength dependent. Second, by using two random functions for the encoding and t…
Quantum search of spatial regions
2003
Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…
Progress in Modelling Coherently Pumped Far-Infrared Laser Dynamics
1990
Coherently pumped lasers (CPL) operating in the far-infrared spectral region shown a wealth of instabilities1, including a behavior remarkably similar2,3 with the predictions of the paradigmatic Lorenz-Haken model of a single-mode homogeneously broadened laser4,5. The qualitative agreement; between theory and experiments2,3 was rather surprising, for the model4,5 refers to a two-level system whereas the CPL operate on a three-level scheme, where the pumping and lasing transitions share a common upper level. Dupertuis et al.6 have identified conditions for the mathematical reduction of the CPL equations to the Lorenz-Haken equations4, but these conditions were not all fulfilled in the experi…
Bi-objective multi-layer location–allocation model for the immediate aftermath of sudden-onset disasters
2019
International audience; Locating distribution centers is critical for humanitarians in the immediate aftermath of a sudden-onset disaster. A major challenge lies in balancing the complexity and uncertainty of the problem with time and resource constraints. To address this problem, we propose a location–allocation model that divides the topography of affected areas into multiple layers; considers constrained number and capacity of facilities and fleets; and allows decision-makers to explore trade-offs between response time and logistics costs. To illustrate our theoretical work, we apply the model to a real dataset from the 2015 Nepal earthquake response. For this case, our method results in…
Steiner configurations ideals: Containment and colouring
2021
Given a homogeneous ideal I&sube
Low Complexity Image Compression using Pruned 8-point DCT Approximation in Wireless Visual Sensor Networks
2017
International audience; Since the transmission of the uncompressed image in the context of wireless visual sensor networks (WVSNs) consumes less energy than transmitting the compressed image, developing energy-aware compression algorithms are mandatory to extend the camera node's lifetime and thereby the whole network lifetime. The present paper studies a low-complexity image compression algorithm in the context of WVSNs. This algorithm consists of applying a pruning approach on a DCT approximation transform. The scheme is investigated in terms of computation cycles, processing time, energy consumption and image quality. Experimental works are conducted using the Atmel Atmega128 processor o…
Complement genetics: biological implications of polymorphisms and deficiencies
1999
Abstract Complement (C) proteins form a highly complex and important humoral host immune defence system. A recent meeting**The VII Complement Genetics Workshop and Conference was held at Mainz, Germany, on 21–23 May 1998. addressed the role of genetic studies of C components and its regulators with respect to evolution, function and human disease.
A note on symmetry reduction for circular traveling tournament problems
2011
Abstract The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between neighboring venues is one, so that the distance between any pair of teams is the distance on the circle. It is empirically proved that these instances are very hard to solve due to the inherent symmetry. This note presents new ideas to cut off essentially identical parts of the solution space. Enumerative solution approaches, e.g. relying on branch-and-bound, benefit from this reduction. We…