Appropriate complexity for the prediction of coastal and estuarine geomorphic behaviour at decadal to centennial scales

Coastal and estuarine landforms provide a physical template that not only accommodates diverse ecosystem functions and human activities, but also mediates flood and erosion risks that are expected to increase with climate change. In this paper, we explore some of the issues associated with the conceptualisation and modelling of coastal morphological change at time and space scales relevant to managers and policy makers. Firstly, we revisit the question of how to define the most appropriate scales at which to seek quantitative predictions of landform change within an age defined by human interference with natural sediment systems and by the prospect of significant changes in climate and ocean forcing. Secondly, we consider the theoretical bases and conceptual frameworks for determining which processes are most important at a given scale of interest and the related problem of how to translate this understanding into models that are computationally feasible, retain a sound physical basis and demonstrate useful predictive skill. In particular, we explore the limitations of a primary scale approach and the extent to which these can be resolved with reference to the concept of the coastal tract and application of systems theory. Thirdly, we consider the importance of different styles of landform change and the need to resolve not only incremental evolution of morphology but also changes in the qualitative dynamics of a system and/or its gross morphological configuration. The extreme complexity and spatially distributed nature of landform systems means that quantitative prediction of future changes must necessarily be approached through mechanistic modelling of some form or another. Geomorphology has increasingly embraced so-called ‘reduced complexity’ models as a means of moving from an essentially reductionist focus on the mechanics of sediment transport towards a more synthesist view of landform evolution. However, there is little consensus on exactly what constitutes a reduced complexity model and the term itself is both misleading and, arguably, unhelpful. Accordingly, we synthesise a set of requirements for what might be termed ‘appropriate complexity modelling’ of quantitative coastal morphological change at scales commensurate with contemporary management and policy-making requirements: 1) The system being studied must be bounded with reference to the time and space scales at which behaviours of interest emerge and/or scientific or management problems arise; 2) model complexity and comprehensiveness must be appropriate to the problem at hand; 3) modellers should seek a priori insights into what kind of behaviours are likely to be evident at the scale of interest and the extent to which the behavioural validity of a model may be constrained by its underlying assumptions and its comprehensiveness; 4) informed by qualitative insights into likely dynamic behaviour, models should then be formulated with a view to resolving critical state changes; and 5) meso-scale modelling of coastal morphological change should reflect critically on the role of modelling and its relation to the observable world.

Complexity, age and motor competence effects on fine motor kinematics

Prehension is a fundamental skill usually performed as part of a complex action sequence in everyday tasks. Using an information processing framework, these studies examined the effects of task complexity, defined by the number of component movement elements (MEs), on performance of prehension tasks. Of interest was how motor control and organisation might be influenced by age and/or motor competence. Three studies and two longitudinal case studies examined kinematic characteristics of prehension tasks involving one-, two- and three-MEs: reach and grasp (low-complexity); reach, grasp and object placement (moderate-complexity); and reach, grasp and double placement of object (high-complexity). A pilot study established the suitability of tasks and procedures for children aged 5-, 8- and 11-years and showed that responses to task complexity and object size manipulations were sensitive to developmental changes, with increasing age associated with faster movements. Study 2 explored complexity and age effects further for children aged 6- and 11-years and adults. Increasing age was associated with shorter and less variable movement times (MTs) and proportional deceleration phases (%DTs) across all MEs. Task complexity had no effect on simple reaction time (SRT), suggesting that there may be little preprogramming of movements beyond the first ME. In addition, MT was longer and more on-line corrections were evident for the high- compared to the moderate-complexity task for ME1. Task complexity had a greater influence on movements in ME2 and ME3 than ME1. Adults, but not children, showed task specific adaptations in ME2. Study 3 examined performance of children with different levels of motor competence aged between 5- and 10-years. Increasing age was associated with shorter SRTs, and MTs for ME1 only. A decrease in motor competence was associated with greater difficulty in planning and controlling movements as indicated by longer SRTs, higher %DTs and more on-line corrections, especially in ME2. Task complexity affected movements in all MEs, with a greater influence on ME1 compared to Study 2. Findings also indicated that performance in MEs following prehension may be especially sensitive to motor competence effects on movement characteristics. Case studies for two children at risk of Developmental Coordination Disorder (DCD) revealed two different patterns of performance change over a 16-17 month period, highlighting the heterogeneous nature of DCD. Overall, findings highlighted age-related differences, and the role of motor competence, in the ability to adapt movements to task specific requirements. Results are useful in guiding movement education programmes for children with both age-appropriate and lower levels of motor competence.

Path Dependence in Decision-Making Processes: Exploring the Impact of Complexity under Increasing Returns

The development of path-dependent processes basically refers to positive feedback in terms of increasing returns as the main driving forces of such processes. Furthermore, path dependence can be affected by context factors, such as different degrees of complexity. Up to now, it has been unclear whether and how different settings of complexity impact path-dependent processes and the probability of lock-in. In this paper we investigate the relationship between environmental complexity and path dependence by means of an experimental study. By focusing on the mode of information load and decision quality in chronological sequences, the study explores the impact of complexity on decision-making processes. The results contribute to both the development of path-dependence theory and a better understanding of decision-making behavior under conditions of positive feedback. Since previous path research has mostly applied qualitative case-study research and (to a minor part) simulations, this paper makes a further contribution by establishing an experimental approach for research on path dependence.

The phosphate mineral arrojadite-(KFe) and its spectroscopic characterization

The arrojadite-(KFe) mineral has been analyzed using a combination of scanning electron microscopy and a combination of Raman and infrared spectroscopy. The origin of the mineral is Rapid Creek sedimentary phosphatic iron formation, northern Yukon. The formula of the mineral was determined as K2.06Na2Ca0.89Na3.23(Fe7.82Mg4.40Mn0.78)Σ13.00Al1.44(PO4)10.85(PO3OH0.23)(OH)2. The complexity of the mineral formula is reflected in the spectroscopy. Raman bands at 975, 991 and 1005 cm−1 with shoulder bands at 951 and 1024 cm−1 are assigned to the View the MathML source ν1 symmetric stretching modes. The Raman bands at 1024, 1066, 1092, 1123, 1148 and 1187 cm−1 are assigned to the View the MathML source ν3 antisymmetric stretching modes. A series of Raman bands observed at 540, 548, 557, 583, 604, 615 and 638 cm−1 are attributed to the ν4 out of plane bending modes of the PO4 and H2PO4 units. The ν2 PO4 and H2PO4 bending modes are observed at 403, 424, 449, 463, 479 and 513 cm−1. Hydroxyl and water stretching bands are readily observed. Vibrational spectroscopy enables new information about the complex phosphate mineral arrojadite-(KFe) to be obtained.

On the Collision and Preimage Resistance of Certain Two-Call Hash Functions

In this paper we present concrete collision and preimage attacks on a large class of compression function constructions making two calls to the underlying ideal primitives. The complexity of the collision attack is above the theoretical lower bound for constructions of this type, but below the birthday complexity; the complexity of the preimage attack, however, is equal to the theoretical lower bound. We also present undesirable properties of some of Stam’s compression functions proposed at CRYPTO ’08. We show that when one of the n-bit to n-bit components of the proposed 2n-bit to n-bit compression function is replaced by a fixed-key cipher in the Davies-Meyer mode, the complexity of finding a preimage would be 2 n/3. We also show that the complexity of finding a collision in a variant of the 3n-bits to 2n-bits scheme with its output truncated to 3n/2 bits is 2 n/2. The complexity of our preimage attack on this hash function is about 2 n . Finally, we present a collision attack on a variant of the proposed m + s-bit to s-bit scheme, truncated to s − 1 bits, with a complexity of O(1). However, none of our results compromise Stam’s security claims.

Generalized Spatial Modulation in Large-Scale Multiuser MIMO Systems

Generalized spatial modulation (GSM) uses n(t) transmit antenna elements but fewer transmit radio frequency (RF) chains, n(rf). Spatial modulation (SM) and spatial multiplexing are special cases of GSM with n(rf) = 1 and n(rf) = n(t), respectively. In GSM, in addition to conveying information bits through n(rf) conventional modulation symbols (for example, QAM), the indices of the n(rf) active transmit antennas also convey information bits. In this paper, we investigate GSM for large-scale multiuser MIMO communications on the uplink. Our contributions in this paper include: 1) an average bit error probability (ABEP) analysis for maximum-likelihood detection in multiuser GSM-MIMO on the uplink, where we derive an upper bound on the ABEP, and 2) low-complexity algorithms for GSM-MIMO signal detection and channel estimation at the base station receiver based on message passing. The analytical upper bounds on the ABEP are found to be tight at moderate to high signal-to-noise ratios (SNR). The proposed receiver algorithms are found to scale very well in complexity while achieving near-optimal performance in large dimensions. Simulation results show that, for the same spectral efficiency, multiuser GSM-MIMO can outperform multiuser SM-MIMO as well as conventional multiuser MIMO, by about 2 to 9 dB at a bit error rate of 10(-3). Such SNR gains in GSM-MIMO compared to SM-MIMO and conventional MIMO can be attributed to the fact that, because of a larger number of spatial index bits, GSM-MIMO can use a lower-order QAM alphabet which is more power efficient.

序列视觉信息整合的特性与机制

One of the great puzzles in the psychology of visual perception is that the visual world appears to be a coherent whole despite our viewing it through temporally discontinuous series of eye fixations. The investigators attempted to explain this puzzle from the perspective of sequential visual information integration. In recent years, investigators hypothesized that information maintained in the visual short-term memory (VSTM) could become visual mental images gradually during time delay in visual buffer and integrated with information perceived currently. Some elementary studies had been carried out to investigate the integration between VSTM and visual percepts, but further research is required to account for several questions on the spatial-temporal characteristics, information representation and mechanism of integrating sequential visual information. Based on the theory of similarity between visual mental image and visual perception, this research (including three studies) employed the temporal integration paradigm and empty cell localization task to further explore the spatial-temporal characteristics, information representation and mechanism of integrating sequential visual information (sequential arrays). The purpose of study 1 was to further explore the temporal characteristics of sequential visual information integration by examining the effects of encoding time of sequential stimuli on the integration of sequential visual information. The purpose of study 2 was to further explore the spatial characteristics of sequential visual information integration by investigating the effects of spatial characteristics change on the integration of sequential visual information. The purpose of study 3 was to explore the information representation of information maintained in the VSTM and integration mechanism in the process of integrating sequential visual information by employing the behavioral experiments and eye tracking technology. The results indicated that: (1) Sequential arrays could be integrated without strategic instruction. Increasing the duration of the first array could cause improvement in performance and increasing the duration of the second array could not improve the performance. Temporal correlation model was not fit to explain the sequential array integration under long-ISI conditions. (2) Stimuli complexity influenced not only the overall performance of sequential arrays but also the values of ISI at asymptotic level of performance. Sequential arrays still could be integrated when the spatial characteristics of sequential arrays changed. During ISI, constructing and manipulating of visual mental image of array 1 were two separate processing phases. (3) During integrating sequential arrays, people represented the pattern constituted by the objects' image maintained in the VSTM and the topological characteristics of the objects' image had some impact on fixation location. The image-perception integration hypothesis was supported when the number of dots in array 1 was less than empty cells, and the convert-and-compare hypothesis was supported when the number of the dot in array 1 was equal to or more than empty cells. These findings not only contribute to make people understand the process of sequential visual information integration better, but also have significant practical application in the design of visual interface.

A technology diffusion perspective of Enterprise Resource Planning across European Small and Medium Enterprises: from determinants to Use to Value

Tese apresentada como requisito parcial para obtenção do grau de Doutor em Gestão de Informação

Efeitos de contingências de suporte e de metacontingências sobre a seleção de contingências comportamentais entrelaçadas

Metacontigências consistem de relações funcionais entre contingências comportamentais entrelaçadas (CCEs) e um produto agregado, que seleciona não o comportamento individual, mas o próprio entrelaçamento. Entrelaçamentos podem também ser mantidos por contingências de suporte, que, nesse caso, operam sobre contingências individuais que participam do entrelaçamento, sendo geralmente dispostas por outro indivíduo, grupo ou agência. Esta é uma proposição teórica veiculada na literatura analítico-comportamental, mas com respeito à qual inexistem evidências empíricas. O presente trabalho teve como objetivo avaliar o efeito de contingências de suporte e metacontingências na instalação e manutenção de CCEs. Participaram do estudo doze estudantes universitários, divididos igualmente em quatro grupos experimentais. Os grupos 1 e 2 integraram o Experimento 1, e os grupos 3 e 4, o Experimento 2. Cada grupo foi exposto a um jogo de apostas e ganhos, no qual cada ficha valia 0,10 centavos. Para os grupos 1 e 2 foram utilizadas fichas plásticas, nas cores amarelo, laranja e marrom, para os grupos 3 e 4, foram utilizadas fichas nas cores amarelo, laranja, marrom, lilás e rosa. As sessões foram compostas por 30 rodadas, cada uma formada pela jogada dos três participantes, os quais revezavam a jogada inicial da rodada. Os grupos 1 e 2 foram expostos à condições de contingências de suporte (condição A) e de metacontingências (condição B) e o grupo 2 apenas à condição B. Em ambos os grupos houve a seleção do entrelaçamento, não tendo sido verificadas diferenças expressivas de desempenho. No Experimento 2, foi aumentada a complexidade do entrelaçamento, a fim de se verificar diferenças nos efeitos de metacontingências e contingências de suporte na seleção de CCEs. Os grupos 3 e 4 foram expostos às condições A’ e B’, que eram idênticas às condições do Experimento 1, exceto no que se refere às cores de fichas utilizadas e à complexidade do entrelaçamento. O Grupo 3 foi exposto a duas fases, nas quais vigoraram ambas as condições. O Grupo 4 foi exposto apenas à condição B’. Em ambos os grupos não houve a seleção do entrelaçamento. Os resultados indicaram que não houve diferença notável entre o desempenho dos grupos em que vigoravam condições de metacontingências e condições de contingências de suporte. No Experimento 1, nos grupos 1 e 2 houve a seleção do entrelaçamento, com desempenhos semelhantes. O Experimento 2 manipulou a complexidade do entrelaçamento, aumentando-o. Os resultados demonstraram que não houve a seleção do entrelaçamento para ambos os grupos. Sugerem-se estudos futuros que repliquem este delineamento, manipulando o entrelaçamento de modo a torná-lo medianamente complexo, a fim de avaliar se contingências de suporte e metacontingências podem exercer papéis diferentes sobre a seleção de CCEs.

An incremental multilinear system for human face learning and recognition

This dissertation establishes a novel system for human face learning and recognition based on incremental multilinear Principal Component Analysis (PCA). Most of the existing face recognition systems need training data during the learning process. The system as proposed in this dissertation utilizes an unsupervised or weakly supervised learning approach, in which the learning phase requires a minimal amount of training data. It also overcomes the inability of traditional systems to adapt to the testing phase as the decision process for the newly acquired images continues to rely on that same old training data set. Consequently when a new training set is to be used, the traditional approach will require that the entire eigensystem will have to be generated again. However, as a means to speed up this computational process, the proposed method uses the eigensystem generated from the old training set together with the new images to generate more effectively the new eigensystem in a so-called incremental learning process. In the empirical evaluation phase, there are two key factors that are essential in evaluating the performance of the proposed method: (1) recognition accuracy and (2) computational complexity. In order to establish the most suitable algorithm for this research, a comparative analysis of the best performing methods has been carried out first. The results of the comparative analysis advocated for the initial utilization of the multilinear PCA in our research. As for the consideration of the issue of computational complexity for the subspace update procedure, a novel incremental algorithm, which combines the traditional sequential Karhunen-Loeve (SKL) algorithm with the newly developed incremental modified fast PCA algorithm, was established. In order to utilize the multilinear PCA in the incremental process, a new unfolding method was developed to affix the newly added data at the end of the previous data. The results of the incremental process based on these two methods were obtained to bear out these new theoretical improvements. Some object tracking results using video images are also provided as another challenging task to prove the soundness of this incremental multilinear learning method.

Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 x 2 and 4 x 2 MIMO Systems

This paper deals with low maximum-likelihood (ML)-decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 x 2) and the 4 transmit antenna, 2 receive antenna (4 x 2) MIMO systems. Presently, the best known STBC for the 2 2 system is the Golden code and that for the 4 x 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 x 2 system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 x 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of for square QAM of size. In this paper, a scheme that reduces its ML-decoding complexity to M-2 root M is presented.

A Low ML-Decoding Complexity, High Coding Gain, Full-Rate, Full-Diversity STBC for 4 x 2 MIMO System

This paper proposes a full-rate, full-diversity space-time block code(STBC) with low maximum likelihood (ML) decoding complexity and high coding gain for the 4 transmit antenna, 2 receive antenna (4 x 2) multiple-input multiple-output (MIMO) system that employs 4/16-QAM. For such a system, the best code known is the DjABBA code and recently, Biglieri, Hong and Viterbo have proposed another STBC (BHV code) for 4-QAM which has lower ML-decoding complexity than the DjABBA code but does not have full-diversity like the DjABBA code. The code proposed in this paper has the same ML-decoding complexity as the BHV code for any square M-QAM but has full-diversity for 4- and 16-QAM. Compared with the DjABBA code, the proposed code has lower ML-decoding complexity for square M-QAM constellation, higher coding gain for 4- and 16-QAM, and hence a better codeword error rate (CER) performance. Simulation results confirming this are presented.

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.